{"as_of":"2026-08-19T00:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:508a968d1b5a43c44060244bb04a0f97ea0b0fb3eabca58f4abad2a4879ac254","coverage":[{"denominator":56,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":56,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T00:35:18.313342Z","state":"measured"},{"denominator":56,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":56,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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/2608.11719/citation-record","integrity":"/paper/2608.11719/integrity","json":"/paper/2608.11719/citation-record.json","paper":"/paper/2608.11719"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:35:17.986797Z","title":"Abanin, Laleh Aghababaie-Beni, Igor Aleiner, Trond I","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.11719","last_updated":"2026-08-12T06:58:59Z","snapshot_observed_at":"2026-08-19T00:28:21.242972Z","submitted_at":"2026-08-12T06:58:59Z","title":"Do Not Let CNOTs Overwhelm the Decoder: Scheduling Transversal Gates for Fast FTQC","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-16T00:35:17.986797Z"},"links":{"citing_paper":"/paper/2608.11719"},"observation_digest":"sha256:fe6544418910ac11216f2a935694f6e1fde25ebaf63109a7544c3baa3b364d35","observation_id":"4bd2b5cc-524e-426c-9ae7-bd040989f504","resolution":{"observed_at":"2026-08-16T00:35:17.986797Z","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-16T00:35:17.992319Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.11719","last_updated":"2026-08-12T06:58:59Z","snapshot_observed_at":"2026-08-19T00:28:21.242972Z","submitted_at":"2026-08-12T06:58:59Z","title":"Do Not Let CNOTs Overwhelm the Decoder: Scheduling Transversal Gates for Fast FTQC","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-16T00:35:17.992319Z"},"links":{"citing_paper":"/paper/2608.11719"},"observation_digest":"sha256:0f4538997a40d15978d48103239bd3c66fd24197c716956223413cb2769a37e1","observation_id":"40a0e05a-ec0c-47a3-aca7-30a3084533f7","resolution":{"observed_at":"2026-08-16T00:35:17.992319Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.10988","last_updated":"2025-08-06T18:37:29Z","snapshot_observed_at":"2026-08-16T12:50:10.715421Z","submitted_at":"2025-03-14T01:23:53Z","title":"Tesseract: A Search-Based Decoder for Quantum Error Correction","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.10988","snapshot_observed_at":"2026-08-16T00:35:17.998262Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.11719","last_updated":"2026-08-12T06:58:59Z","snapshot_observed_at":"2026-08-19T00:28:21.242972Z","submitted_at":"2026-08-12T06:58:59Z","title":"Do Not Let CNOTs Overwhelm the Decoder: Scheduling Transversal Gates for Fast FTQC","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-16T00:35:17.998262Z"},"links":{"cited_paper":"/paper/2503.10988","citing_paper":"/paper/2608.11719"},"observation_digest":"sha256:a87eed2e347f4e282cf7176ba02308dfedf1ce122ec416f805978551a347245c","observation_id":"b4c85659-6911-4625-9ead-e9a420d2c143","resolution":{"observed_at":"2026-08-16T00:35:17.998262Z","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-16T00:35:19.529990Z","title":"Beverland, Malcolm Carroll, Andrew W","venue":null,"work_id":"bc52f480-3ec8-46aa-9472-e7e342e6b949","year":null},"citing_paper":{"arxiv_id":"2608.11719","last_updated":"2026-08-12T06:58:59Z","snapshot_observed_at":"2026-08-19T00:28:21.242972Z","submitted_at":"2026-08-12T06:58:59Z","title":"Do Not Let CNOTs Overwhelm the Decoder: Scheduling Transversal Gates for Fast FTQC","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-16T00:35:18.003453Z"},"links":{"citing_paper":"/paper/2608.11719"},"observation_digest":"sha256:745a2add39b0c415f78a7e1f9e3f23f069394599efb531a8693f1fd8b506ca0d","observation_id":"5ca10375-926e-415e-9d23-300573d38831","resolution":{"observed_at":"2026-08-16T00:35:19.534995Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T00:35:18.013787Z","title":"Evered, Alexandra A","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.11719","last_updated":"2026-08-12T06:58:59Z","snapshot_observed_at":"2026-08-19T00:28:21.242972Z","submitted_at":"2026-08-12T06:58:59Z","title":"Do Not Let CNOTs Overwhelm the Decoder: Scheduling Transversal Gates for Fast FTQC","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-16T00:35:18.013787Z"},"links":{"citing_paper":"/paper/2608.11719"},"observation_digest":"sha256:60cf47380c7264e4033da4ce888060c2e110afac03661f8573a7f9f37f90ad31","observation_id":"5ad672b3-f199-45dc-84ca-0f12a3bcd995","resolution":{"observed_at":"2026-08-16T00:35:18.013787Z","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-16T00:35:18.019691Z","title":"Geim, Sophie H","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.11719","last_updated":"2026-08-12T06:58:59Z","snapshot_observed_at":"2026-08-19T00:28:21.242972Z","submitted_at":"2026-08-12T06:58:59Z","title":"Do Not Let CNOTs Overwhelm the Decoder: Scheduling Transversal Gates for Fast FTQC","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-16T00:35:18.019691Z"},"links":{"citing_paper":"/paper/2608.11719"},"observation_digest":"sha256:c3ce81423db70c304bdb471f3d616fb3dd7f560623df29a8da2a174165f4fc7a","observation_id":"48b3d8da-aff8-42f9-9ef9-b601c17e96ff","resolution":{"observed_at":"2026-08-16T00:35:18.019691Z","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-16T00:35:18.024922Z","title":"Mishmash, Naomi Nickerson, Fernando Pastawski, and Sam Roberts","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.11719","last_updated":"2026-08-12T06:58:59Z","snapshot_observed_at":"2026-08-19T00:28:21.242972Z","submitted_at":"2026-08-12T06:58:59Z","title":"Do Not Let CNOTs Overwhelm the Decoder: Scheduling Transversal Gates for Fast FTQC","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-16T00:35:18.024922Z"},"links":{"citing_paper":"/paper/2608.11719"},"observation_digest":"sha256:f6bddd1ebdf75d25fc1fb6ae8c3e23ead8f824647ab651286d57887ddadbbca0","observation_id":"346845c1-70da-402f-a320-83e862f5c7d0","resolution":{"observed_at":"2026-08-16T00:35:18.024922Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.04846","last_updated":"2023-03-08T19:26:10Z","snapshot_observed_at":"2026-08-16T21:53:14.937897Z","submitted_at":"2023-03-08T19:26:10Z","title":"Modular decoding: parallelizable real-time decoding for quantum computers","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.04846","snapshot_observed_at":"2026-08-16T00:35:18.033092Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.11719","last_updated":"2026-08-12T06:58:59Z","snapshot_observed_at":"2026-08-19T00:28:21.242972Z","submitted_at":"2026-08-12T06:58:59Z","title":"Do Not Let CNOTs Overwhelm the Decoder: Scheduling Transversal Gates for Fast FTQC","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-16T00:35:18.033092Z"},"links":{"cited_paper":"/paper/2303.04846","citing_paper":"/paper/2608.11719"},"observation_digest":"sha256:e34943ca85b41747b746d7553cc9a2271ce0382f820f722b3528440410f60478","observation_id":"45bbe882-6fd9-40fd-b71c-85f976ab51f4","resolution":{"observed_at":"2026-08-16T00:35:18.033092Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.00696","last_updated":"2024-08-21T14:00:04Z","snapshot_observed_at":"2026-08-18T00:57:09.555307Z","submitted_at":"2023-12-01T16:29:02Z","title":"Low-Overhead Parallelisation of LCU via Commuting Operators","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.00696","snapshot_observed_at":"2026-08-16T00:35:18.038748Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.11719","last_updated":"2026-08-12T06:58:59Z","snapshot_observed_at":"2026-08-19T00:28:21.242972Z","submitted_at":"2026-08-12T06:58:59Z","title":"Do Not Let CNOTs Overwhelm the Decoder: Scheduling Transversal Gates for Fast FTQC","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-16T00:35:18.038748Z"},"links":{"cited_paper":"/paper/2312.00696","citing_paper":"/paper/2608.11719"},"observation_digest":"sha256:39f4ca0bfe94b0a8ce1eae08e505f09f59b1cc168b160fe9fe110901f75a6abd","observation_id":"7641078f-7442-4571-8972-84d5f3106b38","resolution":{"observed_at":"2026-08-16T00:35:18.038748Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/9811052","last_updated":"1998-11-20T03:23:13Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"1998-11-20T03:23:13Z","title":"Quantum codes on a lattice with boundary","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/9811052","snapshot_observed_at":"2026-08-16T00:35:18.044775Z","title":null,"venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2608.11719","last_updated":"2026-08-12T06:58:59Z","snapshot_observed_at":"2026-08-19T00:28:21.242972Z","submitted_at":"2026-08-12T06:58:59Z","title":"Do Not Let CNOTs Overwhelm the Decoder: Scheduling Transversal Gates for Fast FTQC","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-16T00:35:18.044775Z"},"links":{"cited_paper":"/paper/quant-ph/9811052","citing_paper":"/paper/2608.11719"},"observation_digest":"sha256:7b643c4d1af8d5012f31f6f32565ed99cbf26757e152242c26a374bf416b5265","observation_id":"d5836aea-58ab-4397-ba73-ce4a06cfa20b","resolution":{"observed_at":"2026-08-16T00:35:18.044775Z","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-16T00:35:18.051746Z","title":null,"venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2608.11719","last_updated":"2026-08-12T06:58:59Z","snapshot_observed_at":"2026-08-19T00:28:21.242972Z","submitted_at":"2026-08-12T06:58:59Z","title":"Do Not Let CNOTs Overwhelm the Decoder: Scheduling Transversal Gates for Fast FTQC","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-16T00:35:18.051746Z"},"links":{"citing_paper":"/paper/2608.11719"},"observation_digest":"sha256:3dbc22f03847afb682c9feb1895b3a04db82a8f523c60a2d201fdada45ce7e91","observation_id":"05d24885-6ea0-4390-acc5-eeb1e86e5273","resolution":{"observed_at":"2026-08-16T00:35:18.051746Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.13587","last_updated":"2025-06-20T04:04:22Z","snapshot_observed_at":"2026-08-16T21:29:49.832237Z","submitted_at":"2025-05-19T18:00:00Z","title":"Fast correlated decoding of transversal logical algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.13587","snapshot_observed_at":"2026-08-16T00:35:18.056954Z","title":"Geim, Aleksander Kubica, Mikhail D","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.11719","last_updated":"2026-08-12T06:58:59Z","snapshot_observed_at":"2026-08-19T00:28:21.242972Z","submitted_at":"2026-08-12T06:58:59Z","title":"Do Not Let CNOTs Overwhelm the Decoder: Scheduling Transversal Gates for Fast FTQC","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-16T00:35:18.056954Z"},"links":{"cited_paper":"/paper/2505.13587","citing_paper":"/paper/2608.11719"},"observation_digest":"sha256:5aa571f8bcea140321419f13eea0c57a3c10b325ac7f7e9cf7dc1c2da64abbc8","observation_id":"6d1c79bc-5432-4b2e-aba9-936b66e6367c","resolution":{"observed_at":"2026-08-16T00:35:18.056954Z","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":"10.1103/physrevlett.133.240602","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:35:18.592631Z","title":"Pablo Bonilla Ataides, Arthur Jaffe, Dolev Bluvstein, and Mikhail D","venue":null,"work_id":"258dc810-b5b4-498b-a589-425d270bc999","year":2024},"citing_paper":{"arxiv_id":"2608.11719","last_updated":"2026-08-12T06:58:59Z","snapshot_observed_at":"2026-08-19T00:28:21.242972Z","submitted_at":"2026-08-12T06:58:59Z","title":"Do Not Let CNOTs Overwhelm the Decoder: Scheduling Transversal Gates for Fast FTQC","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-16T00:35:18.062945Z"},"links":{"citing_paper":"/paper/2608.11719"},"observation_digest":"sha256:38416de8a12de44c4a611e11304c88abb87b903a629ce851c7e850d9005ea848","observation_id":"ee980a70-3a0b-4649-a63c-9445cc8b932f","resolution":{"observed_at":"2026-08-16T00:35:18.597870Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.22331/q-2018-01-04-43","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:35:18.576408Z","title":null,"venue":null,"work_id":"215d4529-0c34-4589-a45e-b165e63c31ee","year":2018},"citing_paper":{"arxiv_id":"2608.11719","last_updated":"2026-08-12T06:58:59Z","snapshot_observed_at":"2026-08-19T00:28:21.242972Z","submitted_at":"2026-08-12T06:58:59Z","title":"Do Not Let CNOTs Overwhelm the Decoder: Scheduling Transversal Gates for Fast FTQC","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-16T00:35:18.067743Z"},"links":{"citing_paper":"/paper/2608.11719"},"observation_digest":"sha256:b30909034829473cd26414f06b30cc5f2160a1c844744c472fac909ed23b26f1","observation_id":"2fd4aeb1-c1a8-48fa-9c53-b76a81b7911a","resolution":{"observed_at":"2026-08-16T00:35:18.581316Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2605.04459","last_updated":"2026-05-06T03:39:24Z","snapshot_observed_at":"2026-08-13T02:29:25.753089Z","submitted_at":"2026-05-06T03:39:24Z","title":"Triage: An Adaptive Parallel Window Decoding Scheduler for Real-time Fault-Tolerant Quantum Computation","version":1},"cited_work":{"arxiv_id":"2605.04459","doi":null,"metadata_source":"pith","pith_arxiv_id":"2605.04459","snapshot_observed_at":"2026-08-16T00:35:19.205063Z","title":"Triage: An Adaptive Parallel Window Decoding Scheduler for Real-time Fault-Tolerant Quantum Computation","venue":"quant-ph","work_id":"5b50d5b8-4206-49a5-b163-ccbc6789b003","year":2026},"citing_paper":{"arxiv_id":"2608.11719","last_updated":"2026-08-12T06:58:59Z","snapshot_observed_at":"2026-08-19T00:28:21.242972Z","submitted_at":"2026-08-12T06:58:59Z","title":"Do Not Let CNOTs Overwhelm the Decoder: Scheduling Transversal Gates for Fast FTQC","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-16T00:35:18.073242Z"},"links":{"cited_paper":"/paper/2605.04459","citing_paper":"/paper/2608.11719"},"observation_digest":"sha256:9977618db310e7946134a0f335aee65d8a3cc12ca062a842954e6b081e8c3de9","observation_id":"a18ec974-093f-44bb-92a2-e42625a98e90","resolution":{"observed_at":"2026-08-16T00:35:19.211935Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2606.22594","last_updated":"2026-06-21T17:03:15Z","snapshot_observed_at":"2026-08-18T05:19:08.418313Z","submitted_at":"2026-06-21T17:03:15Z","title":"Hierarchical Logical Processor on the Rotated Surface Code with Shuttle Buses","version":1},"cited_work":{"arxiv_id":"2606.22594","doi":null,"metadata_source":"pith","pith_arxiv_id":"2606.22594","snapshot_observed_at":"2026-08-16T00:35:19.176307Z","title":"Hierarchical Logical Processor on the Rotated Surface Code with Shuttle Buses","venue":"quant-ph","work_id":"78a9557f-2729-440b-bea1-881197778737","year":2026},"citing_paper":{"arxiv_id":"2608.11719","last_updated":"2026-08-12T06:58:59Z","snapshot_observed_at":"2026-08-19T00:28:21.242972Z","submitted_at":"2026-08-12T06:58:59Z","title":"Do Not Let CNOTs Overwhelm the Decoder: Scheduling Transversal Gates for Fast FTQC","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-16T00:35:18.079997Z"},"links":{"cited_paper":"/paper/2606.22594","citing_paper":"/paper/2608.11719"},"observation_digest":"sha256:8fa669ec1e3ed7e122c68c3b05d28d9ff739eaf7dc5930ca366fbdd9ca126c27","observation_id":"cdad69e9-1b8b-4c7d-9e59-c2c419c9f840","resolution":{"observed_at":"2026-08-16T00:35:19.182185Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T00:35:18.086335Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.11719","last_updated":"2026-08-12T06:58:59Z","snapshot_observed_at":"2026-08-19T00:28:21.242972Z","submitted_at":"2026-08-12T06:58:59Z","title":"Do Not Let CNOTs Overwhelm the Decoder: Scheduling Transversal Gates for Fast FTQC","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-16T00:35:18.086335Z"},"links":{"citing_paper":"/paper/2608.11719"},"observation_digest":"sha256:1e8b35ee22c60dda7570c782547eca19a94c4424a6b97aa7b8934347a56900e8","observation_id":"6bdf00f1-655e-40bf-b35a-11377a4b01e1","resolution":{"observed_at":"2026-08-16T00:35:18.086335Z","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":"10.1103/7r3w-","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:35:18.551315Z","title":null,"venue":null,"work_id":"3c19e953-27cf-4c74-85b0-6cfc1d77a275","year":2025},"citing_paper":{"arxiv_id":"2608.11719","last_updated":"2026-08-12T06:58:59Z","snapshot_observed_at":"2026-08-19T00:28:21.242972Z","submitted_at":"2026-08-12T06:58:59Z","title":"Do Not Let CNOTs Overwhelm the Decoder: Scheduling Transversal Gates for Fast FTQC","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-16T00:35:18.091974Z"},"links":{"citing_paper":"/paper/2608.11719"},"observation_digest":"sha256:3908ff1fe09af48581e3fec6cb5567a69378d25cb30622a5404ba439a586122c","observation_id":"bce4bf6d-8e26-4d9d-ac0e-b72b21eb7a61","resolution":{"observed_at":"2026-08-16T00:35:18.556136Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.22331/q-2021-12-","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:35:18.534516Z","title":"Nickerson","venue":null,"work_id":"f0e578c6-4af7-4e06-ba12-a19ca63dcb6b","year":2021},"citing_paper":{"arxiv_id":"2608.11719","last_updated":"2026-08-12T06:58:59Z","snapshot_observed_at":"2026-08-19T00:28:21.242972Z","submitted_at":"2026-08-12T06:58:59Z","title":"Do Not Let CNOTs Overwhelm the Decoder: Scheduling Transversal Gates for Fast FTQC","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-16T00:35:18.097992Z"},"links":{"citing_paper":"/paper/2608.11719"},"observation_digest":"sha256:ef0f11586454c38f6cf0d940e1b8cbfe9e8e34108631c54439ddbb824fcd7bf5","observation_id":"cacc9e88-d4f9-43b7-b573-7d0009052c88","resolution":{"observed_at":"2026-08-16T00:35:18.540259Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T00:35:18.103250Z","title":null,"venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2608.11719","last_updated":"2026-08-12T06:58:59Z","snapshot_observed_at":"2026-08-19T00:28:21.242972Z","submitted_at":"2026-08-12T06:58:59Z","title":"Do Not Let CNOTs Overwhelm the Decoder: Scheduling Transversal Gates for Fast FTQC","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-16T00:35:18.103250Z"},"links":{"citing_paper":"/paper/2608.11719"},"observation_digest":"sha256:d3e81adaade1a16c0eb6f47cbb2d7e6da5b27bffe0cd4497a2eafb6aed921625","observation_id":"bcdbecd3-6890-4bb1-916e-b65205b695e7","resolution":{"observed_at":"2026-08-16T00:35:18.103250Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1808.06709","last_updated":"2019-08-30T22:12:41Z","snapshot_observed_at":"2026-08-16T15:23:35.174641Z","submitted_at":"2018-08-20T22:09:39Z","title":"Low overhead quantum computation using lattice surgery","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1808.06709","snapshot_observed_at":"2026-08-16T00:35:18.108417Z","title":"Fowler and Craig Gidney","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2608.11719","last_updated":"2026-08-12T06:58:59Z","snapshot_observed_at":"2026-08-19T00:28:21.242972Z","submitted_at":"2026-08-12T06:58:59Z","title":"Do Not Let CNOTs Overwhelm the Decoder: Scheduling Transversal Gates for Fast FTQC","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-16T00:35:18.108417Z"},"links":{"cited_paper":"/paper/1808.06709","citing_paper":"/paper/2608.11719"},"observation_digest":"sha256:427e1d3c9bd9adc7ffd250e95673360045f8da2bc3019fe2b9f38041fb2916ab","observation_id":"3e22612c-b6e1-4cb4-b896-9eb2470885b5","resolution":{"observed_at":"2026-08-16T00:35:18.108417Z","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-16T00:35:18.113649Z","title":"Fowler, Matteo Mariantoni, John M","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2608.11719","last_updated":"2026-08-12T06:58:59Z","snapshot_observed_at":"2026-08-19T00:28:21.242972Z","submitted_at":"2026-08-12T06:58:59Z","title":"Do Not Let CNOTs Overwhelm the Decoder: Scheduling Transversal Gates for Fast FTQC","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-16T00:35:18.113649Z"},"links":{"citing_paper":"/paper/2608.11719"},"observation_digest":"sha256:732c66bb1a8640f47dbc0ca3d445d3a9df982298a5cea8158ef2b031f3f950fa","observation_id":"0051a4f7-bdc7-4f8e-9398-abe429c803fa","resolution":{"observed_at":"2026-08-16T00:35:18.113649Z","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-16T00:35:19.494033Z","title":null,"venue":null,"work_id":"a81a95c8-a24e-4d88-91c0-f648010f73b9","year":2021},"citing_paper":{"arxiv_id":"2608.11719","last_updated":"2026-08-12T06:58:59Z","snapshot_observed_at":"2026-08-19T00:28:21.242972Z","submitted_at":"2026-08-12T06:58:59Z","title":"Do Not Let CNOTs Overwhelm the Decoder: Scheduling Transversal Gates for Fast FTQC","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-16T00:35:18.118391Z"},"links":{"citing_paper":"/paper/2608.11719"},"observation_digest":"sha256:6a148becf7ffa5cd1ee3b7a9d311c6cd3674ed65493e4973037ee91efb6b2a25","observation_id":"92ee262f-58fe-411d-9746-93e215ecba0f","resolution":{"observed_at":"2026-08-16T00:35:19.498756Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T00:35:18.128425Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.11719","last_updated":"2026-08-12T06:58:59Z","snapshot_observed_at":"2026-08-19T00:28:21.242972Z","submitted_at":"2026-08-12T06:58:59Z","title":"Do Not Let CNOTs Overwhelm the Decoder: Scheduling Transversal Gates for Fast FTQC","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-16T00:35:18.128425Z"},"links":{"citing_paper":"/paper/2608.11719"},"observation_digest":"sha256:92f146f43ec83ad451109b2ecaed4fa0c627ad9a0dd5bf634d8cc79f7dac4990","observation_id":"98524c65-658b-4275-affa-9102ae7c0ec4","resolution":{"observed_at":"2026-08-16T00:35:18.128425Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.17595","last_updated":"2024-09-26T07:21:58Z","snapshot_observed_at":"2026-08-13T21:53:07.774758Z","submitted_at":"2024-09-26T07:21:58Z","title":"Magic state cultivation: growing T states as cheap as CNOT gates","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.17595","snapshot_observed_at":"2026-08-16T00:35:18.142351Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.11719","last_updated":"2026-08-12T06:58:59Z","snapshot_observed_at":"2026-08-19T00:28:21.242972Z","submitted_at":"2026-08-12T06:58:59Z","title":"Do Not Let CNOTs Overwhelm the Decoder: Scheduling Transversal Gates for Fast FTQC","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-16T00:35:18.142351Z"},"links":{"cited_paper":"/paper/2409.17595","citing_paper":"/paper/2608.11719"},"observation_digest":"sha256:48fe960ee609fa551fe7100750b2fe41aa1bb3a32986c88b15e4fc1415ca95ad","observation_id":"26f3fd1c-b7de-445a-bd77-a1256117ae66","resolution":{"observed_at":"2026-08-16T00:35:18.142351Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.18901","last_updated":"2024-03-27T18:00:04Z","snapshot_observed_at":"2026-08-19T00:15:17.641019Z","submitted_at":"2024-03-27T18:00:04Z","title":"Toward Low-latency Iterative Decoding of QLDPC Codes Under Circuit-Level Noise","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.18901","snapshot_observed_at":"2026-08-16T00:35:18.147705Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.11719","last_updated":"2026-08-12T06:58:59Z","snapshot_observed_at":"2026-08-19T00:28:21.242972Z","submitted_at":"2026-08-12T06:58:59Z","title":"Do Not Let CNOTs Overwhelm the Decoder: Scheduling Transversal Gates for Fast FTQC","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-16T00:35:18.147705Z"},"links":{"cited_paper":"/paper/2403.18901","citing_paper":"/paper/2608.11719"},"observation_digest":"sha256:ece8ced85425251da4f6e02ff8128b976c11abbcba3f87ed34d8e9563de22a0b","observation_id":"4cdf7f5c-5c70-4c4d-ac8e-fd78a0163d9a","resolution":{"observed_at":"2026-08-16T00:35:18.147705Z","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-16T00:35:18.154133Z","title":null,"venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2608.11719","last_updated":"2026-08-12T06:58:59Z","snapshot_observed_at":"2026-08-19T00:28:21.242972Z","submitted_at":"2026-08-12T06:58:59Z","title":"Do Not Let CNOTs Overwhelm the Decoder: Scheduling Transversal Gates for Fast FTQC","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-16T00:35:18.154133Z"},"links":{"citing_paper":"/paper/2608.11719"},"observation_digest":"sha256:a2bbebae34967bee1e13bf003a86911130e983037dd5d064ddcb9705cb1b1b96","observation_id":"d3f934ea-52e3-4a57-bac2-3cbb5e869c13","resolution":{"observed_at":"2026-08-16T00:35:18.154133Z","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-16T00:35:19.478294Z","title":"Griffiths and Dan E","venue":null,"work_id":"0ecd865d-a72c-4a03-a702-1f93d219da8c","year":2024},"citing_paper":{"arxiv_id":"2608.11719","last_updated":"2026-08-12T06:58:59Z","snapshot_observed_at":"2026-08-19T00:28:21.242972Z","submitted_at":"2026-08-12T06:58:59Z","title":"Do Not Let CNOTs Overwhelm the Decoder: Scheduling Transversal Gates for Fast FTQC","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-16T00:35:18.160333Z"},"links":{"citing_paper":"/paper/2608.11719"},"observation_digest":"sha256:bb0566bc45a6e85b967d6fd05f95e9b802d4c4c2ad2595d972cca6d4e08194af","observation_id":"229be22d-6f36-4156-becb-70d50cd5cf54","resolution":{"observed_at":"2026-08-16T00:35:19.483192Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T00:35:18.165608Z","title":"Martyn, Shifan Xu, Diana Chamaki, Ethan Decker, Ying Mao, Luis F","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.11719","last_updated":"2026-08-12T06:58:59Z","snapshot_observed_at":"2026-08-19T00:28:21.242972Z","submitted_at":"2026-08-12T06:58:59Z","title":"Do Not Let CNOTs Overwhelm the Decoder: Scheduling Transversal Gates for Fast FTQC","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-16T00:35:18.165608Z"},"links":{"citing_paper":"/paper/2608.11719"},"observation_digest":"sha256:bf416dd757bb8af7bb9d205b9913fe745e1bf12b042fe2925811f6c0213e56af","observation_id":"8c08347d-f552-46e8-b63b-0e1fd2adbc72","resolution":{"observed_at":"2026-08-16T00:35:18.165608Z","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-16T00:35:18.171237Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.11719","last_updated":"2026-08-12T06:58:59Z","snapshot_observed_at":"2026-08-19T00:28:21.242972Z","submitted_at":"2026-08-12T06:58:59Z","title":"Do Not Let CNOTs Overwhelm the Decoder: Scheduling Transversal Gates for Fast FTQC","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-16T00:35:18.171237Z"},"links":{"citing_paper":"/paper/2608.11719"},"observation_digest":"sha256:c9493fa8a4b1cfbc573effbfb36600613e6523fa040f9ed2bc0a703e34bc7537","observation_id":"e43c890d-3da5-4986-8b67-ffbd4861e4c9","resolution":{"observed_at":"2026-08-16T00:35:18.171237Z","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-16T00:35:18.181517Z","title":"Fowler, Simon Devitt, and Rodney Van Meter","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2608.11719","last_updated":"2026-08-12T06:58:59Z","snapshot_observed_at":"2026-08-19T00:28:21.242972Z","submitted_at":"2026-08-12T06:58:59Z","title":"Do Not Let CNOTs Overwhelm the Decoder: Scheduling Transversal Gates for Fast FTQC","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-16T00:35:18.181517Z"},"links":{"citing_paper":"/paper/2608.11719"},"observation_digest":"sha256:9249a06cfe5288ac26b015b78426ea19ce455c74e845cf0342fb3473059e25af","observation_id":"5b663cbe-e3d9-46b1-9308-8536c64c8ef1","resolution":{"observed_at":"2026-08-16T00:35:18.181517Z","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":"10.1038/s41534-026-01242-x","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:35:18.439134Z","title":"English, and Stephen D","venue":null,"work_id":"fb38c8a2-3489-41e1-bc92-c52c1749773b","year":2026},"citing_paper":{"arxiv_id":"2608.11719","last_updated":"2026-08-12T06:58:59Z","snapshot_observed_at":"2026-08-19T00:28:21.242972Z","submitted_at":"2026-08-12T06:58:59Z","title":"Do Not Let CNOTs Overwhelm the Decoder: Scheduling Transversal Gates for Fast FTQC","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-16T00:35:18.186310Z"},"links":{"citing_paper":"/paper/2608.11719"},"observation_digest":"sha256:abfa07c4387fd496d84b0579939c2e4b60d4ae29c63b9674c63c1f34b1f1ce7b","observation_id":"d1b76cc1-b3e2-4a6f-86e1-3fe21161e223","resolution":{"observed_at":"2026-08-16T00:35:18.445347Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T00:35:18.191345Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.11719","last_updated":"2026-08-12T06:58:59Z","snapshot_observed_at":"2026-08-19T00:28:21.242972Z","submitted_at":"2026-08-12T06:58:59Z","title":"Do Not Let CNOTs Overwhelm the Decoder: Scheduling Transversal Gates for Fast FTQC","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-16T00:35:18.191345Z"},"links":{"citing_paper":"/paper/2608.11719"},"observation_digest":"sha256:b817a027730207d57988608dc80c631ea2b04582603b5886d44501904bfb3f16","observation_id":"cb8c09a3-533c-4268-b4e2-940e337d773a","resolution":{"observed_at":"2026-08-16T00:35:18.191345Z","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-16T00:35:18.196533Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.11719","last_updated":"2026-08-12T06:58:59Z","snapshot_observed_at":"2026-08-19T00:28:21.242972Z","submitted_at":"2026-08-12T06:58:59Z","title":"Do Not Let CNOTs Overwhelm the Decoder: Scheduling Transversal Gates for Fast FTQC","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-16T00:35:18.196533Z"},"links":{"citing_paper":"/paper/2608.11719"},"observation_digest":"sha256:eb0e0bef4413cd90d6bc2be62aecbaf4a79c32767f1a96a387d6f78113144f4a","observation_id":"a26eb2a4-a9b6-471d-8e61-430c1f5763fb","resolution":{"observed_at":"2026-08-16T00:35:18.196533Z","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-16T00:35:18.202790Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.11719","last_updated":"2026-08-12T06:58:59Z","snapshot_observed_at":"2026-08-19T00:28:21.242972Z","submitted_at":"2026-08-12T06:58:59Z","title":"Do Not Let CNOTs Overwhelm the Decoder: Scheduling Transversal Gates for Fast FTQC","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-16T00:35:18.202790Z"},"links":{"citing_paper":"/paper/2608.11719"},"observation_digest":"sha256:81efc38c70ae993d70735f4b5c596d6c6be6fdd0ebc5c7c62515e2a01e98464b","observation_id":"99b3a370-ea55-46c2-b107-66c922faacd9","resolution":{"observed_at":"2026-08-16T00:35:18.202790Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.17995","last_updated":"2026-03-11T16:38:21Z","snapshot_observed_at":"2026-07-06T18:37:04.753504Z","submitted_at":"2024-06-26T00:50:10Z","title":"Managing Classical Processing Requirements for Quantum Error Correction","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.17995","snapshot_observed_at":"2026-08-16T00:35:18.207647Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.11719","last_updated":"2026-08-12T06:58:59Z","snapshot_observed_at":"2026-08-19T00:28:21.242972Z","submitted_at":"2026-08-12T06:58:59Z","title":"Do Not Let CNOTs Overwhelm the Decoder: Scheduling Transversal Gates for Fast FTQC","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-16T00:35:18.207647Z"},"links":{"cited_paper":"/paper/2406.17995","citing_paper":"/paper/2608.11719"},"observation_digest":"sha256:039a77e6b7954d9229d6a49eaaee9755aa302cf0c58b3f35a84405262023e90c","observation_id":"463ec70a-9279-4a97-a88c-d7d434dbd673","resolution":{"observed_at":"2026-08-16T00:35:18.207647Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.01779","last_updated":"2025-08-22T12:35:33Z","snapshot_observed_at":"2026-08-14T09:32:22.319151Z","submitted_at":"2025-06-02T15:23:00Z","title":"Improved belief propagation is sufficient for real-time decoding of quantum memory","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.01779","snapshot_observed_at":"2026-08-16T00:35:18.212969Z","title":"Beverland, Markus Bühler, Blake R","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.11719","last_updated":"2026-08-12T06:58:59Z","snapshot_observed_at":"2026-08-19T00:28:21.242972Z","submitted_at":"2026-08-12T06:58:59Z","title":"Do Not Let CNOTs Overwhelm the Decoder: Scheduling Transversal Gates for Fast FTQC","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-16T00:35:18.212969Z"},"links":{"cited_paper":"/paper/2506.01779","citing_paper":"/paper/2608.11719"},"observation_digest":"sha256:ebbf67b27d061b056b5560cc9e151e29136e3831886e7d9b57e76f2a587d701d","observation_id":"d59e6b8c-2a9b-40a5-a8f6-9db8f87fcee8","resolution":{"observed_at":"2026-08-16T00:35:18.212969Z","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-16T00:35:18.218112Z","title":"Nielsen and Isaac L","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2608.11719","last_updated":"2026-08-12T06:58:59Z","snapshot_observed_at":"2026-08-19T00:28:21.242972Z","submitted_at":"2026-08-12T06:58:59Z","title":"Do Not Let CNOTs Overwhelm the Decoder: Scheduling Transversal Gates for Fast FTQC","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-16T00:35:18.218112Z"},"links":{"citing_paper":"/paper/2608.11719"},"observation_digest":"sha256:6ffbe370b85b893c11d47a032c515eb9fe398677fb38dff4b4026b2b326367fe","observation_id":"ed42e1bb-e0a4-4253-bcd3-1f9145af8c31","resolution":{"observed_at":"2026-08-16T00:35:18.218112Z","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-16T00:35:18.224931Z","title":"Riesebos, X","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2608.11719","last_updated":"2026-08-12T06:58:59Z","snapshot_observed_at":"2026-08-19T00:28:21.242972Z","submitted_at":"2026-08-12T06:58:59Z","title":"Do Not Let CNOTs Overwhelm the Decoder: Scheduling Transversal Gates for Fast FTQC","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-16T00:35:18.224931Z"},"links":{"citing_paper":"/paper/2608.11719"},"observation_digest":"sha256:f1549ad5c24430876e8803c4be2f68c7dcec30a619e0d9c682fc52639edd7ef1","observation_id":"316e9e28-6a6e-428a-87eb-2a9b7b2e6c2d","resolution":{"observed_at":"2026-08-16T00:35:18.224931Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2005.07016","last_updated":"2020-12-29T12:29:32Z","snapshot_observed_at":"2026-08-09T10:57:38.741654Z","submitted_at":"2020-05-14T14:33:08Z","title":"Decoding Across the Quantum LDPC Code Landscape","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.07016","snapshot_observed_at":"2026-08-16T00:35:18.230316Z","title":"White, Simon Burton, and Earl T","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2608.11719","last_updated":"2026-08-12T06:58:59Z","snapshot_observed_at":"2026-08-19T00:28:21.242972Z","submitted_at":"2026-08-12T06:58:59Z","title":"Do Not Let CNOTs Overwhelm the Decoder: Scheduling Transversal Gates for Fast FTQC","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-16T00:35:18.230316Z"},"links":{"cited_paper":"/paper/2005.07016","citing_paper":"/paper/2608.11719"},"observation_digest":"sha256:594b9adae734785616f167cdeefdc397f712b059bfee1e7a6dd900f2da211861","observation_id":"f716ca47-d280-4a7c-9b3f-ad9e531ca446","resolution":{"observed_at":"2026-08-16T00:35:18.230316Z","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-16T00:35:18.238768Z","title":"Ross and Peter Selinger","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2608.11719","last_updated":"2026-08-12T06:58:59Z","snapshot_observed_at":"2026-08-19T00:28:21.242972Z","submitted_at":"2026-08-12T06:58:59Z","title":"Do Not Let CNOTs Overwhelm the Decoder: Scheduling Transversal Gates for Fast FTQC","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-16T00:35:18.238768Z"},"links":{"citing_paper":"/paper/2608.11719"},"observation_digest":"sha256:ac9ad56dddad789f7ee87e76144a94d95686cb37ba1ca7bd0571a9fe5684d302","observation_id":"41ef94ed-83a6-4174-9826-4b6aff748f44","resolution":{"observed_at":"2026-08-16T00:35:18.238768Z","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-16T00:35:18.244822Z","title":"Brown, and Shruti Puri","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.11719","last_updated":"2026-08-12T06:58:59Z","snapshot_observed_at":"2026-08-19T00:28:21.242972Z","submitted_at":"2026-08-12T06:58:59Z","title":"Do Not Let CNOTs Overwhelm the Decoder: Scheduling Transversal Gates for Fast FTQC","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-16T00:35:18.244822Z"},"links":{"citing_paper":"/paper/2608.11719"},"observation_digest":"sha256:f8ff28e7daa1b95baeb284c766e71814394f1d3cffbf5168e5034ae0794ca6f4","observation_id":"f6556e01-3d08-469b-9446-a8b3266cf75a","resolution":{"observed_at":"2026-08-16T00:35:18.244822Z","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-16T00:35:18.249621Z","title":"Browne, Kenton M","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.11719","last_updated":"2026-08-12T06:58:59Z","snapshot_observed_at":"2026-08-19T00:28:21.242972Z","submitted_at":"2026-08-12T06:58:59Z","title":"Do Not Let CNOTs Overwhelm the Decoder: Scheduling Transversal Gates for Fast FTQC","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-16T00:35:18.249621Z"},"links":{"citing_paper":"/paper/2608.11719"},"observation_digest":"sha256:dbf4cad1b995d18e52b2a6cb1effe37159a22ee94d264ddb04a27619a9c487f3","observation_id":"9d27dd39-2b82-405e-a023-a53d7c02e965","resolution":{"observed_at":"2026-08-16T00:35:18.249621Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.18979","last_updated":"2025-06-23T18:00:02Z","snapshot_observed_at":"2026-08-16T15:24:50.505072Z","submitted_at":"2025-06-23T18:00:02Z","title":"Transversal Surface-Code Game Powered by Neutral Atoms","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.18979","snapshot_observed_at":"2026-08-16T00:35:18.254113Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.11719","last_updated":"2026-08-12T06:58:59Z","snapshot_observed_at":"2026-08-19T00:28:21.242972Z","submitted_at":"2026-08-12T06:58:59Z","title":"Do Not Let CNOTs Overwhelm the Decoder: Scheduling Transversal Gates for Fast FTQC","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-16T00:35:18.254113Z"},"links":{"cited_paper":"/paper/2506.18979","citing_paper":"/paper/2608.11719"},"observation_digest":"sha256:4391a3a56bdcc225f2a16acff1cb77a3ad9ab598c800d9bdbb1c67225f159467","observation_id":"66867dc4-cf0b-492c-a380-84ed1adf546c","resolution":{"observed_at":"2026-08-16T00:35:18.254113Z","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-16T00:35:18.259056Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2608.11719","last_updated":"2026-08-12T06:58:59Z","snapshot_observed_at":"2026-08-19T00:28:21.242972Z","submitted_at":"2026-08-12T06:58:59Z","title":"Do Not Let CNOTs Overwhelm the Decoder: Scheduling Transversal Gates for Fast FTQC","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-16T00:35:18.259056Z"},"links":{"citing_paper":"/paper/2608.11719"},"observation_digest":"sha256:97361d54a703616cc2f6e1f0fa2cb293f4b34be6cb6b1cb2b52f16853c47002c","observation_id":"7312baec-aa8e-4f1f-867f-b1d898222344","resolution":{"observed_at":"2026-08-16T00:35:18.259056Z","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-16T00:35:18.264078Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.11719","last_updated":"2026-08-12T06:58:59Z","snapshot_observed_at":"2026-08-19T00:28:21.242972Z","submitted_at":"2026-08-12T06:58:59Z","title":"Do Not Let CNOTs Overwhelm the Decoder: Scheduling Transversal Gates for Fast FTQC","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-16T00:35:18.264078Z"},"links":{"citing_paper":"/paper/2608.11719"},"observation_digest":"sha256:0d0c8831feee27f145abdfd70ea9581c71da6030782dd7329b7363b02cb55c41","observation_id":"10565f2f-f486-4b5b-9ae4-3527f762a60a","resolution":{"observed_at":"2026-08-16T00:35:18.264078Z","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-16T00:35:18.269178Z","title":"Chadwick, Sarang Joshi, Gokul Subramanian Ravi, Yan- jing Li, and Frederic T","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.11719","last_updated":"2026-08-12T06:58:59Z","snapshot_observed_at":"2026-08-19T00:28:21.242972Z","submitted_at":"2026-08-12T06:58:59Z","title":"Do Not Let CNOTs Overwhelm the Decoder: Scheduling Transversal Gates for Fast FTQC","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-16T00:35:18.269178Z"},"links":{"cited_paper":"/paper/2412.05115","citing_paper":"/paper/2608.11719"},"observation_digest":"sha256:ccc6fbc237bc0a600752f7e265c027b305a64c999857aa6f0e2d92a821ee6084","observation_id":"88729553-4c06-4c2c-a2d8-c26bbf668d6c","resolution":{"observed_at":"2026-08-16T00:35:18.269178Z","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-16T00:35:19.463219Z","title":"Fowler, and Winfried K","venue":null,"work_id":"374499cd-a424-447c-b6b7-97abe37c90eb","year":null},"citing_paper":{"arxiv_id":"2608.11719","last_updated":"2026-08-12T06:58:59Z","snapshot_observed_at":"2026-08-19T00:28:21.242972Z","submitted_at":"2026-08-12T06:58:59Z","title":"Do Not Let CNOTs Overwhelm the Decoder: Scheduling Transversal Gates for Fast FTQC","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-16T00:35:18.282472Z"},"links":{"citing_paper":"/paper/2608.11719"},"observation_digest":"sha256:638e56ff3dcca99411188b4bb6d4423167e325597f89aa8bd266160768835b25","observation_id":"1e2bb1ea-c514-41cc-8798-e0c00127cb82","resolution":{"observed_at":"2026-08-16T00:35:19.467795Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T00:35:18.294237Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.11719","last_updated":"2026-08-12T06:58:59Z","snapshot_observed_at":"2026-08-19T00:28:21.242972Z","submitted_at":"2026-08-12T06:58:59Z","title":"Do Not Let CNOTs Overwhelm the Decoder: Scheduling Transversal Gates for Fast FTQC","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-16T00:35:18.294237Z"},"links":{"citing_paper":"/paper/2608.11719"},"observation_digest":"sha256:4ba456c29113353f172353640eb8bab4a54b5213f43528ad8ebf8b396196fc2f","observation_id":"d1728d91-19a0-4c6a-af8f-652d3bcfefce","resolution":{"observed_at":"2026-08-16T00:35:18.294237Z","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-16T00:35:18.298743Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.11719","last_updated":"2026-08-12T06:58:59Z","snapshot_observed_at":"2026-08-19T00:28:21.242972Z","submitted_at":"2026-08-12T06:58:59Z","title":"Do Not Let CNOTs Overwhelm the Decoder: Scheduling Transversal Gates for Fast FTQC","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-16T00:35:18.298743Z"},"links":{"citing_paper":"/paper/2608.11719"},"observation_digest":"sha256:cf72a852d4ca1727c9992529ff2458d04bcd1393162f4b21cbd94d91315c68ed","observation_id":"9b682aca-bfe1-4b43-8db7-6cad931232aa","resolution":{"observed_at":"2026-08-16T00:35:18.298743Z","resolver_source":null,"status":"malformed_identifier"},"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-16T00:35:18.303786Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.11719","last_updated":"2026-08-12T06:58:59Z","snapshot_observed_at":"2026-08-19T00:28:21.242972Z","submitted_at":"2026-08-12T06:58:59Z","title":"Do Not Let CNOTs Overwhelm the Decoder: Scheduling Transversal Gates for Fast FTQC","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-16T00:35:18.303786Z"},"links":{"citing_paper":"/paper/2608.11719"},"observation_digest":"sha256:20a92eee7595c014e9c32007239abc3c470e23b81f754620d480bccfdf1c28c4","observation_id":"09455e01-413d-4abf-bd8b-76fb19702caa","resolution":{"observed_at":"2026-08-16T00:35:18.303786Z","resolver_source":null,"status":"malformed_identifier"},"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-16T00:35:18.308370Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.11719","last_updated":"2026-08-12T06:58:59Z","snapshot_observed_at":"2026-08-19T00:28:21.242972Z","submitted_at":"2026-08-12T06:58:59Z","title":"Do Not Let CNOTs Overwhelm the Decoder: Scheduling Transversal Gates for Fast FTQC","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-16T00:35:18.308370Z"},"links":{"citing_paper":"/paper/2608.11719"},"observation_digest":"sha256:d2114c1aa7b6642d7e7773f8f64661c2058a79486274074c6ef45aebd15bf751","observation_id":"ac032de0-fb63-40c8-86d9-2b9e76e9670a","resolution":{"observed_at":"2026-08-16T00:35:18.308370Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2604.16613","last_updated":"2026-08-06T17:08:15Z","snapshot_observed_at":"2026-08-09T23:12:11.510298Z","submitted_at":"2026-04-17T18:11:20Z","title":"GreenPeas: Unlocking adaptive quantum error correction with just-in-time decoding hypergraphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2604.16613","snapshot_observed_at":"2026-08-16T00:35:18.313342Z","title":"Ziad, Jubo Xu, and Hongxiang Fan","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.11719","last_updated":"2026-08-12T06:58:59Z","snapshot_observed_at":"2026-08-19T00:28:21.242972Z","submitted_at":"2026-08-12T06:58:59Z","title":"Do Not Let CNOTs Overwhelm the Decoder: Scheduling Transversal Gates for Fast FTQC","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-16T00:35:18.313342Z"},"links":{"cited_paper":"/paper/2604.16613","citing_paper":"/paper/2608.11719"},"observation_digest":"sha256:d2e63c7ae56405738efc0a0715ef2c4a7eda646728390a998a5d145268525091","observation_id":"abc25564-14dc-4908-9606-16bacc8f05b0","resolution":{"observed_at":"2026-08-16T00:35:18.313342Z","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-16T00:35:18.122978Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.11719","last_updated":"2026-08-12T06:58:59Z","snapshot_observed_at":"2026-08-19T00:28:21.242972Z","submitted_at":"2026-08-12T06:58:59Z","title":"Do Not Let CNOTs Overwhelm the Decoder: Scheduling Transversal Gates for Fast FTQC","version":1},"reference_index":497,"source":"pdf_text","source_observed_at":"2026-08-16T00:35:18.122978Z"},"links":{"citing_paper":"/paper/2608.11719"},"observation_digest":"sha256:d01754726d15cf2c9b3135aa096447d55c21cd65bab3e4e4c42194454e141294","observation_id":"0f291cdd-9741-4d43-bd22-ca580dafbf1f","resolution":{"observed_at":"2026-08-16T00:35:18.122978Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.20976","last_updated":"2025-04-10T18:47:07Z","snapshot_observed_at":"2026-08-18T05:19:40.866038Z","submitted_at":"2024-07-30T17:10:10Z","title":"An iterative transversal CNOT decoder","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.20976","snapshot_observed_at":"2026-08-16T00:35:18.288428Z","title":"arXiv:2407.20976","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.11719","last_updated":"2026-08-12T06:58:59Z","snapshot_observed_at":"2026-08-19T00:28:21.242972Z","submitted_at":"2026-08-12T06:58:59Z","title":"Do Not Let CNOTs Overwhelm the Decoder: Scheduling Transversal Gates for Fast FTQC","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-16T00:35:18.288428Z"},"links":{"cited_paper":"/paper/2407.20976","citing_paper":"/paper/2608.11719"},"observation_digest":"sha256:d6edd3adc18bae28d7ab77e75a3c684621538b54a04a3b94ec543c0c504f4613","observation_id":"c2084ff7-c714-4adc-9fa0-e6c9b0285197","resolution":{"observed_at":"2026-08-16T00:35:18.288428Z","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-16T00:35:18.008835Z","title":"arXiv:2511.15177","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.11719","last_updated":"2026-08-12T06:58:59Z","snapshot_observed_at":"2026-08-19T00:28:21.242972Z","submitted_at":"2026-08-12T06:58:59Z","title":"Do Not Let CNOTs Overwhelm the Decoder: Scheduling Transversal Gates for Fast FTQC","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-16T00:35:18.008835Z"},"links":{"citing_paper":"/paper/2608.11719"},"observation_digest":"sha256:c67c4a7d642adcdb1204913048cdb2c739fde5bfeb3aec4dad8cd6a35ca4e2a2","observation_id":"a6c3a35b-e8f7-4c00-9ef2-05a3da28636e","resolution":{"observed_at":"2026-08-16T00:35:18.008835Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2608.11719","last_updated":"2026-08-12T06:58:59Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-19T00:28:21.242972Z","submitted_at":"2026-08-12T06:58:59Z","title":"Do Not Let CNOTs Overwhelm the Decoder: Scheduling Transversal Gates for Fast FTQC"},"reference_resolution":{"displayed":56,"state_counts":{"malformed_identifier":8,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":41,"verified_exact":5,"verified_fuzzy":2},"total_outbound_references":56},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 56 of 56 outbound references and 0 inbound Pith citation observations for arXiv:2608.11719."}