{"as_of":"2026-08-05T05:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2b0ef651c13a4153471647f0d42205b24440294d4cda767c708081a81e9a0d5b","coverage":[{"denominator":28,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":28,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-11T11:50:26.030339Z","state":"measured"},{"denominator":102,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":102,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-04T06:34:03.388597+00:00","state":"measured"},{"denominator":74,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":74,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T18:53:46.915251Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"pith","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":4,"observed_at":"2026-08-05T02:28:24.338817Z","source":"pith"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":"2506.03094","doi":"10.48550/arxiv.2506.03094","metadata_source":"pith","pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","venue":"quant-ph","work_id":"8dc68421-a34c-4895-bb8a-2378446b9e03","year":2025},"citing_paper":{"arxiv_id":"2410.11942","last_updated":"2026-05-11T04:48:38Z","snapshot_observed_at":"2026-07-06T19:34:05.643989Z","submitted_at":"2024-10-15T18:00:00Z","title":"Operator algebra and algorithmic construction of boundaries and defects in (2+1)D topological Pauli stabilizer codes","version":5},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-05-23T18:41:14.926900Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2410.11942"},"observation_digest":"sha256:1c71d9df49e79bfb061b83f1157fe8e79a7599c269b23664ba4065d4ea9b1a9e","observation_id":"57b0ea6b-5f6a-4774-aea4-c93d11a4ac37","resolution":{"observed_at":"2026-05-23T18:43:19.050947Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":"2506.03094","doi":"10.48550/arxiv.2506.03094","metadata_source":"pith","pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","venue":"quant-ph","work_id":"8dc68421-a34c-4895-bb8a-2378446b9e03","year":2025},"citing_paper":{"arxiv_id":"2411.10406","last_updated":"2026-03-13T03:26:12Z","snapshot_observed_at":"2026-07-06T19:51:05.604758Z","submitted_at":"2024-11-15T18:22:46Z","title":"How to Build a Quantum Supercomputer: Scaling from Hundreds to Millions of Qubits","version":3},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-05-18T22:41:36.363536Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2411.10406"},"observation_digest":"sha256:50a75ded88264d559b8d86d309be30388ed0b29431db2ab6c0759e001cd0e5bd","observation_id":"f962d570-0c15-4719-a8bf-ae7ecf81fcc3","resolution":{"observed_at":"2026-05-18T22:41:36.603661Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":"2506.03094","doi":"10.48550/arxiv.2506.03094","metadata_source":"pith","pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","venue":"quant-ph","work_id":"8dc68421-a34c-4895-bb8a-2378446b9e03","year":2025},"citing_paper":{"arxiv_id":"2503.05003","last_updated":"2026-01-22T18:18:17Z","snapshot_observed_at":"2026-07-06T20:48:13.849680Z","submitted_at":"2025-03-06T22:05:52Z","title":"Parallel Logical Measurements via Quantum Code Surgery","version":3},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-05-23T00:29:29.522530Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2503.05003"},"observation_digest":"sha256:81ef6194838b772f0bd83ee9d7904e22fe58cbe236a059f8a0025868f485dfd8","observation_id":"1a5dfc42-24aa-4051-9547-b91a3fb35713","resolution":{"observed_at":"2026-05-23T00:32:18.345251Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":"2506.03094","doi":"10.48550/arxiv.2506.03094","metadata_source":"pith","pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","venue":"quant-ph","work_id":"8dc68421-a34c-4895-bb8a-2378446b9e03","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":53,"source":"pdf_text","source_observed_at":"2026-05-19T02:09:15.662431Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2507.23011"},"observation_digest":"sha256:d8a17d22c51414c5ccbc864c10936ba8ed7c1d11da3a7b6f627fad63736df418","observation_id":"53721dcd-ba05-4439-a9ce-9ae42ace8edb","resolution":{"observed_at":"2026-05-19T02:11:59.440684Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":"2506.03094","doi":"10.48550/arxiv.2506.03094","metadata_source":"pith","pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","venue":"quant-ph","work_id":"8dc68421-a34c-4895-bb8a-2378446b9e03","year":2025},"citing_paper":{"arxiv_id":"2508.10714","last_updated":"2025-11-06T19:03:24Z","snapshot_observed_at":"2026-07-06T22:13:00.029560Z","submitted_at":"2025-08-14T14:56:50Z","title":"Magic tricycles: Efficient magic state generation with finite block-length quantum LDPC codes","version":2},"reference_index":97,"source":"pdf_text","source_observed_at":"2026-05-18T22:51:30.133403Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2508.10714"},"observation_digest":"sha256:15372a99c66b47f2dc96766a260b6d4fd01e27291c603ca304cf543798d61198","observation_id":"faca3b9e-3792-4e4e-b643-f909b1873995","resolution":{"observed_at":"2026-05-18T22:51:52.970983Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":"2506.03094","doi":"10.48550/arxiv.2506.03094","metadata_source":"pith","pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","venue":"quant-ph","work_id":"8dc68421-a34c-4895-bb8a-2378446b9e03","year":2025},"citing_paper":{"arxiv_id":"2508.11765","last_updated":"2026-01-27T20:25:46Z","snapshot_observed_at":"2026-08-02T18:46:25.302981Z","submitted_at":"2025-08-15T18:31:37Z","title":"The Role of Quantum Computing in Advancing Scientific High-Performance Computing: A perspective from the ADAC Institute","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-18T22:19:39.677935Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2508.11765"},"observation_digest":"sha256:7c8fc67663c312611296f95eae9a922e26fe2b96baec694a6f4ad15adb8e1f8e","observation_id":"7d7fa3b1-5edc-407f-8b5d-256383e55daf","resolution":{"observed_at":"2026-05-18T22:21:52.987735Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":"2506.03094","doi":"10.48550/arxiv.2506.03094","metadata_source":"pith","pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","venue":"quant-ph","work_id":"8dc68421-a34c-4895-bb8a-2378446b9e03","year":2025},"citing_paper":{"arxiv_id":"2508.19160","last_updated":"2026-04-23T17:16:44Z","snapshot_observed_at":"2026-07-06T22:19:00.152099Z","submitted_at":"2025-08-26T16:09:45Z","title":"Architecting Distributed Quantum Computers: Design Insights from Resource Estimation","version":2},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-05-18T21:14:24.329406Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2508.19160"},"observation_digest":"sha256:0aa61d495ecb57f7bf4a33b015735d289319fdb0c79a38b33983e6234a89032f","observation_id":"24805daf-9cc8-4e3a-ad8f-0f11d6c39385","resolution":{"observed_at":"2026-05-13T19:33:59.899165Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-04T18:37:23.402432Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.09882","last_updated":"2025-09-11T22:26:57Z","snapshot_observed_at":"2026-08-04T18:37:19.655046Z","submitted_at":"2025-09-11T22:26:57Z","title":"Quantum Computing Technology Roadmaps and Capability Assessment for Scientific Computing -- An analysis of use cases from the NERSC workload","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-04T18:37:23.402432Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2509.09882"},"observation_digest":"sha256:f822b510aace211d705755ca9466cc0468b705a19c93a307fb425d6a2379693e","observation_id":"cbd39ddb-82a6-4315-a657-87246702c701","resolution":{"observed_at":"2026-08-04T18:37:23.402432Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-04T15:51:50.670507Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.18294","last_updated":"2026-05-29T17:17:12Z","snapshot_observed_at":"2026-08-04T15:50:28.664459Z","submitted_at":"2025-09-22T18:23:28Z","title":"Transversal architecture for megaquop-scale quantum simulation with neutral atoms","version":2},"reference_index":92,"source":"pdf_text","source_observed_at":"2026-08-04T15:51:50.670507Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2509.18294"},"observation_digest":"sha256:de09cdeafb5b1fa1ddefda6495bf69c8622d98a0ee36344454380fbed16f5782","observation_id":"d2d32797-b865-4ca5-864a-38def110c365","resolution":{"observed_at":"2026-08-04T15:51:50.670507Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":"2506.03094","doi":"10.48550/arxiv.2506.03094","metadata_source":"pith","pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","venue":"quant-ph","work_id":"8dc68421-a34c-4895-bb8a-2378446b9e03","year":2025},"citing_paper":{"arxiv_id":"2510.05221","last_updated":"2026-05-02T10:58:00Z","snapshot_observed_at":"2026-07-06T22:31:53.944103Z","submitted_at":"2025-10-06T18:00:47Z","title":"Fault-tolerant interfaces for modular quantum computing on diverse qubit platforms","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-05-18T09:07:58.878012Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2510.05221"},"observation_digest":"sha256:989a31982abdb0865fb98c76ccbb09fc4d75ab72af396076ba041d428c266f66","observation_id":"7f67d799-b108-4951-92f1-ced7d10d79cb","resolution":{"observed_at":"2026-05-18T09:11:09.786649Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-04T10:54:42.491823Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.08290","last_updated":"2026-06-25T05:49:44Z","snapshot_observed_at":"2026-08-04T10:54:30.782379Z","submitted_at":"2025-10-09T14:42:35Z","title":"Theory and Architecture of Syndrome-Resolved Logical Gates","version":2},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-04T10:54:42.491823Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2510.08290"},"observation_digest":"sha256:c598fc17a11eaa858e57e123b2b4cf85b46f2acea2adcfad1679a3df92e1dcba","observation_id":"abb930e5-484a-4d76-be85-743cf2abec54","resolution":{"observed_at":"2026-08-04T10:54:42.491823Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-04T10:47:12.160496Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.08695","last_updated":"2026-07-08T05:33:05Z","snapshot_observed_at":"2026-08-04T10:47:08.963214Z","submitted_at":"2025-10-09T18:01:30Z","title":"Degeneracy Cutting: A Local and Efficient Post-Processing for Belief Propagation Decoding of Quantum Low-Density Parity-Check Codes","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.160496Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:ddaabc6d8a5fae8b0c288c764fb14842ebc8c31c1ca2021e51df888b81d10f60","observation_id":"da55ae40-dc37-429c-b6e9-0d46828a6fdc","resolution":{"observed_at":"2026-08-04T10:47:12.160496Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-04T08:32:08.965697Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.20489","last_updated":"2026-06-30T08:59:51Z","snapshot_observed_at":"2026-08-04T08:32:06.026355Z","submitted_at":"2025-10-23T12:30:55Z","title":"Phenomenological Noise Models and Optimal Thresholds of the 3D Toric Code","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-04T08:32:08.965697Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2510.20489"},"observation_digest":"sha256:88e18dfa5ee8f83bef55939f4d85f6132926aafc34d8e02491ab8d23c731a191","observation_id":"fa70fae5-93c2-4d6a-82a8-197f51476540","resolution":{"observed_at":"2026-08-04T08:32:08.965697Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":"2506.03094","doi":"10.48550/arxiv.2506.03094","metadata_source":"pith","pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","venue":"quant-ph","work_id":"8dc68421-a34c-4895-bb8a-2378446b9e03","year":2025},"citing_paper":{"arxiv_id":"2511.04430","last_updated":"2026-05-06T23:02:15Z","snapshot_observed_at":"2026-07-06T22:35:02.737645Z","submitted_at":"2025-11-06T15:05:17Z","title":"Symmetry-enriched topological order and quasifractonic behavior in $\\mathbb{Z}_N$ stabilizer codes","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-05-18T01:01:08.043585Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2511.04430"},"observation_digest":"sha256:8ad28e8eb3bd68cf482e568913ba9f063ee04f50eec083ed4079d1a3a08df07f","observation_id":"06560034-b85a-4877-8579-992811869190","resolution":{"observed_at":"2026-05-18T01:02:15.448464Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-03T21:53:44.206407Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.13560","last_updated":"2026-06-19T13:50:26Z","snapshot_observed_at":"2026-08-03T21:53:39.997731Z","submitted_at":"2025-11-17T16:26:15Z","title":"Sequences of Bivariate Bicycle Codes from Covering Graphs","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-03T21:53:44.206407Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2511.13560"},"observation_digest":"sha256:76f03f0049cdfd165f590a278e4ed80693cc881e2673205b095f6909c805f24b","observation_id":"7b7191cb-ddfb-4c1f-8d36-fa5a59016f84","resolution":{"observed_at":"2026-08-03T21:53:44.206407Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-03T21:56:51.182215Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.13721","last_updated":"2026-06-11T17:28:03Z","snapshot_observed_at":"2026-08-03T21:56:47.960439Z","submitted_at":"2025-11-17T18:59:59Z","title":"Quantum Error Correction Codes for Truncated SU(2) Lattice Gauge Theories","version":2},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-03T21:56:51.182215Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2511.13721"},"observation_digest":"sha256:5e08126eb26258f47718b7f01431b97ef6ab58bb66893407cdcb8e44c639c220","observation_id":"f1cf1747-290b-4cb5-b1d1-b83159cd4beb","resolution":{"observed_at":"2026-08-03T21:56:51.182215Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":"2506.03094","doi":"10.48550/arxiv.2506.03094","metadata_source":"pith","pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","venue":"quant-ph","work_id":"8dc68421-a34c-4895-bb8a-2378446b9e03","year":2025},"citing_paper":{"arxiv_id":"2512.06484","last_updated":"2026-07-27T08:19:42Z","snapshot_observed_at":"2026-08-03T18:14:58.021281Z","submitted_at":"2025-12-06T16:16:20Z","title":"PureMagic: A Dynamic Scheduler for Lattice Surgery","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-21T17:16:55.744680Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2512.06484"},"observation_digest":"sha256:9e6709f4faa7da0553e5fa9782d863b6b10afda33187a069c8014bdad18788af","observation_id":"493e704d-e7c1-4c98-bee2-3105444bc3d6","resolution":{"observed_at":"2026-05-21T17:20:25.444178Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-03T18:15:09.052958Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2512.06484","last_updated":"2026-07-27T08:19:42Z","snapshot_observed_at":"2026-08-03T18:14:58.021281Z","submitted_at":"2025-12-06T16:16:20Z","title":"PureMagic: A Dynamic Scheduler for Lattice Surgery","version":6},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-03T18:15:09.052958Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2512.06484"},"observation_digest":"sha256:22e350d4698ef1570ef0ecad226aba16a944a43b5d0773254855d534326f92f3","observation_id":"be36a2ba-4a0d-4514-bf9b-681dd26e78ff","resolution":{"observed_at":"2026-08-03T18:15:09.052958Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":"2506.03094","doi":"10.48550/arxiv.2506.03094","metadata_source":"pith","pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","venue":"quant-ph","work_id":"8dc68421-a34c-4895-bb8a-2378446b9e03","year":2025},"citing_paper":{"arxiv_id":"2512.09189","last_updated":"2025-12-09T23:23:40Z","snapshot_observed_at":"2026-07-06T22:38:35.387503Z","submitted_at":"2025-12-09T23:23:40Z","title":"Exact and Efficient Stabilizer Simulation of Thermal-Relaxation Noise for Quantum Error Correction","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-16T23:30:13.523299Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2512.09189"},"observation_digest":"sha256:7a862f9dc8a85d8a0ea3b9914eb809d9687afd8da7593cf7cdcc55e02ca98554","observation_id":"43d944ac-f78e-42b5-87ed-5d172d1bdc13","resolution":{"observed_at":"2026-05-16T23:31:22.146761Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-03T08:00:03.729545Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.18879","last_updated":"2026-05-24T01:40:16Z","snapshot_observed_at":"2026-08-03T11:12:49.778747Z","submitted_at":"2026-01-26T19:00:03Z","title":"Multivariate Multicycle Codes for Complete Single-Shot Decoding","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-03T08:00:03.729545Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2601.18879"},"observation_digest":"sha256:6227ab97dfb23cdc012ade0ae9ec33ee9d57f3a3e964747b7ca0e2d870dd36b8","observation_id":"c632c76e-6155-4829-a8d3-5592399d476d","resolution":{"observed_at":"2026-08-03T08:00:03.729545Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":"2506.03094","doi":"10.48550/arxiv.2506.03094","metadata_source":"pith","pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","venue":"quant-ph","work_id":"8dc68421-a34c-4895-bb8a-2378446b9e03","year":2025},"citing_paper":{"arxiv_id":"2602.04831","last_updated":"2026-03-19T05:45:14Z","snapshot_observed_at":"2026-07-09T23:17:12.705388Z","submitted_at":"2026-02-04T18:19:32Z","title":"Review of Superconducting Qubit Devices and Their Large-Scale Integration","version":2},"reference_index":220,"source":"pdf_text","source_observed_at":"2026-05-16T07:10:57.518161Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2602.04831"},"observation_digest":"sha256:feaba1c96ff5f809de2fff83b281daa1f2cfb42e3587fee5a63dc0ea6b1e0469","observation_id":"5aba31c9-2063-4cd1-a7d2-1a717ad5c11e","resolution":{"observed_at":"2026-05-16T07:12:29.374737Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":"2506.03094","doi":"10.48550/arxiv.2506.03094","metadata_source":"pith","pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","venue":"quant-ph","work_id":"8dc68421-a34c-4895-bb8a-2378446b9e03","year":2025},"citing_paper":{"arxiv_id":"2602.11457","last_updated":"2026-05-05T14:58:57Z","snapshot_observed_at":"2026-07-06T22:45:34.674215Z","submitted_at":"2026-02-12T00:30:48Z","title":"The Pinnacle Architecture: Reducing the cost of breaking RSA-2048 to 100 000 physical qubits using quantum LDPC codes","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-16T05:27:23.269152Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2602.11457"},"observation_digest":"sha256:6e9a7749486ca945a38196c993f281cc58669baec331aa44e993f206ec64a684","observation_id":"31255964-ec00-40cb-98ec-b98b579e0eba","resolution":{"observed_at":"2026-05-13T19:33:59.899165Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":"2506.03094","doi":"10.48550/arxiv.2506.03094","metadata_source":"pith","pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","venue":"quant-ph","work_id":"8dc68421-a34c-4895-bb8a-2378446b9e03","year":2025},"citing_paper":{"arxiv_id":"2602.13094","last_updated":"2026-05-13T13:54:41Z","snapshot_observed_at":"2026-07-06T22:45:49.118915Z","submitted_at":"2026-02-13T17:00:03Z","title":"A Quantum Reservoir Computing Approach to Quantum Stock Movement Forecasting in Quantum-Invested Markets","version":2},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-05-15T22:27:38.431667Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2602.13094"},"observation_digest":"sha256:17aec8fa44d10af1082fc370888536bec4f92e52d2146d7fed6c8c04d2322437","observation_id":"129be478-a940-461d-9df2-5d5544f6efec","resolution":{"observed_at":"2026-05-15T22:30:22.178399Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-02T21:28:00.444199Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.20546","last_updated":"2026-06-02T15:13:30Z","snapshot_observed_at":"2026-08-02T21:27:53.468174Z","submitted_at":"2026-02-24T04:57:42Z","title":"Distilling Magic States in the Bicycle Architecture","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-02T21:28:00.444199Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2602.20546"},"observation_digest":"sha256:5c0442f55c209aac69175305dec62db636e560cbc1e3fdf5d0972fc2637c6193","observation_id":"92dac8fd-0434-4858-9c7b-6c27f91a4faa","resolution":{"observed_at":"2026-08-02T21:28:00.444199Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-02T20:44:33.904155Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.22770","last_updated":"2026-06-08T17:16:15Z","snapshot_observed_at":"2026-08-02T20:44:31.689074Z","submitted_at":"2026-02-26T09:00:20Z","title":"A matching decoder for bivariate bicycle codes","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-02T20:44:33.904155Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2602.22770"},"observation_digest":"sha256:529a49f8a2786ae217505466bf05f9dc5b9f7760a558fdf952a40a7baecaeea5","observation_id":"5b037ed9-a097-4355-9214-b663578889e3","resolution":{"observed_at":"2026-08-02T20:44:33.904155Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":"2506.03094","doi":"10.48550/arxiv.2506.03094","metadata_source":"pith","pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","venue":"quant-ph","work_id":"8dc68421-a34c-4895-bb8a-2378446b9e03","year":2025},"citing_paper":{"arxiv_id":"2603.05429","last_updated":"2026-03-05T17:51:50Z","snapshot_observed_at":"2026-07-06T22:47:59.530407Z","submitted_at":"2026-03-05T17:51:50Z","title":"Constant depth magic state cultivation with Clifford measurements by gauging","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-15T16:06:44.792360Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2603.05429"},"observation_digest":"sha256:75eead417c631682292641bda908d31e4161fe7a2775e8a2056c7bb2aebb08f0","observation_id":"cdc69037-1c33-4bc9-a274-d386cc6b2afc","resolution":{"observed_at":"2026-05-15T16:10:09.427303Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":"2506.03094","doi":"10.48550/arxiv.2506.03094","metadata_source":"pith","pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","venue":"quant-ph","work_id":"8dc68421-a34c-4895-bb8a-2378446b9e03","year":2025},"citing_paper":{"arxiv_id":"2603.28846","last_updated":"2026-04-15T16:50:58Z","snapshot_observed_at":"2026-07-06T22:51:09.377351Z","submitted_at":"2026-03-30T17:59:25Z","title":"Securing Elliptic Curve Cryptocurrencies against Quantum Vulnerabilities: Resource Estimates and Mitigations","version":2},"reference_index":117,"source":"pdf_text","source_observed_at":"2026-05-14T21:29:00.763638Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2603.28846"},"observation_digest":"sha256:737f2af64bcad45c45dc1c2bb64a7b3e0f041e9bc2301b4116c8f13a0fd26ecb","observation_id":"f7026604-3939-4229-acc5-ae3510bade05","resolution":{"observed_at":"2026-05-14T21:29:28.501275Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":"2506.03094","doi":"10.48550/arxiv.2506.03094","metadata_source":"pith","pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","venue":"quant-ph","work_id":"8dc68421-a34c-4895-bb8a-2378446b9e03","year":2025},"citing_paper":{"arxiv_id":"2604.01040","last_updated":"2026-04-14T20:52:40Z","snapshot_observed_at":"2026-08-02T16:09:55.399051Z","submitted_at":"2026-04-01T15:50:51Z","title":"Geometry-induced correlated noise in qLDPC syndrome extraction","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-05-13T22:08:43.050338Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2604.01040"},"observation_digest":"sha256:611beecd815d32f61be5e0d6c150d3729a20bdb6a8399b7736c323b4dfa7ce79","observation_id":"9a37d882-5c6c-4742-ab6b-0c6c9b00272a","resolution":{"observed_at":"2026-05-13T22:13:20.774642Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":"2506.03094","doi":"10.48550/arxiv.2506.03094","metadata_source":"pith","pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","venue":"quant-ph","work_id":"8dc68421-a34c-4895-bb8a-2378446b9e03","year":2025},"citing_paper":{"arxiv_id":"2604.03435","last_updated":"2026-04-03T20:19:30Z","snapshot_observed_at":"2026-07-06T22:52:39.423471Z","submitted_at":"2026-04-03T20:19:30Z","title":"A High Motional Frequency Ion Trapping Regime for Quantum Information Science","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-05-13T18:53:38.651452Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2604.03435"},"observation_digest":"sha256:4f9747b2d282e80ac1f15c2817daec9c326b54261dd2d2abfc068430018300bb","observation_id":"04396769-9bd0-4f5a-a5ba-cebacaf72f67","resolution":{"observed_at":"2026-05-13T19:33:59.899165Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":"2506.03094","doi":"10.48550/arxiv.2506.03094","metadata_source":"pith","pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","venue":"quant-ph","work_id":"8dc68421-a34c-4895-bb8a-2378446b9e03","year":2025},"citing_paper":{"arxiv_id":"2604.05126","last_updated":"2026-04-06T19:40:46Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-06T19:40:46Z","title":"In-Situ Simultaneous Magic State Injection on Arbitrary CSS qLDPC Codes","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-05-10T18:57:36.013957Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2604.05126"},"observation_digest":"sha256:fb034aab198339ae2851246f8412e56b69d7ede77e3292e62df2fbdf93e6c450","observation_id":"2fe3559f-2a2e-4d14-8016-fa428009615c","resolution":{"observed_at":"2026-05-13T19:33:59.899165Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":"2506.03094","doi":"10.48550/arxiv.2506.03094","metadata_source":"pith","pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","venue":"quant-ph","work_id":"8dc68421-a34c-4895-bb8a-2378446b9e03","year":2025},"citing_paper":{"arxiv_id":"2604.06319","last_updated":"2026-04-13T18:52:34Z","snapshot_observed_at":"2026-07-06T22:54:48.916799Z","submitted_at":"2026-04-07T18:00:11Z","title":"Heterogeneous architectures enable a 138x reduction in physical qubit requirements for fault-tolerant quantum computing under detailed accounting","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-10T18:34:54.008258Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2604.06319"},"observation_digest":"sha256:0cf6eab269e43d1a3cf94cce30864daf0bf8a78cd90d0084e1aa279d9317f055","observation_id":"bd2b1892-0c45-4b2f-9279-4f18ed6de7af","resolution":{"observed_at":"2026-05-13T19:33:59.899165Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":"2506.03094","doi":"10.48550/arxiv.2506.03094","metadata_source":"pith","pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","venue":"quant-ph","work_id":"8dc68421-a34c-4895-bb8a-2378446b9e03","year":2025},"citing_paper":{"arxiv_id":"2604.06322","last_updated":"2026-04-07T18:00:35Z","snapshot_observed_at":"2026-08-02T12:12:15.120160Z","submitted_at":"2026-04-07T18:00:35Z","title":"Probing the Planck scale with quantum computation","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-10T18:29:52.572161Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2604.06322"},"observation_digest":"sha256:5be012eccc9e659713117d38f336b27e1140c72977e05c869b8d17b3eec6be4e","observation_id":"dd9ab7ce-7419-440c-adfd-1f94cd04e81b","resolution":{"observed_at":"2026-05-13T19:33:59.899165Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":"2506.03094","doi":"10.48550/arxiv.2506.03094","metadata_source":"pith","pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","venue":"quant-ph","work_id":"8dc68421-a34c-4895-bb8a-2378446b9e03","year":2025},"citing_paper":{"arxiv_id":"2604.09797","last_updated":"2026-04-20T21:10:18Z","snapshot_observed_at":"2026-08-03T07:43:56.563135Z","submitted_at":"2026-04-10T18:19:25Z","title":"Optimising Quantum Error Correction Using Morphing Circuits","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-05-10T17:55:08.272761Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2604.09797"},"observation_digest":"sha256:14a9c07d7562a84b64e84f01d8cb41c2005e772204836e5185142765ca643452","observation_id":"6b83b967-bb09-4a1c-acb4-85fe855141f3","resolution":{"observed_at":"2026-05-13T19:33:59.899165Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":"2506.03094","doi":"10.48550/arxiv.2506.03094","metadata_source":"pith","pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","venue":"quant-ph","work_id":"8dc68421-a34c-4895-bb8a-2378446b9e03","year":2025},"citing_paper":{"arxiv_id":"2604.11352","last_updated":"2026-04-13T11:49:57Z","snapshot_observed_at":"2026-08-02T05:40:57.868888Z","submitted_at":"2026-04-13T11:49:57Z","title":"Analytical Theory of Greedy Peeling for Bivariate Bicycle Codes and Two-Shot Streaming Decoding","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-10T15:11:42.666572Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2604.11352"},"observation_digest":"sha256:b896db62f7823f9a618d14b60f1f25e83893da8636a158e14d0f3a65e1ecac75","observation_id":"52d0cd8e-0c55-4d74-a477-ddf8bd71777d","resolution":{"observed_at":"2026-05-13T19:33:59.899165Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":"2506.03094","doi":"10.48550/arxiv.2506.03094","metadata_source":"pith","pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","venue":"quant-ph","work_id":"8dc68421-a34c-4895-bb8a-2378446b9e03","year":2025},"citing_paper":{"arxiv_id":"2604.13964","last_updated":"2026-04-15T15:14:41Z","snapshot_observed_at":"2026-08-02T08:33:26.904905Z","submitted_at":"2026-04-15T15:14:41Z","title":"Dimensioning of Quantum Memories for Distilled Quantum EPR Packets","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-10T12:45:06.029512Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2604.13964"},"observation_digest":"sha256:5dadabeda30bcbf9ac130808baef25a1caa430005c6598e5411a638db3315287","observation_id":"2b6a0c8e-509e-4c82-ad3f-9f51a9ca0732","resolution":{"observed_at":"2026-05-13T19:33:59.899165Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":"2506.03094","doi":"10.48550/arxiv.2506.03094","metadata_source":"pith","pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","venue":"quant-ph","work_id":"8dc68421-a34c-4895-bb8a-2378446b9e03","year":2025},"citing_paper":{"arxiv_id":"2604.16209","last_updated":"2026-06-26T21:06:12Z","snapshot_observed_at":"2026-08-02T13:05:05.240699Z","submitted_at":"2026-04-17T16:19:55Z","title":"Towards Ultra-High-Rate Quantum Error Correction with Reconfigurable Atom Arrays","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-05-10T09:09:21.862128Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2604.16209"},"observation_digest":"sha256:19cef81f55c880a0cc1519b5ecdf12ba7a33f5e5e52b7236a71b627bf5b7d83c","observation_id":"0f9390a0-5b8a-4efe-93c5-f83e3945ce3a","resolution":{"observed_at":"2026-05-13T19:33:59.899165Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":"2506.03094","doi":"10.48550/arxiv.2506.03094","metadata_source":"pith","pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","venue":"quant-ph","work_id":"8dc68421-a34c-4895-bb8a-2378446b9e03","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":16,"source":"pdf_text","source_observed_at":"2026-05-10T04:46:26.589764Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2604.18714"},"observation_digest":"sha256:e98688b6abd6a90e0ec221b91c2bb97e8ed0ec1067c1103b2cebcc6058a1cf8e","observation_id":"193b547a-37e5-4f29-ad24-953b4e606233","resolution":{"observed_at":"2026-05-13T19:33:59.899165Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":"2506.03094","doi":"10.48550/arxiv.2506.03094","metadata_source":"pith","pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","venue":"quant-ph","work_id":"8dc68421-a34c-4895-bb8a-2378446b9e03","year":2025},"citing_paper":{"arxiv_id":"2604.19319","last_updated":"2026-04-21T10:28:02Z","snapshot_observed_at":"2026-08-04T16:38:00.628918Z","submitted_at":"2026-04-21T10:28:02Z","title":"An Oracle-Free Quantum Algorithm for Nonadiabatic Quantum Molecular Dynamics","version":1},"reference_index":146,"source":"pdf_text","source_observed_at":"2026-05-10T02:42:29.575743Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2604.19319"},"observation_digest":"sha256:a7f97d652125e48561ac46fe2c30191fae0fa55a71f479538e96c2a88bc3ceda","observation_id":"2ad295a4-3aeb-4a3d-aecc-55815a0d8040","resolution":{"observed_at":"2026-05-13T19:33:59.899165Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":"2506.03094","doi":"10.48550/arxiv.2506.03094","metadata_source":"pith","pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","venue":"quant-ph","work_id":"8dc68421-a34c-4895-bb8a-2378446b9e03","year":2025},"citing_paper":{"arxiv_id":"2604.19481","last_updated":"2026-04-21T14:02:12Z","snapshot_observed_at":"2026-08-02T05:59:04.891529Z","submitted_at":"2026-04-21T14:02:12Z","title":"Fault-Tolerant Quantum Computing with Trapped Ions: The Walking Cat Architecture","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-10T02:15:19.433368Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2604.19481"},"observation_digest":"sha256:643aa8255e4cfc0320e68934be12b52f7412bf9d89456197bb8e731f4e912b62","observation_id":"123db217-4530-4a8c-8656-2f851a9e5cfd","resolution":{"observed_at":"2026-05-13T19:33:59.899165Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":"2506.03094","doi":"10.48550/arxiv.2506.03094","metadata_source":"pith","pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","venue":"quant-ph","work_id":"8dc68421-a34c-4895-bb8a-2378446b9e03","year":2025},"citing_paper":{"arxiv_id":"2604.19735","last_updated":"2026-04-21T17:57:43Z","snapshot_observed_at":"2026-07-06T23:06:21.774788Z","submitted_at":"2026-04-21T17:57:43Z","title":"Architecting Early Fault Tolerant Neutral Atoms Systems with Quantum Advantage","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-05-10T02:52:43.444049Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2604.19735"},"observation_digest":"sha256:476bcd771277a180af505de3cf410c1134894de1341d6d102be03ce77c54d833","observation_id":"d0b41e31-dc95-477b-96c6-42f1145ee4dd","resolution":{"observed_at":"2026-05-13T19:33:59.899165Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":"2506.03094","doi":"10.48550/arxiv.2506.03094","metadata_source":"pith","pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","venue":"quant-ph","work_id":"8dc68421-a34c-4895-bb8a-2378446b9e03","year":2025},"citing_paper":{"arxiv_id":"2604.19814","last_updated":"2026-04-17T04:29:16Z","snapshot_observed_at":"2026-08-02T05:24:20.644373Z","submitted_at":"2026-04-17T04:29:16Z","title":"Quantum Integrated High-Performance Computing: Foundations, Architectural Elements and Future Directions","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-10T08:49:27.022403Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2604.19814"},"observation_digest":"sha256:b3d0da5a9234ee4a1b6aa8ad15d8c1383cefc44e728830a48be0c597e6160bfc","observation_id":"c76abcb0-e2e5-45ff-9e23-1459f2f932ae","resolution":{"observed_at":"2026-05-13T19:33:59.899165Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":"2506.03094","doi":"10.48550/arxiv.2506.03094","metadata_source":"pith","pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","venue":"quant-ph","work_id":"8dc68421-a34c-4895-bb8a-2378446b9e03","year":2025},"citing_paper":{"arxiv_id":"2604.20013","last_updated":"2026-04-21T21:43:03Z","snapshot_observed_at":"2026-07-06T23:06:31.110859Z","submitted_at":"2026-04-21T21:43:03Z","title":"Assessing System Capabilities and Bottlenecks of an Early Fault-Tolerant Bicycle Architecture","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-10T01:59:36.998867Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2604.20013"},"observation_digest":"sha256:ef03568c6df144650d025d8bf63242519f2b23b74a1a121966b8ed099241b7c4","observation_id":"ded975a4-1764-4f77-99ff-df3d2cc24d64","resolution":{"observed_at":"2026-05-13T19:33:59.899165Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":"2506.03094","doi":"10.48550/arxiv.2506.03094","metadata_source":"pith","pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","venue":"quant-ph","work_id":"8dc68421-a34c-4895-bb8a-2378446b9e03","year":2025},"citing_paper":{"arxiv_id":"2604.21468","last_updated":"2026-07-01T05:02:10Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-23T09:28:19Z","title":"Novelty-Based Generation of Continuous Landscapes with Diverse Local Optima Networks","version":2},"reference_index":90,"source":"pdf_text","source_observed_at":"2026-07-05T01:27:19.545404Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2604.21468"},"observation_digest":"sha256:5f1f5247c39ad5c83c06756f04329b9d4a06d9eb6d119c4d3ddd36b0c0ced22c","observation_id":"e38720fe-6dc1-461d-946b-31a0e0aae0ee","resolution":{"observed_at":"2026-07-05T01:30:37.232201Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":"2506.03094","doi":"10.48550/arxiv.2506.03094","metadata_source":"pith","pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","venue":"quant-ph","work_id":"8dc68421-a34c-4895-bb8a-2378446b9e03","year":2025},"citing_paper":{"arxiv_id":"2604.21472","last_updated":"2026-06-03T02:27:08Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-23T09:30:00Z","title":"LightStim: A Framework for QEC Protocol Evaluation and Prototyping with Automated DEM Construction","version":1},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-05-09T22:30:01.774437Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2604.21472"},"observation_digest":"sha256:97de2e33a21148db97b2163bc90f1a7bd1a9a77870aefa22bcad86e256393736","observation_id":"da8ba9ff-501b-4710-827b-95e6a2a98896","resolution":{"observed_at":"2026-05-13T19:33:59.899165Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":"2506.03094","doi":"10.48550/arxiv.2506.03094","metadata_source":"pith","pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","venue":"quant-ph","work_id":"8dc68421-a34c-4895-bb8a-2378446b9e03","year":2025},"citing_paper":{"arxiv_id":"2604.25094","last_updated":"2026-04-28T00:58:22Z","snapshot_observed_at":"2026-07-06T23:11:02.043135Z","submitted_at":"2026-04-28T00:58:22Z","title":"INJEQT: Improved Magic-State Injection Protocol for Fault-Tolerant Quantum Extractor Architectures","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-07T17:09:23.033476Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2604.25094"},"observation_digest":"sha256:61bdeb655e96d10f8e6ebad071fae604d975f7e79d31f2e3670ba2a603eb5a72","observation_id":"e9d03211-bee4-4db3-b324-1e6671a28ba2","resolution":{"observed_at":"2026-05-13T19:33:59.899165Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":"2506.03094","doi":"10.48550/arxiv.2506.03094","metadata_source":"pith","pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","venue":"quant-ph","work_id":"8dc68421-a34c-4895-bb8a-2378446b9e03","year":2025},"citing_paper":{"arxiv_id":"2605.03854","last_updated":"2026-05-05T15:19:56Z","snapshot_observed_at":"2026-07-06T23:16:44.876986Z","submitted_at":"2026-05-05T15:19:56Z","title":"Space-Time Tradeoffs of Pauli-Based Computation in Distributed qLDPC Architectures","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-07T16:36:33.311554Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2605.03854"},"observation_digest":"sha256:6d2a08c0de2e0cc65cf41456f1148a6f60c2c19dcbfc003ebeb9cc768229ba99","observation_id":"4421af8d-e00e-425e-9647-6e150213bdaf","resolution":{"observed_at":"2026-05-13T19:33:59.899165Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":"2506.03094","doi":"10.48550/arxiv.2506.03094","metadata_source":"pith","pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","venue":"quant-ph","work_id":"8dc68421-a34c-4895-bb8a-2378446b9e03","year":2025},"citing_paper":{"arxiv_id":"2605.04663","last_updated":"2026-05-06T09:10:28Z","snapshot_observed_at":"2026-07-06T23:17:23.641984Z","submitted_at":"2026-05-06T09:10:28Z","title":"Distributed Quantum Error Correction with Bivariate Bicycle Codes in a Modular Architecture","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-08T17:42:30.745093Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2605.04663"},"observation_digest":"sha256:de60e68a540c02bc459366c4d4a4db788d2219902c53528b55fc61b02dac9516","observation_id":"19f96a0c-01e2-48d6-aff0-bf3861ab4f17","resolution":{"observed_at":"2026-05-13T19:33:59.899165Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":"2506.03094","doi":"10.48550/arxiv.2506.03094","metadata_source":"pith","pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","venue":"quant-ph","work_id":"8dc68421-a34c-4895-bb8a-2378446b9e03","year":2025},"citing_paper":{"arxiv_id":"2605.06122","last_updated":"2026-05-07T12:30:52Z","snapshot_observed_at":"2026-07-06T23:18:36.537416Z","submitted_at":"2026-05-07T12:30:52Z","title":"Variationally Compressing Quantum Circuits to Approximate Nonadiabatic Molecular Quantum Dynamics","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-05-08T11:32:59.920680Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2605.06122"},"observation_digest":"sha256:69f1f4107fb3353bae745635128ed423918c03ecbef7346b23aed3a2dd027c47","observation_id":"1a01f73c-4e88-42bb-a20a-e1f11344563b","resolution":{"observed_at":"2026-05-13T19:33:59.899165Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":"2506.03094","doi":"10.48550/arxiv.2506.03094","metadata_source":"pith","pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","venue":"quant-ph","work_id":"8dc68421-a34c-4895-bb8a-2378446b9e03","year":2025},"citing_paper":{"arxiv_id":"2605.15344","last_updated":"2026-05-14T19:13:25Z","snapshot_observed_at":"2026-07-06T23:26:37.362117Z","submitted_at":"2026-05-14T19:13:25Z","title":"Fire and ice: Partially fault-tolerant quantum computing with selective state filtering","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-05-19T15:50:35.503960Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2605.15344"},"observation_digest":"sha256:a53937473d5b9e26f40f844c31101e42ece18e4046da0a1a61ca751f8a8bc57c","observation_id":"1fd713e3-4132-4eff-b13f-3f6c68cc721f","resolution":{"observed_at":"2026-05-19T15:52:38.054641Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":"2506.03094","doi":"10.48550/arxiv.2506.03094","metadata_source":"pith","pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","venue":"quant-ph","work_id":"8dc68421-a34c-4895-bb8a-2378446b9e03","year":2025},"citing_paper":{"arxiv_id":"2605.20346","last_updated":"2026-06-23T18:51:06Z","snapshot_observed_at":"2026-07-06T23:30:58.549353Z","submitted_at":"2026-05-19T18:03:20Z","title":"Forced Gap Post-Selection for Quantum LDPC Codes and their Operations","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-30T18:02:07.029185Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2605.20346"},"observation_digest":"sha256:0c62c7d895e0d3eb29ef8df9651a4eb5edded1db7add7741d74aa7351d36f264","observation_id":"b808834a-b699-4d0d-bd3e-61e6c3f07439","resolution":{"observed_at":"2026-06-30T18:04:57.938678Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":"2506.03094","doi":"10.48550/arxiv.2506.03094","metadata_source":"pith","pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","venue":"quant-ph","work_id":"8dc68421-a34c-4895-bb8a-2378446b9e03","year":2025},"citing_paper":{"arxiv_id":"2605.21746","last_updated":"2026-05-20T21:17:42Z","snapshot_observed_at":"2026-07-06T23:32:10.472558Z","submitted_at":"2026-05-20T21:17:42Z","title":"GeneCS: Synthesizing Resource-Efficient Code Surgery for Arbitrary Quantum Stabilizer Codes","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-22T08:39:29.459668Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2605.21746"},"observation_digest":"sha256:2e73cae412b9170b249a26adc960fb5e6504e8a989e6f5ee0118bf2be3a1e981","observation_id":"585809c0-fef6-4b00-99a9-21c2b5b9aad4","resolution":{"observed_at":"2026-05-22T08:41:16.788290Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":"2506.03094","doi":"10.48550/arxiv.2506.03094","metadata_source":"pith","pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","venue":"quant-ph","work_id":"8dc68421-a34c-4895-bb8a-2378446b9e03","year":2025},"citing_paper":{"arxiv_id":"2605.25132","last_updated":"2026-05-24T15:22:34Z","snapshot_observed_at":"2026-07-06T23:35:06.733347Z","submitted_at":"2026-05-24T15:22:34Z","title":"Resource Management in Heterogeneous Quantum Repeater Networks","version":1},"reference_index":222,"source":"pdf_text","source_observed_at":"2026-06-30T00:31:00.673903Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2605.25132"},"observation_digest":"sha256:00f1d5e1f3a29364ef3a48460572ade08e8bb29c5619fdefff02a98bbb741f93","observation_id":"8b41bcb4-e5fe-4945-897c-24513c42467f","resolution":{"observed_at":"2026-06-30T00:34:04.812856Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":"2506.03094","doi":"10.48550/arxiv.2506.03094","metadata_source":"pith","pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","venue":"quant-ph","work_id":"8dc68421-a34c-4895-bb8a-2378446b9e03","year":2025},"citing_paper":{"arxiv_id":"2605.26757","last_updated":"2026-05-26T09:29:39Z","snapshot_observed_at":"2026-08-02T07:03:48.975321Z","submitted_at":"2026-05-26T09:29:39Z","title":"Practical Entanglement Distillation Protocols with Quadratic Error Suppression","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-29T17:37:16.374678Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2605.26757"},"observation_digest":"sha256:39a5c37afde5c5ba22243cf5f3628739c93873c300523216fbedcf8a58f1835d","observation_id":"5285ffbc-eda8-4d58-a8bd-79a8a182a189","resolution":{"observed_at":"2026-06-29T18:03:48.396077Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":"2506.03094","doi":"10.48550/arxiv.2506.03094","metadata_source":"pith","pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","venue":"quant-ph","work_id":"8dc68421-a34c-4895-bb8a-2378446b9e03","year":2025},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-07-06T23:43:46.458792Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:3ea532dbb9cc77e7f41a86e1bba709d5d82fc706516ebea3a733008c5164744b","observation_id":"83316857-38a6-4101-b976-8e37ea8dd9a2","resolution":{"observed_at":"2026-07-02T03:56:34.945428Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":"2506.03094","doi":"10.48550/arxiv.2506.03094","metadata_source":"pith","pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","venue":"quant-ph","work_id":"8dc68421-a34c-4895-bb8a-2378446b9e03","year":2025},"citing_paper":{"arxiv_id":"2606.05044","last_updated":"2026-06-03T16:05:40Z","snapshot_observed_at":"2026-07-06T23:45:02.342193Z","submitted_at":"2026-06-03T16:05:40Z","title":"Generalized Bicycle Codes as Cyclic Submodules and their Automorphism Structure","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-28T05:41:01.009335Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2606.05044"},"observation_digest":"sha256:1df2577d4502388986f8d2897be706fe34d975f87b0428dac0ad369982dc83e0","observation_id":"c961cc86-4bef-48aa-9fd9-707dc5b9d265","resolution":{"observed_at":"2026-07-02T09:06:48.983582Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":"2506.03094","doi":"10.48550/arxiv.2506.03094","metadata_source":"pith","pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","venue":"quant-ph","work_id":"8dc68421-a34c-4895-bb8a-2378446b9e03","year":2025},"citing_paper":{"arxiv_id":"2606.06455","last_updated":"2026-06-04T17:49:27Z","snapshot_observed_at":"2026-08-03T10:44:27.463640Z","submitted_at":"2026-06-04T17:49:27Z","title":"Breakeven demonstration of quantum low-density parity-check codes","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-28T00:48:39.914294Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2606.06455"},"observation_digest":"sha256:1e670598599bd5dcd4cf451a9b040b1ba77b794bad671392eacfa766f0018e63","observation_id":"2e2f1fb9-5ba5-481f-a71a-77f80ff939a9","resolution":{"observed_at":"2026-07-02T13:56:59.801113Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":"2506.03094","doi":"10.48550/arxiv.2506.03094","metadata_source":"pith","pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","venue":"quant-ph","work_id":"8dc68421-a34c-4895-bb8a-2378446b9e03","year":2025},"citing_paper":{"arxiv_id":"2606.07734","last_updated":"2026-07-09T08:31:58Z","snapshot_observed_at":"2026-07-12T23:17:33.087864Z","submitted_at":"2026-06-05T18:00:00Z","title":"Exploring the landscape of compact magic-state distillation factories","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-27T21:27:39.552180Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2606.07734"},"observation_digest":"sha256:9536205df3d879b1a7f27fee35bdafb37103016f1a7bcd6d777475b92f67e077","observation_id":"b77b9a52-74bd-4950-9bda-91c471ce0a67","resolution":{"observed_at":"2026-07-02T19:37:19.257834Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-07-12T14:49:51.418401Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.07734","last_updated":"2026-07-09T08:31:58Z","snapshot_observed_at":"2026-07-12T23:17:33.087864Z","submitted_at":"2026-06-05T18:00:00Z","title":"Exploring the landscape of compact magic-state distillation factories","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-12T14:49:51.418401Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2606.07734"},"observation_digest":"sha256:eb2437c50701028233eb2bf07716ee3307b638b6118ebfd0abab0169d4527b4d","observation_id":"d95f30e6-c3a5-4688-bda1-97b404d8c676","resolution":{"observed_at":"2026-07-12T14:49:51.418401Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":"2506.03094","doi":"10.48550/arxiv.2506.03094","metadata_source":"pith","pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","venue":"quant-ph","work_id":"8dc68421-a34c-4895-bb8a-2378446b9e03","year":2025},"citing_paper":{"arxiv_id":"2606.20263","last_updated":"2026-06-18T14:11:14Z","snapshot_observed_at":"2026-07-06T23:55:25.144457Z","submitted_at":"2026-06-18T14:11:14Z","title":"Vine Codes: Low-Overhead Quantum LDPC Codes on a Planar Square Grid","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-06-26T16:51:59.233119Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2606.20263"},"observation_digest":"sha256:e4563865bcb756ce2e811cfc0e063dbfee46a4691fd6a6813a8c44fc426ba069","observation_id":"90cef4a6-0358-42a4-b6b6-5611fd0ed57f","resolution":{"observed_at":"2026-07-04T04:39:34.804322Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":"2506.03094","doi":"10.48550/arxiv.2506.03094","metadata_source":"pith","pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","venue":"quant-ph","work_id":"8dc68421-a34c-4895-bb8a-2378446b9e03","year":2025},"citing_paper":{"arxiv_id":"2606.22418","last_updated":"2026-06-21T10:11:38Z","snapshot_observed_at":"2026-08-04T00:45:55.729720Z","submitted_at":"2026-06-21T10:11:38Z","title":"A Three-Layer Architecture for Fault-Tolerant Quantum Computing","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-06-26T10:36:28.979796Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2606.22418"},"observation_digest":"sha256:b4202e9a0eecd6a67e1bc77831ea1e3f21be628d58c2f0b90d858eaf0ca9fcb5","observation_id":"c58fde69-dbcb-4912-ad08-352daaf61e61","resolution":{"observed_at":"2026-07-04T08:59:43.421648Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":"2506.03094","doi":"10.48550/arxiv.2506.03094","metadata_source":"pith","pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","venue":"quant-ph","work_id":"8dc68421-a34c-4895-bb8a-2378446b9e03","year":2025},"citing_paper":{"arxiv_id":"2606.30592","last_updated":"2026-06-29T17:34:21Z","snapshot_observed_at":"2026-08-02T10:38:57.071588Z","submitted_at":"2026-06-29T17:34:21Z","title":"Untangling QLDPC Codes with Biased Noise Ancilla","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-30T05:55:29.858800Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2606.30592"},"observation_digest":"sha256:106b6626bd97137ac23fa588fe28c36c672051b501ea91848c38602234bc1488","observation_id":"3037d68c-15fa-4359-8a5e-a9f4905baaa4","resolution":{"observed_at":"2026-06-30T13:34:40.975086Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":"2506.03094","doi":"10.48550/arxiv.2506.03094","metadata_source":"pith","pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","venue":"quant-ph","work_id":"8dc68421-a34c-4895-bb8a-2378446b9e03","year":2025},"citing_paper":{"arxiv_id":"2607.01342","last_updated":"2026-07-27T01:50:14Z","snapshot_observed_at":"2026-08-02T09:02:31.002467Z","submitted_at":"2026-07-01T18:00:55Z","title":"Design rules for fault-tolerant multi-gate teleportation","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-03T20:14:11.543325Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2607.01342"},"observation_digest":"sha256:8fa2065bb48095f699fb2cab2d4f17c81bb5e05c63063817d62f0dd0ecea0fe4","observation_id":"02e567db-7034-4fe4-abdc-63c7d7578cbb","resolution":{"observed_at":"2026-07-03T20:18:55.888950Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":"2506.03094","doi":"10.48550/arxiv.2506.03094","metadata_source":"pith","pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","venue":"quant-ph","work_id":"8dc68421-a34c-4895-bb8a-2378446b9e03","year":2025},"citing_paper":{"arxiv_id":"2607.01887","last_updated":"2026-07-02T08:38:27Z","snapshot_observed_at":"2026-08-04T01:19:10.602015Z","submitted_at":"2026-07-02T08:38:27Z","title":"LUCI on IBM Hardware: Error Suppression with Almost Half Syndrome Density","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-03T12:16:51.954644Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2607.01887"},"observation_digest":"sha256:9d9e16ccc0af59fc9bd0b4eb6f01096f1fe75507afecb2cbaaf9333b5e643faf","observation_id":"a0d25628-4650-4adf-8291-86679d270785","resolution":{"observed_at":"2026-07-03T12:18:06.152907Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-07-11T21:49:20.652346Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.04082","last_updated":"2026-07-05T02:25:45Z","snapshot_observed_at":"2026-08-04T10:01:48.757476Z","submitted_at":"2026-07-05T02:25:45Z","title":"A Cross-Platform Analysis of High-Performance Quantum Error Correction Codes","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-11T21:49:20.652346Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2607.04082"},"observation_digest":"sha256:51cafe7b2e9566306bfdee5e75b16a2b384c899704c6cd62bbcf56ee7039b917","observation_id":"b08a21bc-8c12-4b05-84b1-3e5459e11f96","resolution":{"observed_at":"2026-07-11T21:49:20.652346Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-07-11T20:48:28.471997Z","title":"Yoder, Eddie Schoute, Patrick Rall, Emily Pritchett, Jay M","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.04227","last_updated":"2026-07-05T11:01:11Z","snapshot_observed_at":"2026-08-01T21:04:09.449160Z","submitted_at":"2026-07-05T11:01:11Z","title":"Genuine Multipartite Entanglement between Logical Qubits via Cross-Code Lattice Surgery","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-07-11T20:48:28.471997Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2607.04227"},"observation_digest":"sha256:f9bdf9d4fe31af9dfaee1b78bab947d5ea9118e5b93b86fc6ed9d3bb547f07bf","observation_id":"c52b03ec-ee9e-4fa2-9cd6-3f1f9abfb224","resolution":{"observed_at":"2026-07-11T20:48:28.471997Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":"2506.03094","doi":"10.48550/arxiv.2506.03094","metadata_source":"pith","pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","venue":"quant-ph","work_id":"8dc68421-a34c-4895-bb8a-2378446b9e03","year":2025},"citing_paper":{"arxiv_id":"2607.06177","last_updated":"2026-07-07T11:54:26Z","snapshot_observed_at":"2026-08-02T13:25:22.537748Z","submitted_at":"2026-07-07T11:54:26Z","title":"Using Tanner Spectral Reduction to Improve Multi-Layer Optical Lattice Routing for Hypergraph-Product and Bivariate Bicycle qLDPC Codes","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-07-08T14:44:48.760270Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2607.06177"},"observation_digest":"sha256:e4c44e3ac0ab34e8db70a6e06204220678f237d8f8c118e57c43f69a8be4d6ec","observation_id":"d8a35161-f01d-46f1-b444-5a4a80e46f48","resolution":{"observed_at":"2026-07-08T14:44:59.594402Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-07-14T13:00:22.366341Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.10274","last_updated":"2026-07-11T12:09:27Z","snapshot_observed_at":"2026-07-16T23:18:16.584875Z","submitted_at":"2026-07-11T12:09:27Z","title":"Efficient Circuit Transpilation of Commuting Gates on 2D Grids","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-07-14T13:00:22.366341Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2607.10274"},"observation_digest":"sha256:4e4c7570fcca44491dd60efb57a9f3c21b3ab41d91f3913de232161be10affb0","observation_id":"6848a2f6-ecf3-4cb1-9226-bd2d75605a27","resolution":{"observed_at":"2026-07-14T13:00:22.366341Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-01T21:14:38.834720Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.16166","last_updated":"2026-07-30T09:46:30Z","snapshot_observed_at":"2026-08-05T04:44:51.503233Z","submitted_at":"2026-07-17T17:46:54Z","title":"Fast logical operations in quantum LDPC codes using simple resource states","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-01T21:14:38.834720Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2607.16166"},"observation_digest":"sha256:0b35d61892ad969b00bd94d0ab8135901ccd8da542ba886bc672dbfc41fa27a6","observation_id":"37c52dfd-3057-4c5b-8067-c6deadc466a3","resolution":{"observed_at":"2026-08-01T21:14:38.834720Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-01T15:37:24.283776Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.18387","last_updated":"2026-07-30T04:21:10Z","snapshot_observed_at":"2026-08-05T03:27:19.073801Z","submitted_at":"2026-07-20T18:00:03Z","title":"Remote entanglement need not be the bottleneck for modular trapped-ion quantum computing","version":2},"reference_index":107,"source":"pdf_text","source_observed_at":"2026-08-01T15:37:24.283776Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2607.18387"},"observation_digest":"sha256:567e709972a4d527d2f9f1fa68f20c866532d36b3bb8fd7690b734af0de3cb71","observation_id":"6f1b3771-d9d9-427a-9e37-a42a2ebcd081","resolution":{"observed_at":"2026-08-01T15:37:24.283776Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-01T09:33:33.421891Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.20756","last_updated":"2026-07-22T22:09:14Z","snapshot_observed_at":"2026-08-01T09:33:27.602621Z","submitted_at":"2026-07-22T22:09:14Z","title":"Suppressing errors in analog logical rotation gates via balanced fusion","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-01T09:33:33.421891Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2607.20756"},"observation_digest":"sha256:63914dc83695498edf656f02a10e1cab30f561db5d35258f8e64d47384475ddd","observation_id":"6d692435-9c95-436c-9f83-8a91c2b44d04","resolution":{"observed_at":"2026-08-01T09:33:33.421891Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-01T04:15:52.744595Z","title":"Cross, Malcolm Carroll, and Michael E","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.27644","last_updated":"2026-07-30T03:55:43Z","snapshot_observed_at":"2026-08-02T23:37:08.064278Z","submitted_at":"2026-07-30T03:55:43Z","title":"Quantum LDPC codes with design rate 1/5 and good performance below 1000 physical qubits","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-01T04:15:52.744595Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2607.27644"},"observation_digest":"sha256:311514e6082411600aba0c55d98a924ac19fb2431614d34ea48849942c14dffc","observation_id":"7d20b855-a1d5-4d23-a207-91b14cb97b60","resolution":{"observed_at":"2026-08-01T04:15:52.744595Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-07-31T02:25:48.675910Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.28605","last_updated":"2026-07-30T17:55:34Z","snapshot_observed_at":"2026-08-05T02:53:40.264343Z","submitted_at":"2026-07-30T17:55:34Z","title":"Logical computation with canonical lifted product codes","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-31T02:25:48.675910Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2607.28605"},"observation_digest":"sha256:473ff9a5e82ebb03167316fd6b8142a79393f4398d6f8c5f81c741ca9e8880ec","observation_id":"5c715cde-27a4-468a-acde-c3bea95815f2","resolution":{"observed_at":"2026-07-31T02:25:48.675910Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-07-31T01:57:11.842144Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.28621","last_updated":"2026-07-30T17:59:18Z","snapshot_observed_at":"2026-08-05T02:39:40.367536Z","submitted_at":"2026-07-30T17:59:18Z","title":"Lifting Lifted Product Codes","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-07-31T01:57:11.842144Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2607.28621"},"observation_digest":"sha256:9ef60fcdf255a2ef5946fef7d81f4af8ac96e8902bd2c0ae79aef07e8462acd7","observation_id":"3d610d78-85f8-4239-bea6-06792191cdaf","resolution":{"observed_at":"2026-07-31T01:57:11.842144Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-04T18:53:46.915251Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.01887","last_updated":"2026-08-03T08:28:21Z","snapshot_observed_at":"2026-08-05T05:21:34.919592Z","submitted_at":"2026-08-03T08:28:21Z","title":"The Pangaea Architecture: Fault-Tolerant Heterogeneous Topological Codes via a Quantum Bus","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-04T18:53:46.915251Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2608.01887"},"observation_digest":"sha256:d5497806a24119265003f64a1882cd8562a40a464a85fcdecfa25ef6e10447e3","observation_id":"0686c3e9-86af-4ca2-995e-8f05ae786318","resolution":{"observed_at":"2026-08-04T18:53:46.915251Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2506.03094/citation-record","integrity":"/paper/2506.03094/integrity","json":"/paper/2506.03094/citation-record.json","paper":"/paper/2506.03094"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1103/physreva.96.042316","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Quantum error correction below the surface code threshold","venue":"Physical review. A/Physical review, A","work_id":"9ed6d039-9adf-4d1d-ab46-0dec78dc0170","year":2017},"citing_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-13T19:33:59.776477Z"},"links":{"citing_paper":"/paper/2506.03094"},"observation_digest":"sha256:0da579295e61d41532d74af40e5a831dba1cd4a27cc67d91e6a8799d39c73846","observation_id":"bea8342b-2f1c-4967-a33a-582c51154200","resolution":{"observed_at":"2026-05-13T19:33:59.806706Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2021.308141","doi":"10.1109/tit.2021.3081415","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Interleaving: Modular architectures for fault-tolerant photonic quantum computing","venue":"IEEE Transactions on Information Theory","work_id":"d3eb7cbd-7438-4e71-9c2d-ce8373f00ab6","year":2021},"citing_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-13T19:33:59.776477Z"},"links":{"citing_paper":"/paper/2506.03094"},"observation_digest":"sha256:a25e9a5c6704bb718791472610a6d1cb38dd990af6d30d8eee7825bcac458d58","observation_id":"01090636-28df-473f-a4d3-6cc7670d28d4","resolution":{"observed_at":"2026-05-13T19:33:59.814466Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1063/1.1499754","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Journal of Mathemat- ical Physics43(9), 4452–4505 (2002) https://doi.org/10.1063/1.1499754","venue":"Journal of Mathematical Physics","work_id":"5255cedc-0cb7-434f-bec2-932c8fbc393c","year":2002},"citing_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-13T19:33:59.776477Z"},"links":{"citing_paper":"/paper/2506.03094"},"observation_digest":"sha256:3ee677038728998f4e5007b8d7f0cf965a0256df89d038e2d4fb7506e2cd63f4","observation_id":"01803d5b-1c56-4209-bb61-47e2af44bc5f","resolution":{"observed_at":"2026-05-13T19:33:59.823406Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-07-12T14:19:53.610405+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T14:19:53.610405+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.22331/q-2021-04-15-433","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Quantum 5, 433 (2021) https://doi.org/10.22331/q-2021-04-15-433","venue":"Quantum","work_id":"b7a705c5-10d2-4d6f-b409-6b6fe2f2a9a4","year":2048},"citing_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-13T19:33:59.776477Z"},"links":{"citing_paper":"/paper/2506.03094"},"observation_digest":"sha256:0b08aceb0e6c52eaf0d3997f66dabc4418b5d4e32762aaf591b9602cdfedfa76","observation_id":"c3349af0-7483-4a0e-9030-208ca0faa455","resolution":{"observed_at":"2026-05-13T19:33:59.828485Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-07-14T06:20:41.393371+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-14T06:20:41.393371+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.15917","last_updated":"2025-05-21T18:11:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-21T18:11:44Z","title":"How to factor 2048 bit RSA integers with less than a million noisy qubits","version":1},"cited_work":{"arxiv_id":"2505.15917","doi":"10.48550/arxiv.2505.15917","metadata_source":"pith","pith_arxiv_id":"2505.15917","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"How to factor 2048 bit RSA integers with less than a million noisy qubits","venue":"quant-ph","work_id":"bd1d7c03-8dbc-468f-979f-49215d18eb4c","year":2025},"citing_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-11T11:50:26.030339Z"},"links":{"cited_paper":"/paper/2505.15917","citing_paper":"/paper/2506.03094"},"observation_digest":"sha256:667073885058835e0e8676ece49661387ab7fd0f0303c77a8683724699e47165","observation_id":"2e95ac4b-b568-4942-8d87-b1bfde3d08ca","resolution":{"observed_at":"2026-05-13T19:33:59.834212Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.26421/qic13.7-8-4","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Quantum computing with realistically noisy devices","venue":"Quantum Information and Computation","work_id":"44bbc6fc-c910-414d-b274-a959524f9e71","year":2005},"citing_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-13T19:33:59.776477Z"},"links":{"citing_paper":"/paper/2506.03094"},"observation_digest":"sha256:1f3807b6b370db46349865e8ec530ce0ccf963ad13658f1e1a938755437c5abf","observation_id":"cfc54504-cef5-479d-8e37-9b6fcd3b59b2","resolution":{"observed_at":"2026-05-13T19:33:59.838081Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"6510.2021","doi":"10.1109/globecom46510.2021.9685345","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Multi-Agent Reinforcement Learning-Based Fairness-Aware Scheduling for Bursty Traffic","venue":"2021 IEEE Global Communications Conference (GLOBECOM)","work_id":"72ccbdf0-ab4f-4576-af28-734b064dff0e","year":2021},"citing_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-13T19:33:59.776477Z"},"links":{"citing_paper":"/paper/2506.03094"},"observation_digest":"sha256:f5a5002e422cd785ec17ddc7307e2780ba3c13fcde52139e73f2cb8c248aef17","observation_id":"7732b5a6-6a0a-48de-b2c2-e9f11292fc58","resolution":{"observed_at":"2026-05-13T19:33:59.843290Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/s0097539795293172","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-02T00:56:24.023050Z","title":"Shor, SIAM Journal on Computing 26, 1484 (1997), https://doi.org/10.1137/S0097539795293172","venue":"SIAM Journal on Computing","work_id":"8c114c19-82cb-47cf-98f7-484a0ef818f7","year":1997},"citing_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-13T19:33:59.776477Z"},"links":{"citing_paper":"/paper/2506.03094"},"observation_digest":"sha256:dde46a1e06e6db34b04a0fd6174113507839b39e53108cb34781fe9745b3b4a9","observation_id":"58bfe816-6e1c-4253-adee-ec625ddcd613","resolution":{"observed_at":"2026-05-13T19:33:59.847879Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-03T18:38:25.799733+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-03T18:38:25.799733+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Automatically from the construction in Eq","venue":null,"work_id":"b361ade7-8d6c-4d87-a564-5f02c806a788","year":null},"citing_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-13T19:33:59.776477Z"},"links":{"citing_paper":"/paper/2506.03094"},"observation_digest":"sha256:d62a59e2139bb9036d06329a0dad5ea16cc417e6f2b7ad8c6ee5e3bde7c84ad9","observation_id":"97d350fb-887a-4e28-8248-e0877773a1cb","resolution":{"observed_at":"2026-05-13T19:33:59.851101Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"(31) and their shifts generate the entire 12-qubit logical Pauli group","venue":null,"work_id":"16e318da-ddfd-4e0a-8254-60c58d3a26b1","year":null},"citing_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-13T19:33:59.776477Z"},"links":{"citing_paper":"/paper/2506.03094"},"observation_digest":"sha256:fdf8aa3d9effebf8b434eb1411ef4fcd7640d0d09d98b8c2cbdcb639b3f3508b","observation_id":"b5cbde5c-60ba-4f1e-a323-2ba9bd371f12","resolution":{"observed_at":"2026-05-13T19:33:59.853943Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"(31) commute, they do not overlap","venue":null,"work_id":"7dcc0743-7c18-4683-bfa4-30446468cfec","year":null},"citing_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-13T19:33:59.776477Z"},"links":{"citing_paper":"/paper/2506.03094"},"observation_digest":"sha256:071dab9292e5eac4f8cd88c0d95931244b7cf413b30401153265d9a3180a4f9c","observation_id":"9e5564a1-a4e9-4996-8ba3-8ab2a41af2e8","resolution":{"observed_at":"2026-05-13T19:33:59.856697Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Likewise, the set ofX-checks that overlap with¯Z1 is disjoint from the set ofX-checks that overlap with ¯Z7","venue":null,"work_id":"b8573b08-cae8-457f-9c08-0880df418dcf","year":null},"citing_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-13T19:33:59.776477Z"},"links":{"citing_paper":"/paper/2506.03094"},"observation_digest":"sha256:3dfe40f6fce1423830658d41f677a0f1f85b18d19f57a1574a57082879f97610","observation_id":"781f567b-4d0f-4564-ad3c-954fbb0c0443","resolution":{"observed_at":"2026-05-13T19:33:59.859909Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"038f902a-a72d-48cb-babf-f733e6d7bba4","year":null},"citing_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-13T19:33:59.776477Z"},"links":{"citing_paper":"/paper/2506.03094"},"observation_digest":"sha256:25a24f48e44953ae794c303be86e8b90c36bf1dbd1dfd8b602c5ac17ca368694","observation_id":"6a8e3f76-1083-43d3-868d-5061971bf210","resolution":{"observed_at":"2026-05-13T19:33:59.862858Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"By the stabilizer update rules [Got97], this deforms the original code so that some of its checks gain support on edge qubits","venue":null,"work_id":"2ce28c6b-9fda-473f-8de0-c1d73549cd02","year":null},"citing_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-13T19:33:59.776477Z"},"links":{"citing_paper":"/paper/2506.03094"},"observation_digest":"sha256:fc3be5e4deea454124401dc521f36c3ce0ad6cbff47f4239cb7bdcbe76c64876","observation_id":"d8e348a3-c886-4fe0-90c2-1949a596e524","resolution":{"observed_at":"2026-05-13T19:33:59.865994Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Let me = ±1 be the result of measuring edge qubite","venue":null,"work_id":"ccfd87a1-618c-49e6-9c73-3c8caae8fee8","year":null},"citing_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-13T19:33:59.776477Z"},"links":{"citing_paper":"/paper/2506.03094"},"observation_digest":"sha256:b7c46dd43be41e2f6c522e6b830d3e2619e7c606694ccf739f91a7932342c341","observation_id":"d508b74f-2b82-4727-a411-f3bdda69c152","resolution":{"observed_at":"2026-05-13T19:33:59.868757Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"check qubit","venue":null,"work_id":"d3233793-d082-4f58-a59c-086bed9ff783","year":null},"citing_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-13T19:33:59.776477Z"},"links":{"citing_paper":"/paper/2506.03094"},"observation_digest":"sha256:9b74c0e425a4f3f130d600278e48c5a5f3cbbbab326b6835e456aeecda1cfe19","observation_id":"5044e700-3e11-4715-86d9-e46ce80f5d01","resolution":{"observed_at":"2026-05-13T19:33:59.871269Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"e368594f-0fba-4493-8f77-e78541db7fe9","year":null},"citing_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-13T19:33:59.776477Z"},"links":{"citing_paper":"/paper/2506.03094"},"observation_digest":"sha256:dff2f22cfdb9a358f5d8505dc52337afa8b5024c048277ed432f1f76e4f6fb3c","observation_id":"53cea215-6849-45c0-a40d-303a515173fb","resolution":{"observed_at":"2026-05-13T19:33:59.873748Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"0de84100-cd4f-4751-9142-db075a083231","year":null},"citing_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-13T19:33:59.776477Z"},"links":{"citing_paper":"/paper/2506.03094"},"observation_digest":"sha256:5502757e0a968f1994c947531a3ef87bf57d9765696886c2972d18b4291b4dfa","observation_id":"60baa550-3b37-4e34-9db1-f9a4148e2fee","resolution":{"observed_at":"2026-05-13T19:33:59.876066Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"a96d8902-3b17-46aa-ab60-dde1fb3345c5","year":null},"citing_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-13T19:33:59.776477Z"},"links":{"citing_paper":"/paper/2506.03094"},"observation_digest":"sha256:ae86069447f62afad9f881ffdd737c64690233770b4b577d1420cfcf34973273","observation_id":"a67b177c-2d24-47d6-b5b1-5963f0b50742","resolution":{"observed_at":"2026-05-13T19:33:59.878324Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"We find an optimal edge-coloring of this bipartite graph using the ‘gcol’ python package","venue":null,"work_id":"573dc249-8282-45ee-9822-54cf6dd9249d","year":null},"citing_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-13T19:33:59.776477Z"},"links":{"citing_paper":"/paper/2506.03094"},"observation_digest":"sha256:f14f485ce28cb2dcef6c3027172b9d267b0a254d4dfa615961fb0ce1cc9b0cde","observation_id":"f9ef0777-d0bc-4b61-88d4-981e2e316b04","resolution":{"observed_at":"2026-05-13T19:33:59.880912Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"in-place","venue":null,"work_id":"890617bd-28de-4954-a5d1-0af64ebc5cac","year":null},"citing_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-13T19:33:59.776477Z"},"links":{"citing_paper":"/paper/2506.03094"},"observation_digest":"sha256:45746d0e1a40846193ad507aa783ff1c36880407c04074d836e5fe2759af29ae","observation_id":"00464a6c-834d-4d87-b3e0-388da977e7c7","resolution":{"observed_at":"2026-05-13T19:33:59.883117Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"df4ec851-63d2-4249-adae-871ccc8d5be7","year":null},"citing_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-13T19:33:59.776477Z"},"links":{"citing_paper":"/paper/2506.03094"},"observation_digest":"sha256:1603ef19c4da98df6351a7563b9fc599c94c88dc2b371aa3be249577ea7935ee","observation_id":"80f12672-db23-4618-b25c-17cbb22274bc","resolution":{"observed_at":"2026-05-13T19:33:59.885181Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"3591133d-3a32-4ddd-9559-0a8597f177f9","year":null},"citing_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-13T19:33:59.776477Z"},"links":{"citing_paper":"/paper/2506.03094"},"observation_digest":"sha256:4951db7c79d742b9849b60542e87ebb90b709d6df8f1233667586c1cb4c5a303","observation_id":"c2041daf-6a9e-4a34-852b-b2d65d47bfbb","resolution":{"observed_at":"2026-05-13T19:33:59.887339Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"space-like","venue":null,"work_id":"ad53fb24-e176-46c8-99a9-63bc3ce0cffb","year":null},"citing_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-13T19:33:59.776477Z"},"links":{"citing_paper":"/paper/2506.03094"},"observation_digest":"sha256:92378aaa0ab70c22d32440fb1db403a4efcc22dd286548ffb4df3aa859b21112","observation_id":"d5491638-a127-40d7-8871-0389317a7ba8","resolution":{"observed_at":"2026-05-13T19:33:59.889404Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"7f983561-4ce4-4dc4-82a6-7710f4a250da","year":null},"citing_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-13T19:33:59.776477Z"},"links":{"citing_paper":"/paper/2506.03094"},"observation_digest":"sha256:a86062566741b1922f9625f0d7db0bd53478d3fc277fa442a44382fd0fdd3776","observation_id":"f9679810-8c0a-4255-a960-6bf0c4fa7235","resolution":{"observed_at":"2026-05-13T19:33:59.891556Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"We reduce both tasks to the same optimization problem","venue":null,"work_id":"14237f74-e3b0-4973-a82a-a5fd91bf4c6c","year":2016},"citing_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-13T19:33:59.776477Z"},"links":{"citing_paper":"/paper/2506.03094"},"observation_digest":"sha256:9e55dcf786da465ff367787a6d5bee3fd4c14c181bc5d28c9d76cfa16b637544","observation_id":"70e1b199-c046-4ab8-a068-047205ef7774","resolution":{"observed_at":"2026-05-13T19:33:59.893898Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"2c515016-06dc-4b73-beb0-5118ab12342a","year":null},"citing_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-13T19:33:59.776477Z"},"links":{"citing_paper":"/paper/2506.03094"},"observation_digest":"sha256:24444b47cace566442de866bfc713c2acb49801898dc8f0c63814f2e2bab995f","observation_id":"b0f2282e-9c61-45a3-a379-a77628b7daf1","resolution":{"observed_at":"2026-05-13T19:33:59.896166Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"For larger numbers of T gates, we extrapolate using a linear fit (dashed) whose intersection with1 3 is given in Figure 10a","venue":null,"work_id":"1f24611b-8d06-4a53-989a-7528a21aa99f","year":null},"citing_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-13T19:33:59.776477Z"},"links":{"citing_paper":"/paper/2506.03094"},"observation_digest":"sha256:a22809a5fb7bda9afb520ac2fcb63f7ad0a5d4a0ad377d74a195609ad69fa60a","observation_id":"2db608af-992f-4103-8761-bb2eb9c03cf7","resolution":{"observed_at":"2026-05-13T19:33:59.898426Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes"},"reference_resolution":{"displayed":28,"state_counts":{"malformed_identifier":0,"metadata_mismatch":5,"parse_uncertain":0,"unresolved":8,"verified_exact":3,"verified_fuzzy":12},"total_outbound_references":28},"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-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"thesis":"As of 5 August 2026, this Paper Citation Record lists 28 of 28 outbound references and 74 inbound Pith citation observations for arXiv:2506.03094."}