{"as_of":"2026-08-23T11:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:234ec1457e9fc6e9bc627194e3892a03083c82147034303b9b13e0d0f8aa9719","coverage":[{"denominator":73,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":73,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T13:17:02.072542Z","state":"measured"},{"denominator":78,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":78,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-23T06:30:58.430688+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-08T21:33:05.730954Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-08T21:35:37.679578Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"cited_work":{"arxiv_id":"2509.00850","doi":null,"metadata_source":"pith","pith_arxiv_id":"2509.00850","snapshot_observed_at":"2026-07-08T21:35:37.679578Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum ldpc codes","venue":"quant-ph","work_id":"6b6b4f9f-b925-4d85-9ec0-a0ddbb4ddb80","year":2025},"citing_paper":{"arxiv_id":"2507.23011","last_updated":"2025-09-13T00:02:56Z","snapshot_observed_at":"2026-07-06T22:05:22.373440Z","submitted_at":"2025-07-30T18:19:44Z","title":"Placing and routing quantum LDPC codes in multilayer superconducting hardware","version":2},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-05-19T02:09:15.662431Z"},"links":{"cited_paper":"/paper/2509.00850","citing_paper":"/paper/2507.23011"},"observation_digest":"sha256:52332bcc1dda6941f2e66f4cb8304bd507c5aaff04d799ed8e209944acc456b5","observation_id":"e57178d8-717c-4a6a-b4a3-c8aeffdd05d9","resolution":{"observed_at":"2026-05-19T02:11:59.384632Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"cited_work":{"arxiv_id":"2509.00850","doi":null,"metadata_source":"pith","pith_arxiv_id":"2509.00850","snapshot_observed_at":"2026-07-08T21:35:37.679578Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum ldpc codes","venue":"quant-ph","work_id":"6b6b4f9f-b925-4d85-9ec0-a0ddbb4ddb80","year":2025},"citing_paper":{"arxiv_id":"2604.18714","last_updated":"2026-04-20T18:14:28Z","snapshot_observed_at":"2026-08-03T04:33:55.994506Z","submitted_at":"2026-04-20T18:14:28Z","title":"Efficient Routing of Quantum LDPC Codes on Programmable 2D Toric Architectures","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-05-10T04:46:26.589764Z"},"links":{"cited_paper":"/paper/2509.00850","citing_paper":"/paper/2604.18714"},"observation_digest":"sha256:69c0bc3daaa2b7feeb0213f8317426bb7136d8297d638cec398a8c42c1c3168c","observation_id":"e0bb406a-57ce-42d9-bb97-569f4022249d","resolution":{"observed_at":"2026-05-10T11:40:19.712723Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"cited_work":{"arxiv_id":"2509.00850","doi":null,"metadata_source":"pith","pith_arxiv_id":"2509.00850","snapshot_observed_at":"2026-07-08T21:35:37.679578Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum ldpc codes","venue":"quant-ph","work_id":"6b6b4f9f-b925-4d85-9ec0-a0ddbb4ddb80","year":2025},"citing_paper":{"arxiv_id":"2605.04663","last_updated":"2026-05-06T09:10:28Z","snapshot_observed_at":"2026-08-11T09:46:51.614672Z","submitted_at":"2026-05-06T09:10:28Z","title":"Distributed Quantum Error Correction with Bivariate Bicycle Codes in a Modular Architecture","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-08T17:42:30.745093Z"},"links":{"cited_paper":"/paper/2509.00850","citing_paper":"/paper/2605.04663"},"observation_digest":"sha256:7f266e6a37a202fa33e8d96a7965afcd2f601850e340a4dab8f13e98d239dbde","observation_id":"5df0a29d-3df4-40ae-9e58-d782021c4fa8","resolution":{"observed_at":"2026-05-11T17:16:10.055517Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"cited_work":{"arxiv_id":"2509.00850","doi":null,"metadata_source":"pith","pith_arxiv_id":"2509.00850","snapshot_observed_at":"2026-07-08T21:35:37.679578Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum ldpc codes","venue":"quant-ph","work_id":"6b6b4f9f-b925-4d85-9ec0-a0ddbb4ddb80","year":2025},"citing_paper":{"arxiv_id":"2606.06062","last_updated":"2026-06-04T12:01:24Z","snapshot_observed_at":"2026-08-06T22:43:50.932175Z","submitted_at":"2026-06-04T12:01:24Z","title":"Barbell Codes: qLDPC Codes for Superconducting Quantum Hardware","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-06-28T00:41:15.817095Z"},"links":{"cited_paper":"/paper/2509.00850","citing_paper":"/paper/2606.06062"},"observation_digest":"sha256:6220b0ae0d92f0d139999a7028f83b7379338ef68a48b1c8255655b5faf40747","observation_id":"5c57d0a4-88a5-4fa0-b6bf-2501b1f8b778","resolution":{"observed_at":"2026-07-02T14:07:03.470400Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"cited_work":{"arxiv_id":"2509.00850","doi":null,"metadata_source":"pith","pith_arxiv_id":"2509.00850","snapshot_observed_at":"2026-07-08T21:35:37.679578Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum ldpc codes","venue":"quant-ph","work_id":"6b6b4f9f-b925-4d85-9ec0-a0ddbb4ddb80","year":2025},"citing_paper":{"arxiv_id":"2607.05897","last_updated":"2026-07-07T06:50:27Z","snapshot_observed_at":"2026-08-19T02:02:22.162774Z","submitted_at":"2026-07-07T06:50:27Z","title":"Strictly Local Tile-Code Architectures on Two-Dimensional Planar Lattices","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-08T21:33:05.730954Z"},"links":{"cited_paper":"/paper/2509.00850","citing_paper":"/paper/2607.05897"},"observation_digest":"sha256:4ca0d6e7b4adf69ac15005f91ce6b3c899e27fb406a89a866046242211abc085","observation_id":"4ee7fe6f-2a2b-40b0-bb3f-60f1bbfe561d","resolution":{"observed_at":"2026-07-08T21:35:37.680840Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2509.00850/citation-record","integrity":"/paper/2509.00850/integrity","json":"/paper/2509.00850/citation-record.json","paper":"/paper/2509.00850"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:17:04.155408Z","title":"For example, this is the case when in the middle of a normal surface code measurement circuit","venue":null,"work_id":"014ea492-542c-436f-b972-8f8770267905","year":null},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:01.690564Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:2f07cbec7d435d3c761b286e1cb383f7009f23f25857f2c44745768a7edc6b57","observation_id":"3f9d5fab-6c6b-4f9c-9aac-617f27423c31","resolution":{"observed_at":"2026-08-05T13:17:04.160873Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:17:04.134831Z","title":"three-quarters LR circuit","venue":null,"work_id":"88e438d0-0376-4895-b508-7c8c12eb1862","year":null},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:01.696641Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:20505c503c9589d93d7ddf82d3c28b3be9b3a3c3e337ce2400247fc5319f750f","observation_id":"90a44cc0-9fde-48a9-bcaa-ffff53b09415","resolution":{"observed_at":"2026-08-05T13:17:04.141560Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.02192","last_updated":"2023-09-14T20:09:26Z","snapshot_observed_at":"2026-08-16T15:57:43.243624Z","submitted_at":"2023-02-04T16:35:42Z","title":"Relaxing Hardware Requirements for Surface Code Circuits using Time-dynamics","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.02192","snapshot_observed_at":"2026-08-05T13:17:01.703460Z","title":"Relaxing Hard- ware Requirements for Surface Code Circuits using Time- dynamics","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:01.703460Z"},"links":{"cited_paper":"/paper/2302.02192","citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:feb8491b3ec18f98a3c19a9ec307b97d345e31a657b3ea13375573bad13b576f","observation_id":"1bd46529-4157-48f8-8379-ebaf17ebe855","resolution":{"observed_at":"2026-08-05T13:17:01.703460Z","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-05T13:17:04.116425Z","title":"Fault-tolerant quantum computation by anyons","venue":null,"work_id":"afb209d0-edd2-4f6a-b379-994f70e62160","year":2003},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:01.710162Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:c14494188b7a7ca8a654b04dc3f260edf15a8868ae3f0da8e0027948d6e9fea1","observation_id":"aa4c9b7f-be45-4912-845c-3eab7f09b4c5","resolution":{"observed_at":"2026-08-05T13:17:04.121581Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-05T13:17:01.716979Z","title":"Quantum codes on a lattice with boundary","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:01.716979Z"},"links":{"cited_paper":"/paper/quant-ph/9811052","citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:6a1684c523196fb8ae54f5d509d115d124ef45697b2896a7fce574378b2d2556","observation_id":"7dc40ec7-5e81-4273-af81-67bcd1ecfb55","resolution":{"observed_at":"2026-08-05T13:17:01.716979Z","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-05T13:17:04.098980Z","title":"Quan- tum error correction below the surface code threshold","venue":null,"work_id":"59a70116-6998-4971-b955-6a7117723457","year":2025},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:01.723525Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:f4abb25c4d9d29ead9599003df69c39b74a76b43ca80c9955e99b4834d57d31e","observation_id":"19e37a2b-231a-47ba-a9c1-37872907edb2","resolution":{"observed_at":"2026-08-05T13:17:04.104400Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:17:04.079930Z","title":"Z2-systolic freedom and quantum codes","venue":null,"work_id":"12ce5076-9bf9-42e4-b475-5555f6011b70","year":2002},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:01.729726Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:3b3fe0eaf2420fd2c7163e69802680e7160f81b38e7e587634d61d07a62a3048","observation_id":"d64d97dd-801e-429b-a641-dbe6a5b68077","resolution":{"observed_at":"2026-08-05T13:17:04.085480Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:17:04.061288Z","title":"Decodable quan- tum ldpc codes beyond the √n distance barrier using high-dimensional expanders","venue":null,"work_id":"6e14e9c1-9795-4d03-bcc3-0321c7b28108","year":null},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:01.734936Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:43d23780fa3b752f6be852baa7bc0e3186f83e33f74bcfaee72bda56ff6351ec","observation_id":"6bd90bd2-66fb-46fc-9ee4-4e0e9f7c8208","resolution":{"observed_at":"2026-08-05T13:17:04.067065Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:17:04.042483Z","title":"New cosystolic expanders from tensors imply explicit quantum ldpc codes with ω(√n log kn) distance","venue":null,"work_id":"8baea4e9-3732-404a-9116-c7ad79b5b4de","year":2021},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:01.740565Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:ca2a77f72d1d1b3475cfff7bbc89017627ececc587e9fb39c7b8ab98750044ea","observation_id":"2dac1f67-eb58-4960-9aa8-6a0947d558b0","resolution":{"observed_at":"2026-08-05T13:17:04.048113Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:17:04.023249Z","title":"Fiber bun- dle codes: breaking the n1/2 polylog(n) barrier for quan- tum ldpc codes","venue":null,"work_id":"d9a941e5-0776-4b52-80a4-700e65968dba","year":2021},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:01.746183Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:28ad488899bd4c5fdc879cef33f9544d6370884ce8b4d292e03e92fb19d3e32a","observation_id":"13cda3d2-00e7-4bb4-97e9-4ab2af764d99","resolution":{"observed_at":"2026-08-05T13:17:04.029272Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:17:04.001299Z","title":"Quantum ldpc codes with almost linear minimum distance","venue":null,"work_id":"de81d9f2-0e1c-4cd6-a67b-131ea73464c3","year":2022},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:01.752141Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:7f7e1009dc0713c4ce9484fcf8dea80a2da2256150f1fd9606505beae1a7a96d","observation_id":"161f3565-8c41-4467-b8bb-25c16ea31b64","resolution":{"observed_at":"2026-08-05T13:17:04.007432Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:17:03.959325Z","title":"Balanced prod- uct quantum codes","venue":null,"work_id":"8cca20f0-f634-4bb3-954b-be1a4682aaf4","year":2021},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:01.758031Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:9e1ec265c9ca7045091c271169326d7cdcc384441d0f66cb4911999362efb852","observation_id":"bfd938dc-10b2-46cf-91e1-e4a8618f0c6c","resolution":{"observed_at":"2026-08-05T13:17:03.979681Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:17:03.915240Z","title":"Asymptotically good quantum and locally testable classical ldpc codes","venue":null,"work_id":"baf714ee-b36e-4d7b-a035-b999803fac00","year":2022},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:01.763073Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:6ea835f7614dfa0c5a169915f5788cd4136d7f724d001512828421e1e55d6cff","observation_id":"3abda84f-cd55-4e18-81c7-d464f17d8622","resolution":{"observed_at":"2026-08-05T13:17:03.933471Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:17:03.869133Z","title":"Quantum tanner codes","venue":null,"work_id":"cd2f3562-755b-4649-8ea0-ef0a7e8ae392","year":2022},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:01.768656Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:35860d0fce3a33e6a161d7993d8da6c003b88724a887aa53ddcff57bc86b1923","observation_id":"0c9ded1d-abc4-4eda-9bb9-6399ec53a938","resolution":{"observed_at":"2026-08-05T13:17:03.883195Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:17:03.823732Z","title":"Good quantum ldpc codes with linear time decoders","venue":null,"work_id":"26ddda49-959a-4c5f-a9de-5cc358552ee0","year":2023},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:01.774141Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:e6a2a12a09ed2a565eb327d84dc20d18245e9531cbf59b41676e8d5b69ef5c19","observation_id":"16f96cb6-3360-40a8-8a59-56635825aeaf","resolution":{"observed_at":"2026-08-05T13:17:03.838581Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:17:03.801255Z","title":"Constant-overhead quantum error correction with thin planar connectivity","venue":null,"work_id":"d5f7c224-c0d7-47a1-9bfd-5900e3d9e944","year":2022},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:01.779713Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:e5618ea9e80025d5791c7534b6750b7a2825517df9f2b94a2ea1c2f32134edf4","observation_id":"c04b9e7a-6502-4a26-9886-9367940fa5d9","resolution":{"observed_at":"2026-08-05T13:17:03.807232Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:17:03.778954Z","title":"High-threshold and low- overhead fault-tolerant quantum memory","venue":null,"work_id":"198f9010-f667-4a09-98e6-564fc05990ed","year":2024},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:01.784887Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:1266c471cbab1b3c27b17f87f155dfee7328568abc11ccabffce662cd1dbcfee","observation_id":"d54e8ebf-e2d0-44d0-b877-40448b53b010","resolution":{"observed_at":"2026-08-05T13:17:03.787350Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.08648","last_updated":"2023-08-16T19:47:17Z","snapshot_observed_at":"2026-08-17T16:57:50.910546Z","submitted_at":"2023-08-16T19:47:17Z","title":"Constant-Overhead Fault-Tolerant Quantum Computation with Reconfigurable Atom Arrays","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.08648","snapshot_observed_at":"2026-08-05T13:17:01.789575Z","title":"Constant-overhead fault-tolerant quantum computation with reconfigurable atom arrays","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:01.789575Z"},"links":{"cited_paper":"/paper/2308.08648","citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:e28502b8bcc29f4fd2324cde915d18c1c2c82048e638b86e6afd1e2e5488dadd","observation_id":"59671d4a-d20e-4077-bd6f-9fe05fa9bd2b","resolution":{"observed_at":"2026-08-05T13:17:01.789575Z","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-05T13:17:03.759135Z","title":"Pla- nar quantum low-density parity-check codes with open boundaries","venue":null,"work_id":"028e0a61-0ad9-496c-b84f-a5b467f37a92","year":2025},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:01.795683Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:55984f774a102b518c84c7c77885dc69ba74c8eeea4b2cd3581cc0c9a5a2fca5","observation_id":"deaeb51e-4db2-4ad4-a21e-1d52b196ebe5","resolution":{"observed_at":"2026-08-05T13:17:03.766624Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:17:03.738939Z","title":"Tile Codes: High- Efficiency Quantum Codes on a Lattice with Boundary","venue":null,"work_id":"d76108f9-0328-44e7-a991-dd1a8ec09103","year":2025},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:01.800825Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:cc606118306fd0614d996f59d1c1bb3309be52cd1c8d95690db8d1a8a69d1e6c","observation_id":"819a5b86-ef5b-438a-8aae-cfeef0420b2b","resolution":{"observed_at":"2026-08-05T13:17:03.745366Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:17:03.719995Z","title":"Lowering connectivity requirements for bivariate bicycle codes using morphing circuits","venue":null,"work_id":"0355db4f-c479-45de-a9df-e27dd018fc52","year":2025},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:01.806098Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:caef9b16f153055abf6c1d8b43193b972b7d2b7e57e43587b350102aad4f7c57","observation_id":"31c2a7a4-7e8f-4429-8f3c-da87b7f14088","resolution":{"observed_at":"2026-08-05T13:17:03.726283Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:17:03.699239Z","title":"Direc- tional Codes: a new family of quantum LDPC codes on hexagonal- and square-grid connectivity hardware","venue":null,"work_id":"23364586-11ec-4816-b4f5-1c3fac28f0d2","year":2025},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:01.811329Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:2a1d51732d358eb9534de72f41d6cfbbc1194de34f9da4972893e37e368434e7","observation_id":"9b42bf68-2c88-43c4-ac70-7003fc91fa20","resolution":{"observed_at":"2026-08-05T13:17:03.705669Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-05T13:17:01.817229Z","title":"Demonstration of low-overhead quantum error correction codes","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:01.817229Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:5e4efe6b8f8ca42a58b3d695746e4cdd99846a41e4e2670a3fc12bd7ec4068e4","observation_id":"c6df79d0-163a-4dea-b390-b117b12e3e78","resolution":{"observed_at":"2026-08-05T13:17:01.817229Z","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-05T13:17:03.677835Z","title":"Realization of High-Fidelity Perfect Entanglers between Remote Superconducting Quantum Processors","venue":null,"work_id":"6d1a9d05-3c4f-41ea-8357-facca66b2473","year":2025},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:01.823217Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:4929cd09840a740e036f6e92091e348e3419f758c10cc1445c666ee3280c3b3c","observation_id":"b8128c59-34da-49ee-91c4-831914d15f9b","resolution":{"observed_at":"2026-08-05T13:17:03.682751Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:17:03.660078Z","title":"Microwave Quantum Link between Superconducting Circuits Housed in Spatially Sepa- rated Cryogenic Systems","venue":null,"work_id":"f0e1dd08-c5bb-4693-83c5-866d1464101e","year":2020},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:01.828267Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:953718fe01f81a693dbf039e01c158f316493e0eeccb5251a7a420ce07fa7f1a","observation_id":"1fd39909-bb0e-44b3-b780-4248903cb407","resolution":{"observed_at":"2026-08-05T13:17:03.665048Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:17:03.642253Z","title":"Determin- istic Remote Entanglement of Superconducting Circuits through Microwave Two-Photon Transitions","venue":null,"work_id":"4098fe0f-b856-4310-9462-eed48a7f2d11","year":2018},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:01.832868Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:f307eb69d43f00203a88df619c09dbe1b805eea1c40c06070cec9f4daa73189b","observation_id":"3af8bdca-4f5f-4cfa-a879-b43218f656f5","resolution":{"observed_at":"2026-08-05T13:17:03.648492Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:17:03.612816Z","title":"Entanglement Purification and Protec- tion in a Superconducting Quantum Network","venue":null,"work_id":"4e6d39ae-bde1-4779-998a-b1690467aefe","year":2022},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:01.837367Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:7f62b51d1564143d2ace4e62d79da15d54339ca9f941749f352901254ecb1a86","observation_id":"0069ef5a-f3f4-4032-ba57-f28cbf4b0c31","resolution":{"observed_at":"2026-08-05T13:17:03.623322Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:17:03.593420Z","title":"A Superconduct- ing Qubit-Resonator Quantum Processor with Effective All-to-All Connectivity","venue":null,"work_id":"2c2eade3-fe45-419e-8701-9fd4077de6d8","year":2025},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:01.842475Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:5bd60fba0203411f4851ed0ae62e41f32669b5d7b41b747e4478d3e37774bbc7","observation_id":"588dd186-a957-4d85-b66b-aecd5b617424","resolution":{"observed_at":"2026-08-05T13:17:03.599184Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:17:03.573584Z","title":"Placing and Routing Non-Local Quantum Error Correcting Codes in Multi- Layer Superconducting Qubit Hardware","venue":null,"work_id":"b5c02843-9009-4a54-bca9-5d8e12820007","year":2025},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:01.847420Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:c28fda896846a6177cf4e1ead2b4476a2d4a1f5418a13e33bd2e8bb10f971df5","observation_id":"2c52d73c-2982-4849-b629-15d76937fc65","resolution":{"observed_at":"2026-08-05T13:17:03.580502Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:17:03.549428Z","title":"Stim: a fast stabilizer circuit simulator","venue":null,"work_id":"e2636ce2-991e-4941-854e-7957ebe00183","year":2021},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:01.852383Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:53ec214b895d29731e7f069fce8d633feb33cdb9773512506b017e9b66d88243","observation_id":"21106ed6-e748-4fd7-b9a7-a5d2d2c38861","resolution":{"observed_at":"2026-08-05T13:17:03.556732Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:17:03.524924Z","title":"Sparse Blossom: correcting a million errors per core second with minimum-weight matching","venue":null,"work_id":"eacf4f76-2fe4-41cb-b3ac-c6a5de703fc1","year":2025},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:01.856838Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:97b6c78f6c84e01aa589816a10178cf06c619078931b07eefa853fb4a9b6771e","observation_id":"c7c897f4-c28c-441a-a1c3-bfcc0cbd2eaf","resolution":{"observed_at":"2026-08-05T13:17:03.531878Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:17:03.502757Z","title":null,"venue":null,"work_id":"4d1039be-b18a-46af-94ab-5112028acee0","year":null},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:01.861551Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:3ac8d81ad31fb5ea8c1285a10b03bd6e10cdf45ff484cb344807de8f62802cf5","observation_id":"c5f39999-47b7-4a98-8556-72f220bc2e10","resolution":{"observed_at":"2026-08-05T13:17:03.509728Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:17:03.478717Z","title":"Projective plane and planar quantum codes","venue":null,"work_id":"f9a944a9-7a55-47be-b933-f1960bcb5b3e","year":2001},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:01.866400Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:dd0e7378117c900a75a663cc281bbab4df3bcb76951df78aefa9f48ab0eecbf9","observation_id":"38e6e047-5016-4eaf-8645-9035b195f74b","resolution":{"observed_at":"2026-08-05T13:17:03.484573Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:17:03.457651Z","title":"Suppressing quantum errors by scaling a surface code logical qubit","venue":null,"work_id":"e30d90cd-a725-476e-bf6b-7107ab8e445e","year":2023},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:01.872005Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:2ff08153788ead1e738fb868129afdeabb0c53c1e5e4ea88c6a21c3c02afb485","observation_id":"f19e07a7-8918-4aeb-bc14-80eb15a6b08c","resolution":{"observed_at":"2026-08-05T13:17:03.464331Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:17:03.434897Z","title":"Tradeoffs for Re- liable Quantum Information Storage in 2D Systems","venue":null,"work_id":"f0c0e806-12f4-4da8-81d8-16056ebc95ac","year":2010},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:01.876892Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:cffd1c338b3babf53b69de22f621a4ee96ffd609c091f7348102f8e97aedc46a","observation_id":"f66c64b1-1525-4605-a2fb-bb2c11254d03","resolution":{"observed_at":"2026-08-05T13:17:03.442592Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:17:03.414617Z","title":"Realizing repeated quantum error cor- rection in a distance-three surface code","venue":null,"work_id":"a2d08417-3021-4e85-a4d6-60bdde317c61","year":2022},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:01.882155Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:ea9405a0a02d9029ce0797892a7f849b62d7152ee093f0b5c621846e1a6fc30c","observation_id":"0c838b26-5e6c-4d2a-ad1f-7f329d3c96a5","resolution":{"observed_at":"2026-08-05T13:17:03.421458Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:17:03.393481Z","title":"Realization of an Error-Correcting Surface Code with Superconducting Qubits","venue":null,"work_id":"994ecdb2-6a7c-438f-aed8-58009e7bbddc","year":2022},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:01.887354Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:00bdeedb5c554e62d02fc861611d21aee761c85371e79bdb3c66a6760d11f657","observation_id":"ab97782b-034f-47fe-ad62-ebf6471c7426","resolution":{"observed_at":"2026-08-05T13:17:03.399995Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-05T13:17:01.892706Z","title":"Architectural mechanisms of a universal fault-tolerant quantum computer","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:01.892706Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:5a02f13b02c4acad2fdc0a6d423940a31ee72b48789168c74ca419a972f645c2","observation_id":"e64e51a5-d67b-4a4a-8ed7-92a2bf616e89","resolution":{"observed_at":"2026-08-05T13:17:01.892706Z","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-05T13:17:03.372327Z","title":"Topological quantum memory","venue":null,"work_id":"2be4aee0-2f89-4dda-8624-ba81f51102b0","year":2002},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:01.897987Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:0612ce4da3a9d1e232ec5142af7b514557e9043a153837ef899d74f4d638f827","observation_id":"653cb6bd-258b-4ddd-b821-df449cde5658","resolution":{"observed_at":"2026-08-05T13:17:03.379527Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1310.0863","last_updated":"2013-10-02T23:16:22Z","snapshot_observed_at":"2026-08-16T02:29:08.014964Z","submitted_at":"2013-10-02T23:16:22Z","title":"Optimal complexity correction of correlated errors in the surface code","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1310.0863","snapshot_observed_at":"2026-08-05T13:17:01.903181Z","title":"Optimal complexity correction of corre- lated errors in the surface code","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:01.903181Z"},"links":{"cited_paper":"/paper/1310.0863","citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:53d0d433b49cbdeb7ac4998fba6496510e70d7d38b5402cbfe3c01519ae29169","observation_id":"79166acf-b51f-4ccd-a430-830ece42e016","resolution":{"observed_at":"2026-08-05T13:17:01.903181Z","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-05T13:17:01.908208Z","title":"Pymatching: A python package for decod- ing quantum codes with minimum-weight perfect match- ing","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:01.908208Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:d52347adb2e592f439e4778cef9c0177f4e309f21d7dd8abe8d40b018b7476cf","observation_id":"1bdaf46c-b51c-4fda-bd6b-9914a6832538","resolution":{"observed_at":"2026-08-05T13:17:01.908208Z","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-05T13:17:01.914425Z","title":"Generalized toric codes on twisted tori for quantum error correction","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:01.914425Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:b6fd793f1af90a74a4deb958cd62ac2601368327cd881d2ef24d27ce796df1b8","observation_id":"ac063420-c095-46cd-b204-59971e597eff","resolution":{"observed_at":"2026-08-05T13:17:01.914425Z","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-05T13:17:03.351409Z","title":"Error correcting codes in quantum the- ory","venue":null,"work_id":"7284e4e6-3bf7-4301-8253-d7a21d3dff79","year":1996},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:01.919994Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:ad12b68ab1ee74fed35233af01619320cb29d9af4fd69834b589b72b985ad6b0","observation_id":"3ee2ee8a-e540-4ce1-af20-fbf05a9b695b","resolution":{"observed_at":"2026-08-05T13:17:03.357897Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:17:03.331355Z","title":"Good quantum error- correcting codes exist","venue":null,"work_id":"8a6e2ed0-f3ab-41bd-893f-6f11dbbcabce","year":1996},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:01.926058Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:46dcc054765b69e82a7b60d9843db979e819b9cb24d857956b651a9a3b78a0c6","observation_id":"68700aa5-0d28-4f9d-88dd-1b097a5c54af","resolution":{"observed_at":"2026-08-05T13:17:03.338109Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/9705052","last_updated":"1997-05-28T23:51:29Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"1997-05-28T23:51:29Z","title":"Stabilizer Codes and Quantum Error Correction","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/9705052","snapshot_observed_at":"2026-08-05T13:17:01.930888Z","title":"Stabilizer codes and quantum error cor- rection","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:01.930888Z"},"links":{"cited_paper":"/paper/quant-ph/9705052","citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:480a9dd8d65b1a800fddefd4fa159851457e33b622c7aeb5b301d785737bf07c","observation_id":"c3b88a23-be0b-4cc7-912f-87fffdf47688","resolution":{"observed_at":"2026-08-05T13:17:01.930888Z","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-05T13:17:03.304453Z","title":"Quantum kronecker sum-product low-density parity-check codes with finite rate","venue":null,"work_id":"76f84203-b983-4cb5-96f0-6e053fa8e031","year":2013},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:01.936237Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:312292a228a184d8e2b4c22394c5f15d657a19f91543b9bbeabb05a1dc8ef40f","observation_id":"d934bfa6-9f39-484f-9be1-7a8ead29ab76","resolution":{"observed_at":"2026-08-05T13:17:03.314865Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:17:03.284026Z","title":"Sparse- graph codes for quantum error correction","venue":null,"work_id":"68e7455f-7387-4cb8-9cb9-8efa0100cc6e","year":2004},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:01.941045Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:c13ecb8d70d0ccb92104b4b412a8dca435089181c2a0eb2f934960d8faa942ec","observation_id":"2dc1d07d-7527-4146-9469-a22a2d5511e6","resolution":{"observed_at":"2026-08-05T13:17:03.290404Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:17:03.256725Z","title":"Commuting pauli hamiltonians as maps be- tween free modules","venue":null,"work_id":"f9ce8123-8253-452f-9dd3-36f4fc226e23","year":2013},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:01.945771Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:a04898de3aa8240a3602753005bf0bfd962f21637d93f6622ed9b14493dfb685","observation_id":"19d53488-0e37-42a4-915b-608286e6cd35","resolution":{"observed_at":"2026-08-05T13:17:03.263388Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:17:03.234609Z","title":"Extract- ing topological orders of generalized pauli stabilizer codes in two dimensions","venue":null,"work_id":"b1ce3c03-fb36-4053-8bd8-2442fea9cefe","year":2024},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:01.950717Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:ceb61405ee1b646cddf70f8f1070baed3c1188d6672147168147e7264e9af6b9","observation_id":"cfb4d4c3-2bb9-4e37-8a09-e809abbda675","resolution":{"observed_at":"2026-08-05T13:17:03.240835Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:17:03.210654Z","title":"Optimal Quantum Circuits for Nearest-Neighbor Architectures","venue":null,"work_id":"f2e9cfda-2ed3-412b-8d41-21a74a6b39f8","year":2013},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:01.955423Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:1398f84815a17a1016d20c42f8a8095df024d8f77b4df91c0fa62c0604361858","observation_id":"00d89220-19b3-4c9f-a4bb-836de2521efe","resolution":{"observed_at":"2026-08-05T13:17:03.217202Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:17:03.190480Z","title":"Fault-tolerant quantum error correction on near-term quantum processors using flag and bridge qubits","venue":null,"work_id":"af53afb1-e8d4-436b-a23a-0d603f635b09","year":2020},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:01.960236Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:a87edffe88ee388d5b6a28cf3a986ad2e969019916fb453635c4f4fd8abf3346","observation_id":"7ae0e082-c414-431f-b7a5-708b036c048b","resolution":{"observed_at":"2026-08-05T13:17:03.196274Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:17:03.170664Z","title":"Tackling the Qubit Mapping Problem for NISQ-Era Quantum Devices","venue":null,"work_id":"d98d4cb7-3516-4b7b-ac06-146dd4e42439","year":2019},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:01.965914Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:aa2e8e9a23efd236cfb754fdbce74993deed5becd02572c0401aefef1c7dcb93","observation_id":"a773ef16-f6a8-4a24-a3b5-eed5505e4e7b","resolution":{"observed_at":"2026-08-05T13:17:03.176428Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:17:03.150018Z","title":"QECC-Synth: A Layout Synthesizer for Quantum Error Correction Codes on Sparse Architec- tures","venue":null,"work_id":"b54dac2e-c668-4081-b6a3-669dfafa92e4","year":2025},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:01.970722Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:9a41f148a51fd2ca876a4d70e0544f110dd655f27ba3026289dcd8100adb6cdc","observation_id":"2608b10b-ee28-4b5f-b694-b09150798c95","resolution":{"observed_at":"2026-08-05T13:17:03.156125Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:17:03.129855Z","title":"To- ward a 2d local implementation of quantum low-density parity-check codes","venue":null,"work_id":"08314255-d8d9-4ebd-9176-ab2d2ec68440","year":2025},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:01.975227Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:3eae3f233ed65fd24af752634f540985121af35cf981728114e0a569475a89ac","observation_id":"57e6cbbf-0795-4dfe-b963-d227baa89991","resolution":{"observed_at":"2026-08-05T13:17:03.136458Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1706.04912","last_updated":"2017-06-15T15:02:02Z","snapshot_observed_at":"2026-08-14T20:53:49.578430Z","submitted_at":"2017-06-15T15:02:02Z","title":"Fault-tolerance thresholds for the surface code with fabrication errors","version":1},"cited_work":{"arxiv_id":"1706.04912","doi":null,"metadata_source":"pith","pith_arxiv_id":"1706.04912","snapshot_observed_at":"2026-08-05T13:17:02.545984Z","title":"Fault-tolerance thresholds for the surface code with fabrication errors","venue":"quant-ph","work_id":"0cd91db2-7601-4404-9ae2-3aa0f6283a5e","year":2017},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:01.980096Z"},"links":{"cited_paper":"/paper/1706.04912","citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:ed16cbe5fe8842370113f36ebce907a6c63d086926491dac9300b16a32116acd","observation_id":"8551199c-234e-458b-892e-856b22388828","resolution":{"observed_at":"2026-08-05T13:17:02.555703Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-05T13:17:01.985361Z","title":"LUCI in the Surface Code with Dropouts","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:01.985361Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:65321d2f2ce53385dee0e83f10873e8add4455238db415d42e238a0bf5fd62fc","observation_id":"912d400f-98e3-4685-b91f-d239feeaa470","resolution":{"observed_at":"2026-08-05T13:17:01.985361Z","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-05T13:17:03.107166Z","title":"Topological and subsystem codes on low-degree graphs with flag qubits","venue":null,"work_id":"933ed645-c4a0-433b-9d73-f4c7a14511eb","year":2020},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:01.990182Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:d16b960e047684e16b15ed5e683fdd04e78a90602bc87df21a8875674f6d5b29","observation_id":"5c53629e-6cd0-40a6-aed0-e6ddc968bc2d","resolution":{"observed_at":"2026-08-05T13:17:03.113138Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:17:03.085440Z","title":"Dynamically Generated Logical Qubits","venue":null,"work_id":"89a58f1b-d13c-40d1-a469-f90da354f3d3","year":2021},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:01.995422Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:dba8dd46eebe13cb0acc77a5c3be637eef675d22923e2ee1086774248ca687f1","observation_id":"207316a0-cfd2-4fcc-a0e8-fb365fb7a7ff","resolution":{"observed_at":"2026-08-05T13:17:03.091366Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:17:03.066408Z","title":"Broshuis, The Small Stellated Dodecahedron Code - Finding Interleaved Measurement Schedules, Bachelor’s thesis, TU Delft, Delft, Netherland (2024)","venue":null,"work_id":"527dc5c8-7b56-4dd2-84a4-7d41ff758a14","year":2024},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:02.000226Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:79b8ab4a27988a9986867024b84079eef2398edb5cb472df49bd4c1b88db005f","observation_id":"aabb367b-3471-4b1b-b5f4-a7d485667725","resolution":{"observed_at":"2026-08-05T13:17:03.072208Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:17:03.047407Z","title":"Quantum Error Cor- rection with Only Two Extra Qubits","venue":null,"work_id":"e8b89a81-ed8d-4bac-9f66-41298aab9993","year":2018},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:02.006327Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:f33118fbd1e7d4c0a201e98e3bb2e454692062668d6a18716b4a4975cf4787c9","observation_id":"28d71401-f1e3-4b60-92ab-b8ec8b99c7f3","resolution":{"observed_at":"2026-08-05T13:17:03.053604Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:17:03.027329Z","title":"Low-distance surface codes under realistic quantum noise","venue":null,"work_id":"59dd7bc3-f3ea-45a4-8b09-4c7f57812176","year":2014},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:02.011550Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:bad1860ddb50a94d35726b4146ba840ffc36945ba9e1563d1a64e8bbe4c04554","observation_id":"55718596-3c5e-4493-ab3a-1a489b223c80","resolution":{"observed_at":"2026-08-05T13:17:03.032895Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:17:03.006318Z","title":"The surface code with a twist","venue":null,"work_id":"f12127af-ba0d-4950-8c54-3a9e33395b34","year":2017},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:02.016647Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:3035b118eecbfbc3985c0d8c67297ffd4d28919f259c450996e007bdf53ebfa6","observation_id":"621f1c1b-2fa6-42a4-b97a-5f60055e354b","resolution":{"observed_at":"2026-08-05T13:17:03.011534Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:17:02.987868Z","title":"Bench- marking the Planar Honeycomb Code","venue":null,"work_id":"44257d21-c1ad-4c60-b50d-879d32ab3937","year":2022},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:02.021664Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:4267d149d28e4ce353f11391bfb92ed2ca15047ad0089c4e8844efe5bd266a9e","observation_id":"6eda8170-eb65-45ef-af49-1fc643370e14","resolution":{"observed_at":"2026-08-05T13:17:02.993262Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:17:02.966222Z","title":"Degenerate Quantum LDPC Codes With Good Finite Length Performance","venue":null,"work_id":"098392a1-9010-4dba-8b16-d09775eeba30","year":2021},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:02.026503Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:d91e9bf987f1ee5c0d87b3079de2d9c26a38edee5e82d0c51653ce5a160100bb","observation_id":"a9874a6a-6d1d-43c0-9425-87ded20aa9b1","resolution":{"observed_at":"2026-08-05T13:17:02.972219Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-05T13:17:02.031681Z","title":"Decoding across the quantum low-density parity-check code landscape","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:02.031681Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:f96864f2f9bb99f186762f367236e986c23870d080917e068dca2b88eb20234d","observation_id":"323e8a2c-04d8-4308-bd59-77419ae0a31e","resolution":{"observed_at":"2026-08-05T13:17:02.031681Z","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-05T13:17:02.944655Z","title":"LDPC: Python tools for low density parity check codes","venue":null,"work_id":"2e5c3160-e1b4-4288-bc8d-c10e9cb93302","year":2022},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:02.036373Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:d1234875a1949e7035de8d5ec1e52bec38c55d159b2b26d8641e5137f071375e","observation_id":"4ab4c49a-0879-4ba7-9d99-fab6ddf399b0","resolution":{"observed_at":"2026-08-05T13:17:02.950585Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:17:02.922032Z","title":"Superconduct- ing processor design optimization for quantum error cor- rection performance","venue":null,"work_id":"b668a801-f7b1-4a47-a08d-00c85a68c63b","year":null},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:02.041066Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:eb799bdaa79a8f92b27a7c1fc39cdfaf0b4411e846298febaf071127acffd87e","observation_id":"6e7f0dd3-10be-4db3-a1ca-981344dca104","resolution":{"observed_at":"2026-08-05T13:17:02.929905Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:17:02.900632Z","title":"Louvre: Relaxing Hardware Requirements of Quantum LDPC Codes by Routing with Expanded Quantum Instruction Set","venue":null,"work_id":"8cca81fa-4387-40d9-ad8f-3b76700816d7","year":2025},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:02.046213Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:d5239cafa3d537f0a4c8bc12d01baf2bf02d643bd35bff0a2c10298fd29dda3c","observation_id":"9a0e251b-f75d-46ef-9d62-9cdf71ec9d62","resolution":{"observed_at":"2026-08-05T13:17:02.907246Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:17:02.881010Z","title":"Spectator Errors in Tun- able Coupling Architectures","venue":null,"work_id":"8975b834-05ff-4855-b871-67403e94d3b4","year":2021},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:02.050998Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:7942977bc1b7396cfd7951c54d2cbc6c4e2234363b05f1fef99b6f2525fe57ee","observation_id":"3e1ead99-ab4a-4759-b037-9fa9a6832894","resolution":{"observed_at":"2026-08-05T13:17:02.886693Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:17:02.863027Z","title":"Learning Correlated Noise in a 39-Qubit Quantum Processor","venue":null,"work_id":"174bb6b1-e64f-4573-b69a-ee8a0ff75dfb","year":2023},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:02.056286Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:24097e564f1044d276cc7de0f69b895cca75e99cbcd2f43a691066328ab7c55d","observation_id":"bf50a09b-6aa2-41a6-9725-e4e842614782","resolution":{"observed_at":"2026-08-05T13:17:02.868354Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:17:02.844506Z","title":"Optimizing quantum gates towards the scale of logical qubits","venue":null,"work_id":"cf9bb210-283f-4be6-9172-b0f05d57c484","year":2024},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:02.061331Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:c89dcc504c79f11676bf42a7bdf62d653f47bf3afa68a21f2595ddc012dd7c61","observation_id":"b92b8f5c-e7e1-41cb-870d-c53110d5db52","resolution":{"observed_at":"2026-08-05T13:17:02.850964Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:17:02.827448Z","title":"Low-density parity-check representation of fault- tolerant quantum circuits","venue":null,"work_id":"7938c131-3846-4c81-92bf-650de4e41542","year":2025},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:02.067787Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:1d5d3acd82829b6ff19b183ee3404e52329e7a32a37c6616b15f01018555bc7d","observation_id":"c3c23f70-e4f1-42b3-8257-ed4de68dc97c","resolution":{"observed_at":"2026-08-05T13:17:02.832308Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-05T13:17:02.072542Z","title":"Designing fault-tolerant circuits using de- tector error models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-05T13:17:02.072542Z"},"links":{"citing_paper":"/paper/2509.00850"},"observation_digest":"sha256:6e1525e3f91ee23a97da372adcdf26c1da7c4b1b4e88a071e89a74d46c6d9f92","observation_id":"7e3da303-d43f-49ae-b565-e0bc8729fbb9","resolution":{"observed_at":"2026-08-05T13:17:02.072542Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2509.00850","last_updated":"2025-08-31T13:51:05Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-13T02:16:30.984030Z","submitted_at":"2025-08-31T13:51:05Z","title":"A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes"},"reference_resolution":{"displayed":73,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":13,"verified_exact":1,"verified_fuzzy":59},"total_outbound_references":73},"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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 73 of 73 outbound references and 5 inbound Pith citation observations for arXiv:2509.00850."}