{"as_of":"2026-08-18T09:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6485df1b3e14ef0db96d55074cf0d9b121bbc31d098d26ea4209fa70b1ff1fef","coverage":[{"denominator":34,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":34,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T00:55:47.284678Z","state":"measured"},{"denominator":34,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":34,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2608.12719/citation-record","integrity":"/paper/2608.12719/integrity","json":"/paper/2608.12719/citation-record.json","paper":"/paper/2608.12719"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2303.18223","last_updated":"2026-03-18T05:34:39Z","snapshot_observed_at":"2026-08-14T10:40:26.323157Z","submitted_at":"2023-03-31T17:28:46Z","title":"A Survey of Large Language Models","version":19},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.18223","snapshot_observed_at":"2026-08-16T00:55:47.128693Z","title":"A survey of large language models.arXiv preprint arXiv:2303.18223, 1(2), 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.12719","last_updated":"2026-08-13T02:04:26Z","snapshot_observed_at":"2026-08-18T08:28:07.066833Z","submitted_at":"2026-08-13T02:04:26Z","title":"Error-Aware Reverse Auction Mechanism for Large Language Model Routing","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-16T00:55:47.128693Z"},"links":{"cited_paper":"/paper/2303.18223","citing_paper":"/paper/2608.12719"},"observation_digest":"sha256:6ff0e593542e595f05b66ee030cbc66aff6c5cdd335e73f1f00a2e4ad12ff982","observation_id":"256862f3-96ff-4d59-a0c7-f91c2581cc6c","resolution":{"observed_at":"2026-08-16T00:55:47.128693Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:55:47.134291Z","title":"Large language model based multi-agents: A survey of progress and challenges","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.12719","last_updated":"2026-08-13T02:04:26Z","snapshot_observed_at":"2026-08-18T08:28:07.066833Z","submitted_at":"2026-08-13T02:04:26Z","title":"Error-Aware Reverse Auction Mechanism for Large Language Model Routing","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-16T00:55:47.134291Z"},"links":{"citing_paper":"/paper/2608.12719"},"observation_digest":"sha256:c0e0d73b6849b1c92585638cff6ab16e3c1942d0ed52a5efa46e0aceb6124d28","observation_id":"15233c7b-ef23-4a01-b541-04505568c1e9","resolution":{"observed_at":"2026-08-16T00:55:47.134291Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:55:47.833047Z","title":"An overview of domain-specific foundation model: key technologies, applications and challenges.Science China Information Sciences, 69(1):111301, 2026","venue":null,"work_id":"d5678bbb-5815-4417-841b-e60580934f86","year":2026},"citing_paper":{"arxiv_id":"2608.12719","last_updated":"2026-08-13T02:04:26Z","snapshot_observed_at":"2026-08-18T08:28:07.066833Z","submitted_at":"2026-08-13T02:04:26Z","title":"Error-Aware Reverse Auction Mechanism for Large Language Model Routing","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-16T00:55:47.138981Z"},"links":{"citing_paper":"/paper/2608.12719"},"observation_digest":"sha256:8ebdc8d506cdb3738348ebb79cf41b9678264564adcda16bc4b197956a3de532","observation_id":"d2028e1f-c089-4829-87dd-177abc598d1c","resolution":{"observed_at":"2026-08-16T00:55:47.838074Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:55:47.817267Z","title":"EmbedLLM: Learning compact representations of large language models","venue":null,"work_id":"a32d51bf-8e9a-4fd6-a393-9fa5d3e448f0","year":2025},"citing_paper":{"arxiv_id":"2608.12719","last_updated":"2026-08-13T02:04:26Z","snapshot_observed_at":"2026-08-18T08:28:07.066833Z","submitted_at":"2026-08-13T02:04:26Z","title":"Error-Aware Reverse Auction Mechanism for Large Language Model Routing","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-16T00:55:47.143957Z"},"links":{"citing_paper":"/paper/2608.12719"},"observation_digest":"sha256:ac2cc2c7ef789dce68b8db7107704685f2a83e0aaf2851e19d7307e6282146e8","observation_id":"c9eda79a-d9cf-4f29-bc79-9ff0156c962e","resolution":{"observed_at":"2026-08-16T00:55:47.822576Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:55:47.148636Z","title":"Gonzalez, M Waleed Kadous, and Ion Stoica","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.12719","last_updated":"2026-08-13T02:04:26Z","snapshot_observed_at":"2026-08-18T08:28:07.066833Z","submitted_at":"2026-08-13T02:04:26Z","title":"Error-Aware Reverse Auction Mechanism for Large Language Model Routing","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-16T00:55:47.148636Z"},"links":{"citing_paper":"/paper/2608.12719"},"observation_digest":"sha256:46a96c9ee21aff33a272cd28694b62307a53121aa63f237a0647df0866fd3d57","observation_id":"0655d457-7d48-4ac6-841b-2305dfc01f8c","resolution":{"observed_at":"2026-08-16T00:55:47.148636Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:55:47.153103Z","title":"Icl-router: In-context learned model representations for llm routing.arXiv preprint arXiv:2510.09719, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.12719","last_updated":"2026-08-13T02:04:26Z","snapshot_observed_at":"2026-08-18T08:28:07.066833Z","submitted_at":"2026-08-13T02:04:26Z","title":"Error-Aware Reverse Auction Mechanism for Large Language Model Routing","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-16T00:55:47.153103Z"},"links":{"citing_paper":"/paper/2608.12719"},"observation_digest":"sha256:ea1662d6c345e75e3c1372b8d903211b93f5c7ee9086c111276ba779cf8bdfdf","observation_id":"624397a7-e235-4fe9-b4d8-213bfc2c5691","resolution":{"observed_at":"2026-08-16T00:55:47.153103Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:55:47.791944Z","title":"Auto router","venue":null,"work_id":"8a611052-8bb6-42ba-9f84-a2732066f947","year":2026},"citing_paper":{"arxiv_id":"2608.12719","last_updated":"2026-08-13T02:04:26Z","snapshot_observed_at":"2026-08-18T08:28:07.066833Z","submitted_at":"2026-08-13T02:04:26Z","title":"Error-Aware Reverse Auction Mechanism for Large Language Model Routing","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-16T00:55:47.157982Z"},"links":{"citing_paper":"/paper/2608.12719"},"observation_digest":"sha256:511a159ccc36e1408c27b14061c7a43aaacf130dba4b395daff624f7110be970","observation_id":"276996b4-b8cd-4c96-a1ab-d4e51f8a8e7b","resolution":{"observed_at":"2026-08-16T00:55:47.797026Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:55:47.777271Z","title":"Smart llm routing","venue":null,"work_id":"4c0cd7d5-7cec-4109-8246-30afc7ff7ce3","year":2026},"citing_paper":{"arxiv_id":"2608.12719","last_updated":"2026-08-13T02:04:26Z","snapshot_observed_at":"2026-08-18T08:28:07.066833Z","submitted_at":"2026-08-13T02:04:26Z","title":"Error-Aware Reverse Auction Mechanism for Large Language Model Routing","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-16T00:55:47.162874Z"},"links":{"citing_paper":"/paper/2608.12719"},"observation_digest":"sha256:4a58af7baee97e5e95c9f36c675c1296c8ad29e9b8fe87abcf6688890410c670","observation_id":"880fe2ce-5a72-4307-a1ce-205b3c74e7b6","resolution":{"observed_at":"2026-08-16T00:55:47.782182Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:55:47.761803Z","title":"Real-time bidding for online advertising: measure- ment and analysis","venue":null,"work_id":"74beb0f2-55f4-46b6-aad7-890e970fdbf0","year":2013},"citing_paper":{"arxiv_id":"2608.12719","last_updated":"2026-08-13T02:04:26Z","snapshot_observed_at":"2026-08-18T08:28:07.066833Z","submitted_at":"2026-08-13T02:04:26Z","title":"Error-Aware Reverse Auction Mechanism for Large Language Model Routing","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-16T00:55:47.167614Z"},"links":{"citing_paper":"/paper/2608.12719"},"observation_digest":"sha256:42ebb0e97f23c3cd87650a8d260d11cb5e0879c54cde99f764607c2d984360f3","observation_id":"87aac32f-1cd0-4535-9316-febe39d413e6","resolution":{"observed_at":"2026-08-16T00:55:47.767014Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:55:47.747178Z","title":"Display advertising with real-time bidding (rtb) and behavioural targeting.Foundations and Trends® in Information Retrieval, 11(4-5):297–435, 2017","venue":null,"work_id":"a83713f2-d1f1-4758-80f1-cd9765fed5b5","year":2017},"citing_paper":{"arxiv_id":"2608.12719","last_updated":"2026-08-13T02:04:26Z","snapshot_observed_at":"2026-08-18T08:28:07.066833Z","submitted_at":"2026-08-13T02:04:26Z","title":"Error-Aware Reverse Auction Mechanism for Large Language Model Routing","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-16T00:55:47.171934Z"},"links":{"citing_paper":"/paper/2608.12719"},"observation_digest":"sha256:4f9c1141c3bd4cb38ed801ca3ae497954fac06e13735062c6d3efbfc918f1f9b","observation_id":"55f9bfd5-ca6a-4c91-9856-5f7be40f71ae","resolution":{"observed_at":"2026-08-16T00:55:47.752092Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:55:47.732038Z","title":"The fcc spectrum auctions: An early assessment.Journal of Economics & Management Strategy, 6(3):431–495, 1997","venue":null,"work_id":"54b824fe-a4f5-40c5-bfc9-40b26d279316","year":1997},"citing_paper":{"arxiv_id":"2608.12719","last_updated":"2026-08-13T02:04:26Z","snapshot_observed_at":"2026-08-18T08:28:07.066833Z","submitted_at":"2026-08-13T02:04:26Z","title":"Error-Aware Reverse Auction Mechanism for Large Language Model Routing","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-16T00:55:47.176400Z"},"links":{"citing_paper":"/paper/2608.12719"},"observation_digest":"sha256:bf858be3b3c4562cf3f1119cbd7e93952c98660f28830fbe4dd468e3733d8c18","observation_id":"521def5f-7719-4ed3-8f07-a236d393461c","resolution":{"observed_at":"2026-08-16T00:55:47.736718Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:55:47.718322Z","title":"Cambridge University Press, 2004","venue":null,"work_id":"8a824442-5012-4bb4-a310-b17a9065a5b8","year":2004},"citing_paper":{"arxiv_id":"2608.12719","last_updated":"2026-08-13T02:04:26Z","snapshot_observed_at":"2026-08-18T08:28:07.066833Z","submitted_at":"2026-08-13T02:04:26Z","title":"Error-Aware Reverse Auction Mechanism for Large Language Model Routing","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-16T00:55:47.181181Z"},"links":{"citing_paper":"/paper/2608.12719"},"observation_digest":"sha256:78617fdee06a742afb846d21e9e91912a8eb04738e8dc43388f8245a5d9656cd","observation_id":"4071d028-8e3d-4ecb-9b1a-cc52ddd3fd64","resolution":{"observed_at":"2026-08-16T00:55:47.722428Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:55:47.704344Z","title":"Fault tolerant mechanism design.Artificial Intelligence, 172(15):1783–1799, 2008","venue":null,"work_id":"6a298d7a-b353-40fb-a1f9-4249e8fcbcec","year":2008},"citing_paper":{"arxiv_id":"2608.12719","last_updated":"2026-08-13T02:04:26Z","snapshot_observed_at":"2026-08-18T08:28:07.066833Z","submitted_at":"2026-08-13T02:04:26Z","title":"Error-Aware Reverse Auction Mechanism for Large Language Model Routing","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-16T00:55:47.186162Z"},"links":{"citing_paper":"/paper/2608.12719"},"observation_digest":"sha256:e61a47ccf66c5e996b397d554cacc38d2ac5da2db9ef08d7a0fdb3f37a700556","observation_id":"4520fe82-f041-4d97-8804-115738aabc30","resolution":{"observed_at":"2026-08-16T00:55:47.708949Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:55:47.690346Z","title":"Strategic design under uncertain evaluations: structural analysis of design- build auctions.The RAND Journal of Economics, 49(3):594–618, 2018","venue":null,"work_id":"b7159704-b710-4eb8-98f4-5ab981d4c201","year":2018},"citing_paper":{"arxiv_id":"2608.12719","last_updated":"2026-08-13T02:04:26Z","snapshot_observed_at":"2026-08-18T08:28:07.066833Z","submitted_at":"2026-08-13T02:04:26Z","title":"Error-Aware Reverse Auction Mechanism for Large Language Model Routing","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-16T00:55:47.191857Z"},"links":{"citing_paper":"/paper/2608.12719"},"observation_digest":"sha256:3769e3fc64c85aef3d9db5ffd8e941f8e20667dbcd40da6a335b0b764a5213bb","observation_id":"f973fe32-1e4f-4097-8702-f468e4d06143","resolution":{"observed_at":"2026-08-16T00:55:47.694901Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.01900","last_updated":"2025-06-02T17:22:47Z","snapshot_observed_at":"2026-08-18T08:26:24.153004Z","submitted_at":"2025-06-02T17:22:47Z","title":"COALESCE: Economic and Security Dynamics of Skill-Based Task Outsourcing Among Team of Autonomous LLM Agents","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.01900","snapshot_observed_at":"2026-08-16T00:55:47.197252Z","title":"Coalesce: Eco- nomic and security dynamics of skill-based task outsourcing among team of autonomous llm agents.arXiv preprint arXiv:2506.01900, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.12719","last_updated":"2026-08-13T02:04:26Z","snapshot_observed_at":"2026-08-18T08:28:07.066833Z","submitted_at":"2026-08-13T02:04:26Z","title":"Error-Aware Reverse Auction Mechanism for Large Language Model Routing","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-16T00:55:47.197252Z"},"links":{"cited_paper":"/paper/2506.01900","citing_paper":"/paper/2608.12719"},"observation_digest":"sha256:4fbf21b28d5e70298ac7c214afcb3cdfc0cc9f8a9e3c5b97a009b1e875837476","observation_id":"5f1d8e7d-2c69-4d94-a5ac-2541af997e19","resolution":{"observed_at":"2026-08-16T00:55:47.197252Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:55:47.676659Z","title":"IRT-router: Effective and interpretable multi-LLM routing via item response theory","venue":null,"work_id":"787c9557-09ec-4179-9253-e34a2c584d7f","year":2025},"citing_paper":{"arxiv_id":"2608.12719","last_updated":"2026-08-13T02:04:26Z","snapshot_observed_at":"2026-08-18T08:28:07.066833Z","submitted_at":"2026-08-13T02:04:26Z","title":"Error-Aware Reverse Auction Mechanism for Large Language Model Routing","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-16T00:55:47.201938Z"},"links":{"citing_paper":"/paper/2608.12719"},"observation_digest":"sha256:e577f29d11674ed495402d3e4d3678d8f755f4adeb5121971e771c8d1879a0e3","observation_id":"7bb514c7-de52-4b9f-8293-c09ec9648778","resolution":{"observed_at":"2026-08-16T00:55:47.680818Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:55:47.206146Z","title":"Routerbench: A benchmark for multi-LLM routing system","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.12719","last_updated":"2026-08-13T02:04:26Z","snapshot_observed_at":"2026-08-18T08:28:07.066833Z","submitted_at":"2026-08-13T02:04:26Z","title":"Error-Aware Reverse Auction Mechanism for Large Language Model Routing","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-16T00:55:47.206146Z"},"links":{"citing_paper":"/paper/2608.12719"},"observation_digest":"sha256:1a2eda526c6be9840c99a986f02012b0f3fb6c30332472bfe0f011c0aa65e6d3","observation_id":"07d3d082-c6b6-45d3-92bf-915acfd267f5","resolution":{"observed_at":"2026-08-16T00:55:47.206146Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:55:47.210316Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.12719","last_updated":"2026-08-13T02:04:26Z","snapshot_observed_at":"2026-08-18T08:28:07.066833Z","submitted_at":"2026-08-13T02:04:26Z","title":"Error-Aware Reverse Auction Mechanism for Large Language Model Routing","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-16T00:55:47.210316Z"},"links":{"citing_paper":"/paper/2608.12719"},"observation_digest":"sha256:9de9f9ca21487d73724001b2658fbf2bb5627f52f7e1829d3830a70f926f92ce","observation_id":"34377388-a92e-484d-9ddb-46ff3472ed22","resolution":{"observed_at":"2026-08-16T00:55:47.210316Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:55:47.215701Z","title":"Winogrande: An adversarial winograd schema challenge at scale.Communications of the ACM, 64(9):99–106, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.12719","last_updated":"2026-08-13T02:04:26Z","snapshot_observed_at":"2026-08-18T08:28:07.066833Z","submitted_at":"2026-08-13T02:04:26Z","title":"Error-Aware Reverse Auction Mechanism for Large Language Model Routing","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-16T00:55:47.215701Z"},"links":{"citing_paper":"/paper/2608.12719"},"observation_digest":"sha256:0af9d7084646c0098817069eb9915c04d1b24049e6ce27d1aa3dbfa3ddcb4527","observation_id":"174ad548-851b-4f1a-98ae-9eec9bd04265","resolution":{"observed_at":"2026-08-16T00:55:47.215701Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1803.05457","last_updated":"2018-03-14T18:04:21Z","snapshot_observed_at":"2026-08-14T19:36:07.505691Z","submitted_at":"2018-03-14T18:04:21Z","title":"Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challenge","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.05457","snapshot_observed_at":"2026-08-16T00:55:47.221116Z","title":"Think you have solved question answering? try arc, the ai2 reasoning challenge.arXiv preprint arXiv:1803.05457, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2608.12719","last_updated":"2026-08-13T02:04:26Z","snapshot_observed_at":"2026-08-18T08:28:07.066833Z","submitted_at":"2026-08-13T02:04:26Z","title":"Error-Aware Reverse Auction Mechanism for Large Language Model Routing","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-16T00:55:47.221116Z"},"links":{"cited_paper":"/paper/1803.05457","citing_paper":"/paper/2608.12719"},"observation_digest":"sha256:c8906145f01881681cc41f66209c529ef90e02ea88af12928968031c1326abfe","observation_id":"25e0b215-f076-484f-b07f-a2f0a85f39c5","resolution":{"observed_at":"2026-08-16T00:55:47.221116Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2108.07732","last_updated":"2021-08-16T03:57:30Z","snapshot_observed_at":"2026-08-15T17:40:38.050939Z","submitted_at":"2021-08-16T03:57:30Z","title":"Program Synthesis with Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2108.07732","snapshot_observed_at":"2026-08-16T00:55:47.225768Z","title":"Program synthesis with large language models.arXiv preprint arXiv:2108.07732, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.12719","last_updated":"2026-08-13T02:04:26Z","snapshot_observed_at":"2026-08-18T08:28:07.066833Z","submitted_at":"2026-08-13T02:04:26Z","title":"Error-Aware Reverse Auction Mechanism for Large Language Model Routing","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-16T00:55:47.225768Z"},"links":{"cited_paper":"/paper/2108.07732","citing_paper":"/paper/2608.12719"},"observation_digest":"sha256:354ce8b02eaeea736952d6ea6a7c92599e7695a27140a1549f0d104708cbc6a6","observation_id":"c2f59939-050a-4091-9648-b7f696109468","resolution":{"observed_at":"2026-08-16T00:55:47.225768Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.14168","last_updated":"2021-11-18T00:23:45Z","snapshot_observed_at":"2026-08-14T02:43:01.480086Z","submitted_at":"2021-10-27T04:49:45Z","title":"Training Verifiers to Solve Math Word Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.14168","snapshot_observed_at":"2026-08-16T00:55:47.231230Z","title":"Training verifiers to solve math word problems.arXiv preprint arXiv:2110.14168, 2021","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.12719","last_updated":"2026-08-13T02:04:26Z","snapshot_observed_at":"2026-08-18T08:28:07.066833Z","submitted_at":"2026-08-13T02:04:26Z","title":"Error-Aware Reverse Auction Mechanism for Large Language Model Routing","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-16T00:55:47.231230Z"},"links":{"cited_paper":"/paper/2110.14168","citing_paper":"/paper/2608.12719"},"observation_digest":"sha256:6a72ff98f1f37950a135cce694c7a9e983f4d5579e87a6c808a3e944e478655b","observation_id":"8c54b913-767a-4e31-92dd-6de703ec8dea","resolution":{"observed_at":"2026-08-16T00:55:47.231230Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:55:47.236038Z","title":"Measuring massive multitask language understanding","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.12719","last_updated":"2026-08-13T02:04:26Z","snapshot_observed_at":"2026-08-18T08:28:07.066833Z","submitted_at":"2026-08-13T02:04:26Z","title":"Error-Aware Reverse Auction Mechanism for Large Language Model Routing","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-16T00:55:47.236038Z"},"links":{"citing_paper":"/paper/2608.12719"},"observation_digest":"sha256:fe81041a0f00c6d9117a86dea0ec572cc738f3d73726132a7635475c20809280","observation_id":"f1b5de73-5d2a-4acb-adb6-5e89e5dfa57a","resolution":{"observed_at":"2026-08-16T00:55:47.236038Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:55:47.240428Z","title":"FrugalGPT: How to use large language models while reducing cost and improving performance.Transactions on Machine Learning Research,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.12719","last_updated":"2026-08-13T02:04:26Z","snapshot_observed_at":"2026-08-18T08:28:07.066833Z","submitted_at":"2026-08-13T02:04:26Z","title":"Error-Aware Reverse Auction Mechanism for Large Language Model Routing","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-16T00:55:47.240428Z"},"links":{"citing_paper":"/paper/2608.12719"},"observation_digest":"sha256:f24575dde8a25a77d524b857974da23e5a1be22853654274ef4ad71703a254f3","observation_id":"61b53121-3b0e-47f3-beb2-5a66d139171e","resolution":{"observed_at":"2026-08-16T00:55:47.240428Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:55:47.605523Z","title":"A unified approach to routing and cascading for LLMs","venue":null,"work_id":"ab3f9368-bb06-4c7a-811a-479f6f5515b2","year":2025},"citing_paper":{"arxiv_id":"2608.12719","last_updated":"2026-08-13T02:04:26Z","snapshot_observed_at":"2026-08-18T08:28:07.066833Z","submitted_at":"2026-08-13T02:04:26Z","title":"Error-Aware Reverse Auction Mechanism for Large Language Model Routing","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-16T00:55:47.249238Z"},"links":{"citing_paper":"/paper/2608.12719"},"observation_digest":"sha256:424d927dd96fdf31e9400ae3af3c9e768355bde53a5170de068586933118c9be","observation_id":"0f511b06-a161-477a-b940-dab562433f91","resolution":{"observed_at":"2026-08-16T00:55:47.610058Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:55:47.590684Z","title":"all-minilm-l6-v2","venue":null,"work_id":"2d534913-ca37-466b-9094-afd42496a947","year":2026},"citing_paper":{"arxiv_id":"2608.12719","last_updated":"2026-08-13T02:04:26Z","snapshot_observed_at":"2026-08-18T08:28:07.066833Z","submitted_at":"2026-08-13T02:04:26Z","title":"Error-Aware Reverse Auction Mechanism for Large Language Model Routing","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-16T00:55:47.253667Z"},"links":{"citing_paper":"/paper/2608.12719"},"observation_digest":"sha256:248f5a993495cb58f7238d22ddcef456ce5427427d1530f9e5e0278e2f6832f9","observation_id":"fb4b81d6-5a42-45bc-b543-8058bde3dbde","resolution":{"observed_at":"2026-08-16T00:55:47.595218Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:55:47.258190Z","title":"Router-r1: Teaching llms multi-round routing and aggregation via reinforcement learning","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.12719","last_updated":"2026-08-13T02:04:26Z","snapshot_observed_at":"2026-08-18T08:28:07.066833Z","submitted_at":"2026-08-13T02:04:26Z","title":"Error-Aware Reverse Auction Mechanism for Large Language Model Routing","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-16T00:55:47.258190Z"},"links":{"citing_paper":"/paper/2608.12719"},"observation_digest":"sha256:036eae2881a9a1fd395047500a93d74c5456e7fc9835df4a326ad79c575600ba","observation_id":"2cbc10eb-776f-4986-ae95-85d7a342be45","resolution":{"observed_at":"2026-08-16T00:55:47.258190Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:55:47.262645Z","title":"Ad auctions for llms via retrieval augmented generation.Advances in Neural Information Processing Systems, 37:18445–18480, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.12719","last_updated":"2026-08-13T02:04:26Z","snapshot_observed_at":"2026-08-18T08:28:07.066833Z","submitted_at":"2026-08-13T02:04:26Z","title":"Error-Aware Reverse Auction Mechanism for Large Language Model Routing","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-16T00:55:47.262645Z"},"links":{"citing_paper":"/paper/2608.12719"},"observation_digest":"sha256:5e2b4efa13228d603434fa3faa22baf7bc4a5885d246676869b9c8a46249506c","observation_id":"88f73e1b-45ce-4585-8b27-39344ee88e90","resolution":{"observed_at":"2026-08-16T00:55:47.262645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:55:47.266962Z","title":"Mechanism design for large language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.12719","last_updated":"2026-08-13T02:04:26Z","snapshot_observed_at":"2026-08-18T08:28:07.066833Z","submitted_at":"2026-08-13T02:04:26Z","title":"Error-Aware Reverse Auction Mechanism for Large Language Model Routing","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-16T00:55:47.266962Z"},"links":{"citing_paper":"/paper/2608.12719"},"observation_digest":"sha256:25234ce536c0fe71e03d19f8a5e8d5278a7747303b807b89ec76c527eb23b546","observation_id":"49f1dc89-9a19-4482-8695-83d540fde4e1","resolution":{"observed_at":"2026-08-16T00:55:47.266962Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:55:47.547814Z","title":"Auctions with llm summaries","venue":null,"work_id":"f32d0d28-3708-49d9-a510-5e675d3503d4","year":2024},"citing_paper":{"arxiv_id":"2608.12719","last_updated":"2026-08-13T02:04:26Z","snapshot_observed_at":"2026-08-18T08:28:07.066833Z","submitted_at":"2026-08-13T02:04:26Z","title":"Error-Aware Reverse Auction Mechanism for Large Language Model Routing","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-16T00:55:47.271181Z"},"links":{"citing_paper":"/paper/2608.12719"},"observation_digest":"sha256:c0fc8ca0726aba35550f9169141c452cc9927aa25496916b39e607f1aecf63de","observation_id":"56baaad0-6fe2-4c64-97a5-5b9a972e39c7","resolution":{"observed_at":"2026-08-16T00:55:47.552515Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:55:47.533083Z","title":null,"venue":null,"work_id":"f167ae70-4385-4105-9203-c7ecccc50b57","year":null},"citing_paper":{"arxiv_id":"2608.12719","last_updated":"2026-08-13T02:04:26Z","snapshot_observed_at":"2026-08-18T08:28:07.066833Z","submitted_at":"2026-08-13T02:04:26Z","title":"Error-Aware Reverse Auction Mechanism for Large Language Model Routing","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-16T00:55:47.275801Z"},"links":{"citing_paper":"/paper/2608.12719"},"observation_digest":"sha256:405df6a318aded54465a6238bb58d2943affc2d770af30bbb20de6cfc5f97362","observation_id":"65c173cf-35ac-4f2d-ab3d-31739a2e4f3a","resolution":{"observed_at":"2026-08-16T00:55:47.537727Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:55:47.517330Z","title":"This confirms that the seller’s utility is weakly increasing in ability and weakly decreasing in difficulty","venue":null,"work_id":"36a71c02-3a1a-44d5-a30a-458281eeab9e","year":null},"citing_paper":{"arxiv_id":"2608.12719","last_updated":"2026-08-13T02:04:26Z","snapshot_observed_at":"2026-08-18T08:28:07.066833Z","submitted_at":"2026-08-13T02:04:26Z","title":"Error-Aware Reverse Auction Mechanism for Large Language Model Routing","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-16T00:55:47.280049Z"},"links":{"citing_paper":"/paper/2608.12719"},"observation_digest":"sha256:2dc7c33dbef943bb8d32cea172213d012f9404d5060bbdf57d436229e3d2dba0","observation_id":"6bf6f5d8-70c1-4e9d-8d49-39fe3b501975","resolution":{"observed_at":"2026-08-16T00:55:47.523468Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:55:47.500721Z","title":null,"venue":null,"work_id":"eab78b61-9d62-4898-a2a4-f970ef88313a","year":null},"citing_paper":{"arxiv_id":"2608.12719","last_updated":"2026-08-13T02:04:26Z","snapshot_observed_at":"2026-08-18T08:28:07.066833Z","submitted_at":"2026-08-13T02:04:26Z","title":"Error-Aware Reverse Auction Mechanism for Large Language Model Routing","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-16T00:55:47.284678Z"},"links":{"citing_paper":"/paper/2608.12719"},"observation_digest":"sha256:00c883ceb87d4c20f9561ef7a72857ef44d59a0cf0b64a24da62bb5c6d7c6d4f","observation_id":"673c1f8d-f4ec-4301-8887-6dac6352a858","resolution":{"observed_at":"2026-08-16T00:55:47.506100Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:55:47.244879Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.12719","last_updated":"2026-08-13T02:04:26Z","snapshot_observed_at":"2026-08-18T08:28:07.066833Z","submitted_at":"2026-08-13T02:04:26Z","title":"Error-Aware Reverse Auction Mechanism for Large Language Model Routing","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-16T00:55:47.244879Z"},"links":{"citing_paper":"/paper/2608.12719"},"observation_digest":"sha256:7a6310f95629a48bb2d1e4aa337f0d882abaf251935142ebfdcfb6bf27e4203b","observation_id":"72f8af3a-d861-45a9-a599-a4348488040f","resolution":{"observed_at":"2026-08-16T00:55:47.244879Z","resolver_source":null,"status":"parse_uncertain"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2608.12719","last_updated":"2026-08-13T02:04:26Z","latest_version":1,"primary_category":"cs.GT","snapshot_observed_at":"2026-08-18T08:28:07.066833Z","submitted_at":"2026-08-13T02:04:26Z","title":"Error-Aware Reverse Auction Mechanism for Large Language Model Routing"},"reference_resolution":{"displayed":34,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":1,"unresolved":18,"verified_exact":0,"verified_fuzzy":15},"total_outbound_references":34},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 34 of 34 outbound references and 0 inbound Pith citation observations for arXiv:2608.12719."}