{"as_of":"2026-08-10T19:25:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3d3d814323cce695e769577762744a6ed158b7ff77e9df5d7448c1e8a05bdd91","coverage":[{"denominator":18,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":18,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T23:17:51.221485Z","state":"measured"},{"denominator":18,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":18,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+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/2502.08923/citation-record","integrity":"/paper/2502.08923/integrity","json":"/paper/2502.08923/citation-record.json","paper":"/paper/2502.08923"},"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-07T23:17:51.629849Z","title":"(b) Check if s is in D (the dictionary of re- peats)","venue":null,"work_id":"be88268d-75af-4f43-9e95-c4adc7b1d289","year":null},"citing_paper":{"arxiv_id":"2502.08923","last_updated":"2025-05-23T00:51:17Z","snapshot_observed_at":"2026-08-09T19:44:07.220721Z","submitted_at":"2025-02-13T03:19:50Z","title":"CopySpec: Accelerating LLMs with Speculative Copy-and-Paste Without Compromising Quality","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T23:17:51.185524Z"},"links":{"citing_paper":"/paper/2502.08923"},"observation_digest":"sha256:5579d7655d57f54267aba437debc77d1d810470931db7db4f6804b626a1ec82e","observation_id":"3c017d70-053d-4da3-9f0e-cc65617432e3","resolution":{"observed_at":"2026-08-07T23:17:51.633351Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2110.14168","last_updated":"2021-11-18T00:23:45Z","snapshot_observed_at":"2026-08-07T01:45:38.840969Z","submitted_at":"2021-10-27T04:49:45Z","title":"Training Verifiers to Solve Math Word Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.14168","snapshot_observed_at":"2026-08-07T23:17:51.160413Z","title":"arXiv preprint arXiv:2110.14168","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.08923","last_updated":"2025-05-23T00:51:17Z","snapshot_observed_at":"2026-08-09T19:44:07.220721Z","submitted_at":"2025-02-13T03:19:50Z","title":"CopySpec: Accelerating LLMs with Speculative Copy-and-Paste Without Compromising Quality","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T23:17:51.160413Z"},"links":{"cited_paper":"/paper/2110.14168","citing_paper":"/paper/2502.08923"},"observation_digest":"sha256:582e70c6e7a3f290a24003a6a336af8240c21ee4b040013596784f45ee62fa14","observation_id":"366b0c09-fd27-42ee-a14e-b7894e9715d3","resolution":{"observed_at":"2026-08-07T23:17:51.160413Z","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-07T23:17:51.609814Z","title":"(b) Let k = 0","venue":null,"work_id":"3cf14cba-44c8-4e5a-8ef1-04076f2c1971","year":null},"citing_paper":{"arxiv_id":"2502.08923","last_updated":"2025-05-23T00:51:17Z","snapshot_observed_at":"2026-08-09T19:44:07.220721Z","submitted_at":"2025-02-13T03:19:50Z","title":"CopySpec: Accelerating LLMs with Speculative Copy-and-Paste Without Compromising Quality","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T23:17:51.192956Z"},"links":{"citing_paper":"/paper/2502.08923"},"observation_digest":"sha256:47b3c0bae7e0353bee6febdd623f3bf59eedc5a3499e83e4bddf94f22e43320a","observation_id":"f5ebc982-c4f7-4b6e-bc9b-7b9c30688915","resolution":{"observed_at":"2026-08-07T23:17:51.613488Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T23:17:51.598503Z","title":"Con- tinue until a stopping criterion (e.g","venue":null,"work_id":"65d28375-8a4f-4605-b27c-e5ed0ae2bba2","year":2023},"citing_paper":{"arxiv_id":"2502.08923","last_updated":"2025-05-23T00:51:17Z","snapshot_observed_at":"2026-08-09T19:44:07.220721Z","submitted_at":"2025-02-13T03:19:50Z","title":"CopySpec: Accelerating LLMs with Speculative Copy-and-Paste Without Compromising Quality","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T23:17:51.196646Z"},"links":{"citing_paper":"/paper/2502.08923"},"observation_digest":"sha256:1589dc6ae9f5082db84a755ec886f3715031b5fd6825824d8bdcd5d363bfe421","observation_id":"018daa91-4a7d-476b-9a9c-51136da7a6ab","resolution":{"observed_at":"2026-08-07T23:17:51.602490Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T23:17:51.540122Z","title":null,"venue":null,"work_id":"d38c19a8-c4e0-493a-9ce6-0f360cf0e14b","year":null},"citing_paper":{"arxiv_id":"2502.08923","last_updated":"2025-05-23T00:51:17Z","snapshot_observed_at":"2026-08-09T19:44:07.220721Z","submitted_at":"2025-02-13T03:19:50Z","title":"CopySpec: Accelerating LLMs with Speculative Copy-and-Paste Without Compromising Quality","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T23:17:51.214844Z"},"links":{"citing_paper":"/paper/2502.08923"},"observation_digest":"sha256:288497a0f74f4578d65a8ebfbb8f9a3bf132dddb544ff50b699ce3c199968ec5","observation_id":"92416935-842a-43b3-bcfc-d8ca9a28a67f","resolution":{"observed_at":"2026-08-07T23:17:51.544240Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.05289","last_updated":"2024-11-08T02:47:07Z","snapshot_observed_at":"2026-08-09T03:51:03.995568Z","submitted_at":"2024-11-08T02:47:07Z","title":"SpecHub: Provable Acceleration to Multi-Draft Speculative Decoding","version":1},"cited_work":{"arxiv_id":"2411.05289","doi":null,"metadata_source":"pith","pith_arxiv_id":"2411.05289","snapshot_observed_at":"2026-08-07T23:17:51.453064Z","title":"SpecHub: Provable Acceleration to Multi-Draft Speculative Decoding","venue":"cs.CL","work_id":"eede6bc6-740a-4cef-b11b-011f692d1c7c","year":2024},"citing_paper":{"arxiv_id":"2502.08923","last_updated":"2025-05-23T00:51:17Z","snapshot_observed_at":"2026-08-09T19:44:07.220721Z","submitted_at":"2025-02-13T03:19:50Z","title":"CopySpec: Accelerating LLMs with Speculative Copy-and-Paste Without Compromising Quality","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T23:17:51.177530Z"},"links":{"cited_paper":"/paper/2411.05289","citing_paper":"/paper/2502.08923"},"observation_digest":"sha256:79bbdd174124f602efae5a88bed626966981f46ddea2f2ff3207a017073a563c","observation_id":"dc8b7ea2-ab5c-4640-8bae-21db6467a6a1","resolution":{"observed_at":"2026-08-07T23:17:51.457374Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T23:17:51.519417Z","title":"Alex\\\" for the friend and \\","venue":null,"work_id":"f5ea0fc0-3db1-4fce-a5c0-c72a13e7c80f","year":null},"citing_paper":{"arxiv_id":"2502.08923","last_updated":"2025-05-23T00:51:17Z","snapshot_observed_at":"2026-08-09T19:44:07.220721Z","submitted_at":"2025-02-13T03:19:50Z","title":"CopySpec: Accelerating LLMs with Speculative Copy-and-Paste Without Compromising Quality","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T23:17:51.221485Z"},"links":{"citing_paper":"/paper/2502.08923"},"observation_digest":"sha256:237289771e40ea7f2314558daad204d0144eecc58e941a88c2931fc5fa1c589a","observation_id":"7b818db6-0055-435d-88ac-65971cf4ca94","resolution":{"observed_at":"2026-08-07T23:17:51.522851Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T23:17:51.619822Z","title":"• If exi passes the acceptance criterion (e.g","venue":null,"work_id":"05b16f77-e2fc-4d93-a8fc-c34edaf48691","year":null},"citing_paper":{"arxiv_id":"2502.08923","last_updated":"2025-05-23T00:51:17Z","snapshot_observed_at":"2026-08-09T19:44:07.220721Z","submitted_at":"2025-02-13T03:19:50Z","title":"CopySpec: Accelerating LLMs with Speculative Copy-and-Paste Without Compromising Quality","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T23:17:51.189069Z"},"links":{"citing_paper":"/paper/2502.08923"},"observation_digest":"sha256:9d36bd8df96a25e5dd4ed56e55c8f670d296abdd7d695c4d51d3a36290102c7f","observation_id":"45a9aaaa-ec2f-4e1e-b6e6-3e196cfbb9a1","resolution":{"observed_at":"2026-08-07T23:17:51.623466Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T23:17:51.587469Z","title":null,"venue":null,"work_id":"4c7115f7-5f7b-4e99-b105-072131606096","year":null},"citing_paper":{"arxiv_id":"2502.08923","last_updated":"2025-05-23T00:51:17Z","snapshot_observed_at":"2026-08-09T19:44:07.220721Z","submitted_at":"2025-02-13T03:19:50Z","title":"CopySpec: Accelerating LLMs with Speculative Copy-and-Paste Without Compromising Quality","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T23:17:51.200472Z"},"links":{"citing_paper":"/paper/2502.08923"},"observation_digest":"sha256:20d292ed68846c882df79a9a5e50faa82b46f7bb95c39e76b60bdab786a7ee74","observation_id":"4d633f17-aaff-4a1d-aa4a-6ec4cbae464b","resolution":{"observed_at":"2026-08-07T23:17:51.591034Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T23:17:51.575750Z","title":null,"venue":null,"work_id":"17724a75-25fe-42da-bec2-56ab0e1e5d76","year":null},"citing_paper":{"arxiv_id":"2502.08923","last_updated":"2025-05-23T00:51:17Z","snapshot_observed_at":"2026-08-09T19:44:07.220721Z","submitted_at":"2025-02-13T03:19:50Z","title":"CopySpec: Accelerating LLMs with Speculative Copy-and-Paste Without Compromising Quality","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T23:17:51.203832Z"},"links":{"citing_paper":"/paper/2502.08923"},"observation_digest":"sha256:9deee1ba769ec65c2a3400e966911721262d35afdadf3315d5347959ed34600e","observation_id":"683beb6b-185d-4beb-82ab-c50052abb5ee","resolution":{"observed_at":"2026-08-07T23:17:51.579869Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T23:17:51.563801Z","title":null,"venue":null,"work_id":"2fae49d9-13fd-4728-a6f5-06944adb0e5c","year":null},"citing_paper":{"arxiv_id":"2502.08923","last_updated":"2025-05-23T00:51:17Z","snapshot_observed_at":"2026-08-09T19:44:07.220721Z","submitted_at":"2025-02-13T03:19:50Z","title":"CopySpec: Accelerating LLMs with Speculative Copy-and-Paste Without Compromising Quality","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T23:17:51.207556Z"},"links":{"citing_paper":"/paper/2502.08923"},"observation_digest":"sha256:182a8629e3c653d1de3f51821da753e1b53dbfc8f808294995f67f319caa8457","observation_id":"6de7db49-18c7-4e28-9e86-3488a87a4051","resolution":{"observed_at":"2026-08-07T23:17:51.567525Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T23:17:51.551494Z","title":null,"venue":null,"work_id":"f8e43338-c8e5-4015-a5b8-839dd634bacc","year":null},"citing_paper":{"arxiv_id":"2502.08923","last_updated":"2025-05-23T00:51:17Z","snapshot_observed_at":"2026-08-09T19:44:07.220721Z","submitted_at":"2025-02-13T03:19:50Z","title":"CopySpec: Accelerating LLMs with Speculative Copy-and-Paste Without Compromising Quality","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T23:17:51.210703Z"},"links":{"citing_paper":"/paper/2502.08923"},"observation_digest":"sha256:526b2b1c441697f09cb51577274b4ac9549715c420c1a969b8a409cf572fac12","observation_id":"a21f446d-9f0c-4da8-a309-d995ea7c5f19","resolution":{"observed_at":"2026-08-07T23:17:51.555066Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T23:17:51.529465Z","title":null,"venue":null,"work_id":"99a6b8c4-0df1-4924-8736-5f46692fc7ac","year":null},"citing_paper":{"arxiv_id":"2502.08923","last_updated":"2025-05-23T00:51:17Z","snapshot_observed_at":"2026-08-09T19:44:07.220721Z","submitted_at":"2025-02-13T03:19:50Z","title":"CopySpec: Accelerating LLMs with Speculative Copy-and-Paste Without Compromising Quality","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T23:17:51.218196Z"},"links":{"citing_paper":"/paper/2502.08923"},"observation_digest":"sha256:80fad0627356aef218fc8cb0c17bf78258098ac61c658f0d9900d15dacb5f255","observation_id":"5cb215bf-223b-44a0-9e5b-eb927297b768","resolution":{"observed_at":"2026-08-07T23:17:51.532944Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:17:51.434265Z","title":"In Advances in Neural Information Processing Systems, volume 28, pages 2692–2700","venue":null,"work_id":"b844750c-4c09-4431-b331-a8bd40cec8bf","year":2023},"citing_paper":{"arxiv_id":"2502.08923","last_updated":"2025-05-23T00:51:17Z","snapshot_observed_at":"2026-08-09T19:44:07.220721Z","submitted_at":"2025-02-13T03:19:50Z","title":"CopySpec: Accelerating LLMs with Speculative Copy-and-Paste Without Compromising Quality","version":2},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-07T23:17:51.181636Z"},"links":{"citing_paper":"/paper/2502.08923"},"observation_digest":"sha256:36c89c06f10575563f0f711b290dd7c14ac7d9181f0118b65475d6233ad2459b","observation_id":"58f5ec44-5f0e-4f9f-b565-e697b245cd9f","resolution":{"observed_at":"2026-08-07T23:17:51.441235Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T19:44:07.220721Z","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:4464da3b739a0601bdeb7ac215e02480a0ab83a19331a62baf0227442b837c75","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":"1704.04368","last_updated":"2017-04-25T05:47:50Z","snapshot_observed_at":"2026-07-06T05:37:49.239583Z","submitted_at":"2017-04-14T07:55:19Z","title":"Get To The Point: Summarization with Pointer-Generator Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1704.04368","snapshot_observed_at":"2026-08-07T23:17:51.172959Z","title":"CoRR, abs/1704.04368","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.08923","last_updated":"2025-05-23T00:51:17Z","snapshot_observed_at":"2026-08-09T19:44:07.220721Z","submitted_at":"2025-02-13T03:19:50Z","title":"CopySpec: Accelerating LLMs with Speculative Copy-and-Paste Without Compromising Quality","version":2},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-07T23:17:51.172959Z"},"links":{"cited_paper":"/paper/1704.04368","citing_paper":"/paper/2502.08923"},"observation_digest":"sha256:f3d75cc08552efe62c496c3b6a2c65776720b17feb89d671356a3526a055e006","observation_id":"516a1d66-db83-46e4-b647-f198fcc9357c","resolution":{"observed_at":"2026-08-07T23:17:51.172959Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2107.03374","last_updated":"2021-07-14T17:16:02Z","snapshot_observed_at":"2026-08-08T11:58:24.516369Z","submitted_at":"2021-07-07T17:41:24Z","title":"Evaluating Large Language Models Trained on Code","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2107.03374","snapshot_observed_at":"2026-08-07T23:17:51.155791Z","title":"Preprint, arXiv:2107.03374","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.08923","last_updated":"2025-05-23T00:51:17Z","snapshot_observed_at":"2026-08-09T19:44:07.220721Z","submitted_at":"2025-02-13T03:19:50Z","title":"CopySpec: Accelerating LLMs with Speculative Copy-and-Paste Without Compromising Quality","version":2},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-07T23:17:51.155791Z"},"links":{"cited_paper":"/paper/2107.03374","citing_paper":"/paper/2502.08923"},"observation_digest":"sha256:4eeabacf54365f0371b1e43b384bca6f1ad06ca5d1a56f744f2d1b5537b8ba44","observation_id":"9394723b-f14a-43cf-b462-852b81964344","resolution":{"observed_at":"2026-08-07T23:17:51.155791Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.02057","last_updated":"2024-02-03T06:37:50Z","snapshot_observed_at":"2026-08-10T01:13:58.065889Z","submitted_at":"2024-02-03T06:37:50Z","title":"Break the Sequential Dependency of LLM Inference Using Lookahead Decoding","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.02057","snapshot_observed_at":"2026-08-07T23:17:51.164390Z","title":"arXiv preprint arXiv:2402.02057","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.08923","last_updated":"2025-05-23T00:51:17Z","snapshot_observed_at":"2026-08-09T19:44:07.220721Z","submitted_at":"2025-02-13T03:19:50Z","title":"CopySpec: Accelerating LLMs with Speculative Copy-and-Paste Without Compromising Quality","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-07T23:17:51.164390Z"},"links":{"cited_paper":"/paper/2402.02057","citing_paper":"/paper/2502.08923"},"observation_digest":"sha256:9c853eff24223e85b48f71dbc9aaa23e372ad4e1504e1d3182fa2d1a083ce698","observation_id":"95d78aee-3486-4971-bc3b-734391255c7f","resolution":{"observed_at":"2026-08-07T23:17:51.164390Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2502.08923","last_updated":"2025-05-23T00:51:17Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-09T19:44:07.220721Z","submitted_at":"2025-02-13T03:19:50Z","title":"CopySpec: Accelerating LLMs with Speculative Copy-and-Paste Without Compromising Quality"},"reference_resolution":{"displayed":18,"state_counts":{"malformed_identifier":1,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":11,"verified_exact":1,"verified_fuzzy":4},"total_outbound_references":18},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 18 of 18 outbound references and 0 inbound Pith citation observations for arXiv:2502.08923."}