{"as_of":"2026-08-09T19:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:deb3882fdb62b8268fb9f0d3db2ea882e319b8da5cddebbb7b10abb40828c849","coverage":[{"denominator":23,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":23,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T22:28:20.527111Z","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-09T06:31:02.800959+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-30T07:39:38.006860Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":0,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.04557","last_updated":"2025-07-08T05:05:28Z","snapshot_observed_at":"2026-08-09T07:26:43.909516Z","submitted_at":"2025-02-06T23:10:53Z","title":"Speeding up Speculative Decoding via Sequential Approximate Verification","version":3},"cited_work":{"arxiv_id":"2502.04557","doi":"10.48550/arxiv.2502.04557","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.04557","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Speeding up","venue":"ArXiv.org","work_id":"d3c25f8e-13e9-4785-b7f1-f0e1f707882a","year":null},"citing_paper":{"arxiv_id":"2606.30265","last_updated":"2026-06-29T13:14:51Z","snapshot_observed_at":"2026-08-06T05:09:41.392875Z","submitted_at":"2026-06-29T13:14:51Z","title":"When Is a Draft Accepted? A Theory of Acceptance in Speculative Decoding","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-06-30T07:39:38.006860Z"},"links":{"cited_paper":"/paper/2502.04557","citing_paper":"/paper/2606.30265"},"observation_digest":"sha256:ece8c715b78fc7feaf0735b4c87a5074752059c8ebfa2e51dcac6a91fc6ee6e7","observation_id":"9929d3d7-a9be-40b7-aee9-e79192104d4e","resolution":{"observed_at":"2026-06-30T07:44:20.987937Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2502.04557/citation-record","integrity":"/paper/2502.04557/integrity","json":"/paper/2502.04557/citation-record.json","paper":"/paper/2502.04557"},"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-08T22:28:21.095904Z","title":"=b ∞X k=r kηk−r FP +b ∞X k=r ηk−r FP = b ηr FP ∞X k=r kηk FP + b ηr FP ∞X k=r ηk FP (28) where (a) follows from settingb=η r TP(1−η FP)td","venue":null,"work_id":"567fbadc-1363-422d-8c57-5cd870afd43f","year":2023},"citing_paper":{"arxiv_id":"2502.04557","last_updated":"2025-07-08T05:05:28Z","snapshot_observed_at":"2026-08-09T07:26:43.909516Z","submitted_at":"2025-02-06T23:10:53Z","title":"Speeding up Speculative Decoding via Sequential Approximate Verification","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-08T22:28:20.514055Z"},"links":{"citing_paper":"/paper/2502.04557"},"observation_digest":"sha256:7ef4111c67cf8cbccf3d4c63d5f573571ddc127d484d78c0520a14e1754c2a32","observation_id":"b98a72da-da56-4c85-8318-e8b0c765dc1f","resolution":{"observed_at":"2026-08-08T22:28:21.099348Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.20495","last_updated":"2024-05-30T21:36:12Z","snapshot_observed_at":"2026-08-09T07:26:50.208136Z","submitted_at":"2024-05-30T21:36:12Z","title":"Transfer Q Star: Principled Decoding for LLM Alignment","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.20495","snapshot_observed_at":"2026-08-08T22:28:20.445252Z","title":"Chelba, C., Mikolov, T., Schuster, M., Ge, Q., Brants, T., Koehn, P., and Robinson, T","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.04557","last_updated":"2025-07-08T05:05:28Z","snapshot_observed_at":"2026-08-09T07:26:43.909516Z","submitted_at":"2025-02-06T23:10:53Z","title":"Speeding up Speculative Decoding via Sequential Approximate Verification","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-08T22:28:20.445252Z"},"links":{"cited_paper":"/paper/2405.20495","citing_paper":"/paper/2502.04557"},"observation_digest":"sha256:b6147a71bf47cbd870746ff30658992b997a8fa3f79f4a3ed47de554c63a4d7b","observation_id":"8ec33669-af07-49dc-be73-6ee1e80af2f1","resolution":{"observed_at":"2026-08-08T22:28:20.445252Z","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-08T22:28:21.177237Z","title":"Eleutherai/gpt-neo-1.3b, 2024a","venue":null,"work_id":"35d7c0a4-8d16-48b2-b82e-732daffa2587","year":2024},"citing_paper":{"arxiv_id":"2502.04557","last_updated":"2025-07-08T05:05:28Z","snapshot_observed_at":"2026-08-09T07:26:43.909516Z","submitted_at":"2025-02-06T23:10:53Z","title":"Speeding up Speculative Decoding via Sequential Approximate Verification","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-08T22:28:20.452453Z"},"links":{"citing_paper":"/paper/2502.04557"},"observation_digest":"sha256:7f63c91c97f33aeb96a9bcf338f2c1d4783797e6ec5ee3c91a89c4be9591cb1d","observation_id":"4da42b38-2ba4-42b6-8e80-4719c9995918","resolution":{"observed_at":"2026-08-08T22:28:21.180427Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T22:28:21.167093Z","title":"Hoffmann, J., Borgeaud, S., Mensch, A., Buchatskaya, E., Cai, T., Rutherford, E., de Las Casas, D., Hendricks, L","venue":null,"work_id":"36510db6-e515-4414-8ca5-b6ed57f2f373","year":2024},"citing_paper":{"arxiv_id":"2502.04557","last_updated":"2025-07-08T05:05:28Z","snapshot_observed_at":"2026-08-09T07:26:43.909516Z","submitted_at":"2025-02-06T23:10:53Z","title":"Speeding up Speculative Decoding via Sequential Approximate Verification","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-08T22:28:20.455578Z"},"links":{"citing_paper":"/paper/2502.04557"},"observation_digest":"sha256:31dab44c5ac969055cc3ffc1a62aae7c32832a79e60d530a7c152c0177ce9228","observation_id":"2d3fa551-eef2-46f0-9b89-7ece5cdcb9a5","resolution":{"observed_at":"2026-08-08T22:28:21.170410Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T22:28:21.153684Z","title":"Accessed: 04-2025","venue":null,"work_id":"76d10a9a-92f3-4784-8cf2-1f1509bbc87b","year":2025},"citing_paper":{"arxiv_id":"2502.04557","last_updated":"2025-07-08T05:05:28Z","snapshot_observed_at":"2026-08-09T07:26:43.909516Z","submitted_at":"2025-02-06T23:10:53Z","title":"Speeding up Speculative Decoding via Sequential Approximate Verification","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-08T22:28:20.462444Z"},"links":{"citing_paper":"/paper/2502.04557"},"observation_digest":"sha256:867986129a29cc756fdf2c131dd7b334823fe0152073e5e5f7e12549a5cbdd80","observation_id":"79515eab-6b24-4e4b-8b59-d5e586d89d43","resolution":{"observed_at":"2026-08-08T22:28:21.161455Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.10644","last_updated":"2024-12-14T20:15:00Z","snapshot_observed_at":"2026-08-09T07:27:10.479587Z","submitted_at":"2024-09-16T18:20:38Z","title":"Improving Multi-candidate Speculative Decoding","version":3},"cited_work":{"arxiv_id":"2409.10644","doi":null,"metadata_source":"pith","pith_arxiv_id":"2409.10644","snapshot_observed_at":"2026-08-08T22:28:21.003936Z","title":"Improving Multi-candidate Speculative Decoding","venue":"cs.CL","work_id":"8663e33f-7ef5-4aa9-abbd-e8804a168976","year":2024},"citing_paper":{"arxiv_id":"2502.04557","last_updated":"2025-07-08T05:05:28Z","snapshot_observed_at":"2026-08-09T07:26:43.909516Z","submitted_at":"2025-02-06T23:10:53Z","title":"Speeding up Speculative Decoding via Sequential Approximate Verification","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-08T22:28:20.469620Z"},"links":{"cited_paper":"/paper/2409.10644","citing_paper":"/paper/2502.04557"},"observation_digest":"sha256:b6ae7105106bf4458b7d89c5436b53b75fb7596d540d84b2ee9f7a814a600903","observation_id":"3cf74ed2-fce1-4023-848e-21d7d748fed8","resolution":{"observed_at":"2026-08-08T22:28:21.008355Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.04304","last_updated":"2024-11-07T12:59:39Z","snapshot_observed_at":"2026-08-09T07:26:06.310167Z","submitted_at":"2024-05-07T13:27:52Z","title":"Dynamic Speculation Lookahead Accelerates Speculative Decoding of Large Language Models","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.04304","snapshot_observed_at":"2026-08-08T22:28:20.472902Z","title":"Melcer, D., Gonugondla, S., Perera, P., Qian, H., Chiang, W.-H., Wang, Y ., Jain, N., Garg, P., Ma, X., and Deoras, A","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.04557","last_updated":"2025-07-08T05:05:28Z","snapshot_observed_at":"2026-08-09T07:26:43.909516Z","submitted_at":"2025-02-06T23:10:53Z","title":"Speeding up Speculative Decoding via Sequential Approximate Verification","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-08T22:28:20.472902Z"},"links":{"cited_paper":"/paper/2405.04304","citing_paper":"/paper/2502.04557"},"observation_digest":"sha256:4315ad1b7232941f4158525f1554a61520cd0b60837617c6150132065b2a3ef2","observation_id":"dba9fc9e-97db-4fe5-b832-31f46e66b974","resolution":{"observed_at":"2026-08-08T22:28:20.472902Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T22:28:20.479843Z","title":"From text to multimodality: Exploring the evolution and impact of large language models in medical practice","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.04557","last_updated":"2025-07-08T05:05:28Z","snapshot_observed_at":"2026-08-09T07:26:43.909516Z","submitted_at":"2025-02-06T23:10:53Z","title":"Speeding up Speculative Decoding via Sequential Approximate Verification","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-08T22:28:20.479843Z"},"links":{"citing_paper":"/paper/2502.04557"},"observation_digest":"sha256:78178d3e8186b154834dab92c7f5ea53e18aebf11e56d304fc0491d5365c68cc","observation_id":"550995dd-6e47-4185-a881-356ef688a7e8","resolution":{"observed_at":"2026-08-08T22:28:20.479843Z","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-08T22:28:21.144923Z","title":"openai-community/gpt2, 2024a","venue":null,"work_id":"8c6590d8-cc21-48b0-9901-5d0dbe17abe8","year":2024},"citing_paper":{"arxiv_id":"2502.04557","last_updated":"2025-07-08T05:05:28Z","snapshot_observed_at":"2026-08-09T07:26:43.909516Z","submitted_at":"2025-02-06T23:10:53Z","title":"Speeding up Speculative Decoding via Sequential Approximate Verification","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-08T22:28:20.482867Z"},"links":{"citing_paper":"/paper/2502.04557"},"observation_digest":"sha256:20bc486e1f1f83f3f7bea1b0ec6d6ffd12be6d25143c0bed04f2d349ed50c64a","observation_id":"c7796989-b02b-4617-af3e-d1972c9127ba","resolution":{"observed_at":"2026-08-08T22:28:21.148089Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T22:28:21.125073Z","title":"Improving word embedding compositionality using lexicographic definitions","venue":null,"work_id":"6541ec9a-94a1-428a-8c78-9a6b9eb8c89d","year":2018},"citing_paper":{"arxiv_id":"2502.04557","last_updated":"2025-07-08T05:05:28Z","snapshot_observed_at":"2026-08-09T07:26:43.909516Z","submitted_at":"2025-02-06T23:10:53Z","title":"Speeding up Speculative Decoding via Sequential Approximate Verification","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-08T22:28:20.485952Z"},"links":{"citing_paper":"/paper/2502.04557"},"observation_digest":"sha256:fe6267f43ef5354df42e92b3f3e691ad76c352fca17af2d0d57757665a53b031","observation_id":"59d13b0a-016e-4463-b905-b270dd272708","resolution":{"observed_at":"2026-08-08T22:28:21.139119Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T22:28:20.498440Z","title":"Tran-Thien, V","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.04557","last_updated":"2025-07-08T05:05:28Z","snapshot_observed_at":"2026-08-09T07:26:43.909516Z","submitted_at":"2025-02-06T23:10:53Z","title":"Speeding up Speculative Decoding via Sequential Approximate Verification","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-08T22:28:20.498440Z"},"links":{"citing_paper":"/paper/2502.04557"},"observation_digest":"sha256:1bd95b668b4a1db308c2065a142f2c6a38a6a2870141f12a66545a2967e3486c","observation_id":"2d6b4281-3c34-43e6-814d-15079e3db088","resolution":{"observed_at":"2026-08-08T22:28:20.498440Z","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-08T22:28:21.106968Z","title":"Accessed: 2025-05-09","venue":null,"work_id":"d40b3b99-6489-47f7-a98e-c9c015d229ea","year":2025},"citing_paper":{"arxiv_id":"2502.04557","last_updated":"2025-07-08T05:05:28Z","snapshot_observed_at":"2026-08-09T07:26:43.909516Z","submitted_at":"2025-02-06T23:10:53Z","title":"Speeding up Speculative Decoding via Sequential Approximate Verification","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-08T22:28:20.501508Z"},"links":{"citing_paper":"/paper/2502.04557"},"observation_digest":"sha256:6d5e8f9065b325e6957bd99cb515136b5af6719afd164ecedc7d82afbaf42976","observation_id":"aea33651-2302-473b-9ace-c45bf255b190","resolution":{"observed_at":"2026-08-08T22:28:21.112737Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.00841","last_updated":"2024-10-30T01:53:04Z","snapshot_observed_at":"2026-07-06T19:43:46.557944Z","submitted_at":"2024-10-30T01:53:04Z","title":"A Theoretical Perspective for Speculative Decoding Algorithm","version":1},"cited_work":{"arxiv_id":"2411.00841","doi":null,"metadata_source":"pith","pith_arxiv_id":"2411.00841","snapshot_observed_at":"2026-08-08T22:28:20.587916Z","title":"A Theoretical Perspective for Speculative Decoding Algorithm","venue":"cs.LG","work_id":"eb7ca4d8-39cf-4ead-9226-f373f76584b3","year":2024},"citing_paper":{"arxiv_id":"2502.04557","last_updated":"2025-07-08T05:05:28Z","snapshot_observed_at":"2026-08-09T07:26:43.909516Z","submitted_at":"2025-02-06T23:10:53Z","title":"Speeding up Speculative Decoding via Sequential Approximate Verification","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-08T22:28:20.505338Z"},"links":{"cited_paper":"/paper/2411.00841","citing_paper":"/paper/2502.04557"},"observation_digest":"sha256:258d622b7cc0fc50daaa73daca73c732b8b8d2568177ffe87c152236cef705e3","observation_id":"5b6b7e36-9e21-4eeb-b112-697248921c1d","resolution":{"observed_at":"2026-08-08T22:28:20.595139Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.06125","last_updated":"2024-02-09T01:15:42Z","snapshot_observed_at":"2026-08-07T01:23:18.440358Z","submitted_at":"2024-02-09T01:15:42Z","title":"Language Model Sentence Completion with a Parser-Driven Rhetorical Control Method","version":1},"cited_work":{"arxiv_id":"2402.06125","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.06125","snapshot_observed_at":"2026-08-08T22:28:20.549988Z","title":"Language Model Sentence Completion with a Parser-Driven Rhetorical Control Method","venue":"cs.CL","work_id":"782cd447-40c9-496d-9d59-ee77a0a5d039","year":2024},"citing_paper":{"arxiv_id":"2502.04557","last_updated":"2025-07-08T05:05:28Z","snapshot_observed_at":"2026-08-09T07:26:43.909516Z","submitted_at":"2025-02-06T23:10:53Z","title":"Speeding up Speculative Decoding via Sequential Approximate Verification","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-08T22:28:20.510206Z"},"links":{"cited_paper":"/paper/2402.06125","citing_paper":"/paper/2502.04557"},"observation_digest":"sha256:a522aa8e682efe7c4fd89c17328fdc17589c2a46ca07d2772218889cf9111eb2","observation_id":"b77f8d4a-cdf7-4956-ba02-aafb5719a95e","resolution":{"observed_at":"2026-08-08T22:28:20.558389Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T22:28:21.076404Z","title":"The main sources of FLOPS considered in (Hoffmann et al., 2022; Casson,","venue":null,"work_id":"acf48172-6d2c-437b-a0c7-aba157065403","year":2022},"citing_paper":{"arxiv_id":"2502.04557","last_updated":"2025-07-08T05:05:28Z","snapshot_observed_at":"2026-08-09T07:26:43.909516Z","submitted_at":"2025-02-06T23:10:53Z","title":"Speeding up Speculative Decoding via Sequential Approximate Verification","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-08T22:28:20.523593Z"},"links":{"citing_paper":"/paper/2502.04557"},"observation_digest":"sha256:f30b95f8f86b0874fda44ab2593fe54368aff9df4d52d632b8553021300edfc9","observation_id":"b5cb0350-1f94-4534-80c2-a0126b27184b","resolution":{"observed_at":"2026-08-08T22:28:21.079725Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T22:28:21.066684Z","title":null,"venue":null,"work_id":"63a21dba-4547-4120-822d-eb8bcd99b076","year":2024},"citing_paper":{"arxiv_id":"2502.04557","last_updated":"2025-07-08T05:05:28Z","snapshot_observed_at":"2026-08-09T07:26:43.909516Z","submitted_at":"2025-02-06T23:10:53Z","title":"Speeding up Speculative Decoding via Sequential Approximate Verification","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-08T22:28:20.527111Z"},"links":{"citing_paper":"/paper/2502.04557"},"observation_digest":"sha256:56ef2e2c2d37e6cfc40632a4bf89c0d9605af0dd80dce0f13aa874fb337e711c","observation_id":"7d1349aa-4bac-41ef-aad9-858860bc396b","resolution":{"observed_at":"2026-08-08T22:28:21.070021Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T22:28:21.086140Z","title":"It was a big success in Pre/f.shortix: Niagra Falls is located in SD Niagra falls is located in the city of Kolkata, India","venue":null,"work_id":"49597ac2-409b-409c-9505-04a8e95f338b","year":2022},"citing_paper":{"arxiv_id":"2502.04557","last_updated":"2025-07-08T05:05:28Z","snapshot_observed_at":"2026-08-09T07:26:43.909516Z","submitted_at":"2025-02-06T23:10:53Z","title":"Speeding up Speculative Decoding via Sequential Approximate Verification","version":3},"reference_index":2000,"source":"pdf_text","source_observed_at":"2026-08-08T22:28:20.520316Z"},"links":{"citing_paper":"/paper/2502.04557"},"observation_digest":"sha256:93d6babdf08867b8168080d48c497d534409bde4c26646bcfef4e4d8de04e1fc","observation_id":"87c114ea-75bf-46d9-878d-83b35bc400bf","resolution":{"observed_at":"2026-08-08T22:28:21.089459Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.05636","last_updated":"2025-02-10T20:51:18Z","snapshot_observed_at":"2026-07-06T18:59:16.978029Z","submitted_at":"2024-08-10T21:24:25Z","title":"Speculative Diffusion Decoding: Accelerating Language Generation through Diffusion","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.05636","snapshot_observed_at":"2026-08-08T22:28:20.448891Z","title":"K., Bartoldson, B","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.04557","last_updated":"2025-07-08T05:05:28Z","snapshot_observed_at":"2026-08-09T07:26:43.909516Z","submitted_at":"2025-02-06T23:10:53Z","title":"Speeding up Speculative Decoding via Sequential Approximate Verification","version":3},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-08T22:28:20.448891Z"},"links":{"cited_paper":"/paper/2408.05636","citing_paper":"/paper/2502.04557"},"observation_digest":"sha256:5e7804cde0913f94865b308efd5b3171f46ebe507ac2e90e6cf64d7385a2708c","observation_id":"9b213293-2f43-4b1c-bbe7-8681e8de3b38","resolution":{"observed_at":"2026-08-08T22:28:20.448891Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.03870","last_updated":"2024-08-27T08:31:04Z","snapshot_observed_at":"2026-07-06T17:40:33.769700Z","submitted_at":"2024-03-06T17:23:28Z","title":"Learning to Decode Collaboratively with Multiple Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.03870","snapshot_observed_at":"2026-08-08T22:28:20.495145Z","title":"Z., Lang, H., Wang, B., Kim, Y ., and Sontag, D","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.04557","last_updated":"2025-07-08T05:05:28Z","snapshot_observed_at":"2026-08-09T07:26:43.909516Z","submitted_at":"2025-02-06T23:10:53Z","title":"Speeding up Speculative Decoding via Sequential Approximate Verification","version":3},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-08T22:28:20.495145Z"},"links":{"cited_paper":"/paper/2403.03870","citing_paper":"/paper/2502.04557"},"observation_digest":"sha256:766176993b81896a7ef819e047378e7abc074fb00e2bc921bccb8ec06b502848","observation_id":"8bf3fcc9-c6cd-4230-b1a4-87f0e2fe7478","resolution":{"observed_at":"2026-08-08T22:28:20.495145Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.15556","last_updated":"2022-03-29T13:38:03Z","snapshot_observed_at":"2026-07-06T12:54:11.616335Z","submitted_at":"2022-03-29T13:38:03Z","title":"Training Compute-Optimal Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.15556","snapshot_observed_at":"2026-08-08T22:28:20.458831Z","title":"Huang, K., Guo, X., and Wang, M","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.04557","last_updated":"2025-07-08T05:05:28Z","snapshot_observed_at":"2026-08-09T07:26:43.909516Z","submitted_at":"2025-02-06T23:10:53Z","title":"Speeding up Speculative Decoding via Sequential Approximate Verification","version":3},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-08T22:28:20.458831Z"},"links":{"cited_paper":"/paper/2203.15556","citing_paper":"/paper/2502.04557"},"observation_digest":"sha256:25295010f43aa253d56c2d871174baa6e0a965a94d13ef2ce094757b93461e8e","observation_id":"a992d833-8523-4e9f-90ef-b089c4bea725","resolution":{"observed_at":"2026-08-08T22:28:20.458831Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.16858","last_updated":"2024-06-30T15:03:25Z","snapshot_observed_at":"2026-07-06T18:36:12.298104Z","submitted_at":"2024-06-24T17:59:11Z","title":"EAGLE-2: Faster Inference of Language Models with Dynamic Draft Trees","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.16858","snapshot_observed_at":"2026-08-08T22:28:20.466085Z","title":"Eagle-2: Faster inference of language models with dynamic draft trees, 2024b.URL https://arxiv","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.04557","last_updated":"2025-07-08T05:05:28Z","snapshot_observed_at":"2026-08-09T07:26:43.909516Z","submitted_at":"2025-02-06T23:10:53Z","title":"Speeding up Speculative Decoding via Sequential Approximate Verification","version":3},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-08T22:28:20.466085Z"},"links":{"cited_paper":"/paper/2406.16858","citing_paper":"/paper/2502.04557"},"observation_digest":"sha256:76287bb2d705541fdb27298bf3765e765cbac697522e1789b5c19334b43612f2","observation_id":"6f30a314-b7e7-46f4-afe8-596307c4a871","resolution":{"observed_at":"2026-08-08T22:28:20.466085Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.19309","last_updated":"2025-01-31T17:09:53Z","snapshot_observed_at":"2026-08-08T01:16:56.960700Z","submitted_at":"2025-01-31T17:09:53Z","title":"Judge Decoding: Faster Speculative Sampling Requires Going Beyond Model Alignment","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.19309","snapshot_observed_at":"2026-08-08T22:28:20.436274Z","title":"Judge decoding: Faster speculative sampling requires going beyond model alignment.arXiv preprint arXiv:2501.19309,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.04557","last_updated":"2025-07-08T05:05:28Z","snapshot_observed_at":"2026-08-09T07:26:43.909516Z","submitted_at":"2025-02-06T23:10:53Z","title":"Speeding up Speculative Decoding via Sequential Approximate Verification","version":3},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-08T22:28:20.436274Z"},"links":{"cited_paper":"/paper/2501.19309","citing_paper":"/paper/2502.04557"},"observation_digest":"sha256:c32561404dd62be10388597fa7951619b450802d5bb307204d0d8dad1068599b","observation_id":"1bbf85ee-3856-4f48-9473-503cbd0f3d76","resolution":{"observed_at":"2026-08-08T22:28:20.436274Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.10774","last_updated":"2024-06-14T23:32:32Z","snapshot_observed_at":"2026-07-06T17:17:56.276857Z","submitted_at":"2024-01-19T15:48:40Z","title":"Medusa: Simple LLM Inference Acceleration Framework with Multiple Decoding Heads","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.10774","snapshot_observed_at":"2026-08-08T22:28:20.441096Z","title":"D., Chen, D., and Dao, T","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.04557","last_updated":"2025-07-08T05:05:28Z","snapshot_observed_at":"2026-08-09T07:26:43.909516Z","submitted_at":"2025-02-06T23:10:53Z","title":"Speeding up Speculative Decoding via Sequential Approximate Verification","version":3},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-08T22:28:20.441096Z"},"links":{"cited_paper":"/paper/2401.10774","citing_paper":"/paper/2502.04557"},"observation_digest":"sha256:3c9fec4747a9817a1958306a154135417ba68befd60006f2d91a68c7fbc7598d","observation_id":"ecdc3666-7771-461c-8c3d-8eeee899c026","resolution":{"observed_at":"2026-08-08T22:28:20.441096Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2502.04557","last_updated":"2025-07-08T05:05:28Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-09T07:26:43.909516Z","submitted_at":"2025-02-06T23:10:53Z","title":"Speeding up Speculative Decoding via Sequential Approximate Verification"},"reference_resolution":{"displayed":23,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":11,"verified_exact":2,"verified_fuzzy":9},"total_outbound_references":23},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 23 of 23 outbound references and 1 inbound Pith citation observation for arXiv:2502.04557."}