{"as_of":"2026-08-17T22:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:69db4f491fedd61385cbecff04894087e64a62868c7f73940b48700ad5a4240f","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-17T06:30:58.91139+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-16T15:24:17.526914Z","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:e86274e6feb60d4aa91316551d13c8222b0ca6a996fa6db67132ff042b00d34b","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-16T15:24:17.526914Z","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:a417208d635bde1b96ba0ff57df4f7e1881c0a234c3b087019486972e8cb2f9f","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-16T15:24:17.526914Z","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:17f9f1194910f92b033fe7451bd2d1c11b1895ca4fae8e3dc07a0f340cc84707","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-16T15:24:17.526914Z","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:89fae7949a9d3ba316394938aae1ac8dcc66d9619c4560acc23d0b6c1ada13f6","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T15:24:17.526914Z","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:31467e7b514ff253b4b75e12ad8b5ed1cce4210cb36c016f63995f742a94041b","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-16T15:24:17.526914Z","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:70edda7bffad03af6ae1a08679350119d95a4b0622d3e76ec625da480931d60f","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-16T15:24:17.526914Z","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:dfff0f255bed062cddc900a3529f1df2df2db094bdc0e280b5a90175a5609b00","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-16T15:24:17.526914Z","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:d7747bc54431597f36126cc1b53fc08c562e19e2be971f87cf357c0a0d04aeae","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-17T13:12:55.970157Z","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-16T15:24:17.526914Z","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:8db8e47f4703b0ea111e4a043409c20c0ce1189eede55c657929bf6d7d3160ba","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-16T15:24:17.526914Z","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:adbf10ebf263ef4bdcf8481a0c937adad86d5b71f884bfee2623e2edada062f0","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-16T15:24:17.526914Z","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:115c45be2d0283b5533f82771a86c02db54b4cd9e413af390a3a63e2c6fad290","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-16T15:24:17.526914Z","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:68c46555207a5009aa4463c3233e174126fd84ea1c394ee1c32562593fb05cb8","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-16T15:24:17.526914Z","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:ac14d51465a3719666ea321b42ab8b7343af79607e53b8ab6aabf2995d089f4d","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T15:24:17.526914Z","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:4dccde8e5a07b8d14f1b4ea111e111163180ab7eb84e305868046e685d33f0fc","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T15:24:17.526914Z","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:50612a7f8e812420f315618bf4d327608025fcf79444877f361ce7db8fa8af86","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-02T07:35:19.423502Z","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-16T15:24:17.526914Z","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:80c45b8ec7ef15f2e16b951c1a6c7f8f61706ee71bca6506ef3553a0a606a6c4","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T15:24:17.526914Z","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:22ad8a8bbb495b263f63a7f1484bbef1facb6452469e04fd61e2466fd1d22f1d","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-16T15:24:17.526914Z","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:6b7d27d5c1629a15114998ef7017ae8ff17e99ce2e33f2136af1ba769cd82522","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T15:24:17.526914Z","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:09a8b892b79b6b1a937972891a5cc909578aa96bc0ebc870a69c362cc6521c92","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T15:24:17.526914Z","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:2c425ef322dbfec3f5fdfb24fe0432159e207d6d405d7589c583f18ff239131c","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-16T15:24:17.526914Z","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:fa33b38e8bb5402b030718b96913bc5ac9b68c8efa4b412d21ac08aee9979527","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-16T15:24:17.526914Z","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:719422619dbec0fc29359a2d60fbb153bfd82e2a7897758cfb9eae7a27b536a1","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-16T15:24:17.526914Z","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:8c31dc89ca30b481a226a719fc84ea9a7883908fb4f02557975febb91c869f5f","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T15:24:17.526914Z","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:6ea44668b8b1bd3efa22bca927daae7bc6dfee406ea7e04e796afb8fb4744b11","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-16T15:24:17.526914Z","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:9e83c717d8017443e1d3f9c873215d6ab2bc758ee793773e63f1c6d80f0fea36","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-16T14:55:12.080057Z","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-16T15:24:17.526914Z","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:ff349b75837b598e9e39c64ba66ea4512ced09b7a65e4f16d0d2b3c63752cd6c","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-16T15:24:17.526914Z","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:2508c761c11ec8ca5e2f879eb2009d2dd8aa79b37ced955c1025608ab967a2c9","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-16T15:24:17.526914Z","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:734451638416f6a152b1881ef85d420805c4a01caf8378520c3e5b8ff1b5efa1","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T15:24:17.526914Z","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:7382c76fb2b858300cf41be1658699717310cc6df7cbc345dbb0c0dc8746f73f","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-16T15:24:17.526914Z","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:6f70ca4e4e3f550d44f20e66fc88f2b4d69930110427b1a801feefb631a95804","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-16T15:24:17.526914Z","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:0c2f353890850552e4802ed766434bfa3508fadf3d3643e791662c64eb673e15","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-16T15:24:17.526914Z","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:5cc55cd79ad73afa90890a971754bd97fda2a5e1472d442e6dafdb94f597588d","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T15:24:17.526914Z","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:c40a1c444f3bffa8e8619a27e85337a2aaad5174fc79215c2c14f4ff41225119","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-16T15:24:17.526914Z","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:5b3d8f7bd80d28c5d0dd5cea3e85ad6630307a3e0cfd64ff3453734df877624b","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-16T15:24:17.526914Z","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:bb6bb2801aae2ea653db516fbed6b126f28efb9650d2b3288557ab16628b9921","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-16T15:24:17.526914Z","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:72fb2976d1d9e8472191a5aa68d1b3d17ad66e15c1ff46a8461276c4a7a233fa","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-16T15:24:17.526914Z","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:eea12703a6d422e428a4f0ab596013d9714b54009ed131985af7cdb20dcdfa55","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-16T15:24:17.526914Z","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:21702cb3d1f2c249ab91cda6fbbc70f4af43f7a5a801d73e5eecd5355d11ec0c","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-16T15:24:17.526914Z","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:7e74b1cd3a39402b401788a7c32c5e60f31a150041c270588ae557baa64b3a2a","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-16T15:24:17.526914Z","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:8a1705e01d5ca811f2938c7d595a56f9b91857e114201d5e5ed0d6c2e5ec03fb","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-16T15:24:17.526914Z","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:7e78778da2b7fe74f22aef639fdf357e71eba98b23266e172eb919f21af5795d","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-16T15:24:17.526914Z","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:c6900f08ad4406e2240acd4c7dedaf69b16ce813131acdb2d5551df100929695","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-16T15:24:17.526914Z","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:987eac6a7a174aeedf72296c50ee152e8d55e92b51edad10b92c14121bced9bf","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-16T15:24:17.526914Z","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:5eaba83d445b62a071bce250ff1d8ebd0e183e12ef10ba6fc370c33e4fa6867c","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-16T15:24:17.526914Z","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:eb84bd01f17ce30c80d4cfdf17ef4dab034d3ecd4c6b252ce03179b0e600479a","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-16T15:24:17.526914Z","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:b96419f773b4797b770558a8a6486c0340aa74470d36ce43fb51ddee94eed837","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-16T13:00:27.546831Z","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-16T15:24:17.526914Z","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:95f98a615b779c3b275038efcd4d5e8b7e142a6d7845da78f50789f785ea4d1a","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-16T15:24:17.526914Z","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:80d9d9a5e48a874ec74b8a5cd5c49a26b705d39c4eaa92567feb0d57f53cec13","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T15:24:17.526914Z","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:b66a050ee16c340623667502133d8a9d9e18d9234cf1e497fa95e18894c7a8ba","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-16T15:24:17.526914Z","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:7f0cf7685888aa3dbf52d6d51ac58a270ad57a0956336ab27cd7aa07f3e6022b","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-16T15:24:17.526914Z","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:0f475dcfb931c095fb97f5b640a52b963115553124c211b34b9217eb01d9369e","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-16T15:24:17.526914Z","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:1eb28af3661c108f29a668a260a32c01279dc25d5079c6e720424a3869f2e8a3","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-16T15:24:17.526914Z","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:a0257e30de3d054c204803cb072fc05f5f607b11de04c13ad26e1980f30939cf","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-16T15:24:17.526914Z","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:b579fcf6a1eca2166dd7b56b8e8347fac543f8f352b5e7b8a353ecaa15c18e04","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-17T16:07:07.665761Z","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-16T15:24:17.526914Z","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:88107836205356e9ecbf3f6495f9a3a380324f6b1933fe882fefa44204c18ab1","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-16T15:24:17.526914Z","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:5d6426e95189b5443492c864f097761c1462eb74ebe3bc77652a01292ffa1959","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-16T15:24:17.526914Z","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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 56 of 56 outbound references and 0 inbound Pith citation observations for arXiv:2608.11719."}