{"as_of":"2026-08-22T15:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8cd4346e082f7b58e3a45e0a637e14e0427c4c386ecfcad4bb33d87a9c00a71e","coverage":[{"denominator":27,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":27,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T05:30:40.853555Z","state":"measured"},{"denominator":42,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":42,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+00:00","state":"measured"},{"denominator":15,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":15,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T00:21:09.815657Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-02T18:37:16.470032Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.03261","last_updated":"2025-05-19T19:40:22Z","snapshot_observed_at":"2026-08-17T03:23:21.487254Z","submitted_at":"2025-02-05T15:17:25Z","title":"CARROT: A Cost Aware Rate Optimal Router","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.03261","snapshot_observed_at":"2026-08-09T19:10:53.842148Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2502.00409","last_updated":"2025-07-21T12:20:06Z","snapshot_observed_at":"2026-08-19T22:44:53.516876Z","submitted_at":"2025-02-01T12:08:38Z","title":"Doing More with Less: A Survey on Routing Strategies for Resource Optimisation in Large Language Model-Based Systems","version":3},"reference_index":94,"source":"pdf_text","source_observed_at":"2026-08-09T19:10:53.842148Z"},"links":{"cited_paper":"/paper/2502.03261","citing_paper":"/paper/2502.00409"},"observation_digest":"sha256:40b0472207d4529451ee9a03bda764214f0914dfc6e96e74e78b7d294fc1d7d8","observation_id":"6e0f9055-fb5f-4563-9b93-d68eea07c2e1","resolution":{"observed_at":"2026-08-09T19:10:53.842148Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.03261","last_updated":"2025-05-19T19:40:22Z","snapshot_observed_at":"2026-08-17T03:23:21.487254Z","submitted_at":"2025-02-05T15:17:25Z","title":"CARROT: A Cost Aware Rate Optimal Router","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.03261","snapshot_observed_at":"2026-08-07T23:48:01.205354Z","title":"Carrot: A cost aware rate optimal router, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2502.08773","last_updated":"2025-07-22T15:27:33Z","snapshot_observed_at":"2026-08-18T13:29:57.105910Z","submitted_at":"2025-02-12T20:30:28Z","title":"Universal Model Routing for Efficient LLM Inference","version":2},"reference_index":97,"source":"arxiv_source","source_observed_at":"2026-08-07T23:48:01.205354Z"},"links":{"cited_paper":"/paper/2502.03261","citing_paper":"/paper/2502.08773"},"observation_digest":"sha256:85671c79429c0545041a3e8f6d238b56ad230a77bcaf723c6aca9b2dec364ddc","observation_id":"1931358c-307b-48cc-a9f8-f6e496dab66c","resolution":{"observed_at":"2026-08-07T23:48:01.205354Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.03261","last_updated":"2025-05-19T19:40:22Z","snapshot_observed_at":"2026-08-17T03:23:21.487254Z","submitted_at":"2025-02-05T15:17:25Z","title":"CARROT: A Cost Aware Rate Optimal Router","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.03261","snapshot_observed_at":"2026-08-15T16:09:31.545410Z","title":"Carrot: A cost aware rate optimal router.arXiv preprint arXiv:2502.03261, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.09782","last_updated":"2025-09-11T18:29:09Z","snapshot_observed_at":"2026-08-19T03:14:29.468542Z","submitted_at":"2025-09-11T18:29:09Z","title":"One Head, Many Models: Cross-Attention Routing for Cost-Aware LLM Selection","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T16:09:31.545410Z"},"links":{"cited_paper":"/paper/2502.03261","citing_paper":"/paper/2509.09782"},"observation_digest":"sha256:a60e49047c87830338ecc1588de7122d728be791c7da643a70357286a127ade0","observation_id":"81d0e684-0dc7-425b-9bc6-978907a211ea","resolution":{"observed_at":"2026-08-15T16:09:31.545410Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.03261","last_updated":"2025-05-19T19:40:22Z","snapshot_observed_at":"2026-08-17T03:23:21.487254Z","submitted_at":"2025-02-05T15:17:25Z","title":"CARROT: A Cost Aware Rate Optimal Router","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.03261","snapshot_observed_at":"2026-08-03T05:17:30.522132Z","title":"M., de Oliveira, A","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.02823","last_updated":"2026-05-29T19:48:02Z","snapshot_observed_at":"2026-08-03T05:17:28.452364Z","submitted_at":"2026-02-02T21:23:51Z","title":"R2-Router: A New Paradigm for LLM Routing with Reasoning","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-03T05:17:30.522132Z"},"links":{"cited_paper":"/paper/2502.03261","citing_paper":"/paper/2602.02823"},"observation_digest":"sha256:a2343bdab61c55597cb008f02a38d0fd750b35d11b6fb83fdbd6db490566b97e","observation_id":"7777ceac-ae07-4c1e-b00c-089700cf1c59","resolution":{"observed_at":"2026-08-03T05:17:30.522132Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.03261","last_updated":"2025-05-19T19:40:22Z","snapshot_observed_at":"2026-08-17T03:23:21.487254Z","submitted_at":"2025-02-05T15:17:25Z","title":"CARROT: A Cost Aware Rate Optimal Router","version":2},"cited_work":{"arxiv_id":"2502.03261","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.03261","snapshot_observed_at":"2026-07-02T18:37:16.470032Z","title":"Carrot: A cost aware rate optimal router","venue":null,"work_id":"ede45886-7ae3-4d0e-8f79-3ec32bd48799","year":2025},"citing_paper":{"arxiv_id":"2605.07112","last_updated":"2026-05-08T01:41:31Z","snapshot_observed_at":"2026-07-06T23:19:30.387067Z","submitted_at":"2026-05-08T01:41:31Z","title":"Switchcraft: AI Model Router for Agentic Tool Calling","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-11T01:02:55.275359Z"},"links":{"cited_paper":"/paper/2502.03261","citing_paper":"/paper/2605.07112"},"observation_digest":"sha256:cab4b7dedf23825f0d85cff089522a695829a49efd3ba5e0b156488f7783ba6d","observation_id":"ca0b191d-c196-4b72-8575-d735ebc07b5b","resolution":{"observed_at":"2026-05-11T04:50:56.494529Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.03261","last_updated":"2025-05-19T19:40:22Z","snapshot_observed_at":"2026-08-17T03:23:21.487254Z","submitted_at":"2025-02-05T15:17:25Z","title":"CARROT: A Cost Aware Rate Optimal Router","version":2},"cited_work":{"arxiv_id":"2502.03261","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.03261","snapshot_observed_at":"2026-07-02T18:37:16.470032Z","title":"Carrot: A cost aware rate optimal router","venue":null,"work_id":"ede45886-7ae3-4d0e-8f79-3ec32bd48799","year":2025},"citing_paper":{"arxiv_id":"2605.07805","last_updated":"2026-05-08T14:39:57Z","snapshot_observed_at":"2026-08-14T00:58:36.822765Z","submitted_at":"2026-05-08T14:39:57Z","title":"Flexible Routing via Uncertainty Decomposition","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-11T03:13:56.150348Z"},"links":{"cited_paper":"/paper/2502.03261","citing_paper":"/paper/2605.07805"},"observation_digest":"sha256:c74c28e4bdb69756b39a760e795079c5fa65fe051d8a4130e9b92acb18b528e1","observation_id":"3bcc990d-60bc-4f47-b781-a475fb266211","resolution":{"observed_at":"2026-05-11T03:15:54.507445Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.03261","last_updated":"2025-05-19T19:40:22Z","snapshot_observed_at":"2026-08-17T03:23:21.487254Z","submitted_at":"2025-02-05T15:17:25Z","title":"CARROT: A Cost Aware Rate Optimal Router","version":2},"cited_work":{"arxiv_id":"2502.03261","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.03261","snapshot_observed_at":"2026-07-02T18:37:16.470032Z","title":"Carrot: A cost aware rate optimal router","venue":null,"work_id":"ede45886-7ae3-4d0e-8f79-3ec32bd48799","year":2025},"citing_paper":{"arxiv_id":"2605.17110","last_updated":"2026-06-01T07:26:00Z","snapshot_observed_at":"2026-08-17T19:10:47.019269Z","submitted_at":"2026-05-16T18:30:37Z","title":"Capturing LLM Capabilities via Evidence-Calibrated Query Clustering","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-20T15:04:32.774530Z"},"links":{"cited_paper":"/paper/2502.03261","citing_paper":"/paper/2605.17110"},"observation_digest":"sha256:eee300271b8b84232487f95ebca9ee1a50e8ce4234303692fc068cc427df7f1d","observation_id":"bb15c1f3-712b-4ac4-a722-176fe5b35ba9","resolution":{"observed_at":"2026-05-20T15:08:25.109071Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.03261","last_updated":"2025-05-19T19:40:22Z","snapshot_observed_at":"2026-08-17T03:23:21.487254Z","submitted_at":"2025-02-05T15:17:25Z","title":"CARROT: A Cost Aware Rate Optimal Router","version":2},"cited_work":{"arxiv_id":"2502.03261","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.03261","snapshot_observed_at":"2026-07-02T18:37:16.470032Z","title":"Carrot: A cost aware rate optimal router","venue":null,"work_id":"ede45886-7ae3-4d0e-8f79-3ec32bd48799","year":2025},"citing_paper":{"arxiv_id":"2605.17110","last_updated":"2026-06-01T07:26:00Z","snapshot_observed_at":"2026-08-17T19:10:47.019269Z","submitted_at":"2026-05-16T18:30:37Z","title":"Capturing LLM Capabilities via Evidence-Calibrated Query Clustering","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-06-30T18:59:45.877785Z"},"links":{"cited_paper":"/paper/2502.03261","citing_paper":"/paper/2605.17110"},"observation_digest":"sha256:9323f16056e6511ab21c220a8fc98a9dd83dd5bf28d39299542c9459f8c3f408","observation_id":"542c12e1-34d7-4df0-ac81-35d24e5d57d2","resolution":{"observed_at":"2026-06-30T19:05:00.974476Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.03261","last_updated":"2025-05-19T19:40:22Z","snapshot_observed_at":"2026-08-17T03:23:21.487254Z","submitted_at":"2025-02-05T15:17:25Z","title":"CARROT: A Cost Aware Rate Optimal Router","version":2},"cited_work":{"arxiv_id":"2502.03261","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.03261","snapshot_observed_at":"2026-07-02T18:37:16.470032Z","title":"Carrot: A cost aware rate optimal router","venue":null,"work_id":"ede45886-7ae3-4d0e-8f79-3ec32bd48799","year":2025},"citing_paper":{"arxiv_id":"2605.27361","last_updated":"2026-05-26T17:58:47Z","snapshot_observed_at":"2026-08-04T13:19:25.137063Z","submitted_at":"2026-05-26T17:58:47Z","title":"Natural Language Query to Configuration for Retrieval Agents","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-29T17:44:34.509337Z"},"links":{"cited_paper":"/paper/2502.03261","citing_paper":"/paper/2605.27361"},"observation_digest":"sha256:fc9fc9dff488f0238b5c351c7256dcd3f6e5ed936902a001ef6214939c232d75","observation_id":"40f18569-8209-44e0-b0a3-e6bedd842f5b","resolution":{"observed_at":"2026-06-29T17:53:47.610472Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.03261","last_updated":"2025-05-19T19:40:22Z","snapshot_observed_at":"2026-08-17T03:23:21.487254Z","submitted_at":"2025-02-05T15:17:25Z","title":"CARROT: A Cost Aware Rate Optimal Router","version":2},"cited_work":{"arxiv_id":"2502.03261","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.03261","snapshot_observed_at":"2026-07-02T18:37:16.470032Z","title":"Carrot: A cost aware rate optimal router","venue":null,"work_id":"ede45886-7ae3-4d0e-8f79-3ec32bd48799","year":2025},"citing_paper":{"arxiv_id":"2606.07587","last_updated":"2026-05-27T19:29:01Z","snapshot_observed_at":"2026-08-20T11:34:49.978585Z","submitted_at":"2026-05-27T19:29:01Z","title":"The Routing Plateau: Understanding and Breaking the Accuracy Limits of LLM Routers","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-06-29T14:07:26.366172Z"},"links":{"cited_paper":"/paper/2502.03261","citing_paper":"/paper/2606.07587"},"observation_digest":"sha256:77c70fae5086e6e04ac2fb961e60cfb0c0165e44e889bf9d6ef1bd48c887c3e0","observation_id":"e53b7678-4ce4-4866-8ca0-8f78c3754a00","resolution":{"observed_at":"2026-06-29T14:13:30.262769Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.03261","last_updated":"2025-05-19T19:40:22Z","snapshot_observed_at":"2026-08-17T03:23:21.487254Z","submitted_at":"2025-02-05T15:17:25Z","title":"CARROT: A Cost Aware Rate Optimal Router","version":2},"cited_work":{"arxiv_id":"2502.03261","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.03261","snapshot_observed_at":"2026-07-02T18:37:16.470032Z","title":"Carrot: A cost aware rate optimal router","venue":null,"work_id":"ede45886-7ae3-4d0e-8f79-3ec32bd48799","year":2025},"citing_paper":{"arxiv_id":"2607.00053","last_updated":"2026-06-30T01:46:26Z","snapshot_observed_at":"2026-07-07T00:05:41.920778Z","submitted_at":"2026-06-30T01:46:26Z","title":"SWE-Router: Routing in Multi-turn Agentic Software Engineering Tasks","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-07-02T18:19:43.146102Z"},"links":{"cited_paper":"/paper/2502.03261","citing_paper":"/paper/2607.00053"},"observation_digest":"sha256:0681daff3a95bc656f3ebffe0342a8a5e710357173c441e8706ee1282b5dd651","observation_id":"9954ab4e-b67f-4d7c-880a-0d558fb0279e","resolution":{"observed_at":"2026-07-02T18:37:16.471519Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.03261","last_updated":"2025-05-19T19:40:22Z","snapshot_observed_at":"2026-08-17T03:23:21.487254Z","submitted_at":"2025-02-05T15:17:25Z","title":"CARROT: A Cost Aware Rate Optimal Router","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.03261","snapshot_observed_at":"2026-07-13T01:00:14.236570Z","title":"Carrot: A cost aware rate optimal router.arXiv preprint arXiv:2502.03261, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.09015","last_updated":"2026-07-10T00:42:10Z","snapshot_observed_at":"2026-08-13T22:20:10.925851Z","submitted_at":"2026-07-10T00:42:10Z","title":"Correlation-Aware Contextual Bandits with Surrogate Rewards for LLM Routing","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-07-13T01:00:14.236570Z"},"links":{"cited_paper":"/paper/2502.03261","citing_paper":"/paper/2607.09015"},"observation_digest":"sha256:45a6499e574f152286473760a9b88e6a550febac0644f8094d7164b4661c5dd1","observation_id":"771be20e-e056-4f31-805b-0e53c56d369b","resolution":{"observed_at":"2026-07-13T01:00:14.236570Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.03261","last_updated":"2025-05-19T19:40:22Z","snapshot_observed_at":"2026-08-17T03:23:21.487254Z","submitted_at":"2025-02-05T15:17:25Z","title":"CARROT: A Cost Aware Rate Optimal Router","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.03261","snapshot_observed_at":"2026-08-04T07:49:39.964348Z","title":"arXiv preprint arXiv:2502.03261 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.02415","last_updated":"2026-08-03T15:53:49Z","snapshot_observed_at":"2026-08-17T06:34:39.162836Z","submitted_at":"2026-08-03T15:53:49Z","title":"Training-Free versus Training-Based Intent Classification in LLMs: Accuracy, Robustness, and Failure Modes","version":1},"reference_index":95,"source":"arxiv_source","source_observed_at":"2026-08-04T07:49:39.964348Z"},"links":{"cited_paper":"/paper/2502.03261","citing_paper":"/paper/2608.02415"},"observation_digest":"sha256:79e61b8d4b563658ed5f87c1bb725e63b88b2f537a4595f3b0d90765bd085f11","observation_id":"fa4e347d-0279-4d9e-82f3-2dd1bf191731","resolution":{"observed_at":"2026-08-04T07:49:39.964348Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.03261","last_updated":"2025-05-19T19:40:22Z","snapshot_observed_at":"2026-08-17T03:23:21.487254Z","submitted_at":"2025-02-05T15:17:25Z","title":"CARROT: A Cost Aware Rate Optimal Router","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.03261","snapshot_observed_at":"2026-08-10T04:22:23.200548Z","title":"Somerstep, F","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.06607","last_updated":"2026-08-06T21:34:51Z","snapshot_observed_at":"2026-08-19T09:12:12.267773Z","submitted_at":"2026-08-06T21:34:51Z","title":"Pre-Inference Routing for Cost-Efficient Document Field Extraction","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T04:22:23.200548Z"},"links":{"cited_paper":"/paper/2502.03261","citing_paper":"/paper/2608.06607"},"observation_digest":"sha256:c53de8e8c1e1dea6fceab945bff28026653b248401edf01816a74affa2692057","observation_id":"266fe307-1d4d-418d-8245-ee8b5e2d1de3","resolution":{"observed_at":"2026-08-10T04:22:23.200548Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.03261","last_updated":"2025-05-19T19:40:22Z","snapshot_observed_at":"2026-08-17T03:23:21.487254Z","submitted_at":"2025-02-05T15:17:25Z","title":"CARROT: A Cost Aware Rate Optimal Router","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.03261","snapshot_observed_at":"2026-08-16T00:21:09.815657Z","title":"Carrot: A cost aware rate optimal router, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.12127","last_updated":"2026-08-19T10:27:45Z","snapshot_observed_at":"2026-08-22T15:09:57.377409Z","submitted_at":"2026-08-12T14:49:28Z","title":"SCOPE-Router: Cost-Aware Open-Set VLM Routing for Execution-Oriented Tasks","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-16T00:21:09.815657Z"},"links":{"cited_paper":"/paper/2502.03261","citing_paper":"/paper/2608.12127"},"observation_digest":"sha256:894dbbf9628073a5248a994d8c4bd8a497cd13cc995ef8a932cc11b6477254c9","observation_id":"2047e7a7-78d4-4195-94db-6e26c8bb8392","resolution":{"observed_at":"2026-08-16T00:21:09.815657Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2502.03261/citation-record","integrity":"/paper/2502.03261/integrity","json":"/paper/2502.03261/citation-record.json","paper":"/paper/2502.03261"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T05:30:41.111625Z","title":null,"venue":null,"work_id":"9a4af194-47e5-4979-8af3-b8b2dc52712c","year":null},"citing_paper":{"arxiv_id":"2502.03261","last_updated":"2025-05-19T19:40:22Z","snapshot_observed_at":"2026-08-17T03:23:21.487254Z","submitted_at":"2025-02-05T15:17:25Z","title":"CARROT: A Cost Aware Rate Optimal Router","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-09T05:30:40.781338Z"},"links":{"citing_paper":"/paper/2502.03261"},"observation_digest":"sha256:e6ad3f864d98b1ed3756cbe1088dc04e964fe635123c30afc14daf1d97d6086c","observation_id":"f6a7e9e9-d81f-4606-a542-03be1994b03e","resolution":{"observed_at":"2026-08-09T05:30:41.114357Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T05:30:41.094288Z","title":", m− 1}d as a uniform grid in [0, 1]d of size md and Gϵ as an ϵ-net in ℓ∞ metric, i.e","venue":null,"work_id":"2594e1e8-5b0f-4aa4-ad67-1cb4d7d517b5","year":null},"citing_paper":{"arxiv_id":"2502.03261","last_updated":"2025-05-19T19:40:22Z","snapshot_observed_at":"2026-08-17T03:23:21.487254Z","submitted_at":"2025-02-05T15:17:25Z","title":"CARROT: A Cost Aware Rate Optimal Router","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-09T05:30:40.788478Z"},"links":{"citing_paper":"/paper/2502.03261"},"observation_digest":"sha256:5c038cccba29efedba89472fb68c643f1dcd345a60db6a428eeaffade8c70115","observation_id":"7f58ce22-ec92-403a-82d6-1c72f5892ebd","resolution":{"observed_at":"2026-08-09T05:30:41.097478Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T05:30:41.103480Z","title":"Then KL(pθ, pθ′) ≤ K(θ−θ′)2 2","venue":null,"work_id":"3214b4bc-e5dc-477a-b6da-dd169781451c","year":null},"citing_paper":{"arxiv_id":"2502.03261","last_updated":"2025-05-19T19:40:22Z","snapshot_observed_at":"2026-08-17T03:23:21.487254Z","submitted_at":"2025-02-05T15:17:25Z","title":"CARROT: A Cost Aware Rate Optimal Router","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-09T05:30:40.785024Z"},"links":{"citing_paper":"/paper/2502.03261"},"observation_digest":"sha256:0996b82f6c31ec3f1e016bf3e6834f21ccaced5069f927ee363650f16476a741","observation_id":"e77300a2-9810-4283-addc-9ffec26ef6c9","resolution":{"observed_at":"2026-08-09T05:30:41.106232Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T05:30:41.076633Z","title":null,"venue":null,"work_id":"a91b7aa5-2d49-4e3b-ac4c-49bbec0b6eba","year":null},"citing_paper":{"arxiv_id":"2502.03261","last_updated":"2025-05-19T19:40:22Z","snapshot_observed_at":"2026-08-17T03:23:21.487254Z","submitted_at":"2025-02-05T15:17:25Z","title":"CARROT: A Cost Aware Rate Optimal Router","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-09T05:30:40.794625Z"},"links":{"citing_paper":"/paper/2502.03261"},"observation_digest":"sha256:6f1b931609a54df125d916c54f7577e946ed3f640d24bccdc8c98e94cd71b4d6","observation_id":"5ef3dece-fef8-44a5-a3ee-2cabab7457b1","resolution":{"observed_at":"2026-08-09T05:30:41.079657Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T05:30:41.068934Z","title":null,"venue":null,"work_id":"f39d923a-5e5b-4a3b-a93d-3a44f4c1e305","year":null},"citing_paper":{"arxiv_id":"2502.03261","last_updated":"2025-05-19T19:40:22Z","snapshot_observed_at":"2026-08-17T03:23:21.487254Z","submitted_at":"2025-02-05T15:17:25Z","title":"CARROT: A Cost Aware Rate Optimal Router","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-09T05:30:40.798043Z"},"links":{"citing_paper":"/paper/2502.03261"},"observation_digest":"sha256:a12f71acea6c29d0ac96bf6cb3f1504f53e74586649d35ea76b8e5336eb4aa79","observation_id":"f985d4ab-b3c5-4509-bcef-c5594c1c4362","resolution":{"observed_at":"2026-08-09T05:30:41.071674Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T05:30:41.058885Z","title":"A sufficient condition for constricting such a family of distributions can be found in Lemma C.3","venue":null,"work_id":"4ddac181-b988-4427-aca9-a2464fcc410a","year":null},"citing_paper":{"arxiv_id":"2502.03261","last_updated":"2025-05-19T19:40:22Z","snapshot_observed_at":"2026-08-17T03:23:21.487254Z","submitted_at":"2025-02-05T15:17:25Z","title":"CARROT: A Cost Aware Rate Optimal Router","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-09T05:30:40.801011Z"},"links":{"citing_paper":"/paper/2502.03261"},"observation_digest":"sha256:38b6c2e11ef78caf3eb63b858331b80cc5bb59b19e432959aeca6ec48c540987","observation_id":"02b1ed21-e667-42b8-9809-8d5ed844348b","resolution":{"observed_at":"2026-08-09T05:30:41.062188Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T05:30:41.085201Z","title":"For such a distribution, note that vol(Gϵ) = ( mϵ)d ≤ (h−1ϵ)d, which implies that for all x ∈ Gϵ we have pX (x) = ( hϵ−1)d","venue":null,"work_id":"134e5325-00c1-4f96-996a-eb6ee46d8ef8","year":null},"citing_paper":{"arxiv_id":"2502.03261","last_updated":"2025-05-19T19:40:22Z","snapshot_observed_at":"2026-08-17T03:23:21.487254Z","submitted_at":"2025-02-05T15:17:25Z","title":"CARROT: A Cost Aware Rate Optimal Router","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-09T05:30:40.791559Z"},"links":{"citing_paper":"/paper/2502.03261"},"observation_digest":"sha256:b3c617083bcd8e061c7c5e9a0eda46fdb8658e8ae7597f9d5cdaf716b88d3719","observation_id":"366c518e-258b-4e75-b430-762907d7035c","resolution":{"observed_at":"2026-08-09T05:30:41.088850Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T05:30:40.980407Z","title":"We also release our data and models so that one can check our results with no training needed","venue":null,"work_id":"ff40fae8-d7a1-4cbc-bb4c-2ae0900fb1e3","year":null},"citing_paper":{"arxiv_id":"2502.03261","last_updated":"2025-05-19T19:40:22Z","snapshot_observed_at":"2026-08-17T03:23:21.487254Z","submitted_at":"2025-02-05T15:17:25Z","title":"CARROT: A Cost Aware Rate Optimal Router","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-09T05:30:40.830591Z"},"links":{"citing_paper":"/paper/2502.03261"},"observation_digest":"sha256:51360f2490a81746bb51f2169d1e210e815337de69c5be83a00400d271955d5b","observation_id":"2146ce10-a95a-407f-b11f-ca1482d55f32","resolution":{"observed_at":"2026-08-09T05:30:40.983517Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T05:30:40.971775Z","title":"Guidelines: • The answer NA means that the authors have not reviewed the NeurIPS Code of Ethics","venue":null,"work_id":"9f9ec47e-d652-4f2e-a908-e7dc188c3c85","year":null},"citing_paper":{"arxiv_id":"2502.03261","last_updated":"2025-05-19T19:40:22Z","snapshot_observed_at":"2026-08-17T03:23:21.487254Z","submitted_at":"2025-02-05T15:17:25Z","title":"CARROT: A Cost Aware Rate Optimal Router","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-09T05:30:40.833538Z"},"links":{"citing_paper":"/paper/2502.03261"},"observation_digest":"sha256:7ca445fc79026037ef889a5592b009dd062efd22431f6d72d87b9fabfa04f496","observation_id":"5e964c07-5cbc-4262-9dfc-1b62c12401f0","resolution":{"observed_at":"2026-08-09T05:30:40.974986Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T05:30:40.960936Z","title":"Guidelines: • The answer NA means that there is no societal impact of the work performed","venue":null,"work_id":"2c8dce8c-d5c1-453c-acb6-e34adab63bd5","year":null},"citing_paper":{"arxiv_id":"2502.03261","last_updated":"2025-05-19T19:40:22Z","snapshot_observed_at":"2026-08-17T03:23:21.487254Z","submitted_at":"2025-02-05T15:17:25Z","title":"CARROT: A Cost Aware Rate Optimal Router","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-09T05:30:40.837085Z"},"links":{"citing_paper":"/paper/2502.03261"},"observation_digest":"sha256:609e748d968629c13ea5f612a6d0f19141817e95aaeda7787bd99bbf1b11bc6b","observation_id":"92a36068-84d4-4a39-be56-ca9029eed767","resolution":{"observed_at":"2026-08-09T05:30:40.964313Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T05:30:41.048904Z","title":"c o r r e c t n e s s _ s c o r e","venue":null,"work_id":"6c23b195-fd92-4a95-8924-7faf4e857732","year":2015},"citing_paper":{"arxiv_id":"2502.03261","last_updated":"2025-05-19T19:40:22Z","snapshot_observed_at":"2026-08-17T03:23:21.487254Z","submitted_at":"2025-02-05T15:17:25Z","title":"CARROT: A Cost Aware Rate Optimal Router","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-09T05:30:40.803890Z"},"links":{"citing_paper":"/paper/2502.03261"},"observation_digest":"sha256:9f0bca09f18e3efef7bff7557f43e6f132c074ef97ecd99030d92ee1eb9f36fd","observation_id":"a7c28da8-9333-4514-a297-0ef6507dffa3","resolution":{"observed_at":"2026-08-09T05:30:41.052503Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T05:30:41.040036Z","title":"Guidelines: • The answer NA means that the abstract and introduction do not include the claims made in the paper","venue":null,"work_id":"8b625e8f-a5d1-400f-ad63-0d6f5929ca89","year":null},"citing_paper":{"arxiv_id":"2502.03261","last_updated":"2025-05-19T19:40:22Z","snapshot_observed_at":"2026-08-17T03:23:21.487254Z","submitted_at":"2025-02-05T15:17:25Z","title":"CARROT: A Cost Aware Rate Optimal Router","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-09T05:30:40.807891Z"},"links":{"citing_paper":"/paper/2502.03261"},"observation_digest":"sha256:e37735f4cf3f1750351715156cc071c3f6bbd4794533ee3c7c6de850661d310e","observation_id":"30412e39-d120-4c67-8fef-d84e8e3ff805","resolution":{"observed_at":"2026-08-09T05:30:41.043339Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T05:30:41.031355Z","title":"Limitations","venue":null,"work_id":"f17ea1ca-97df-4c32-941f-becf528cce95","year":null},"citing_paper":{"arxiv_id":"2502.03261","last_updated":"2025-05-19T19:40:22Z","snapshot_observed_at":"2026-08-17T03:23:21.487254Z","submitted_at":"2025-02-05T15:17:25Z","title":"CARROT: A Cost Aware Rate Optimal Router","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-09T05:30:40.811174Z"},"links":{"citing_paper":"/paper/2502.03261"},"observation_digest":"sha256:bac6a47962f4cc8077107f4b7651ab04811ba90783ce1531c17c2dcf695acf03","observation_id":"f58bca75-33f2-4d3b-addc-3b2da2051108","resolution":{"observed_at":"2026-08-09T05:30:41.034822Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T05:30:41.021982Z","title":"Guidelines: • The answer NA means that the paper does not include theoretical results","venue":null,"work_id":"52116bc9-23b9-4eba-a75e-9a39534f0715","year":null},"citing_paper":{"arxiv_id":"2502.03261","last_updated":"2025-05-19T19:40:22Z","snapshot_observed_at":"2026-08-17T03:23:21.487254Z","submitted_at":"2025-02-05T15:17:25Z","title":"CARROT: A Cost Aware Rate Optimal Router","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-09T05:30:40.814786Z"},"links":{"citing_paper":"/paper/2502.03261"},"observation_digest":"sha256:e0a05917d47d1c9b1902ea47e67092d37d20e59edd9a3115479daf631b0ed4a2","observation_id":"787fbdc5-01c2-4883-8efb-74f986ba81fe","resolution":{"observed_at":"2026-08-09T05:30:41.025541Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T05:30:41.014205Z","title":"Guidelines: • The answer NA means that the paper does not include experiments","venue":null,"work_id":"f064370a-c3b7-4416-a86d-0899f6458408","year":null},"citing_paper":{"arxiv_id":"2502.03261","last_updated":"2025-05-19T19:40:22Z","snapshot_observed_at":"2026-08-17T03:23:21.487254Z","submitted_at":"2025-02-05T15:17:25Z","title":"CARROT: A Cost Aware Rate Optimal Router","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-09T05:30:40.817436Z"},"links":{"citing_paper":"/paper/2502.03261"},"observation_digest":"sha256:39c2ceb1d466ab9781a121be163fb0720bfac42a4069f18567d806abd3af8f60","observation_id":"2d1129a4-5568-45ed-b629-291878881187","resolution":{"observed_at":"2026-08-09T05:30:41.017142Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T05:30:41.005706Z","title":"Guidelines: • The answer NA means that paper does not include experiments requiring code","venue":null,"work_id":"82fe4405-0bd7-4700-9218-c561a9f91336","year":null},"citing_paper":{"arxiv_id":"2502.03261","last_updated":"2025-05-19T19:40:22Z","snapshot_observed_at":"2026-08-17T03:23:21.487254Z","submitted_at":"2025-02-05T15:17:25Z","title":"CARROT: A Cost Aware Rate Optimal Router","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-09T05:30:40.820780Z"},"links":{"citing_paper":"/paper/2502.03261"},"observation_digest":"sha256:ab3bc6ee42ebbf94ac482d7535ad05ad59e5489f3d6cbc659dd739c9f0f3fbe1","observation_id":"45af1a96-f531-4451-9988-fe09da198e1a","resolution":{"observed_at":"2026-08-09T05:30:41.009214Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T05:30:40.997672Z","title":"• The experimental setting should be presented in the core of the paper to a level of detail that is necessary to appreciate the results and make sense of them","venue":null,"work_id":"00b1a788-d828-4aae-a486-6d628ccf1957","year":null},"citing_paper":{"arxiv_id":"2502.03261","last_updated":"2025-05-19T19:40:22Z","snapshot_observed_at":"2026-08-17T03:23:21.487254Z","submitted_at":"2025-02-05T15:17:25Z","title":"CARROT: A Cost Aware Rate Optimal Router","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-09T05:30:40.824122Z"},"links":{"citing_paper":"/paper/2502.03261"},"observation_digest":"sha256:3e4b0bf90e4a035b7bb19dfc78c609cc100637e4488088f4a63abe1822b5c040","observation_id":"6ca2e1b9-eee8-4745-bbc9-d0740ddee0ed","resolution":{"observed_at":"2026-08-09T05:30:41.001002Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T05:30:40.989136Z","title":"29 Guidelines: • The answer NA means that the paper does not include experiments","venue":null,"work_id":"2db06704-4a2a-497e-ac91-0feebac36520","year":null},"citing_paper":{"arxiv_id":"2502.03261","last_updated":"2025-05-19T19:40:22Z","snapshot_observed_at":"2026-08-17T03:23:21.487254Z","submitted_at":"2025-02-05T15:17:25Z","title":"CARROT: A Cost Aware Rate Optimal Router","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-09T05:30:40.827900Z"},"links":{"citing_paper":"/paper/2502.03261"},"observation_digest":"sha256:4bf7803337e3c4c303aa3f70e22b78fca9cdf79347b880bf34f6851ce681cc37","observation_id":"be70a042-292b-49c5-932b-c7b4eee31773","resolution":{"observed_at":"2026-08-09T05:30:40.992382Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T05:30:40.952638Z","title":"Guidelines: • The answer NA means that the paper poses no such risks","venue":null,"work_id":"498bbdc9-3904-4e01-b6a0-2fd1a18840f5","year":null},"citing_paper":{"arxiv_id":"2502.03261","last_updated":"2025-05-19T19:40:22Z","snapshot_observed_at":"2026-08-17T03:23:21.487254Z","submitted_at":"2025-02-05T15:17:25Z","title":"CARROT: A Cost Aware Rate Optimal Router","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-09T05:30:40.839975Z"},"links":{"citing_paper":"/paper/2502.03261"},"observation_digest":"sha256:366b307e8c7c1cd96f6e6d5e38738364e760afe292bebccfe4096840ed38a825","observation_id":"4b502c3b-7d62-40f1-bed6-48aae92df531","resolution":{"observed_at":"2026-08-09T05:30:40.955738Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T05:30:40.944056Z","title":"Guidelines: • The answer NA means that the paper does not use existing assets","venue":null,"work_id":"f89ef41a-36fe-4baf-bf3d-f69c708ffa29","year":null},"citing_paper":{"arxiv_id":"2502.03261","last_updated":"2025-05-19T19:40:22Z","snapshot_observed_at":"2026-08-17T03:23:21.487254Z","submitted_at":"2025-02-05T15:17:25Z","title":"CARROT: A Cost Aware Rate Optimal Router","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-09T05:30:40.842532Z"},"links":{"citing_paper":"/paper/2502.03261"},"observation_digest":"sha256:6325a838431a51514363cd6310ec281db82f97cf3822edaf90a8b215cd2320e5","observation_id":"3f42024a-7369-4df6-9655-768b552aaa41","resolution":{"observed_at":"2026-08-09T05:30:40.947030Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T05:30:40.935635Z","title":"Guidelines: • The answer NA means that the paper does not release new assets","venue":null,"work_id":"d2921328-7a85-45d4-a346-f0b236ca139b","year":null},"citing_paper":{"arxiv_id":"2502.03261","last_updated":"2025-05-19T19:40:22Z","snapshot_observed_at":"2026-08-17T03:23:21.487254Z","submitted_at":"2025-02-05T15:17:25Z","title":"CARROT: A Cost Aware Rate Optimal Router","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-09T05:30:40.845025Z"},"links":{"citing_paper":"/paper/2502.03261"},"observation_digest":"sha256:2a762af81918ae2b9a22592cf6ca73d12a2988ed6f1787db5d73d35a243bcbd1","observation_id":"cfe5a30a-27f7-4112-addd-bdc54007d0df","resolution":{"observed_at":"2026-08-09T05:30:40.938821Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T05:30:40.926500Z","title":"Justification: [TODO] Guidelines: • The answer NA means that the paper does not involve crowdsourcing nor research with human subjects","venue":null,"work_id":"cd4de439-3f03-485e-8f40-5f0858c84592","year":null},"citing_paper":{"arxiv_id":"2502.03261","last_updated":"2025-05-19T19:40:22Z","snapshot_observed_at":"2026-08-17T03:23:21.487254Z","submitted_at":"2025-02-05T15:17:25Z","title":"CARROT: A Cost Aware Rate Optimal Router","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-09T05:30:40.847920Z"},"links":{"citing_paper":"/paper/2502.03261"},"observation_digest":"sha256:a358984a0693d4d8f776201245e2477cbedc40f83d97621455afa6a9cc96b6c8","observation_id":"60cdd9bb-e34d-42c1-9076-20f5865e5f5b","resolution":{"observed_at":"2026-08-09T05:30:40.929864Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T05:30:40.915343Z","title":"Justification: [TODO] Guidelines: • The answer NA means that the paper does not involve crowdsourcing nor research with human subjects","venue":null,"work_id":"dad038c7-5265-4432-90f6-24fc702285c5","year":null},"citing_paper":{"arxiv_id":"2502.03261","last_updated":"2025-05-19T19:40:22Z","snapshot_observed_at":"2026-08-17T03:23:21.487254Z","submitted_at":"2025-02-05T15:17:25Z","title":"CARROT: A Cost Aware Rate Optimal Router","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-09T05:30:40.850979Z"},"links":{"citing_paper":"/paper/2502.03261"},"observation_digest":"sha256:1c418d1b17171a9d654c54a06d3d6b2cd174bb656886c740568b6325f9f6bf62","observation_id":"7c269deb-5304-4c7c-9232-7a5d1248cb21","resolution":{"observed_at":"2026-08-09T05:30:40.919778Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T05:30:40.903837Z","title":"Answer: [NA]","venue":null,"work_id":"8b373fc7-0127-4cdb-a2f4-a9192ba25eed","year":2025},"citing_paper":{"arxiv_id":"2502.03261","last_updated":"2025-05-19T19:40:22Z","snapshot_observed_at":"2026-08-17T03:23:21.487254Z","submitted_at":"2025-02-05T15:17:25Z","title":"CARROT: A Cost Aware Rate Optimal Router","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-09T05:30:40.853555Z"},"links":{"citing_paper":"/paper/2502.03261"},"observation_digest":"sha256:82da79fde1e83da521a3c1f8b8c931fb069f4bd6c22e2f9f06b6bc4804839a9a","observation_id":"af1c018f-7d58-4eb9-8ebd-c79948781faa","resolution":{"observed_at":"2026-08-09T05:30:40.907729Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.07545","last_updated":"2024-06-11T17:59:47Z","snapshot_observed_at":"2026-08-16T13:44:03.001502Z","submitted_at":"2024-06-11T17:59:47Z","title":"Open-LLM-Leaderboard: From Multi-choice to Open-style Questions for LLMs Evaluation, Benchmark, and Arena","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.07545","snapshot_observed_at":"2026-08-09T05:30:40.772943Z","title":"URL https://aclanthology.org/2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.03261","last_updated":"2025-05-19T19:40:22Z","snapshot_observed_at":"2026-08-17T03:23:21.487254Z","submitted_at":"2025-02-05T15:17:25Z","title":"CARROT: A Cost Aware Rate Optimal Router","version":2},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-09T05:30:40.772943Z"},"links":{"cited_paper":"/paper/2406.07545","citing_paper":"/paper/2502.03261"},"observation_digest":"sha256:f83379b072d7f5e1444d4e6262ca7c2134d6a234a4933fa8b1816d63e3dabeea","observation_id":"54984122-afbb-486b-a687-06d47e20df1d","resolution":{"observed_at":"2026-08-09T05:30:40.772943Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2102.09127","last_updated":"2022-07-16T06:13:26Z","snapshot_observed_at":"2026-08-16T18:44:47.617492Z","submitted_at":"2021-02-18T02:59:58Z","title":"Efficient Online ML API Selection for Multi-Label Classification Tasks","version":2},"cited_work":{"arxiv_id":"2102.09127","doi":null,"metadata_source":"pith","pith_arxiv_id":"2102.09127","snapshot_observed_at":"2026-08-09T05:30:40.891683Z","title":"Efficient Online ML API Selection for Multi-Label Classification Tasks","venue":"cs.LG","work_id":"e142c207-c6d7-48fb-a909-54ddab167399","year":2021},"citing_paper":{"arxiv_id":"2502.03261","last_updated":"2025-05-19T19:40:22Z","snapshot_observed_at":"2026-08-17T03:23:21.487254Z","submitted_at":"2025-02-05T15:17:25Z","title":"CARROT: A Cost Aware Rate Optimal Router","version":2},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-09T05:30:40.767647Z"},"links":{"cited_paper":"/paper/2102.09127","citing_paper":"/paper/2502.03261"},"observation_digest":"sha256:69cc557429411e8ddb5d5fea68dc481347514430e6359d189ea7b30ba2dcd22c","observation_id":"ee68dac0-e3e0-4a26-8a39-f774f9f8ec00","resolution":{"observed_at":"2026-08-09T05:30:40.897204Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15789","last_updated":"2023-09-27T17:08:40Z","snapshot_observed_at":"2026-08-19T20:05:00.057234Z","submitted_at":"2023-09-27T17:08:40Z","title":"Large Language Model Routing with Benchmark Datasets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.15789","snapshot_observed_at":"2026-08-09T05:30:40.777328Z","title":"prompt\" contains the model queries, the","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.03261","last_updated":"2025-05-19T19:40:22Z","snapshot_observed_at":"2026-08-17T03:23:21.487254Z","submitted_at":"2025-02-05T15:17:25Z","title":"CARROT: A Cost Aware Rate Optimal Router","version":2},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-09T05:30:40.777328Z"},"links":{"cited_paper":"/paper/2309.15789","citing_paper":"/paper/2502.03261"},"observation_digest":"sha256:dbcbd867c083e56e3762471b02c5dc9ed868f67c6cb684c3f40fdb28fcb92dd9","observation_id":"a47a39aa-60f6-40a7-8a9d-5726d5beedf1","resolution":{"observed_at":"2026-08-09T05:30:40.777328Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2502.03261","last_updated":"2025-05-19T19:40:22Z","latest_version":2,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-17T03:23:21.487254Z","submitted_at":"2025-02-05T15:17:25Z","title":"CARROT: A Cost Aware Rate Optimal Router"},"reference_resolution":{"displayed":27,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":1,"verified_fuzzy":21},"total_outbound_references":27},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 27 of 27 outbound references and 15 inbound Pith citation observations for arXiv:2502.03261."}