{"as_of":"2026-08-13T08:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:493e3be7aa1870333d3b485eb3a5cb623a8acf0c38ec6c6fd356270c0ad1415b","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":7,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":7,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":7,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T16:42:44.397001Z","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-05-23T18:53:21.485180Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2405.19261","last_updated":"2024-10-21T18:12:44Z","snapshot_observed_at":"2026-08-13T00:36:04.578140Z","submitted_at":"2024-05-29T16:55:08Z","title":"Faster Cascades via Speculative Decoding","version":2},"cited_work":{"arxiv_id":"2405.19261","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2405.19261","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Faster cascades via speculative decoding","venue":null,"work_id":"fcdda78e-f96c-4a86-a6f5-9c660d1f2ab4","year":2024},"citing_paper":{"arxiv_id":"2410.15761","last_updated":"2026-06-03T09:17:37Z","snapshot_observed_at":"2026-08-12T22:18:50.523282Z","submitted_at":"2024-10-21T08:21:00Z","title":"Optimal Query Allocation in Extractive QA with LLMs: A Learning-to-Defer Framework with Theoretical Guarantees","version":4},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-05-23T18:49:39.718108Z"},"links":{"cited_paper":"/paper/2405.19261","citing_paper":"/paper/2410.15761"},"observation_digest":"sha256:cdea4c9a81f1731c87ca34d69bc13ad0631b0b43ee6efb7df05b0911c1302326","observation_id":"027f2cf3-c44b-4980-a1c6-5cf6df0519b7","resolution":{"observed_at":"2026-05-23T18:53:21.487790Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.19261","last_updated":"2024-10-21T18:12:44Z","snapshot_observed_at":"2026-08-13T00:36:04.578140Z","submitted_at":"2024-05-29T16:55:08Z","title":"Faster Cascades via Speculative Decoding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.19261","snapshot_observed_at":"2026-08-09T13:58:45.704596Z","title":"Faster cascades via speculative decoding, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.01976","last_updated":"2025-09-10T02:45:51Z","snapshot_observed_at":"2026-08-11T02:33:49.875237Z","submitted_at":"2025-02-04T03:36:44Z","title":"CITER: Collaborative Inference for Efficient Large Language Model Decoding with Token-Level Routing","version":6},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-09T13:58:45.704596Z"},"links":{"cited_paper":"/paper/2405.19261","citing_paper":"/paper/2502.01976"},"observation_digest":"sha256:93193ff9862af5bc4e34ab09ad9f2eac9ca9a30ecad17ebd3daa6e3cbec09c50","observation_id":"eff3495b-4e86-4a6f-b395-2f9207bb1cdb","resolution":{"observed_at":"2026-08-09T13:58:45.704596Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.19261","last_updated":"2024-10-21T18:12:44Z","snapshot_observed_at":"2026-08-13T00:36:04.578140Z","submitted_at":"2024-05-29T16:55:08Z","title":"Faster Cascades via Speculative Decoding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.19261","snapshot_observed_at":"2026-08-07T11:30:56.527364Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.02391","last_updated":"2025-06-03T03:13:27Z","snapshot_observed_at":"2026-08-09T18:58:56.218883Z","submitted_at":"2025-06-03T03:13:27Z","title":"Consultant Decoding: Yet Another Synergistic Mechanism","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T11:30:56.527364Z"},"links":{"cited_paper":"/paper/2405.19261","citing_paper":"/paper/2506.02391"},"observation_digest":"sha256:cee9ff71d664a71a048e41fbce573e29d44c5297584d5378ccb8e1d494f5aa17","observation_id":"370af658-2db4-4a73-b1ba-2e7e978021d0","resolution":{"observed_at":"2026-08-07T11:30:56.527364Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.19261","last_updated":"2024-10-21T18:12:44Z","snapshot_observed_at":"2026-08-13T00:36:04.578140Z","submitted_at":"2024-05-29T16:55:08Z","title":"Faster Cascades via Speculative Decoding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.19261","snapshot_observed_at":"2026-08-06T22:05:28.170295Z","title":"Narasimhan, W","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.22716","last_updated":"2025-06-28T01:52:50Z","snapshot_observed_at":"2026-08-10T21:18:17.869089Z","submitted_at":"2025-06-28T01:52:50Z","title":"BEST-Route: Adaptive LLM Routing with Test-Time Optimal Compute","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-06T22:05:28.170295Z"},"links":{"cited_paper":"/paper/2405.19261","citing_paper":"/paper/2506.22716"},"observation_digest":"sha256:82546007d9ef82df74e2cbd9d21202240890afae4c3d314c707b737883e79115","observation_id":"311cca90-e11b-4e37-aace-39fe173cf310","resolution":{"observed_at":"2026-08-06T22:05:28.170295Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.19261","last_updated":"2024-10-21T18:12:44Z","snapshot_observed_at":"2026-08-13T00:36:04.578140Z","submitted_at":"2024-05-29T16:55:08Z","title":"Faster Cascades via Speculative Decoding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.19261","snapshot_observed_at":"2026-08-02T02:42:04.653479Z","title":"Narasimhan, W","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.14277","last_updated":"2026-07-15T18:36:54Z","snapshot_observed_at":"2026-08-10T13:47:06.891390Z","submitted_at":"2026-07-15T18:36:54Z","title":"Multi-Head Latent Control: A Unified Interface for LLM Agent Decision Making","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-02T02:42:04.653479Z"},"links":{"cited_paper":"/paper/2405.19261","citing_paper":"/paper/2607.14277"},"observation_digest":"sha256:9b372e90121bef029cca6fe76424d00d833307276bb83ed2c0f3391e6172e028","observation_id":"32a5e820-26e1-4284-8074-8080ea213918","resolution":{"observed_at":"2026-08-02T02:42:04.653479Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.19261","last_updated":"2024-10-21T18:12:44Z","snapshot_observed_at":"2026-08-13T00:36:04.578140Z","submitted_at":"2024-05-29T16:55:08Z","title":"Faster Cascades via Speculative Decoding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.19261","snapshot_observed_at":"2026-08-01T12:06:59.316479Z","title":"arXiv preprint arXiv:2405.19261 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.26627","last_updated":"2026-07-29T08:54:27Z","snapshot_observed_at":"2026-08-13T05:31:44.441783Z","submitted_at":"2026-07-29T08:54:27Z","title":"Revisiting Lossy Verification in Speculative Decoding: Mechanisms, Trade-offs, and Failure Modes","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-01T12:06:59.316479Z"},"links":{"cited_paper":"/paper/2405.19261","citing_paper":"/paper/2607.26627"},"observation_digest":"sha256:ff0a443c00715a47285491cd5adff19f6ed317d3afe520e6f19fda45300f8b0c","observation_id":"25e23dda-c0ef-4dbb-97e8-e613a66aac51","resolution":{"observed_at":"2026-08-01T12:06:59.316479Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.19261","last_updated":"2024-10-21T18:12:44Z","snapshot_observed_at":"2026-08-13T00:36:04.578140Z","submitted_at":"2024-05-29T16:55:08Z","title":"Faster Cascades via Speculative Decoding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.19261","snapshot_observed_at":"2026-08-10T16:42:44.397001Z","title":"11 Yan Shu, Zheng Liu, Peitian Zhang, Minghao Qin, Junjie Zhou, Zhengyang Liang, Tiejun Huang, and Bo Zhao","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07014","last_updated":"2026-08-07T09:25:20Z","snapshot_observed_at":"2026-08-12T23:11:41.886313Z","submitted_at":"2026-08-07T09:25:20Z","title":"Stable Curves, Unstable Items: Item-Level Scaling Heterogeneity in Video LLMs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T16:42:44.397001Z"},"links":{"cited_paper":"/paper/2405.19261","citing_paper":"/paper/2608.07014"},"observation_digest":"sha256:90c5f104949668d024d4101865b21a10c11cb65097849542606b8c871a10849d","observation_id":"571605d5-ce0e-4d7a-a7e9-0ec1070f16ea","resolution":{"observed_at":"2026-08-10T16:42:44.397001Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2405.19261/citation-record","integrity":"/paper/2405.19261/integrity","json":"/paper/2405.19261/citation-record.json","paper":"/paper/2405.19261"},"outbound":[],"paper":{"arxiv_id":"2405.19261","last_updated":"2024-10-21T18:12:44Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-13T00:36:04.578140Z","submitted_at":"2024-05-29T16:55:08Z","title":"Faster Cascades via Speculative Decoding"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 7 inbound Pith citation observations for arXiv:2405.19261."}