{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:FNNIVDHBPPSDGBUC25JQO3BYB6","short_pith_number":"pith:FNNIVDHB","schema_version":"1.0","canonical_sha256":"2b5a8a8ce17be4330682d753076c380f90acf8d5b8ae27bcbc16ec34d6e9f9ee","source":{"kind":"arxiv","id":"2608.12719","version":1},"attestation_state":"computed","paper":{"title":"Error-Aware Reverse Auction Mechanism for Large Language Model Routing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.GT","authors_text":"Guangxu Zhu, Haolong Chen, Lei Xue, Liang Zhang, Zhengyuan Xin","submitted_at":"2026-08-13T02:04:26Z","abstract_excerpt":"Routing each query to a cost-effective large language model (LLM) is critical for balancing quality and cost, yet most routers rely on a centralized task center to predict model performance, creating an information-risk mismatch and a scalability bottleneck as the model pool grows. We propose a market-based routing paradigm that shifts ex-ante prediction to LLM providers via a reverse auction, where providers bid with self-predicted success probabilities and execution costs. To account for inherently noisy provider predictions and center evaluations, we introduce the \\textit{\\textbf{E}rror-\\te"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2608.12719","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2026-08-13T02:04:26Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"f49d68a7587fb8d562ccf233ee3cec1d21db0a031401955949ffdfd345803f5b","abstract_canon_sha256":"c721a52d8d6bc627d066db70c1c622fd6d40c0601408b63dc25357b5f58b99ef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-14T00:47:06.552947Z","signature_b64":"eMN2SzOsEAWu+v9/QAU0pel+VxbQthti+2eL4LSTR4B3SrK6uVEzRrJClvFMmXvYxblF8f6GIObgYFxNwMlTCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b5a8a8ce17be4330682d753076c380f90acf8d5b8ae27bcbc16ec34d6e9f9ee","last_reissued_at":"2026-08-14T00:47:06.550893Z","signature_status":"signed_v1","first_computed_at":"2026-08-14T00:47:06.550893Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Error-Aware Reverse Auction Mechanism for Large Language Model Routing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.GT","authors_text":"Guangxu Zhu, Haolong Chen, Lei Xue, Liang Zhang, Zhengyuan Xin","submitted_at":"2026-08-13T02:04:26Z","abstract_excerpt":"Routing each query to a cost-effective large language model (LLM) is critical for balancing quality and cost, yet most routers rely on a centralized task center to predict model performance, creating an information-risk mismatch and a scalability bottleneck as the model pool grows. We propose a market-based routing paradigm that shifts ex-ante prediction to LLM providers via a reverse auction, where providers bid with self-predicted success probabilities and execution costs. To account for inherently noisy provider predictions and center evaluations, we introduce the \\textit{\\textbf{E}rror-\\te"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.12719","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2608.12719/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2608.12719","created_at":"2026-08-14T00:47:06.551892+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.12719v1","created_at":"2026-08-14T00:47:06.551892+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.12719","created_at":"2026-08-14T00:47:06.551892+00:00"},{"alias_kind":"pith_short_12","alias_value":"FNNIVDHBPPSD","created_at":"2026-08-14T00:47:06.551892+00:00"},{"alias_kind":"pith_short_16","alias_value":"FNNIVDHBPPSDGBUC","created_at":"2026-08-14T00:47:06.551892+00:00"},{"alias_kind":"pith_short_8","alias_value":"FNNIVDHB","created_at":"2026-08-14T00:47:06.551892+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FNNIVDHBPPSDGBUC25JQO3BYB6","json":"https://pith.science/pith/FNNIVDHBPPSDGBUC25JQO3BYB6.json","graph_json":"https://pith.science/api/pith-number/FNNIVDHBPPSDGBUC25JQO3BYB6/graph.json","events_json":"https://pith.science/api/pith-number/FNNIVDHBPPSDGBUC25JQO3BYB6/events.json","paper":"https://pith.science/paper/FNNIVDHB"},"agent_actions":{"view_html":"https://pith.science/pith/FNNIVDHBPPSDGBUC25JQO3BYB6","download_json":"https://pith.science/pith/FNNIVDHBPPSDGBUC25JQO3BYB6.json","view_paper":"https://pith.science/paper/FNNIVDHB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.12719&json=true","fetch_graph":"https://pith.science/api/pith-number/FNNIVDHBPPSDGBUC25JQO3BYB6/graph.json","fetch_events":"https://pith.science/api/pith-number/FNNIVDHBPPSDGBUC25JQO3BYB6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FNNIVDHBPPSDGBUC25JQO3BYB6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FNNIVDHBPPSDGBUC25JQO3BYB6/action/storage_attestation","attest_author":"https://pith.science/pith/FNNIVDHBPPSDGBUC25JQO3BYB6/action/author_attestation","sign_citation":"https://pith.science/pith/FNNIVDHBPPSDGBUC25JQO3BYB6/action/citation_signature","submit_replication":"https://pith.science/pith/FNNIVDHBPPSDGBUC25JQO3BYB6/action/replication_record"}},"created_at":"2026-08-14T00:47:06.551892+00:00","updated_at":"2026-08-14T00:47:06.551892+00:00"}