{"as_of":"2026-08-19T11:03:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ba8828f97a63ef11104049c5c01972603e29acbfeaf247963f2fc1d666e0850e","coverage":[{"denominator":17,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":17,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T08:17:16.700628Z","state":"measured"},{"denominator":17,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":17,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+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/2607.13062/citation-record","integrity":"/paper/2607.13062/integrity","json":"/paper/2607.13062/citation-record.json","paper":"/paper/2607.13062"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2410.05202","last_updated":"2024-10-07T17:07:18Z","snapshot_observed_at":"2026-08-17T09:48:31.708512Z","submitted_at":"2024-10-07T17:07:18Z","title":"Demonstrating real-time and low-latency quantum error correction with superconducting qubits","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.05202","snapshot_observed_at":"2026-08-02T08:17:15.213554Z","title":"Blunt, Archibald Ruban, Jimmy McDaniel, Joseph A","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.13062","last_updated":"2026-07-24T17:28:33Z","snapshot_observed_at":"2026-08-17T03:40:38.944272Z","submitted_at":"2026-07-07T20:07:18Z","title":"The verifier side of speculative window decoding: a predictability bracket, a machine-checked blast-radius bound, and a decoder-agnostic recover loop","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-02T08:17:15.213554Z"},"links":{"cited_paper":"/paper/2410.05202","citing_paper":"/paper/2607.13062"},"observation_digest":"sha256:641e91b2b12363267d889f27a429ed601cdf52141e1f9c66b8b221eec6e02e28","observation_id":"3375ccb9-6cae-430d-a972-4023476c695b","resolution":{"observed_at":"2026-08-02T08:17:15.213554Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.13687","last_updated":"2024-08-24T23:08:50Z","snapshot_observed_at":"2026-08-16T13:24:05.007005Z","submitted_at":"2024-08-24T23:08:50Z","title":"Quantum error correction below the surface code threshold","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.13687","snapshot_observed_at":"2026-08-02T08:17:15.272693Z","title":"Quantum error correction below the surface code threshold.Nature, 638:920–926, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.13062","last_updated":"2026-07-24T17:28:33Z","snapshot_observed_at":"2026-08-17T03:40:38.944272Z","submitted_at":"2026-07-07T20:07:18Z","title":"The verifier side of speculative window decoding: a predictability bracket, a machine-checked blast-radius bound, and a decoder-agnostic recover loop","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-02T08:17:15.272693Z"},"links":{"cited_paper":"/paper/2408.13687","citing_paper":"/paper/2607.13062"},"observation_digest":"sha256:a59a75bb6ddf6860937173ec51cf885feb8dd6aae3752819078a4a130a726151","observation_id":"a484b781-bde9-4beb-8572-db6de641ffde","resolution":{"observed_at":"2026-08-02T08:17:15.272693Z","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-02T08:17:15.376020Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13062","last_updated":"2026-07-24T17:28:33Z","snapshot_observed_at":"2026-08-17T03:40:38.944272Z","submitted_at":"2026-07-07T20:07:18Z","title":"The verifier side of speculative window decoding: a predictability bracket, a machine-checked blast-radius bound, and a decoder-agnostic recover loop","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-02T08:17:15.376020Z"},"links":{"citing_paper":"/paper/2607.13062"},"observation_digest":"sha256:ef4d39cc732308dbadd1143233b8eceb7f7c86d107e6f81275291662e5ad4a69","observation_id":"00b3dfa4-afde-42b4-969d-ba3a2cf2b16d","resolution":{"observed_at":"2026-08-02T08:17:15.376020Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1302.3428","last_updated":"2015-04-10T07:16:30Z","snapshot_observed_at":"2026-08-15T00:28:46.596910Z","submitted_at":"2013-02-14T15:20:12Z","title":"Quantum Error Correction for Quantum Memories","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1302.3428","snapshot_observed_at":"2026-08-02T08:17:15.501413Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.13062","last_updated":"2026-07-24T17:28:33Z","snapshot_observed_at":"2026-08-17T03:40:38.944272Z","submitted_at":"2026-07-07T20:07:18Z","title":"The verifier side of speculative window decoding: a predictability bracket, a machine-checked blast-radius bound, and a decoder-agnostic recover loop","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-02T08:17:15.501413Z"},"links":{"cited_paper":"/paper/1302.3428","citing_paper":"/paper/2607.13062"},"observation_digest":"sha256:4d8d73ae92c15afd40cfc06d057f36dc6c6dd9dbd37f8653f6b7857b0825f72e","observation_id":"c1536f92-0fbc-40a5-ac21-56a8d3c67716","resolution":{"observed_at":"2026-08-02T08:17:15.501413Z","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-02T08:17:15.647893Z","title":"Browne, Kenton M","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.13062","last_updated":"2026-07-24T17:28:33Z","snapshot_observed_at":"2026-08-17T03:40:38.944272Z","submitted_at":"2026-07-07T20:07:18Z","title":"The verifier side of speculative window decoding: a predictability bracket, a machine-checked blast-radius bound, and a decoder-agnostic recover loop","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-02T08:17:15.647893Z"},"links":{"citing_paper":"/paper/2607.13062"},"observation_digest":"sha256:19ed32e9f82517633a61c74c777966c80596ab461fb8dce46c3708b121cce376","observation_id":"ba179fb5-962f-436f-b27c-0001da92012b","resolution":{"observed_at":"2026-08-02T08:17:15.647893Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/0110143","last_updated":"2001-10-24T20:02:14Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2001-10-24T20:02:14Z","title":"Topological quantum memory","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/0110143","snapshot_observed_at":"2026-08-02T08:17:15.720795Z","title":"Topological quantum memory","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.13062","last_updated":"2026-07-24T17:28:33Z","snapshot_observed_at":"2026-08-17T03:40:38.944272Z","submitted_at":"2026-07-07T20:07:18Z","title":"The verifier side of speculative window decoding: a predictability bracket, a machine-checked blast-radius bound, and a decoder-agnostic recover loop","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-02T08:17:15.720795Z"},"links":{"cited_paper":"/paper/quant-ph/0110143","citing_paper":"/paper/2607.13062"},"observation_digest":"sha256:9f5e1ed6c939763922f47b3279481050f2b8fab947020910b680039d704d4500","observation_id":"fda80f8e-10f7-4ec0-83b0-f87d02b35058","resolution":{"observed_at":"2026-08-02T08:17:15.720795Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.05115","last_updated":"2024-12-06T15:17:18Z","snapshot_observed_at":"2026-08-18T05:43:00.112324Z","submitted_at":"2024-12-06T15:17:18Z","title":"Predictive Window Decoding for Fault-Tolerant Quantum Programs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.05115","snapshot_observed_at":"2026-08-02T08:17:15.775282Z","title":"Chadwick, Sarang Joshi, Gokul Subramanian Ravi, Yanjing Li, and Fred- eric T","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.13062","last_updated":"2026-07-24T17:28:33Z","snapshot_observed_at":"2026-08-17T03:40:38.944272Z","submitted_at":"2026-07-07T20:07:18Z","title":"The verifier side of speculative window decoding: a predictability bracket, a machine-checked blast-radius bound, and a decoder-agnostic recover loop","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-02T08:17:15.775282Z"},"links":{"cited_paper":"/paper/2412.05115","citing_paper":"/paper/2607.13062"},"observation_digest":"sha256:3f1d9ddf2b9079de36739bf2a4d5942c086d2dde6ca1182203b7bbcb1417dca4","observation_id":"d6023c62-c960-4456-b32a-a4665ff5d78e","resolution":{"observed_at":"2026-08-02T08:17:15.775282Z","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-02T08:17:15.859737Z","title":"ARTERY: Fast quantum feedback using branch prediction","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.13062","last_updated":"2026-07-24T17:28:33Z","snapshot_observed_at":"2026-08-17T03:40:38.944272Z","submitted_at":"2026-07-07T20:07:18Z","title":"The verifier side of speculative window decoding: a predictability bracket, a machine-checked blast-radius bound, and a decoder-agnostic recover loop","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-02T08:17:15.859737Z"},"links":{"citing_paper":"/paper/2607.13062"},"observation_digest":"sha256:89793196ca8e4acc6d724373a71bc0716915537ff0861fd978bd6676f186a73c","observation_id":"bc0b4cc3-3625-415c-b2c8-6b36c97a8efe","resolution":{"observed_at":"2026-08-02T08:17:15.859737Z","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-02T08:17:15.941423Z","title":"Fastinferencefromtransformersviaspecula- tive decoding","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13062","last_updated":"2026-07-24T17:28:33Z","snapshot_observed_at":"2026-08-17T03:40:38.944272Z","submitted_at":"2026-07-07T20:07:18Z","title":"The verifier side of speculative window decoding: a predictability bracket, a machine-checked blast-radius bound, and a decoder-agnostic recover loop","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-02T08:17:15.941423Z"},"links":{"citing_paper":"/paper/2607.13062"},"observation_digest":"sha256:dc33ab524603b32334346c66c905f33dc2976b1216196743254cbffe98ff5b72","observation_id":"0e851266-d755-4134-8fbd-a5d6fdc680ef","resolution":{"observed_at":"2026-08-02T08:17:15.941423Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.01318","last_updated":"2023-02-02T18:44:11Z","snapshot_observed_at":"2026-08-13T23:55:57.074762Z","submitted_at":"2023-02-02T18:44:11Z","title":"Accelerating Large Language Model Decoding with Speculative Sampling","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.01318","snapshot_observed_at":"2026-08-02T08:17:16.026430Z","title":"Accelerating large language model decoding with speculative sampling.arXiv preprint, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.13062","last_updated":"2026-07-24T17:28:33Z","snapshot_observed_at":"2026-08-17T03:40:38.944272Z","submitted_at":"2026-07-07T20:07:18Z","title":"The verifier side of speculative window decoding: a predictability bracket, a machine-checked blast-radius bound, and a decoder-agnostic recover loop","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-02T08:17:16.026430Z"},"links":{"cited_paper":"/paper/2302.01318","citing_paper":"/paper/2607.13062"},"observation_digest":"sha256:b3655f4dab8f98cd19d37ab5ce6561bc5c4e5e5e6d9eef270747739e7f3401ca","observation_id":"771d5af9-1510-431d-81ef-9045883abff5","resolution":{"observed_at":"2026-08-02T08:17:16.026430Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.03136","last_updated":"2024-04-04T01:16:49Z","snapshot_observed_at":"2026-08-16T14:03:47.509758Z","submitted_at":"2024-04-04T01:16:49Z","title":"Promatch: Extending the Reach of Real-Time Quantum Error Correction with Adaptive Predecoding","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.03136","snapshot_observed_at":"2026-08-02T08:17:16.094033Z","title":"Promatch: Extending the reach of real-time quantum error correction with adaptive predecoding","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.13062","last_updated":"2026-07-24T17:28:33Z","snapshot_observed_at":"2026-08-17T03:40:38.944272Z","submitted_at":"2026-07-07T20:07:18Z","title":"The verifier side of speculative window decoding: a predictability bracket, a machine-checked blast-radius bound, and a decoder-agnostic recover loop","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-02T08:17:16.094033Z"},"links":{"cited_paper":"/paper/2404.03136","citing_paper":"/paper/2607.13062"},"observation_digest":"sha256:85ab7d913bef8c6cc30bab6dd5f731268bac929d203d15569e61a4752ef274ab","observation_id":"2d4b9877-0451-4219-ba78-ab166c00bc5f","resolution":{"observed_at":"2026-08-02T08:17:16.094033Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2512.09807","last_updated":"2025-12-12T18:02:56Z","snapshot_observed_at":"2026-08-17T05:38:05.174050Z","submitted_at":"2025-12-10T16:23:00Z","title":"Pinball: A Cryogenic Predecoder for Surface Code Decoding Under Circuit-Level Noise","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2512.09807","snapshot_observed_at":"2026-08-02T08:17:16.176535Z","title":"Pinball: A cryogenic predecoder for surface code decoding under circuit-level noise.arXiv preprint, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.13062","last_updated":"2026-07-24T17:28:33Z","snapshot_observed_at":"2026-08-17T03:40:38.944272Z","submitted_at":"2026-07-07T20:07:18Z","title":"The verifier side of speculative window decoding: a predictability bracket, a machine-checked blast-radius bound, and a decoder-agnostic recover loop","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-02T08:17:16.176535Z"},"links":{"cited_paper":"/paper/2512.09807","citing_paper":"/paper/2607.13062"},"observation_digest":"sha256:24f3c251330421a9dad7426e572cb0c5c130da547efc1120f45b096581fee58c","observation_id":"f599202a-5a3d-4a08-a0e8-b5dc6039246a","resolution":{"observed_at":"2026-08-02T08:17:16.176535Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.02202","last_updated":"2021-06-18T05:03:01Z","snapshot_observed_at":"2026-08-16T18:41:39.137374Z","submitted_at":"2021-03-03T06:21:21Z","title":"Stim: a fast stabilizer circuit simulator","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.02202","snapshot_observed_at":"2026-08-02T08:17:16.260411Z","title":"Stim: a fast stabilizer circuit sim- ulator.Quantum, 5:497, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.13062","last_updated":"2026-07-24T17:28:33Z","snapshot_observed_at":"2026-08-17T03:40:38.944272Z","submitted_at":"2026-07-07T20:07:18Z","title":"The verifier side of speculative window decoding: a predictability bracket, a machine-checked blast-radius bound, and a decoder-agnostic recover loop","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-02T08:17:16.260411Z"},"links":{"cited_paper":"/paper/2103.02202","citing_paper":"/paper/2607.13062"},"observation_digest":"sha256:f32dc0cb65f1771821519282b03af5343b72bc4fe96f9e4aa893843db649495d","observation_id":"1bcb1a6b-46f4-401b-8091-8f479cf52768","resolution":{"observed_at":"2026-08-02T08:17:16.260411Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.15933","last_updated":"2025-01-14T17:46:22Z","snapshot_observed_at":"2026-08-16T15:44:44.190609Z","submitted_at":"2023-03-28T12:42:54Z","title":"Sparse Blossom: correcting a million errors per core second with minimum-weight matching","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.15933","snapshot_observed_at":"2026-08-02T08:17:16.357047Z","title":"Sparse blos- som: correcting a million errors per core sec- ond with minimum-weight matching.Quantum, 9:1600, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.13062","last_updated":"2026-07-24T17:28:33Z","snapshot_observed_at":"2026-08-17T03:40:38.944272Z","submitted_at":"2026-07-07T20:07:18Z","title":"The verifier side of speculative window decoding: a predictability bracket, a machine-checked blast-radius bound, and a decoder-agnostic recover loop","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-02T08:17:16.357047Z"},"links":{"cited_paper":"/paper/2303.15933","citing_paper":"/paper/2607.13062"},"observation_digest":"sha256:1d7fe2ef4d4f70bcf01763cbae0df6b8872ce63ddd4b54fad468eec1738d3cf5","observation_id":"65b66dbf-65d3-4327-a464-23558941f99f","resolution":{"observed_at":"2026-08-02T08:17:16.357047Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1208.0928","last_updated":"2012-10-27T00:37:14Z","snapshot_observed_at":"2026-08-15T00:50:49.791303Z","submitted_at":"2012-08-04T13:37:57Z","title":"Surface codes: Towards practical large-scale quantum computation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1208.0928","snapshot_observed_at":"2026-08-02T08:17:16.523178Z","title":"Fowler, Matteo Mariantoni, John M","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.13062","last_updated":"2026-07-24T17:28:33Z","snapshot_observed_at":"2026-08-17T03:40:38.944272Z","submitted_at":"2026-07-07T20:07:18Z","title":"The verifier side of speculative window decoding: a predictability bracket, a machine-checked blast-radius bound, and a decoder-agnostic recover loop","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-02T08:17:16.523178Z"},"links":{"cited_paper":"/paper/1208.0928","citing_paper":"/paper/2607.13062"},"observation_digest":"sha256:b91491aa7dd5bed798a1750daabeff8d6e6f141960c4bc22944298a234fba923","observation_id":"4bac209d-07d0-41bd-8c88-62c169853ce8","resolution":{"observed_at":"2026-08-02T08:17:16.523178Z","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-02T08:17:16.604780Z","title":"The Lean mathemati- cal library","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.13062","last_updated":"2026-07-24T17:28:33Z","snapshot_observed_at":"2026-08-17T03:40:38.944272Z","submitted_at":"2026-07-07T20:07:18Z","title":"The verifier side of speculative window decoding: a predictability bracket, a machine-checked blast-radius bound, and a decoder-agnostic recover loop","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-02T08:17:16.604780Z"},"links":{"citing_paper":"/paper/2607.13062"},"observation_digest":"sha256:c91ec46241877eb844f112582542090a5f57cefdfccd3cfb9f958a75ed2e69bc","observation_id":"46a3d350-5df9-40ba-b23b-a2d4191f24d1","resolution":{"observed_at":"2026-08-02T08:17:16.604780Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1709.06218","last_updated":"2021-11-24T20:33:14Z","snapshot_observed_at":"2026-08-14T20:31:58.041180Z","submitted_at":"2017-09-19T01:35:11Z","title":"Almost-linear time decoding algorithm for topological codes","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1709.06218","snapshot_observed_at":"2026-08-02T08:17:16.700628Z","title":"Nickerson","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.13062","last_updated":"2026-07-24T17:28:33Z","snapshot_observed_at":"2026-08-17T03:40:38.944272Z","submitted_at":"2026-07-07T20:07:18Z","title":"The verifier side of speculative window decoding: a predictability bracket, a machine-checked blast-radius bound, and a decoder-agnostic recover loop","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-02T08:17:16.700628Z"},"links":{"cited_paper":"/paper/1709.06218","citing_paper":"/paper/2607.13062"},"observation_digest":"sha256:c48a3299695f390d53b985237c5b387b1fdc5a7ab8d6df210103a7da97a2fed2","observation_id":"da550235-0d4f-4aa5-bd03-a7422f3b0a78","resolution":{"observed_at":"2026-08-02T08:17:16.700628Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.13062","last_updated":"2026-07-24T17:28:33Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-17T03:40:38.944272Z","submitted_at":"2026-07-07T20:07:18Z","title":"The verifier side of speculative window decoding: a predictability bracket, a machine-checked blast-radius bound, and a decoder-agnostic recover loop"},"reference_resolution":{"displayed":17,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":17,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":17},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 17 of 17 outbound references and 0 inbound Pith citation observations for arXiv:2607.13062."}