Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated just now
PreprintCC BY 4.0arXiv

Is Your LLM Relay Serving What It Claims? A low-cost and high-power test for LLM Relay Auditing

Abstract

Relay and reseller APIs have become a common way to access large language models (LLMs), yet users cannot directly verify whether they receive the models they request and pay for. This opacity motivates LLM relay auditing, but existing methods struggle to combine low cost, robustness to benign deployment changes, and statistically interpretable decisions under black-box access. To address these limitations, we propose distributional fingerprint auditing (DFA), a statistical method that requires only textual responses from suspect and trusted reference endpoints. DFA repeatedly queries semantically simple finite-choice probes and uses the resulting categorical response distributions to construct endpoint fingerprints. It compares the suspect and reference fingerprints probe by probe and aggregates the resulting evidence using the Cauchy combination test, yielding an approximate endpoint-level p-value for audit decisions at a prespecified nominal significance level. Using registered fingerprints of candidate models, a likelihood-based formulation further supports model attribution under full substitution and joint estimation of substitute identity and substitution ratio under constant-ratio mixed routing. Our benchmark includes 16 proprietary and open-weight LLMs from 10 model families. Across 240 ordered full-substitution pairs, DFA achieves high detection rates at a nominal significance level of α=0.05, using five probes and 250 relay requests per audit with stored reference fingerprints. Configuration overrides can lead to rejection even when the served model remains unchanged, with effects varying across models and configurations. Simulations based on stored empirical fingerprints demonstrate accurate model attribution and estimate substitution ratios, with estimation error decreasing as the audit budget increases.

Related

  1. The Capacity of the Relay Channel
    Jonathan Ponniah
    arXivPreprintCC BY 4.0Full textGeneral mathematicsarXiv
  2. Counterexample to a Proposed Capacity Characterization of the Relay Channel
    Chun Hei Michael Shiu
    arXivPreprintCC BY 4.0Full textGeneral mathematicsarXiv
  3. Topology Design for Distributed Consensus with Relay-Assisted Communication
    Shuyi Ren, Zheng Chen, Erik G. Larsson
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  4. An Improved Upper Bound on the Capacity of the Primitive Diamond Relay Channel
    Deniz Gündüz, Yanxiao Liu, Yi Liu
    arXivPreprintCC BY 4.0Full textGeneral mathematicsarXiv
  5. Can Quantum Entanglement Increase the Capacity of a Classical Relay Channel?
    Elsa Mizrahi, Uzi Pereg
    arXivPreprintarXiv licenceFull textGeneral mathematicsQuantum physics & quantum informationarXiv
BibTeX
@misc{miao2026your,
  title = {{Is Your LLM Relay Serving What It Claims? A low-cost and high-power test for LLM Relay Auditing}},
  author = {Fangran Miao and Shengjie Niu and Jian Huang and Ting Li},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.37086},
  eprint = {2610.37086},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.37086},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Is Your LLM Relay Serving What It Claims? A low-cost and high-power test for LLM Relay Auditing
AU  - Fangran Miao
AU  - Shengjie Niu
AU  - Jian Huang
AU  - Ting Li
PY  - 2026
DA  - 2026/10/27
PB  - arXiv
DO  - 10.48550/arxiv.2610.37086
UR  - https://arxiv.org/abs/2610.37086
AB  - Relay and reseller APIs have become a common way to access large language models (LLMs), yet users cannot directly verify whether they receive the models they request and pay for. This opacity motivates LLM relay auditing, but existing methods struggle to combine low cost, robustness to benign deployment changes, and statistically interpretable decisions under black-box access. To address these limitations, we propose distributional fingerprint auditing (DFA), a statistical method that requires only textual responses from suspect and trusted reference endpoints. DFA repeatedly queries semantically simple finite-choice probes and uses the resulting categorical response distributions to construct endpoint fingerprints. It compares the suspect and reference fingerprints probe by probe and aggregates the resulting evidence using the Cauchy combination test, yielding an approximate endpoint-level p-value for audit decisions at a prespecified nominal significance level. Using registered fingerprints of candidate models, a likelihood-based formulation further supports model attribution under full substitution and joint estimation of substitute identity and substitution ratio under constant-ratio mixed routing. Our benchmark includes 16 proprietary and open-weight LLMs from 10 model families. Across 240 ordered full-substitution pairs, DFA achieves high detection rates at a nominal significance level of α=0.05, using five probes and 250 relay requests per audit with stored reference fingerprints. Configuration overrides can lead to rejection even when the served model remains unchanged, with effects varying across models and configurations. Simulations based on stored empirical fingerprints demonstrate accurate model attribution and estimate substitution ratios, with estimation error decreasing as the audit budget increases.
ER  -