{"as_of":"2026-08-18T04:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:59b27f4277418c82bd91c6a619fc133ecb6a20b4c5063c892a0e7690541aa645","coverage":[{"denominator":24,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":24,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T04:22:23.263273Z","state":"measured"},{"denominator":24,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":24,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+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.06607/citation-record","integrity":"/paper/2608.06607/integrity","json":"/paper/2608.06607/citation-record.json","paper":"/paper/2608.06607"},"outbound":[{"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-16T21:03:34.001313Z","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:4bc667617b691942710bde3ba19a2a4f8320f5f35b05c5839e725e4f912e87fe","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":"2505.19435","last_updated":"2025-05-26T02:53:17Z","snapshot_observed_at":"2026-08-17T11:25:24.808240Z","submitted_at":"2025-05-26T02:53:17Z","title":"Route to Reason: Adaptive Routing for LLM and Reasoning Strategy Selection","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.19435","snapshot_observed_at":"2026-08-10T04:22:23.205185Z","title":null,"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-16T21:03:34.001313Z","submitted_at":"2026-08-06T21:34:51Z","title":"Pre-Inference Routing for Cost-Efficient Document Field Extraction","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T04:22:23.205185Z"},"links":{"cited_paper":"/paper/2505.19435","citing_paper":"/paper/2608.06607"},"observation_digest":"sha256:722a90e76ccee5c6c90c0276e3dc0e8e29c898124f74bb18923818be0c7c7d96","observation_id":"7c34ce99-6132-43d5-8c26-d60f6f840c60","resolution":{"observed_at":"2026-08-10T04:22:23.205185Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.18482","last_updated":"2025-02-09T02:26:15Z","snapshot_observed_at":"2026-08-10T03:43:29.633184Z","submitted_at":"2025-02-09T02:26:15Z","title":"MixLLM: Dynamic Routing in Mixed Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.18482","snapshot_observed_at":"2026-08-10T04:22:23.208384Z","title":null,"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-16T21:03:34.001313Z","submitted_at":"2026-08-06T21:34:51Z","title":"Pre-Inference Routing for Cost-Efficient Document Field Extraction","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T04:22:23.208384Z"},"links":{"cited_paper":"/paper/2502.18482","citing_paper":"/paper/2608.06607"},"observation_digest":"sha256:cc6f962ffbf15423d12048a32d397872559da9934a0720d5312e7dfc258e684a","observation_id":"4f65ed0c-93a5-441f-aff0-fc4912208b44","resolution":{"observed_at":"2026-08-10T04:22:23.208384Z","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-10T04:22:23.503420Z","title":null,"venue":null,"work_id":"b59f7ca9-6d34-4a6e-8465-1eb172c766e9","year":2026},"citing_paper":{"arxiv_id":"2608.06607","last_updated":"2026-08-06T21:34:51Z","snapshot_observed_at":"2026-08-16T21:03:34.001313Z","submitted_at":"2026-08-06T21:34:51Z","title":"Pre-Inference Routing for Cost-Efficient Document Field Extraction","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T04:22:23.211780Z"},"links":{"citing_paper":"/paper/2608.06607"},"observation_digest":"sha256:ed6b27958fbae452e6d75391eb595f8d35e208de4cd7fbed78a3ee712b17c8b6","observation_id":"8d82f24f-075e-4985-9188-b319cc6fb501","resolution":{"observed_at":"2026-08-10T04:22:23.505797Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.22716","last_updated":"2025-06-28T01:52:50Z","snapshot_observed_at":"2026-08-14T16:20:26.515800Z","submitted_at":"2025-06-28T01:52:50Z","title":"BEST-Route: Adaptive LLM Routing with Test-Time Optimal Compute","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.22716","snapshot_observed_at":"2026-08-10T04:22:23.215021Z","title":null,"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-16T21:03:34.001313Z","submitted_at":"2026-08-06T21:34:51Z","title":"Pre-Inference Routing for Cost-Efficient Document Field Extraction","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T04:22:23.215021Z"},"links":{"cited_paper":"/paper/2506.22716","citing_paper":"/paper/2608.06607"},"observation_digest":"sha256:439c358763ab7b8d81f447c6b8c516d0e742ea088497e230b4b35eda75beae46","observation_id":"491b6841-1bf8-4ba4-a8ba-0bde2235c0ec","resolution":{"observed_at":"2026-08-10T04:22:23.215021Z","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":"4904.37925","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T04:22:23.367117Z","title":"Pan and K","venue":null,"work_id":"3cbbc0df-32ed-4f79-8fc8-032dfdc21a13","year":2026},"citing_paper":{"arxiv_id":"2608.06607","last_updated":"2026-08-06T21:34:51Z","snapshot_observed_at":"2026-08-16T21:03:34.001313Z","submitted_at":"2026-08-06T21:34:51Z","title":"Pre-Inference Routing for Cost-Efficient Document Field Extraction","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T04:22:23.218143Z"},"links":{"citing_paper":"/paper/2608.06607"},"observation_digest":"sha256:496166c9e4052a712c7142030f1445819c186b6114d1283e3a7c4fc67398e236","observation_id":"8b8a37ea-0c15-433d-92bd-c9d85171c9fb","resolution":{"observed_at":"2026-08-10T04:22:23.372416Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2512.01099","last_updated":"2026-04-17T13:11:16Z","snapshot_observed_at":"2026-08-16T21:04:06.722743Z","submitted_at":"2025-11-30T21:46:54Z","title":"Cost-Aware Model Orchestration for LLM-based Systems","version":2},"cited_work":{"arxiv_id":"2512.01099","doi":null,"metadata_source":"pith","pith_arxiv_id":"2512.01099","snapshot_observed_at":"2026-08-10T04:22:23.305784Z","title":"Cost-Aware Model Orchestration for LLM-based Systems","venue":"cs.AI","work_id":"67877a59-3d62-42a1-874b-77fa93277c78","year":2025},"citing_paper":{"arxiv_id":"2608.06607","last_updated":"2026-08-06T21:34:51Z","snapshot_observed_at":"2026-08-16T21:03:34.001313Z","submitted_at":"2026-08-06T21:34:51Z","title":"Pre-Inference Routing for Cost-Efficient Document Field Extraction","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T04:22:23.220784Z"},"links":{"cited_paper":"/paper/2512.01099","citing_paper":"/paper/2608.06607"},"observation_digest":"sha256:281f463f792b09c41b2c23c2934c58c1bfa69459884cc924472f69d657a9f806","observation_id":"0db0c390-ba41-4216-99c0-a66594dda9bf","resolution":{"observed_at":"2026-08-10T04:22:23.310527Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T04:22:23.496097Z","title":"Sindhu and A","venue":null,"work_id":"bb97ffc0-5cb7-45ec-b4ec-2b4b4eb78b31","year":2025},"citing_paper":{"arxiv_id":"2608.06607","last_updated":"2026-08-06T21:34:51Z","snapshot_observed_at":"2026-08-16T21:03:34.001313Z","submitted_at":"2026-08-06T21:34:51Z","title":"Pre-Inference Routing for Cost-Efficient Document Field Extraction","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T04:22:23.224410Z"},"links":{"citing_paper":"/paper/2608.06607"},"observation_digest":"sha256:c8ef6c0eac5f8902a8fc5d449e5a4e24c79a79e8c16bc7ff083ea3423bc4d7f9","observation_id":"255a46dd-cd72-4c12-8740-f89c4c215f3f","resolution":{"observed_at":"2026-08-10T04:22:23.498992Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2603.04445","last_updated":"2026-04-21T10:38:10Z","snapshot_observed_at":"2026-07-06T22:47:50.848191Z","submitted_at":"2026-02-23T21:57:27Z","title":"Dynamic Model Routing and Cascading for Efficient LLM Inference: A Survey","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2603.04445","snapshot_observed_at":"2026-08-10T04:22:23.227160Z","title":"Moslem and J","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.06607","last_updated":"2026-08-06T21:34:51Z","snapshot_observed_at":"2026-08-16T21:03:34.001313Z","submitted_at":"2026-08-06T21:34:51Z","title":"Pre-Inference Routing for Cost-Efficient Document Field Extraction","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T04:22:23.227160Z"},"links":{"cited_paper":"/paper/2603.04445","citing_paper":"/paper/2608.06607"},"observation_digest":"sha256:6fcb8446141e58af731619b879ca44bc97fc8b59bfbbc27fa00a55dbc41cd5dc","observation_id":"8cc29350-4a25-40d1-a5f2-a38e7c20641d","resolution":{"observed_at":"2026-08-10T04:22:23.227160Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.05176","last_updated":"2023-05-09T05:11:02Z","snapshot_observed_at":"2026-08-10T11:59:11.481480Z","submitted_at":"2023-05-09T05:11:02Z","title":"FrugalGPT: How to Use Large Language Models While Reducing Cost and Improving Performance","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.05176","snapshot_observed_at":"2026-08-10T04:22:23.230889Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.06607","last_updated":"2026-08-06T21:34:51Z","snapshot_observed_at":"2026-08-16T21:03:34.001313Z","submitted_at":"2026-08-06T21:34:51Z","title":"Pre-Inference Routing for Cost-Efficient Document Field Extraction","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T04:22:23.230889Z"},"links":{"cited_paper":"/paper/2305.05176","citing_paper":"/paper/2608.06607"},"observation_digest":"sha256:f7eb10280c1ecbb927fad13bba7504b1296e6f302f6c5e0a7ffb3e1338f6e85c","observation_id":"887f89df-7d50-4ffd-a3d6-c902bb086b74","resolution":{"observed_at":"2026-08-10T04:22:23.230889Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.18665","last_updated":"2025-02-23T08:50:33Z","snapshot_observed_at":"2026-08-16T00:08:23.767909Z","submitted_at":"2024-06-26T18:10:22Z","title":"RouteLLM: Learning to Route LLMs with Preference Data","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.18665","snapshot_observed_at":"2026-08-10T04:22:23.233487Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.06607","last_updated":"2026-08-06T21:34:51Z","snapshot_observed_at":"2026-08-16T21:03:34.001313Z","submitted_at":"2026-08-06T21:34:51Z","title":"Pre-Inference Routing for Cost-Efficient Document Field Extraction","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T04:22:23.233487Z"},"links":{"cited_paper":"/paper/2406.18665","citing_paper":"/paper/2608.06607"},"observation_digest":"sha256:8d1be9757847b0c16e3082df8f85f8dabd677eea3ac3b9c570349daab08460e7","observation_id":"c1771c4f-0028-4699-a3ec-2d2aea6a98ba","resolution":{"observed_at":"2026-08-10T04:22:23.233487Z","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-10T04:22:23.489621Z","title":null,"venue":null,"work_id":"245fb094-91a5-426a-8f88-14080b7177ca","year":2024},"citing_paper":{"arxiv_id":"2608.06607","last_updated":"2026-08-06T21:34:51Z","snapshot_observed_at":"2026-08-16T21:03:34.001313Z","submitted_at":"2026-08-06T21:34:51Z","title":"Pre-Inference Routing for Cost-Efficient Document Field Extraction","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T04:22:23.236152Z"},"links":{"citing_paper":"/paper/2608.06607"},"observation_digest":"sha256:cdcddbe717ce799ff10ac030137ed8d53243fd86f6a52f00cfdcb22e2c4ffaa5","observation_id":"0f5f566e-c7b4-474f-bccb-f91b4ef1bb47","resolution":{"observed_at":"2026-08-10T04:22:23.491920Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T04:22:23.484341Z","title":"Madras, T","venue":null,"work_id":"396748e2-c714-4b01-bbb9-2a6e13eb83db","year":2018},"citing_paper":{"arxiv_id":"2608.06607","last_updated":"2026-08-06T21:34:51Z","snapshot_observed_at":"2026-08-16T21:03:34.001313Z","submitted_at":"2026-08-06T21:34:51Z","title":"Pre-Inference Routing for Cost-Efficient Document Field Extraction","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T04:22:23.239105Z"},"links":{"citing_paper":"/paper/2608.06607"},"observation_digest":"sha256:ec2052c0fe5da6bc809afe0b475b6f9891d1dd5c918a5e5a525ac3cc1f9297b7","observation_id":"fc6383f6-90db-4d05-b52c-bc4b160dc8ca","resolution":{"observed_at":"2026-08-10T04:22:23.486266Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T04:22:23.478627Z","title":"Geifman and R","venue":null,"work_id":"ab3c9a5a-a5ac-4618-8055-578f359565d4","year":2017},"citing_paper":{"arxiv_id":"2608.06607","last_updated":"2026-08-06T21:34:51Z","snapshot_observed_at":"2026-08-16T21:03:34.001313Z","submitted_at":"2026-08-06T21:34:51Z","title":"Pre-Inference Routing for Cost-Efficient Document Field Extraction","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T04:22:23.242260Z"},"links":{"citing_paper":"/paper/2608.06607"},"observation_digest":"sha256:ed48c38841f94e1863ae682b16a5934b399b33bf2a587def6f84d1d25695b711","observation_id":"44fe299c-42ae-42a4-b03b-3225979fe651","resolution":{"observed_at":"2026-08-10T04:22:23.480808Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T04:22:23.472258Z","title":"Huang, T","venue":null,"work_id":"6171d2a6-e94d-4bc6-ac98-9f4e5dc69d0a","year":2022},"citing_paper":{"arxiv_id":"2608.06607","last_updated":"2026-08-06T21:34:51Z","snapshot_observed_at":"2026-08-16T21:03:34.001313Z","submitted_at":"2026-08-06T21:34:51Z","title":"Pre-Inference Routing for Cost-Efficient Document Field Extraction","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T04:22:23.244739Z"},"links":{"citing_paper":"/paper/2608.06607"},"observation_digest":"sha256:789d052688e8894dc35f0a68cf80e58fb388884a127ed29cb5c388cdd5849651","observation_id":"9fcbf0a1-f52c-4978-87e8-42aaa797659a","resolution":{"observed_at":"2026-08-10T04:22:23.474596Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T04:22:23.463877Z","title":null,"venue":null,"work_id":"506e780e-51af-4910-98f1-983b813f40e6","year":2022},"citing_paper":{"arxiv_id":"2608.06607","last_updated":"2026-08-06T21:34:51Z","snapshot_observed_at":"2026-08-16T21:03:34.001313Z","submitted_at":"2026-08-06T21:34:51Z","title":"Pre-Inference Routing for Cost-Efficient Document Field Extraction","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-10T04:22:23.247001Z"},"links":{"citing_paper":"/paper/2608.06607"},"observation_digest":"sha256:d3cf86f4f7162aa5ef6656e7c76c2eb09aa5ad916703f9714dd7d67c02c46a99","observation_id":"1402ccc0-853d-4509-8e91-b044b49c4002","resolution":{"observed_at":"2026-08-10T04:22:23.466448Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T04:22:23.456999Z","title":null,"venue":null,"work_id":"d061f63a-11b5-4077-a6da-f1b261f1b527","year":2019},"citing_paper":{"arxiv_id":"2608.06607","last_updated":"2026-08-06T21:34:51Z","snapshot_observed_at":"2026-08-16T21:03:34.001313Z","submitted_at":"2026-08-06T21:34:51Z","title":"Pre-Inference Routing for Cost-Efficient Document Field Extraction","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T04:22:23.249149Z"},"links":{"citing_paper":"/paper/2608.06607"},"observation_digest":"sha256:15c9247fcb479c89229b6b9246508a84ffa6f57fa30d0f43e8939288745c44a2","observation_id":"4ef2f669-4b49-42ed-ac8c-fe822bc9ebd7","resolution":{"observed_at":"2026-08-10T04:22:23.459480Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T04:22:23.450107Z","title":"Huang, K","venue":null,"work_id":"1d30406e-2a92-4699-8fb0-9685020659b0","year":2019},"citing_paper":{"arxiv_id":"2608.06607","last_updated":"2026-08-06T21:34:51Z","snapshot_observed_at":"2026-08-16T21:03:34.001313Z","submitted_at":"2026-08-06T21:34:51Z","title":"Pre-Inference Routing for Cost-Efficient Document Field Extraction","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-10T04:22:23.251023Z"},"links":{"citing_paper":"/paper/2608.06607"},"observation_digest":"sha256:a8d17dc5940aef749497dd4f952672326a24d9facae93cb1756f04a0bc7bc377","observation_id":"3e5c27ad-7fce-41f5-81a9-4660da694ebd","resolution":{"observed_at":"2026-08-10T04:22:23.452645Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T04:22:23.441722Z","title":"Jaume, H","venue":null,"work_id":"79d68650-cb5b-4d2f-865b-6953991ed6f1","year":2019},"citing_paper":{"arxiv_id":"2608.06607","last_updated":"2026-08-06T21:34:51Z","snapshot_observed_at":"2026-08-16T21:03:34.001313Z","submitted_at":"2026-08-06T21:34:51Z","title":"Pre-Inference Routing for Cost-Efficient Document Field Extraction","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-10T04:22:23.252807Z"},"links":{"citing_paper":"/paper/2608.06607"},"observation_digest":"sha256:f7c0b072585b3d376859b1d349d6a35542320c0209d648181bc8da48425b6069","observation_id":"6ab4ff7e-400d-4d03-acf1-866e1778c3c7","resolution":{"observed_at":"2026-08-10T04:22:23.444927Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T04:22:23.433816Z","title":null,"venue":null,"work_id":"7b0557ae-b315-422a-934a-61f2c162b1e6","year":2023},"citing_paper":{"arxiv_id":"2608.06607","last_updated":"2026-08-06T21:34:51Z","snapshot_observed_at":"2026-08-16T21:03:34.001313Z","submitted_at":"2026-08-06T21:34:51Z","title":"Pre-Inference Routing for Cost-Efficient Document Field Extraction","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-10T04:22:23.254649Z"},"links":{"citing_paper":"/paper/2608.06607"},"observation_digest":"sha256:975e9aceec2be616f44111af30d7d26810cb0e2e5e8c565a34334fd946475120","observation_id":"d2f71629-4126-42ca-ba2f-613963e2f5da","resolution":{"observed_at":"2026-08-10T04:22:23.436245Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T04:22:23.427320Z","title":"Svetlichnaya","venue":null,"work_id":"7ad4ee0d-94ce-460d-8880-70782ab3426b","year":2020},"citing_paper":{"arxiv_id":"2608.06607","last_updated":"2026-08-06T21:34:51Z","snapshot_observed_at":"2026-08-16T21:03:34.001313Z","submitted_at":"2026-08-06T21:34:51Z","title":"Pre-Inference Routing for Cost-Efficient Document Field Extraction","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-10T04:22:23.256757Z"},"links":{"citing_paper":"/paper/2608.06607"},"observation_digest":"sha256:f8623d6b8fa16787652beaf7083785e2e84473e9c0d0a5497aa6e79c84752e4d","observation_id":"8545dcf7-2e02-4a95-968c-1b24f1d7b1b9","resolution":{"observed_at":"2026-08-10T04:22:23.429626Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T04:22:23.415217Z","title":"Borchmann, M","venue":null,"work_id":"8d2f4eff-fa7a-49ad-abb2-c06679a4d22e","year":2021},"citing_paper":{"arxiv_id":"2608.06607","last_updated":"2026-08-06T21:34:51Z","snapshot_observed_at":"2026-08-16T21:03:34.001313Z","submitted_at":"2026-08-06T21:34:51Z","title":"Pre-Inference Routing for Cost-Efficient Document Field Extraction","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-10T04:22:23.258680Z"},"links":{"citing_paper":"/paper/2608.06607"},"observation_digest":"sha256:58d6fd0982b6dbacf4c0251d933c0e2c3577eb2fdd06fe917b8a631f52288a2a","observation_id":"57c9dcd0-fa10-4eb0-b7a9-9d7008a86828","resolution":{"observed_at":"2026-08-10T04:22:23.420625Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T04:22:23.407615Z","title":"ˇSimsa, M","venue":null,"work_id":"aaf48f13-57e0-4557-b820-7e2f830f3a8e","year":2023},"citing_paper":{"arxiv_id":"2608.06607","last_updated":"2026-08-06T21:34:51Z","snapshot_observed_at":"2026-08-16T21:03:34.001313Z","submitted_at":"2026-08-06T21:34:51Z","title":"Pre-Inference Routing for Cost-Efficient Document Field Extraction","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-10T04:22:23.260635Z"},"links":{"citing_paper":"/paper/2608.06607"},"observation_digest":"sha256:62e9a8c35e56eac09a3f27cfac8f42a5ba19f85fe23a6910e431cd886b6f9cf6","observation_id":"1c42ec5e-8599-4684-9b2f-06af2d7de887","resolution":{"observed_at":"2026-08-10T04:22:23.410140Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T04:22:23.400136Z","title":"Kuang, W","venue":null,"work_id":"6a508811-a46f-4d88-b028-6a56c865063f","year":2023},"citing_paper":{"arxiv_id":"2608.06607","last_updated":"2026-08-06T21:34:51Z","snapshot_observed_at":"2026-08-16T21:03:34.001313Z","submitted_at":"2026-08-06T21:34:51Z","title":"Pre-Inference Routing for Cost-Efficient Document Field Extraction","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-10T04:22:23.263273Z"},"links":{"citing_paper":"/paper/2608.06607"},"observation_digest":"sha256:a024762b18c0e91fcc7ebf21f4613770b0480f32e2e276ffec9ac49facdbba8f","observation_id":"6509e37b-4b0d-4e47-96ca-6e55e1593e9d","resolution":{"observed_at":"2026-08-10T04:22:23.403133Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2608.06607","last_updated":"2026-08-06T21:34:51Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-16T21:03:34.001313Z","submitted_at":"2026-08-06T21:34:51Z","title":"Pre-Inference Routing for Cost-Efficient Document Field Extraction"},"reference_resolution":{"displayed":24,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":12,"verified_exact":1,"verified_fuzzy":10},"total_outbound_references":24},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 24 of 24 outbound references and 0 inbound Pith citation observations for arXiv:2608.06607."}