{"as_of":"2026-08-18T17:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a6918d18eb794649c722bc4b937537486e0c7ddc0c6b74aec52f9663cc7bd7f2","coverage":[{"denominator":65,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":65,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T16:32:18.763276Z","state":"measured"},{"denominator":66,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":66,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T08:21:49.525743Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.13496","snapshot_observed_at":"2026-08-01T08:21:49.525743Z","title":"Cao and B","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.21160","last_updated":"2026-07-23T10:42:57Z","snapshot_observed_at":"2026-08-16T13:32:24.732357Z","submitted_at":"2026-07-23T10:42:57Z","title":"Duality constrains optimal thresholds in quantum error correction","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-01T08:21:49.525743Z"},"links":{"cited_paper":"/paper/2507.13496","citing_paper":"/paper/2607.21160"},"observation_digest":"sha256:b29e998e84389c2c71d14e41ada0c215d42e0d6f0d7f78e035828fc622108dc2","observation_id":"d12e41e9-48d8-4dfd-8243-2cef4725f7a1","resolution":{"observed_at":"2026-08-01T08:21:49.525743Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2507.13496/citation-record","integrity":"/paper/2507.13496/integrity","json":"/paper/2507.13496/citation-record.json","paper":"/paper/2507.13496"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"quant-ph/9608012","last_updated":"1996-08-08T23:13:46Z","snapshot_observed_at":"2026-08-15T15:15:17.440216Z","submitted_at":"1996-08-08T23:13:46Z","title":"Concatenated Quantum Codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/9608012","snapshot_observed_at":"2026-08-06T16:32:18.538087Z","title":"Concatenated quantum codes","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T16:32:18.538087Z"},"links":{"cited_paper":"/paper/quant-ph/9608012","citing_paper":"/paper/2507.13496"},"observation_digest":"sha256:7e3df63462b615ed728371b19ae0a4de18afc10656f2ee2bf3d3f1dc844cbd49","observation_id":"29418ada-116a-4370-8201-8e7527b7550f","resolution":{"observed_at":"2026-08-06T16:32:18.538087Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:32:19.426803Z","title":"Time-efficient constant-space-overhead fault-tolerant quantum computation","venue":null,"work_id":"d7a6de43-4fb9-4d6c-b53d-d575a171d9cd","year":2024},"citing_paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T16:32:18.542878Z"},"links":{"citing_paper":"/paper/2507.13496"},"observation_digest":"sha256:156b9ce9b8487ab76bdf2d8cd4c68f7698818aed4dc7fb6f4cbae003b6ec36b1","observation_id":"563933bf-bcc7-4526-bbc6-0ded88a9ea91","resolution":{"observed_at":"2026-08-06T16:32:19.431669Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09606","last_updated":"2025-05-05T22:36:07Z","snapshot_observed_at":"2026-08-16T14:18:29.059292Z","submitted_at":"2024-02-14T22:27:48Z","title":"Concatenate codes, save qubits","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.09606","snapshot_observed_at":"2026-08-06T16:32:18.546369Z","title":"Concatenate codes, save qubits","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T16:32:18.546369Z"},"links":{"cited_paper":"/paper/2402.09606","citing_paper":"/paper/2507.13496"},"observation_digest":"sha256:478db46b467832b592f7cd908571f63029534f42191c18a75ed6c249d3f5e974","observation_id":"8561aed7-7e0d-436d-8f9f-eb69d29ba243","resolution":{"observed_at":"2026-08-06T16:32:18.546369Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.16132","last_updated":"2025-02-22T07:58:20Z","snapshot_observed_at":"2026-08-16T12:56:09.488434Z","submitted_at":"2025-02-22T07:58:20Z","title":"A Constant Rate Quantum Computer on a Line","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.16132","snapshot_observed_at":"2026-08-06T16:32:18.550528Z","title":"A constant rate quantum computer on a line","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T16:32:18.550528Z"},"links":{"cited_paper":"/paper/2502.16132","citing_paper":"/paper/2507.13496"},"observation_digest":"sha256:e2736d8e0cc5a6282b7abc0f06dc79a48e045d770632804ded9c3c238667f5b5","observation_id":"38e7a149-8506-4a2b-bf60-5b2ba9c02bc2","resolution":{"observed_at":"2026-08-06T16:32:18.550528Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:32:19.415711Z","title":"Holographic quantum error-correcting codes: toy mod- els for the bulk/boundary correspondence","venue":null,"work_id":"6049ff0e-2a0e-4f03-94cb-68d5155c87a0","year":2015},"citing_paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T16:32:18.555080Z"},"links":{"citing_paper":"/paper/2507.13496"},"observation_digest":"sha256:1fd38fa9957bcf782e8e7d38e4d17f14a64eca7387c74fcbb1eb729c7a7337de","observation_id":"d184a612-c0df-4b0a-8feb-4944c0eac667","resolution":{"observed_at":"2026-08-06T16:32:19.420071Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:32:19.404664Z","title":"Harris, Nathan A","venue":null,"work_id":"3f20a9dc-91ea-4910-9621-770e8900c9f5","year":2018},"citing_paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T16:32:18.558472Z"},"links":{"citing_paper":"/paper/2507.13496"},"observation_digest":"sha256:bae6e2d3916c60ded731292c87a884fd46c637bcd99e05b8e3a1304e87191f8b","observation_id":"274b1089-1bd7-4f77-ad96-e0fd9384de08","resolution":{"observed_at":"2026-08-06T16:32:19.409162Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:32:19.394350Z","title":"Approxi- mate bacon-shor code and holography.Jour- nal of High Energy Physics , 2021(5), May 2021","venue":null,"work_id":"b12848bb-d3a8-4636-8961-f9894ae426ce","year":2021},"citing_paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T16:32:18.562394Z"},"links":{"citing_paper":"/paper/2507.13496"},"observation_digest":"sha256:8a3a5f6469c9f308e18a207d96d424bed6504041588f83b128f9cc0b159c3742","observation_id":"8dae85a4-bc58-4d9c-a00c-24762302eaef","resolution":{"observed_at":"2026-08-06T16:32:19.398397Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.11926","last_updated":"2025-08-05T13:32:24Z","snapshot_observed_at":"2026-08-16T13:33:41.163087Z","submitted_at":"2024-07-16T17:18:13Z","title":"Far from Perfect: Quantum Error Correction with (Hyperinvariant) Evenbly Codes","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.11926","snapshot_observed_at":"2026-08-06T16:32:18.565585Z","title":"Far from perfect: Quantum error correction with (hyperinvariant) even- bly codes","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T16:32:18.565585Z"},"links":{"cited_paper":"/paper/2407.11926","citing_paper":"/paper/2507.13496"},"observation_digest":"sha256:1711dcaf2a3795ad99d9c293205a5a89fe74474fcf6e48dd3526dd10e85c8046","observation_id":"a97c78fa-1391-43ad-8773-aa9dbcb3b024","resolution":{"observed_at":"2026-08-06T16:32:18.565585Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:32:19.383993Z","title":"Overcoming the zero-rate hashing bound with holographic quantum error correction, 2024","venue":null,"work_id":"c61c82cd-7a38-4f2f-b723-55e7f2567465","year":2024},"citing_paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T16:32:18.569031Z"},"links":{"citing_paper":"/paper/2507.13496"},"observation_digest":"sha256:e78505d4d231daded0ecd100c96f09b38174fcc045a9544d9a7c4c92a8b63ec6","observation_id":"97d19d54-e5de-4ced-b00c-ad3e8644685e","resolution":{"observed_at":"2026-08-06T16:32:19.388277Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:32:19.372396Z","title":"Yoder, Ryuji Takagi, and Isaac L","venue":null,"work_id":"c3da1124-8e9d-49c4-956a-c950818a5823","year":2016},"citing_paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T16:32:18.572667Z"},"links":{"citing_paper":"/paper/2507.13496"},"observation_digest":"sha256:05429206ad1ccba669c0109ffdffb0e09d961c698c182c56a40066fcb4acb8d6","observation_id":"b2522cf9-22dc-4845-aa4e-a869f2773c34","resolution":{"observed_at":"2026-08-06T16:32:19.377707Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:32:19.360537Z","title":"Using concatenated quantum codes for universal fault-tolerant quantum gates","venue":null,"work_id":"7c0dfa1a-5965-47ac-8dae-da4f41e0fb4f","year":2014},"citing_paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T16:32:18.576720Z"},"links":{"citing_paper":"/paper/2507.13496"},"observation_digest":"sha256:de8ca2ea59804ce43c78520a51177fedff28bf428a26b79be1f69a16a4f5ce90","observation_id":"2d7f91e3-7a0c-4c3c-bc9c-746df3cc6b85","resolution":{"observed_at":"2026-08-06T16:32:19.364648Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:32:19.349239Z","title":"Buildingad- dressable fault-tolerant gates with quantum lego","venue":null,"work_id":"ad71dc1d-158a-4cbe-84ed-37cfbeca923e","year":2025},"citing_paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T16:32:18.581012Z"},"links":{"citing_paper":"/paper/2507.13496"},"observation_digest":"sha256:1c86961fab2e41ac6d7bfd1fe53f8653bce989c5ea26e9a72f3f69fd63c53c8d","observation_id":"cd8b0bb5-a1e7-4afc-84c8-a671f59fbc7a","resolution":{"observed_at":"2026-08-06T16:32:19.353865Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.10386","last_updated":"2025-04-14T16:28:33Z","snapshot_observed_at":"2026-08-18T02:35:14.256948Z","submitted_at":"2025-04-14T16:28:33Z","title":"Universal fault-tolerant logic with heterogeneous holographic codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.10386","snapshot_observed_at":"2026-08-06T16:32:18.584924Z","title":"Universal fault-tolerant logic with heterogeneous holographic codes.arXiv preprint arXiv:2504.10386, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T16:32:18.584924Z"},"links":{"cited_paper":"/paper/2504.10386","citing_paper":"/paper/2507.13496"},"observation_digest":"sha256:797ed41810e7a5ba4bff6823dba5341203586a8350ff10b76bef4d1ac08b3541","observation_id":"70a04291-f41a-43e2-ba56-a3fcd9f17e32","resolution":{"observed_at":"2026-08-06T16:32:18.584924Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:32:19.338196Z","title":"Ferris and David Poulin","venue":null,"work_id":"97aaa764-6354-443f-97a9-8c11ee28269e","year":2014},"citing_paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T16:32:18.588974Z"},"links":{"citing_paper":"/paper/2507.13496"},"observation_digest":"sha256:2bd8db26301b6b7001fd9054355ec6259856ca55a2e5249ae537b54f26936590","observation_id":"0bf55cff-261a-474c-849a-d1ea3bcd4a0b","resolution":{"observed_at":"2026-08-06T16:32:19.342477Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.13619","last_updated":"2025-06-16T15:48:19Z","snapshot_observed_at":"2026-08-18T11:12:56.351003Z","submitted_at":"2025-06-16T15:48:19Z","title":"Blocklet concatenation: Low-overhead fault-tolerant protocols for fusion-based quantum computation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.13619","snapshot_observed_at":"2026-08-06T16:32:18.592992Z","title":"Blocklet concatenation: Low-overhead fault-tolerant protocols for fusion-based quantum computation","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T16:32:18.592992Z"},"links":{"cited_paper":"/paper/2506.13619","citing_paper":"/paper/2507.13496"},"observation_digest":"sha256:a60a3249d40c4568b9142b6e77d2263c6a93353e8a958b2fbf236138ec2401bd","observation_id":"7f5ed2d9-9cad-4418-ac9e-a3a3878590ff","resolution":{"observed_at":"2026-08-06T16:32:18.592992Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:32:19.327550Z","title":"Nguyen and Christopher A","venue":null,"work_id":"d7bea1ad-2111-441e-bce7-07cca0ab2fa8","year":2024},"citing_paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T16:32:18.597225Z"},"links":{"citing_paper":"/paper/2507.13496"},"observation_digest":"sha256:a3f83520e0f19afa6e918755d1cdf4f694c03ef093cf5e2740d4a78c3ccc7a64","observation_id":"e6f53b05-53bb-4b5d-bf25-f8441743cc97","resolution":{"observed_at":"2026-08-06T16:32:19.331691Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:32:19.315649Z","title":"Polylog-time- and constant- space-overhead fault-tolerant quantum com- putation with quantum low-density parity- check codes, 2024","venue":null,"work_id":"d5e76db8-6f17-4c21-a988-4bd47cdfed98","year":2024},"citing_paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T16:32:18.601264Z"},"links":{"citing_paper":"/paper/2507.13496"},"observation_digest":"sha256:01ed5659fe62b2e31f5bbf0634223556fb62dd4e0507595ce862cda947955e89","observation_id":"f30258c8-fc9e-4464-9357-7682cc7746fb","resolution":{"observed_at":"2026-08-06T16:32:19.320478Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:32:19.305092Z","title":"Fault-tolerant quantum computation with constant overhead, 2014","venue":null,"work_id":"65367351-1b3d-4900-b95c-bbea85e631f1","year":2014},"citing_paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T16:32:18.605266Z"},"links":{"citing_paper":"/paper/2507.13496"},"observation_digest":"sha256:d3a7fa8477eecbd1869a5107f5981e872e7db5e0a58f48076f9c0c65e470b944","observation_id":"fcc2ffc3-449e-4172-8130-f7953c630962","resolution":{"observed_at":"2026-08-06T16:32:19.309221Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:32:19.293657Z","title":"Cross, Jay M","venue":null,"work_id":"ddad680f-6374-402b-9c2e-456d4106b073","year":null},"citing_paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T16:32:18.609427Z"},"links":{"citing_paper":"/paper/2507.13496"},"observation_digest":"sha256:0f610490576651f2f3c3e20412ac204b573c99eb92df64206b28f6d4a0f9841e","observation_id":"fbe132f9-7aa1-49df-a265-c022471fd863","resolution":{"observed_at":"2026-08-06T16:32:19.297927Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:32:19.282438Z","title":"Asymp- totically good quantum and locally testable classical ldpc codes, 2022","venue":null,"work_id":"30f7f7b7-c2f2-4c1a-8f22-3618abca6b22","year":2022},"citing_paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T16:32:18.613293Z"},"links":{"citing_paper":"/paper/2507.13496"},"observation_digest":"sha256:76affad94fc558aa3ee3f64ad6b53ad940eda2d3fc741fb938f2012d9a448fb0","observation_id":"0121e266-04ca-4bb9-99cc-05b405364d5a","resolution":{"observed_at":"2026-08-06T16:32:19.286905Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:32:19.271338Z","title":"Quan- tum ldpc codes with positive rate and min- imum distance proportional to the square root of the blocklength","venue":null,"work_id":"f5a7de8d-7255-4b0c-84bf-801360e991ae","year":2014},"citing_paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T16:32:18.616414Z"},"links":{"citing_paper":"/paper/2507.13496"},"observation_digest":"sha256:289e1a2d83d6528ecfaf04346fcd81af622828af00c4271adc04dce2d04bb65b","observation_id":"1dd9db2b-5156-4b7c-89ac-6d7c62257f12","resolution":{"observed_at":"2026-08-06T16:32:19.276203Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:32:19.258952Z","title":"Breuckmann and Jens Niklas Eberhardt","venue":null,"work_id":"68a4752b-2b9f-472d-8165-2402d74fc802","year":2021},"citing_paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T16:32:18.619630Z"},"links":{"citing_paper":"/paper/2507.13496"},"observation_digest":"sha256:8847830f559a76b30d2c5b794bd2315dbee5674fe969ae7912cf09750b2f1a06","observation_id":"c34fffab-7b19-46cb-a04d-b864cc838e42","resolution":{"observed_at":"2026-08-06T16:32:19.265345Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:32:19.248608Z","title":"Weight reduction for quantum codes, 2016","venue":null,"work_id":"ca0caed9-0150-491f-b4a3-57c014dffcc4","year":2016},"citing_paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T16:32:18.622672Z"},"links":{"citing_paper":"/paper/2507.13496"},"observation_digest":"sha256:1c09366a4877eebe8f522e5dc34d82adf2789ac9875e4b593d18931ee14bf474","observation_id":"71e7b993-ed00-4bf1-801a-8795dd61dac3","resolution":{"observed_at":"2026-08-06T16:32:19.252617Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:32:19.236019Z","title":"On quantum weight reduction, 2021","venue":null,"work_id":"c7ed7e56-7fed-45ef-8f97-dda5a98654be","year":2021},"citing_paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T16:32:18.626414Z"},"links":{"citing_paper":"/paper/2507.13496"},"observation_digest":"sha256:d0cca18eeb78b0c4f5a39a9ff8035b0c973f3b56ce93fe5cdcd7d329ba63e080","observation_id":"8daf0bf9-9258-421a-a636-325452ed44f0","resolution":{"observed_at":"2026-08-06T16:32:19.240198Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:32:19.224673Z","title":"Gunderman, Ben- jamin Ide, Michael Vasmer, and Guil- laume Dauphinais","venue":null,"work_id":"8cb41569-32fe-4c7d-a302-c99f3af8f881","year":2024},"citing_paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T16:32:18.630144Z"},"links":{"citing_paper":"/paper/2507.13496"},"observation_digest":"sha256:3ddbb1a5045b45753d43656734772f47ee4aa17c8d90c0b0ac93149b3330ee12","observation_id":"02d09104-3305-469a-bf58-f66d9ad39487","resolution":{"observed_at":"2026-08-06T16:32:19.229106Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1411.3334","last_updated":"2017-02-17T03:43:48Z","snapshot_observed_at":"2026-08-14T23:11:52.770159Z","submitted_at":"2014-11-12T21:00:14Z","title":"Sparse Quantum Codes from Quantum Circuits","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1411.3334","snapshot_observed_at":"2026-08-06T16:32:18.633969Z","title":"Flammia, Aram W","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T16:32:18.633969Z"},"links":{"cited_paper":"/paper/1411.3334","citing_paper":"/paper/2507.13496"},"observation_digest":"sha256:81498cd8d2a567a8fb2141c1e3300009323bf9f034f7ec7dc29ab9dab0ca237e","observation_id":"a823b1b3-e587-4802-9f2a-0f1742725a0a","resolution":{"observed_at":"2026-08-06T16:32:18.633969Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:32:19.213584Z","title":"Wire codes, 2024","venue":null,"work_id":"48270bef-72bd-46ba-a196-51f63db4c996","year":2024},"citing_paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T16:32:18.637380Z"},"links":{"citing_paper":"/paper/2507.13496"},"observation_digest":"sha256:938a03118c7821c6274ea922c5bdd21a112fcf72c72fbe9111aad89116e18026","observation_id":"9717e49d-1726-41db-8ef9-87e8a01a7f1b","resolution":{"observed_at":"2026-08-06T16:32:19.217933Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:32:19.202678Z","title":"Quan- tum tanner codes, 2022","venue":null,"work_id":"95416674-12b1-4a33-839a-cb84639c62fb","year":2022},"citing_paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T16:32:18.640715Z"},"links":{"citing_paper":"/paper/2507.13496"},"observation_digest":"sha256:5980a4ddf05a4dc0a17d14788fbe496c56186353392c6e665172d01eb810e6b2","observation_id":"9db09bef-0f3c-4198-84e0-6711d9343bd7","resolution":{"observed_at":"2026-08-06T16:32:19.206957Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:32:19.191562Z","title":"Xyz ruby code: Making a case for a three- colored graphical calculus for quantum er- ror correction in spacetime.PRX Quantum, 6(1):010360, 2025","venue":null,"work_id":"368c3430-33c5-4b0b-83b3-3e79301a2bc9","year":2025},"citing_paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T16:32:18.643862Z"},"links":{"citing_paper":"/paper/2507.13496"},"observation_digest":"sha256:bea8a00cfa696f61ae1ec87242ff3e71547f18cd28cb2c52a4c4ecdecdef4876","observation_id":"2fa3c51f-ea50-4ac8-9207-1c274c88c607","resolution":{"observed_at":"2026-08-06T16:32:19.196102Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:32:19.179213Z","title":"Phase-free zx diagrams are css codes (...or how to graphically grok the surface code), 2022","venue":null,"work_id":"67e1a28c-25dd-437a-bcf8-141f4d537982","year":2022},"citing_paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T16:32:18.647574Z"},"links":{"citing_paper":"/paper/2507.13496"},"observation_digest":"sha256:3a0edd789058f10a7b5598317c92e39b8aa964b7a9d725bf8de05aef6658b49d","observation_id":"4b28e761-68b4-4edc-aa81-768b8a3f9ce3","resolution":{"observed_at":"2026-08-06T16:32:19.183601Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:32:19.168190Z","title":"Quan- tum lego: Building quantum error correction codes from tensor networks.PRX Quantum, 3(2), May 2022","venue":null,"work_id":"47f59fdb-24a5-47b0-835d-f66c480bbb5b","year":2022},"citing_paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T16:32:18.650700Z"},"links":{"citing_paper":"/paper/2507.13496"},"observation_digest":"sha256:2abe483b5c022a03cb49aa55a7c352eb994af958a9d47021907dddb87b07a541","observation_id":"facedbff-2c1b-4776-ac17-7192bd90527e","resolution":{"observed_at":"2026-08-06T16:32:19.172626Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:32:19.155561Z","title":"Harris, Nathan A","venue":null,"work_id":"bb473230-86a2-405a-b8f3-83e992ad3372","year":2021},"citing_paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T16:32:18.653738Z"},"links":{"citing_paper":"/paper/2507.13496"},"observation_digest":"sha256:bdb2c39d74af38464e61a8b1375fe5569ba722594eb87be0c0fdc238b0d74712","observation_id":"16f559fc-4293-4cf2-8332-b315294f5992","resolution":{"observed_at":"2026-08-06T16:32:19.160443Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:32:19.144384Z","title":"Local tensor- network codes","venue":null,"work_id":"79607260-975d-4b23-ad36-8afd7ff2e565","year":2022},"citing_paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T16:32:18.657344Z"},"links":{"citing_paper":"/paper/2507.13496"},"observation_digest":"sha256:5d20d9373d7dca446d6eb0001ac6fd040e1a1f8860a29995e36d330099f4e5b2","observation_id":"5ab631dc-bd4b-4f6e-9c36-7de72b9b7e2c","resolution":{"observed_at":"2026-08-06T16:32:19.148874Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:32:19.133736Z","title":"Gullans, Brad Lackey, and Zitao Wang","venue":null,"work_id":"12fb17ca-2bea-43d7-b72c-433e298497e1","year":2024},"citing_paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T16:32:18.660350Z"},"links":{"citing_paper":"/paper/2507.13496"},"observation_digest":"sha256:6610e99088bf943b7980328a86995f621b5b5de092848ccdf377551e154515a4","observation_id":"0f7befe9-fc4b-4108-bc80-6284eac73d98","resolution":{"observed_at":"2026-08-06T16:32:19.137837Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:32:19.123144Z","title":"Quantum lego and xp stabilizer codes, 2023","venue":null,"work_id":"db9afc84-1791-4e9d-93a4-05ed2f9add79","year":2023},"citing_paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T16:32:18.664114Z"},"links":{"citing_paper":"/paper/2507.13496"},"observation_digest":"sha256:557af96e01ec4aab5d5fee1c63a253e27a057378a9e8d2203085fadb6438625c","observation_id":"70eadd54-9882-461d-a3a2-e143f7ccc64c","resolution":{"observed_at":"2026-08-06T16:32:19.127319Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:32:19.112315Z","title":"Thezxcalculusisalanguageforsurfacecode lattice surgery","venue":null,"work_id":"2c9cfe61-9d2b-4df2-8dce-0ebab19642f5","year":2020},"citing_paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T16:32:18.667490Z"},"links":{"citing_paper":"/paper/2507.13496"},"observation_digest":"sha256:9688e1d62090baba33ff00fce4b3449415ec1a545be5bcac2c55737172514d6d","observation_id":"2fc3bb58-a98b-439b-8c5d-c0f771d7aa47","resolution":{"observed_at":"2026-08-06T16:32:19.116506Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:32:19.100927Z","title":"Graphical structures for design and verification of quantum error correc- tion","venue":null,"work_id":"a5ba6024-1b17-4cd2-8f0b-103b1cb6fad1","year":2023},"citing_paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T16:32:18.670692Z"},"links":{"citing_paper":"/paper/2507.13496"},"observation_digest":"sha256:033785e24618e7660fbccf6a127df4ae5c36944f8549f3c08331a8d4d10f9dea","observation_id":"f919ca29-337f-4d6a-8501-c0f45380ca75","resolution":{"observed_at":"2026-08-06T16:32:19.105576Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:32:19.090004Z","title":"Scalable spider nests (...or how to graph- ically grok transversal non-clifford gates)","venue":null,"work_id":"4645c621-fdf8-4bec-b01a-9183fa397733","year":2024},"citing_paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T16:32:18.673906Z"},"links":{"citing_paper":"/paper/2507.13496"},"observation_digest":"sha256:cdf041542fc4d9c1e743cce6a7bb51f207182d94faadf19e8560f15e4f78c8d7","observation_id":"67f78380-907d-46f8-8a93-558e484c4e24","resolution":{"observed_at":"2026-08-06T16:32:19.094393Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:32:19.078741Z","title":"Graphical css code transformation using zx calculus","venue":null,"work_id":"53c284bc-40e1-4d09-8724-222a01ae0acc","year":2023},"citing_paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T16:32:18.677048Z"},"links":{"citing_paper":"/paper/2507.13496"},"observation_digest":"sha256:57638b555ea0ddd77d7d3612da8fd24b9176141db367942c5f8ebb4251dc52df","observation_id":"07780961-1d4c-4dd9-8a41-a10180533a1b","resolution":{"observed_at":"2026-08-06T16:32:19.083242Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:32:19.067739Z","title":"Quantum weight enumerators and tensor networks","venue":null,"work_id":"3005277d-aec6-4ce4-9f78-544a877b2f53","year":2024},"citing_paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T16:32:18.680271Z"},"links":{"citing_paper":"/paper/2507.13496"},"observation_digest":"sha256:e160956be182e7fd70ea10052e904da2fa125d12be6403277dd5ffccf793f680","observation_id":"06527468-b5f8-40a1-8da9-b41bcd361344","resolution":{"observed_at":"2026-08-06T16:32:19.072651Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:32:19.058864Z","title":"Discovery of optimal quantum error correcting codes via reinforcement learning, 2023","venue":null,"work_id":"56b025ae-1e33-4797-9f60-792edf6ee2e1","year":2023},"citing_paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T16:32:18.683250Z"},"links":{"citing_paper":"/paper/2507.13496"},"observation_digest":"sha256:03016178c88468a78d5de0c88fe6372b06ac938e5084f7f78236d65925d23d78","observation_id":"bb3cb18b-42c5-4fe5-9fe4-43d6654f1151","resolution":{"observed_at":"2026-08-06T16:32:19.062447Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:32:19.050030Z","title":"Stabilizer codes and quantum error correction","venue":null,"work_id":"1d99d17b-c5bd-415f-8890-c72fab9678df","year":1997},"citing_paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T16:32:18.686434Z"},"links":{"citing_paper":"/paper/2507.13496"},"observation_digest":"sha256:748cab298c9618337c56eb155f5118ccd6c6675e70393970f58ca026606254f9","observation_id":"156ec6ce-9109-4646-ad97-bb69d097a00c","resolution":{"observed_at":"2026-08-06T16:32:19.053502Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:32:19.041053Z","title":"Modifying method of con- structing quantum codes from highly entan- gled states","venue":null,"work_id":"86332db9-f32e-439f-b0d9-71cd655c5a4f","year":2020},"citing_paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-06T16:32:18.689646Z"},"links":{"citing_paper":"/paper/2507.13496"},"observation_digest":"sha256:5124ffbf0bb5ef88b63a141ea46966df03b0d430b8ca5a11e5f8106c16288143","observation_id":"7684850d-ded6-4969-84c2-8935502d2d1f","resolution":{"observed_at":"2026-08-06T16:32:19.044107Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:32:19.032566Z","title":"Quan- tum variational learning for quantum error- correcting codes","venue":null,"work_id":"dc3b0af3-038b-4ddc-87d7-37323a7ac09c","year":2022},"citing_paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-06T16:32:18.692787Z"},"links":{"citing_paper":"/paper/2507.13496"},"observation_digest":"sha256:06626a95c60005ffa4109c3ce25232f0b93705fcd8d1b919e54b1b0181091a70","observation_id":"71660c8a-0c1d-4d0e-90a2-c7f3c057def8","resolution":{"observed_at":"2026-08-06T16:32:19.035805Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:32:19.024113Z","title":"An introduction to quan- tumerrorcorrectionandfault-tolerantquan- tum computation, 2009","venue":null,"work_id":"2f8e84e2-3b59-4c5e-8136-19470e059105","year":2009},"citing_paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-06T16:32:18.695987Z"},"links":{"citing_paper":"/paper/2507.13496"},"observation_digest":"sha256:68ff94f3fee9e4a1bae5677d964d59efb138d0e1c4703d74b6ac3bf7182473bc","observation_id":"fab0922f-a39b-4334-9f3a-c6807e9dadd0","resolution":{"observed_at":"2026-08-06T16:32:19.027078Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:32:19.015794Z","title":"Good quantum ldpc codes with linear time decoders, 2022","venue":null,"work_id":"2ac1938a-1de1-4dce-bff5-a9f90600bf38","year":2022},"citing_paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-06T16:32:18.699345Z"},"links":{"citing_paper":"/paper/2507.13496"},"observation_digest":"sha256:0555779d2b659a9a7e004fd962aee5abb10dfd3a78232e1ee281941b283a1dd2","observation_id":"ccf5f555-5481-4331-a827-59676aa3d0bb","resolution":{"observed_at":"2026-08-06T16:32:19.018848Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:32:19.007439Z","title":"Quan- tum ldpc codes with almost linear minimum distance","venue":null,"work_id":"c552c8af-1d02-4bca-af54-af2a1aa87eb3","year":2022},"citing_paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-06T16:32:18.702436Z"},"links":{"citing_paper":"/paper/2507.13496"},"observation_digest":"sha256:9b14a439147b97aebd01f8b736eaeb28dd2f4f8c025df296959ea447962472c0","observation_id":"78c56617-acd9-4101-8d3f-74107f1d2538","resolution":{"observed_at":"2026-08-06T16:32:19.010667Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:32:18.999395Z","title":"Protecting expressive circuits with a quantum error detection code","venue":null,"work_id":"ed31588d-0b27-44fa-9a1e-d4ea250547a5","year":2024},"citing_paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-06T16:32:18.705584Z"},"links":{"citing_paper":"/paper/2507.13496"},"observation_digest":"sha256:476b174e453b581d7fd4b68f0dbd0aae60130e8687d3542971cd351dc028c63e","observation_id":"71660f15-c7a1-4cec-964c-a787654d7017","resolution":{"observed_at":"2026-08-06T16:32:19.002300Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:32:18.990770Z","title":"Entan- glement renormalization and topological or- der","venue":null,"work_id":"e1c2f3f9-5eb4-4460-9643-9e49a62973d4","year":2008},"citing_paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-06T16:32:18.708606Z"},"links":{"citing_paper":"/paper/2507.13496"},"observation_digest":"sha256:da5d4cb4ac490db6ee2d244eff50a98cd471da8c6f8502df1a68491b4cb07d39","observation_id":"ccb681c7-e197-4520-9f9c-af36b4e566c8","resolution":{"observed_at":"2026-08-06T16:32:18.994034Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:32:18.981697Z","title":"Fusion-based quantum com- putation, 2021","venue":null,"work_id":"05833409-8657-4f15-879f-b72fbdb96e1c","year":2021},"citing_paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-06T16:32:18.712383Z"},"links":{"citing_paper":"/paper/2507.13496"},"observation_digest":"sha256:ca431ff90e58e0ffd0e64cdfd33d15239a9441ad856ccc6571a5ea681bc63c43","observation_id":"e3d61a8b-f1fa-4f5d-9241-36db0566fc82","resolution":{"observed_at":"2026-08-06T16:32:18.984779Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:32:18.972621Z","title":"Stabilizer formalism for oper- ator quantum error correction.Physical Re- view Letters, 95(23), December 2005","venue":null,"work_id":"91099115-03cd-4d6b-9c0b-3856a43306a9","year":2005},"citing_paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-06T16:32:18.715832Z"},"links":{"citing_paper":"/paper/2507.13496"},"observation_digest":"sha256:5735676965067af09279523e443e1ff811ab18d935f144105fe35e603588399f","observation_id":"9d6dd1b6-a0ed-44f7-b6e9-e1c81a33d2dc","resolution":{"observed_at":"2026-08-06T16:32:18.975657Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.14372","last_updated":"2025-02-20T09:05:34Z","snapshot_observed_at":"2026-08-16T12:56:44.993430Z","submitted_at":"2025-02-20T09:05:34Z","title":"Discovering highly efficient low-weight quantum error-correcting codes with reinforcement learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.14372","snapshot_observed_at":"2026-08-06T16:32:18.719380Z","title":"Discov- ering highly efficient low-weight quantum error-correcting codes with reinforcement learning","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-06T16:32:18.719380Z"},"links":{"cited_paper":"/paper/2502.14372","citing_paper":"/paper/2507.13496"},"observation_digest":"sha256:d06e2a9c88024dd4f6632bef90510cd30093ce7079556c6efd727757458f384d","observation_id":"6e63be38-ac6e-4488-b78f-afd8caea545c","resolution":{"observed_at":"2026-08-06T16:32:18.719380Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:32:18.964227Z","title":"Tradeoffs for reliable quantum in- formation storage in 2d systems","venue":null,"work_id":"9157bd8a-2a28-4ff8-8b66-d790a3c0706e","year":2010},"citing_paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-06T16:32:18.722705Z"},"links":{"citing_paper":"/paper/2507.13496"},"observation_digest":"sha256:96abf3615e491d66617169bbc81749f329171deba9f17db69b8f737ce3ac64df","observation_id":"6e27b1fb-ab51-4ebe-8209-b21b2bded20a","resolution":{"observed_at":"2026-08-06T16:32:18.967330Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:32:18.954741Z","title":"Unifying flavors of fault tolerance with the zx calculus.Quantum, 8:1379, June 2024","venue":null,"work_id":"f4ede06d-5760-4eca-895c-9874f3ee2cfc","year":2024},"citing_paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-06T16:32:18.725906Z"},"links":{"citing_paper":"/paper/2507.13496"},"observation_digest":"sha256:94d27627ad159e90b72c3a808ab0ea065894374db1149aab1208ee70fa5b70a8","observation_id":"b0b160a0-2a1d-4b6c-ab40-67523f455275","resolution":{"observed_at":"2026-08-06T16:32:18.958764Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:32:18.946428Z","title":"Fault-tolerant complexes, 2023","venue":null,"work_id":"cfe859dd-e565-40c9-b119-30cdb7042f98","year":2023},"citing_paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-06T16:32:18.729560Z"},"links":{"citing_paper":"/paper/2507.13496"},"observation_digest":"sha256:48e82eb112d0cf61bb940f19d6618d4af20154e3b9cfe545e62b837dfb26be2e","observation_id":"ae4b984c-693d-4274-ad47-44bc318ef7b1","resolution":{"observed_at":"2026-08-06T16:32:18.949322Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:32:18.937637Z","title":"Magic- state distillation with low overhead.Physical Review A, 86(5), November 2012","venue":null,"work_id":"bec2ec5a-6cf7-46f6-bdf8-d1ea4cce2967","year":2012},"citing_paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-06T16:32:18.732677Z"},"links":{"citing_paper":"/paper/2507.13496"},"observation_digest":"sha256:0a410c6bbdb4c79b4dd8caa96e009fcd9beb1d33d3df48d39a94d929eebe9206","observation_id":"0e1f9e0a-4832-45fb-8865-37ca587a2a14","resolution":{"observed_at":"2026-08-06T16:32:18.940966Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:32:18.928892Z","title":"Quantifying nonlocality: How outperform- ing local quantum codes is expensive.Phys","venue":null,"work_id":"3334cc1e-d519-4cd7-851a-3e38de3251d4","year":2022},"citing_paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-06T16:32:18.735887Z"},"links":{"citing_paper":"/paper/2507.13496"},"observation_digest":"sha256:8792d0d8d7a47149edc22e7b63170c32c2948cce405b21ea2514fffb5067e3cf","observation_id":"7ccb059f-a3d0-4769-a583-a050f2d23fbb","resolution":{"observed_at":"2026-08-06T16:32:18.932066Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:32:18.920251Z","title":"Transform arbitrary good quantum ldpc codes into good geometrically local codes in any dimension, 2024","venue":null,"work_id":"3320d63f-486f-4c10-8ae0-b4027cfadb14","year":2024},"citing_paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-06T16:32:18.739345Z"},"links":{"citing_paper":"/paper/2507.13496"},"observation_digest":"sha256:31fcd1af922079c3127fd6486fbb42d2ee2905714e88fd064ea0620e03b3d87b","observation_id":"4ed0dc83-e837-49e0-8c98-fcdd2dfc8486","resolution":{"observed_at":"2026-08-06T16:32:18.923650Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:32:18.911317Z","title":null,"venue":null,"work_id":"932dc957-505c-4b9e-803d-4ef19d1620c4","year":2023},"citing_paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-06T16:32:18.742508Z"},"links":{"citing_paper":"/paper/2507.13496"},"observation_digest":"sha256:127a71d4e9881908dae8befd973c385ea9757c9d8ab2c67939dddd32f8527f15","observation_id":"70341a50-35b9-4666-9912-adae11f1aa90","resolution":{"observed_at":"2026-08-06T16:32:18.914292Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:32:18.901854Z","title":"Simultaneous discov- ery of quantum error correction codes and encoders with a noise-aware reinforcement learning agent, 2024","venue":null,"work_id":"c92bb510-959e-4751-b1ec-a71e80391828","year":2024},"citing_paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-06T16:32:18.746781Z"},"links":{"citing_paper":"/paper/2507.13496"},"observation_digest":"sha256:d7d136e97bbd881e69973689a7beb158c897ec6ce2e32aca59b9858a02e80a90","observation_id":"29c49e25-81b5-4ba2-8cc7-672572ec7bf3","resolution":{"observed_at":"2026-08-06T16:32:18.905213Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.08887","last_updated":"2025-08-22T04:09:12Z","snapshot_observed_at":"2026-08-16T12:41:55.944500Z","submitted_at":"2025-04-11T18:00:05Z","title":"Planar quantum low-density parity-check codes with open boundaries","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.08887","snapshot_observed_at":"2026-08-06T16:32:18.749955Z","title":"Planar quantum low-density parity-check codes with open boundaries","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-06T16:32:18.749955Z"},"links":{"cited_paper":"/paper/2504.08887","citing_paper":"/paper/2507.13496"},"observation_digest":"sha256:d0d540905aedc84902dc32220055bc08452fd155af5423f9359ede786436442a","observation_id":"5c503a5a-c458-495c-bb57-838427e9d975","resolution":{"observed_at":"2026-08-06T16:32:18.749955Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:32:18.892742Z","title":"Opportunities and chal- lenges in fault-tolerant quantum computa- tion, 2022","venue":null,"work_id":"284c0c07-546d-43f8-93c2-fbe35f8257ab","year":2022},"citing_paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-06T16:32:18.753264Z"},"links":{"citing_paper":"/paper/2507.13496"},"observation_digest":"sha256:7e0f7fa92c16b0f939b2d189dda97021d70c5295ed6f4bfeca7a89118e7e03b7","observation_id":"5b8a61bf-0325-4d00-a7e2-c806d03952ff","resolution":{"observed_at":"2026-08-06T16:32:18.896130Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:32:18.882504Z","title":"Floquetifying stabiliser codes with distance-preserving rewrites, 2024","venue":null,"work_id":"268b6300-8725-4fac-8831-d089a129692d","year":2024},"citing_paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-06T16:32:18.757112Z"},"links":{"citing_paper":"/paper/2507.13496"},"observation_digest":"sha256:317f83eb2653beefbacb6199ba0608dd653e5f845cb7157bfb9fac0d48a22a86","observation_id":"d64e9a85-9cd6-4111-8d52-41cda6be08c9","resolution":{"observed_at":"2026-08-06T16:32:18.886830Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:32:18.873867Z","title":"unchanged","venue":null,"work_id":"68d897d6-fec8-4101-8d88-ac4a362cbdc8","year":2006},"citing_paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-06T16:32:18.760040Z"},"links":{"citing_paper":"/paper/2507.13496"},"observation_digest":"sha256:6448769223f858002328ffbdda7f5233b4904cc4d945eeb7d703ad5ed3b4708d","observation_id":"883d0ef2-8548-4764-9636-e1a1b8d32ec3","resolution":{"observed_at":"2026-08-06T16:32:18.876853Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:32:18.861372Z","title":"This 22 ¯X′ 0 is a bare logicalX-operator because any pairs of qubits that pushed throughXN do not acti- vate the gauge qubit","venue":null,"work_id":"2bec9ee7-357d-4b5a-9675-77fa32ad92cd","year":null},"citing_paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-06T16:32:18.763276Z"},"links":{"citing_paper":"/paper/2507.13496"},"observation_digest":"sha256:2e56906d58f39af0a1532629b2420e27cdfeca856140605c3b48869c9cd8f4cd","observation_id":"c400ba66-d405-473a-b65f-1df13342e605","resolution":{"observed_at":"2026-08-06T16:32:18.867635Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.13496","last_updated":"2025-07-17T19:05:52Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-16T08:36:41.353241Z","submitted_at":"2025-07-17T19:05:52Z","title":"Growing Sparse Quantum Codes from a Seed"},"reference_resolution":{"displayed":65,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":10,"verified_exact":0,"verified_fuzzy":55},"total_outbound_references":65},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 65 of 65 outbound references and 1 inbound Pith citation observation for arXiv:2507.13496."}