{"as_of":"2026-08-09T04:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f3598333c1fb5191f0b08308d344d1c441f7b71fb52c5c12924325dfffaf4adb","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-08T06:32:00.761636+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-07T23:17:51.168641Z","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-03T10:37:56.283023Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2310.12072","last_updated":"2024-01-03T00:32:43Z","snapshot_observed_at":"2026-07-06T16:35:07.121479Z","submitted_at":"2023-10-18T16:07:01Z","title":"SPEED: Speculative Pipelined Execution for Efficient Decoding","version":2},"cited_work":{"arxiv_id":"2310.12072","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.12072","snapshot_observed_at":"2026-07-03T10:37:56.283023Z","title":"Speed: Speculative pipelined execution for efficient decoding","venue":null,"work_id":"82ad9c47-5f9d-44b6-bb07-e99a4a6ec4a8","year":2024},"citing_paper":{"arxiv_id":"2401.15077","last_updated":"2025-03-04T13:58:39Z","snapshot_observed_at":"2026-08-03T09:40:31.365295Z","submitted_at":"2024-01-26T18:59:01Z","title":"EAGLE: Speculative Sampling Requires Rethinking Feature Uncertainty","version":3},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-05-15T00:15:49.303458Z"},"links":{"cited_paper":"/paper/2310.12072","citing_paper":"/paper/2401.15077"},"observation_digest":"sha256:e04853168c8d2e3bd9b61172fef37a6f795595095a11b2f510a56ffa555d2860","observation_id":"ede8ff5b-8055-4742-ac0d-588160740201","resolution":{"observed_at":"2026-05-15T00:15:49.425180Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.12072","last_updated":"2024-01-03T00:32:43Z","snapshot_observed_at":"2026-07-06T16:35:07.121479Z","submitted_at":"2023-10-18T16:07:01Z","title":"SPEED: Speculative Pipelined Execution for Efficient Decoding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.12072","snapshot_observed_at":"2026-08-07T23:17:51.168641Z","title":"In Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (V olume 1: Long Papers), pages 1631– 1640","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.08923","last_updated":"2025-05-23T00:51:17Z","snapshot_observed_at":"2026-08-08T23:36:15.480419Z","submitted_at":"2025-02-13T03:19:50Z","title":"CopySpec: Accelerating LLMs with Speculative Copy-and-Paste Without Compromising Quality","version":2},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-07T23:17:51.168641Z"},"links":{"cited_paper":"/paper/2310.12072","citing_paper":"/paper/2502.08923"},"observation_digest":"sha256:d6e433c5e57a1bca37ac7e1734d0997a2469b88e19083bbb239762e9f23ab373","observation_id":"e003766f-2845-476d-bbca-3cab7024d150","resolution":{"observed_at":"2026-08-07T23:17:51.168641Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.12072","last_updated":"2024-01-03T00:32:43Z","snapshot_observed_at":"2026-07-06T16:35:07.121479Z","submitted_at":"2023-10-18T16:07:01Z","title":"SPEED: Speculative Pipelined Execution for Efficient Decoding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.12072","snapshot_observed_at":"2026-08-07T14:55:45.915619Z","title":"Speed: Speculative pipelined execution for efficient decoding","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.20316","last_updated":"2025-05-23T02:25:26Z","snapshot_observed_at":"2026-08-08T08:33:09.022524Z","submitted_at":"2025-05-23T02:25:26Z","title":"Reinforcement Speculative Decoding for Fast Ranking","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:45.915619Z"},"links":{"cited_paper":"/paper/2310.12072","citing_paper":"/paper/2505.20316"},"observation_digest":"sha256:176cb1a73e8f24e8e74c13e7975bec1f6a036bb33836742150d5b52d0a3df295","observation_id":"df0725ad-3f72-4ec8-9388-84057782f793","resolution":{"observed_at":"2026-08-07T14:55:45.915619Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.12072","last_updated":"2024-01-03T00:32:43Z","snapshot_observed_at":"2026-07-06T16:35:07.121479Z","submitted_at":"2023-10-18T16:07:01Z","title":"SPEED: Speculative Pipelined Execution for Efficient Decoding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.12072","snapshot_observed_at":"2026-08-07T11:02:39.243484Z","title":"Speed: Speculative pipelined execution for efficient decoding","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.03700","last_updated":"2025-06-04T08:32:30Z","snapshot_observed_at":"2026-08-08T01:16:24.422333Z","submitted_at":"2025-06-04T08:32:30Z","title":"AdaDecode: Accelerating LLM Decoding with Adaptive Layer Parallelism","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T11:02:39.243484Z"},"links":{"cited_paper":"/paper/2310.12072","citing_paper":"/paper/2506.03700"},"observation_digest":"sha256:e3fb88ec43c5c8414992d85a8ecd6e82c092f5c71a76c2999859b3415d3b4dbb","observation_id":"5b54c427-bdf2-4722-a5b0-6f787aff1049","resolution":{"observed_at":"2026-08-07T11:02:39.243484Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.12072","last_updated":"2024-01-03T00:32:43Z","snapshot_observed_at":"2026-07-06T16:35:07.121479Z","submitted_at":"2023-10-18T16:07:01Z","title":"SPEED: Speculative Pipelined Execution for Efficient Decoding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.12072","snapshot_observed_at":"2026-08-07T00:22:44.720990Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.14158","last_updated":"2025-06-17T03:38:19Z","snapshot_observed_at":"2026-08-09T00:36:23.093929Z","submitted_at":"2025-06-17T03:38:19Z","title":"S$^4$C: Speculative Sampling with Syntactic and Semantic Coherence for Efficient Inference of Large Language Models","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T00:22:44.720990Z"},"links":{"cited_paper":"/paper/2310.12072","citing_paper":"/paper/2506.14158"},"observation_digest":"sha256:9da6240d76df552c706d3160fbd9c9484fa4e57bb8ead7e0cff9a3ec9536689b","observation_id":"b8da5858-9e66-4f1f-b009-45da1b65a076","resolution":{"observed_at":"2026-08-07T00:22:44.720990Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.12072","last_updated":"2024-01-03T00:32:43Z","snapshot_observed_at":"2026-07-06T16:35:07.121479Z","submitted_at":"2023-10-18T16:07:01Z","title":"SPEED: Speculative Pipelined Execution for Efficient Decoding","version":2},"cited_work":{"arxiv_id":"2310.12072","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.12072","snapshot_observed_at":"2026-07-03T10:37:56.283023Z","title":"Speed: Speculative pipelined execution for efficient decoding","venue":null,"work_id":"82ad9c47-5f9d-44b6-bb07-e99a4a6ec4a8","year":2024},"citing_paper":{"arxiv_id":"2507.01449","last_updated":"2026-04-29T08:32:18Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-07-02T08:08:30Z","title":"LogitSpec: Accelerating Retrieval-based Speculative Decoding via Next Next Token Speculation","version":3},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-05-19T06:53:02.744567Z"},"links":{"cited_paper":"/paper/2310.12072","citing_paper":"/paper/2507.01449"},"observation_digest":"sha256:c0a14e2d821162446b339b4e0fefd1dcf9b68e80ff5d7808f45520572ce0c60c","observation_id":"9c1bed11-a931-4505-9992-8c898b93414c","resolution":{"observed_at":"2026-05-19T06:57:08.135410Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.12072","last_updated":"2024-01-03T00:32:43Z","snapshot_observed_at":"2026-07-06T16:35:07.121479Z","submitted_at":"2023-10-18T16:07:01Z","title":"SPEED: Speculative Pipelined Execution for Efficient Decoding","version":2},"cited_work":{"arxiv_id":"2310.12072","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.12072","snapshot_observed_at":"2026-07-03T10:37:56.283023Z","title":"Speed: Speculative pipelined execution for efficient decoding","venue":null,"work_id":"82ad9c47-5f9d-44b6-bb07-e99a4a6ec4a8","year":2024},"citing_paper":{"arxiv_id":"2606.12303","last_updated":"2026-06-10T16:40:18Z","snapshot_observed_at":"2026-08-06T21:12:26.166982Z","submitted_at":"2026-06-10T16:40:18Z","title":"From 2D Grids to 1D Tokens: Reforming Shared Representations for Multimodal Image Fusion","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-06-27T09:58:02.298704Z"},"links":{"cited_paper":"/paper/2310.12072","citing_paper":"/paper/2606.12303"},"observation_digest":"sha256:12884fc4c982bbe95b9231209259c0e4ebde88a055bd6ba45dedc2c0165a47a1","observation_id":"80210906-266a-4008-b87f-572285e2a2ba","resolution":{"observed_at":"2026-07-03T10:37:56.284440Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2310.12072/citation-record","integrity":"/paper/2310.12072/integrity","json":"/paper/2310.12072/citation-record.json","paper":"/paper/2310.12072"},"outbound":[],"paper":{"arxiv_id":"2310.12072","last_updated":"2024-01-03T00:32:43Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-07-06T16:35:07.121479Z","submitted_at":"2023-10-18T16:07:01Z","title":"SPEED: Speculative Pipelined Execution for Efficient 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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 7 inbound Pith citation observations for arXiv:2310.12072."}