{"as_of":"2026-08-10T13:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b9ab7b497b8f73e36e8ed8a4bb3c45619ba134f7d3fd1f065bba8e22afe0680e","coverage":[{"denominator":48,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":48,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T21:18:51.407738Z","state":"measured"},{"denominator":50,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":50,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-15T01:42:39.110455Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-15T01:43:27.489227Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2508.09082","last_updated":"2025-08-12T17:03:59Z","snapshot_observed_at":"2026-08-09T00:24:03.298508Z","submitted_at":"2025-08-12T17:03:59Z","title":"Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Hook Errors","version":1},"cited_work":{"arxiv_id":"2508.09082","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2508.09082","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Generalized bicycle codes with low con- nectivity: Minimum distance bounds and hook errors","venue":null,"work_id":"5bd3bd36-99f0-4cf4-b9d7-748bccf2e5f9","year":2025},"citing_paper":{"arxiv_id":"2605.05881","last_updated":"2026-05-07T08:47:27Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-07T08:47:27Z","title":"Surface-Code Thresholds and Qubit Footprints in Shuttling-Based Spin-Qubit Railways","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-05-08T11:38:59.842203Z"},"links":{"cited_paper":"/paper/2508.09082","citing_paper":"/paper/2605.05881"},"observation_digest":"sha256:bf447f9db962ccbeeec69bb8f9d956de48583fa3e5c5b765c88b492ff2a3c3f3","observation_id":"e5f7a8d1-edd4-43ac-892b-d10f54674cf0","resolution":{"observed_at":"2026-05-11T19:36:08.387503Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.09082","last_updated":"2025-08-12T17:03:59Z","snapshot_observed_at":"2026-08-09T00:24:03.298508Z","submitted_at":"2025-08-12T17:03:59Z","title":"Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Hook Errors","version":1},"cited_work":{"arxiv_id":"2508.09082","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2508.09082","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Generalized bicycle codes with low con- nectivity: Minimum distance bounds and hook errors","venue":null,"work_id":"5bd3bd36-99f0-4cf4-b9d7-748bccf2e5f9","year":2025},"citing_paper":{"arxiv_id":"2605.14173","last_updated":"2026-05-13T22:52:01Z","snapshot_observed_at":"2026-07-06T23:25:39.415637Z","submitted_at":"2026-05-13T22:52:01Z","title":"Univariate Bicycle Quantum LDPC Codes: Explicit Logical Structure and Distance Bounds","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-15T01:42:39.110455Z"},"links":{"cited_paper":"/paper/2508.09082","citing_paper":"/paper/2605.14173"},"observation_digest":"sha256:9ff217d7dbf44a90a0c2f5196053dc6aae4e1d0e115884192c0b00e9a64f13c2","observation_id":"04474b6d-47f3-4253-9a8c-dd0f56d00dbf","resolution":{"observed_at":"2026-05-15T01:43:27.491975Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2508.09082/citation-record","integrity":"/paper/2508.09082/integrity","json":"/paper/2508.09082/citation-record.json","paper":"/paper/2508.09082"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T21:19:02.773842Z","title":"Constructions and noise threshold of hyperbolic surface codes","venue":null,"work_id":"4a764b5c-f088-4f13-a7aa-bc3e641a5ca7","year":2016},"citing_paper":{"arxiv_id":"2508.09082","last_updated":"2025-08-12T17:03:59Z","snapshot_observed_at":"2026-08-09T00:24:03.298508Z","submitted_at":"2025-08-12T17:03:59Z","title":"Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Hook Errors","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-05T21:18:45.374586Z"},"links":{"citing_paper":"/paper/2508.09082"},"observation_digest":"sha256:b063337204c1429bfe7197d0378de116317b85c551fc8aa2599678f528f6a2b0","observation_id":"42f2217d-c85c-4176-86f6-0a36bc9bbb20","resolution":{"observed_at":"2026-08-05T21:19:02.837891Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.03750","last_updated":"2024-11-22T18:55:45Z","snapshot_observed_at":"2026-08-08T22:59:41.166928Z","submitted_at":"2023-08-07T17:54:45Z","title":"Constructions and performance of hyperbolic and semi-hyperbolic Floquet codes","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.03750","snapshot_observed_at":"2026-08-05T21:18:45.554749Z","title":"Constructions and performance of hyperbolic and semi-hyperbolic floquet codes","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.09082","last_updated":"2025-08-12T17:03:59Z","snapshot_observed_at":"2026-08-09T00:24:03.298508Z","submitted_at":"2025-08-12T17:03:59Z","title":"Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Hook Errors","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-05T21:18:45.554749Z"},"links":{"cited_paper":"/paper/2308.03750","citing_paper":"/paper/2508.09082"},"observation_digest":"sha256:668f0201d86af1f67fc9c7b72eef13ea80e6f42432968b6f561ca03802515989","observation_id":"c70b8777-2e55-4992-b5b4-ce68f1725efb","resolution":{"observed_at":"2026-08-05T21:18:45.554749Z","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-05T21:19:02.426308Z","title":"Quantum kronecker sum-product low-density parity-check codes with finite rate","venue":null,"work_id":"2783258e-5801-48ce-8b6d-881430b19f27","year":2013},"citing_paper":{"arxiv_id":"2508.09082","last_updated":"2025-08-12T17:03:59Z","snapshot_observed_at":"2026-08-09T00:24:03.298508Z","submitted_at":"2025-08-12T17:03:59Z","title":"Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Hook Errors","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-05T21:18:45.672906Z"},"links":{"citing_paper":"/paper/2508.09082"},"observation_digest":"sha256:f04d10de72214adbee30db84fe464a7d7331f61658d6104907c5d395ee5296a7","observation_id":"a0512e5e-eff9-4479-a6a5-6640b1b8f9f6","resolution":{"observed_at":"2026-08-05T21:19:02.663137Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T21:19:02.154832Z","title":"Degenerate quantum LDPC codes with good finite length performance","venue":null,"work_id":"f721dddd-a5ef-4a85-aede-eface03aeac4","year":2021},"citing_paper":{"arxiv_id":"2508.09082","last_updated":"2025-08-12T17:03:59Z","snapshot_observed_at":"2026-08-09T00:24:03.298508Z","submitted_at":"2025-08-12T17:03:59Z","title":"Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Hook Errors","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-05T21:18:45.881944Z"},"links":{"citing_paper":"/paper/2508.09082"},"observation_digest":"sha256:f7bd2dadc0a558bbdb1066da1d209f72c3dbfb3f87e43c9987b04d9a45743a9a","observation_id":"501be353-3803-43f6-8240-191c62819de3","resolution":{"observed_at":"2026-08-05T21:19:02.284749Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T21:19:01.635116Z","title":"Quantum two-block group algebra codes","venue":null,"work_id":"cb9387ad-8306-41ce-a87a-ec68e377c1c0","year":2024},"citing_paper":{"arxiv_id":"2508.09082","last_updated":"2025-08-12T17:03:59Z","snapshot_observed_at":"2026-08-09T00:24:03.298508Z","submitted_at":"2025-08-12T17:03:59Z","title":"Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Hook Errors","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-05T21:18:46.007667Z"},"links":{"citing_paper":"/paper/2508.09082"},"observation_digest":"sha256:730f916193a382079abae96b79c469ae3b259684a9d507318fa343b20bceb4c1","observation_id":"e0f78453-aaaa-4ecc-8391-09c9348d0e3a","resolution":{"observed_at":"2026-08-05T21:19:01.737628Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T21:19:01.428980Z","title":"Quantum LDPC codes with positive rate and minimum distance proportional to the square root of the blocklength","venue":null,"work_id":"9bb3db1f-d3ad-4959-8666-f77084d05a93","year":2013},"citing_paper":{"arxiv_id":"2508.09082","last_updated":"2025-08-12T17:03:59Z","snapshot_observed_at":"2026-08-09T00:24:03.298508Z","submitted_at":"2025-08-12T17:03:59Z","title":"Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Hook Errors","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-05T21:18:46.121936Z"},"links":{"citing_paper":"/paper/2508.09082"},"observation_digest":"sha256:00a887470e121a399e7e25e9e1fe25361ba0b6f2e10440a01a5e2a16863859a5","observation_id":"6451d7a1-8aa2-402d-ae8c-cc9c7deb24f1","resolution":{"observed_at":"2026-08-05T21:19:01.508846Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T21:19:01.254821Z","title":"High-threshold and low-overhead fault-tolerant quantum memory","venue":null,"work_id":"7101e863-f50b-4a09-9d98-f157b40734ca","year":2024},"citing_paper":{"arxiv_id":"2508.09082","last_updated":"2025-08-12T17:03:59Z","snapshot_observed_at":"2026-08-09T00:24:03.298508Z","submitted_at":"2025-08-12T17:03:59Z","title":"Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Hook Errors","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-05T21:18:46.215623Z"},"links":{"citing_paper":"/paper/2508.09082"},"observation_digest":"sha256:d1ddba73c40c771b0d1f53782cbfe919f3fe52a0ec55eb0d3c751055ae6f9d47","observation_id":"e5d80cef-a33d-463b-aca5-cd9fe75b06a3","resolution":{"observed_at":"2026-08-05T21:19:01.338930Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T21:19:01.115278Z","title":"Good quantum LDPC codes with linear time decoders","venue":null,"work_id":"4f4c9311-5a7f-4a79-9b20-48e911649fc4","year":2023},"citing_paper":{"arxiv_id":"2508.09082","last_updated":"2025-08-12T17:03:59Z","snapshot_observed_at":"2026-08-09T00:24:03.298508Z","submitted_at":"2025-08-12T17:03:59Z","title":"Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Hook Errors","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-05T21:18:46.333469Z"},"links":{"citing_paper":"/paper/2508.09082"},"observation_digest":"sha256:1d73c17705edcdb8110c754a5a3fdb35d6bcc14c39be76f4971f7a8560ee1491","observation_id":"4411c0c0-182c-4e5d-a2e9-9b1f90b28b2f","resolution":{"observed_at":"2026-08-05T21:19:01.197077Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.03646","last_updated":"2024-11-06T03:53:10Z","snapshot_observed_at":"2026-08-03T08:51:35.198604Z","submitted_at":"2024-11-06T03:53:10Z","title":"Quantum LDPC Codes of Almost Linear Distance via Homological Products","version":1},"cited_work":{"arxiv_id":"2411.03646","doi":null,"metadata_source":"pith","pith_arxiv_id":"2411.03646","snapshot_observed_at":"2026-08-05T21:18:51.837952Z","title":"Quantum LDPC Codes of Almost Linear Distance via Homological Products","venue":"quant-ph","work_id":"4edb3165-345a-4cf3-b402-b37fa98e446e","year":2024},"citing_paper":{"arxiv_id":"2508.09082","last_updated":"2025-08-12T17:03:59Z","snapshot_observed_at":"2026-08-09T00:24:03.298508Z","submitted_at":"2025-08-12T17:03:59Z","title":"Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Hook Errors","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-05T21:18:46.508520Z"},"links":{"cited_paper":"/paper/2411.03646","citing_paper":"/paper/2508.09082"},"observation_digest":"sha256:498ab9473e99a72b6b8ef9c989551d333aed56714946d0d2ba8641247d4c362a","observation_id":"21df02ec-6fcb-4b60-aa55-48eb8efc39ab","resolution":{"observed_at":"2026-08-05T21:18:51.944935Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T21:19:00.899289Z","title":"Quantum Tanner codes","venue":null,"work_id":"1234a7fa-8491-49a6-bf3f-7aded885f51c","year":2022},"citing_paper":{"arxiv_id":"2508.09082","last_updated":"2025-08-12T17:03:59Z","snapshot_observed_at":"2026-08-09T00:24:03.298508Z","submitted_at":"2025-08-12T17:03:59Z","title":"Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Hook Errors","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-05T21:18:46.654445Z"},"links":{"citing_paper":"/paper/2508.09082"},"observation_digest":"sha256:22e95a1ff6b3ae8618fb43d6622e5de3ddb0f62cd94b4556304844b859913290","observation_id":"c3c4f0ff-e3e5-4f94-9b92-8936ac3c1c57","resolution":{"observed_at":"2026-08-05T21:19:01.034754Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.03581","last_updated":"2022-03-07T18:30:45Z","snapshot_observed_at":"2026-07-06T12:45:14.351278Z","submitted_at":"2022-03-07T18:30:45Z","title":"Good quantum LDPC codes with linear time decoder from lossless expanders","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.03581","snapshot_observed_at":"2026-08-05T21:18:46.829205Z","title":"Good quantum LDPC codes with linear time decoder from lossless expanders","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2508.09082","last_updated":"2025-08-12T17:03:59Z","snapshot_observed_at":"2026-08-09T00:24:03.298508Z","submitted_at":"2025-08-12T17:03:59Z","title":"Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Hook Errors","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-05T21:18:46.829205Z"},"links":{"cited_paper":"/paper/2203.03581","citing_paper":"/paper/2508.09082"},"observation_digest":"sha256:d33e014989208e380cd102e3b7403b038368dac1b725879fc01ad4a0bf46efe0","observation_id":"698ca915-915f-4297-8c5f-c6dfc8ffd5c0","resolution":{"observed_at":"2026-08-05T21:18:46.829205Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.16032","last_updated":"2023-10-24T17:47:06Z","snapshot_observed_at":"2026-08-09T00:23:33.456108Z","submitted_at":"2023-10-24T17:47:06Z","title":"The Physics of (good) LDPC Codes I. Gauging and dualities","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.16032","snapshot_observed_at":"2026-08-05T21:18:46.963158Z","title":"The Physics of (good) LDPC Codes I","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.09082","last_updated":"2025-08-12T17:03:59Z","snapshot_observed_at":"2026-08-09T00:24:03.298508Z","submitted_at":"2025-08-12T17:03:59Z","title":"Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Hook Errors","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-05T21:18:46.963158Z"},"links":{"cited_paper":"/paper/2310.16032","citing_paper":"/paper/2508.09082"},"observation_digest":"sha256:a7a8aa0568cf9ac26116930d750e927c41d122ca46bc33ede7b10ac6ba2bd5f1","observation_id":"9275627a-1f74-4448-9465-e7ddef6c598d","resolution":{"observed_at":"2026-08-05T21:18:46.963158Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.16831","last_updated":"2024-02-26T18:56:46Z","snapshot_observed_at":"2026-07-06T17:35:41.168780Z","submitted_at":"2024-02-26T18:56:46Z","title":"The Physics of (good) LDPC Codes II. Product constructions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.16831","snapshot_observed_at":"2026-08-05T21:18:47.049742Z","title":"The Physics of (good) LDPC Codes II","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.09082","last_updated":"2025-08-12T17:03:59Z","snapshot_observed_at":"2026-08-09T00:24:03.298508Z","submitted_at":"2025-08-12T17:03:59Z","title":"Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Hook Errors","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-05T21:18:47.049742Z"},"links":{"cited_paper":"/paper/2402.16831","citing_paper":"/paper/2508.09082"},"observation_digest":"sha256:53af04bd968c6c6066bf21931dafa7a65444bb8b2994504f291b35fb5c19d15c","observation_id":"d5372506-c4e9-4304-af9a-390124e16cff","resolution":{"observed_at":"2026-08-05T21:18:47.049742Z","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-05T21:19:00.643561Z","title":"Distance bounds for generalized bicycle codes","venue":null,"work_id":"6396f777-dc66-422b-9f41-03631f6b7a19","year":2022},"citing_paper":{"arxiv_id":"2508.09082","last_updated":"2025-08-12T17:03:59Z","snapshot_observed_at":"2026-08-09T00:24:03.298508Z","submitted_at":"2025-08-12T17:03:59Z","title":"Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Hook Errors","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-05T21:18:47.205092Z"},"links":{"citing_paper":"/paper/2508.09082"},"observation_digest":"sha256:0f71f32d15ecab8d3cc5524c42c0a920685afbf5745e1eefc9e6097c95d837f3","observation_id":"22ec9553-2d7e-4b78-91bf-dd4539b82337","resolution":{"observed_at":"2026-08-05T21:19:00.764766Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.19406","last_updated":"2025-08-06T07:01:11Z","snapshot_observed_at":"2026-08-07T17:45:17.408885Z","submitted_at":"2025-02-26T18:54:19Z","title":"Single-shot and two-shot decoding with generalized bicycle codes","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.19406","snapshot_observed_at":"2026-08-05T21:18:47.296735Z","title":"Single-shot and two-shot decoding with generalized bicycle codes","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.09082","last_updated":"2025-08-12T17:03:59Z","snapshot_observed_at":"2026-08-09T00:24:03.298508Z","submitted_at":"2025-08-12T17:03:59Z","title":"Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Hook Errors","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-05T21:18:47.296735Z"},"links":{"cited_paper":"/paper/2502.19406","citing_paper":"/paper/2508.09082"},"observation_digest":"sha256:2c1bef6992a54f8a5b8c1c3e9659c8898ae54de118cbb2166213f9ac1ecf4019","observation_id":"3d602cce-6b2d-4855-a8ba-fbebcc13b548","resolution":{"observed_at":"2026-08-05T21:18:47.296735Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.07583","last_updated":"2024-01-15T10:38:13Z","snapshot_observed_at":"2026-08-09T10:33:25.073258Z","submitted_at":"2024-01-15T10:38:13Z","title":"Small Quantum Codes from Algebraic Extensions of Generalized Bicycle Codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.07583","snapshot_observed_at":"2026-08-05T21:18:47.427609Z","title":"Small quantum codes from algebraic extensions of generalized bicycle codes (2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.09082","last_updated":"2025-08-12T17:03:59Z","snapshot_observed_at":"2026-08-09T00:24:03.298508Z","submitted_at":"2025-08-12T17:03:59Z","title":"Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Hook Errors","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-05T21:18:47.427609Z"},"links":{"cited_paper":"/paper/2401.07583","citing_paper":"/paper/2508.09082"},"observation_digest":"sha256:44416b5f2ee8718f1425ff6d3c3dde09b2d1828ea031b2a62790f8c96a83010b","observation_id":"c30b41fe-798e-4c86-8ed6-b74e6444128e","resolution":{"observed_at":"2026-08-05T21:18:47.427609Z","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-05T21:19:00.355512Z","title":"Abelian and non-abelian quantum two-block codes","venue":null,"work_id":"6628ab53-bda6-471f-9e81-5f3c1e98675c","year":2023},"citing_paper":{"arxiv_id":"2508.09082","last_updated":"2025-08-12T17:03:59Z","snapshot_observed_at":"2026-08-09T00:24:03.298508Z","submitted_at":"2025-08-12T17:03:59Z","title":"Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Hook Errors","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-05T21:18:47.526339Z"},"links":{"citing_paper":"/paper/2508.09082"},"observation_digest":"sha256:5b0bbd14ac333e6b62a81fa4478c00bbb34469edb889ec8fc07c11d59ef45929","observation_id":"2c3513b5-4ebb-4f22-9c1d-e1ec91086627","resolution":{"observed_at":"2026-08-05T21:19:00.516112Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.16980","last_updated":"2026-05-28T15:27:54Z","snapshot_observed_at":"2026-07-06T16:53:55.269172Z","submitted_at":"2023-11-28T17:31:08Z","title":"qSIEVE: Efficient qLDPC Memory via Systolic Movement in Atom Arrays","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.16980","snapshot_observed_at":"2026-08-05T21:18:47.646322Z","title":"Matching generalized-bicycle codes to neutral atoms for low-overhead fault-tolerance","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.09082","last_updated":"2025-08-12T17:03:59Z","snapshot_observed_at":"2026-08-09T00:24:03.298508Z","submitted_at":"2025-08-12T17:03:59Z","title":"Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Hook Errors","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-05T21:18:47.646322Z"},"links":{"cited_paper":"/paper/2311.16980","citing_paper":"/paper/2508.09082"},"observation_digest":"sha256:43cc1b26c0ca26c944e50a23f222c7bf3aa712d3a862469b1edbe3525a830a8a","observation_id":"a2775f04-dc5b-448c-aae1-f7b94ba50b90","resolution":{"observed_at":"2026-08-05T21:18:47.646322Z","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-05T21:18:59.864748Z","title":"Towards early fault tolerance on a 2 n array of qubits equipped with shuttling","venue":null,"work_id":"e2da55b8-d617-476c-bedb-9b8133bba4d3","year":2024},"citing_paper":{"arxiv_id":"2508.09082","last_updated":"2025-08-12T17:03:59Z","snapshot_observed_at":"2026-08-09T00:24:03.298508Z","submitted_at":"2025-08-12T17:03:59Z","title":"Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Hook Errors","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-05T21:18:47.750387Z"},"links":{"citing_paper":"/paper/2508.09082"},"observation_digest":"sha256:034d318816bdb774587141b3af9f373eb69f00125199e630976f5dc7a4b09b7c","observation_id":"6e38efd0-6ae9-4d44-b458-81e5cebc8c8e","resolution":{"observed_at":"2026-08-05T21:18:59.974331Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T21:18:59.583890Z","title":"Design of additive quantum codes via the code-word-stabilized framework","venue":null,"work_id":"d3ea8a8b-4e64-457b-890e-64fae2960cf3","year":2011},"citing_paper":{"arxiv_id":"2508.09082","last_updated":"2025-08-12T17:03:59Z","snapshot_observed_at":"2026-08-09T00:24:03.298508Z","submitted_at":"2025-08-12T17:03:59Z","title":"Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Hook Errors","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-05T21:18:47.902463Z"},"links":{"citing_paper":"/paper/2508.09082"},"observation_digest":"sha256:a7ae98e7a09329778a83f4050bda1231cc4f25bed1cb7eee797733d8f53f4f8b","observation_id":"b95bb29a-3e6f-4f77-a94e-203aaf23beb9","resolution":{"observed_at":"2026-08-05T21:18:59.704744Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T21:18:59.336610Z","title":"Improved quantum hypergraph-product LDPC codes","venue":null,"work_id":"8f8ebdff-e0e8-41a5-8e8c-3179877551b9","year":2012},"citing_paper":{"arxiv_id":"2508.09082","last_updated":"2025-08-12T17:03:59Z","snapshot_observed_at":"2026-08-09T00:24:03.298508Z","submitted_at":"2025-08-12T17:03:59Z","title":"Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Hook Errors","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-05T21:18:48.021502Z"},"links":{"citing_paper":"/paper/2508.09082"},"observation_digest":"sha256:2714c0809c848cf6de4eeabeb0af0fbb1f933733a9e21b6a3695a53a7611ad44","observation_id":"0fcfb79d-922c-4f24-8772-0cfb5495f5a4","resolution":{"observed_at":"2026-08-05T21:18:59.457642Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T21:18:58.904754Z","title":"Leveraging automorphisms of quantum codes for fault-tolerant quantum computation","venue":null,"work_id":"6474fa2b-153a-4b43-a059-0072d638ec62","year":2013},"citing_paper":{"arxiv_id":"2508.09082","last_updated":"2025-08-12T17:03:59Z","snapshot_observed_at":"2026-08-09T00:24:03.298508Z","submitted_at":"2025-08-12T17:03:59Z","title":"Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Hook Errors","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-05T21:18:48.167554Z"},"links":{"citing_paper":"/paper/2508.09082"},"observation_digest":"sha256:2cd9a894513ececa537e4b45afbebc7fbd05976faaa6129d1dc5f45f5cb2b361","observation_id":"3a33f954-a817-4012-8a4d-6f3b3a7526d2","resolution":{"observed_at":"2026-08-05T21:18:59.142963Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.18175","last_updated":"2025-05-09T17:26:07Z","snapshot_observed_at":"2026-08-04T00:46:10.255246Z","submitted_at":"2024-09-26T18:00:00Z","title":"Fault-Tolerant Logical Clifford Gates from Code Automorphisms","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.18175","snapshot_observed_at":"2026-08-05T21:18:48.276699Z","title":"Fault-tolerant logical clifford gates from code automorphisms","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.09082","last_updated":"2025-08-12T17:03:59Z","snapshot_observed_at":"2026-08-09T00:24:03.298508Z","submitted_at":"2025-08-12T17:03:59Z","title":"Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Hook Errors","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-05T21:18:48.276699Z"},"links":{"cited_paper":"/paper/2409.18175","citing_paper":"/paper/2508.09082"},"observation_digest":"sha256:95ae8b4f6647b1ff975e258ad9bd11df582332dd7920fcf81e771dbec4dab527","observation_id":"b8e2c53d-8d52-4056-a451-d95b371d46ca","resolution":{"observed_at":"2026-08-05T21:18:48.276699Z","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-05T21:18:58.244880Z","title":"(2,2)-gb codes: Classification and comparison with weight-4 surface codes, 2025","venue":null,"work_id":"14f4f96b-6560-4b8a-866c-f92f3b44974f","year":2025},"citing_paper":{"arxiv_id":"2508.09082","last_updated":"2025-08-12T17:03:59Z","snapshot_observed_at":"2026-08-09T00:24:03.298508Z","submitted_at":"2025-08-12T17:03:59Z","title":"Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Hook Errors","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-05T21:18:48.354105Z"},"links":{"citing_paper":"/paper/2508.09082"},"observation_digest":"sha256:3fcfb3374bcf03f1c2665a623883e26649aa21f5aad2c11da9d3ab2338ca903c","observation_id":"6f6835e4-7306-4a66-8613-31e1b2988b16","resolution":{"observed_at":"2026-08-05T21:18:58.684752Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.18360","last_updated":"2025-04-25T14:04:08Z","snapshot_observed_at":"2026-08-07T15:59:12.484764Z","submitted_at":"2025-04-25T14:04:08Z","title":"On the Generalization of Kitaev Codes as Generalized Bicycle Codes","version":1},"cited_work":{"arxiv_id":"2504.18360","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.18360","snapshot_observed_at":"2026-08-05T21:18:51.538712Z","title":"On the Generalization of Kitaev Codes as Generalized Bicycle Codes","venue":"cs.IT","work_id":"a435047f-4615-48d4-8812-f342ed4acce5","year":2025},"citing_paper":{"arxiv_id":"2508.09082","last_updated":"2025-08-12T17:03:59Z","snapshot_observed_at":"2026-08-09T00:24:03.298508Z","submitted_at":"2025-08-12T17:03:59Z","title":"Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Hook Errors","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-05T21:18:48.450385Z"},"links":{"cited_paper":"/paper/2504.18360","citing_paper":"/paper/2508.09082"},"observation_digest":"sha256:f41e45e7ebda6601b13bc951ba9c8dabbe5355eb543919d5a5833c8ebab16ffd","observation_id":"ba56eaf2-40d6-4c7d-a300-ee897e79c9d8","resolution":{"observed_at":"2026-08-05T21:18:51.644105Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T21:18:57.714748Z","title":"Fundamentals of error-correcting codes","venue":null,"work_id":"79838dcc-9d20-4ff3-a6ac-37d3ba443cdc","year":2010},"citing_paper":{"arxiv_id":"2508.09082","last_updated":"2025-08-12T17:03:59Z","snapshot_observed_at":"2026-08-09T00:24:03.298508Z","submitted_at":"2025-08-12T17:03:59Z","title":"Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Hook Errors","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-05T21:18:48.656894Z"},"links":{"citing_paper":"/paper/2508.09082"},"observation_digest":"sha256:0f15cda1460d69456fb67c4104292f3852be985d0a05db4ff4d3bdfe4e40e124","observation_id":"47d8cc88-492d-4fed-8e4f-1e1dc56be264","resolution":{"observed_at":"2026-08-05T21:18:57.924752Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T21:18:57.344753Z","title":"Quantum error correction via codes over gf (4)","venue":null,"work_id":"89920421-de64-4cd7-88d0-a02c7c8660ec","year":1998},"citing_paper":{"arxiv_id":"2508.09082","last_updated":"2025-08-12T17:03:59Z","snapshot_observed_at":"2026-08-09T00:24:03.298508Z","submitted_at":"2025-08-12T17:03:59Z","title":"Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Hook Errors","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-05T21:18:48.716642Z"},"links":{"citing_paper":"/paper/2508.09082"},"observation_digest":"sha256:d7f0f3e40f204a8e94e716a34e698928acaff1cdd3e04b89ce05cd40a31532de","observation_id":"be54a7a3-702f-4d19-90cb-562d105eecd9","resolution":{"observed_at":"2026-08-05T21:18:57.534752Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T21:18:56.904747Z","title":"Class of quantum error-correcting codes saturating the quantum hamming bound","venue":null,"work_id":"238218f1-25b1-4cbf-bc9f-77c64a99dc27","year":1996},"citing_paper":{"arxiv_id":"2508.09082","last_updated":"2025-08-12T17:03:59Z","snapshot_observed_at":"2026-08-09T00:24:03.298508Z","submitted_at":"2025-08-12T17:03:59Z","title":"Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Hook Errors","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-05T21:18:48.838307Z"},"links":{"citing_paper":"/paper/2508.09082"},"observation_digest":"sha256:6112ea6c8ffd717e8493e4233da9b17f17503b688b9266bb07c8ec54df3db624","observation_id":"44e40154-eb1e-4e96-9cd5-886dfcdb88b3","resolution":{"observed_at":"2026-08-05T21:18:57.044757Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T21:18:56.694758Z","title":"Crespo, and Javier Garcia-Frías","venue":null,"work_id":"4eda3653-fca3-4ee0-bff6-18a953c96928","year":2021},"citing_paper":{"arxiv_id":"2508.09082","last_updated":"2025-08-12T17:03:59Z","snapshot_observed_at":"2026-08-09T00:24:03.298508Z","submitted_at":"2025-08-12T17:03:59Z","title":"Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Hook Errors","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-05T21:18:48.995500Z"},"links":{"citing_paper":"/paper/2508.09082"},"observation_digest":"sha256:3e8c1d56abbb00c8e001c711e069264bb6009ff064bfb4573132488dabba7d62","observation_id":"58646b93-9c69-437a-a57c-74f726e22a9c","resolution":{"observed_at":"2026-08-05T21:18:56.808318Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T21:18:56.424758Z","title":"Asymptotically good quantum and locally testable classical LDPC codes","venue":null,"work_id":"0a771616-99f8-44a9-818e-9eb837f4fe6f","year":2022},"citing_paper":{"arxiv_id":"2508.09082","last_updated":"2025-08-12T17:03:59Z","snapshot_observed_at":"2026-08-09T00:24:03.298508Z","submitted_at":"2025-08-12T17:03:59Z","title":"Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Hook Errors","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-05T21:18:49.071932Z"},"links":{"citing_paper":"/paper/2508.09082"},"observation_digest":"sha256:76bccb2f9bcb9757a01472ca69a9e7e008259ae871475d8a0837d732cdf7acb0","observation_id":"5cd3ed87-783d-4dec-b22c-0d5e59aad39e","resolution":{"observed_at":"2026-08-05T21:18:56.534766Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T21:18:56.245462Z","title":"Good quantum error-correcting codes exist","venue":null,"work_id":"b8679903-14a3-494c-bf76-cca2ef2663aa","year":1996},"citing_paper":{"arxiv_id":"2508.09082","last_updated":"2025-08-12T17:03:59Z","snapshot_observed_at":"2026-08-09T00:24:03.298508Z","submitted_at":"2025-08-12T17:03:59Z","title":"Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Hook Errors","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-05T21:18:49.286707Z"},"links":{"citing_paper":"/paper/2508.09082"},"observation_digest":"sha256:cafa5fa7733f95d7e20d60c44378d6f066fc58edc7432af07b96a2abd5c03060","observation_id":"67aa6e8f-3134-462b-a541-b831a89d8b78","resolution":{"observed_at":"2026-08-05T21:18:56.304756Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T21:18:55.946184Z","title":"Multiple-particle interference and quantum error correction","venue":null,"work_id":"8025394e-8419-4ce7-88f6-272b0c44ace1","year":1954},"citing_paper":{"arxiv_id":"2508.09082","last_updated":"2025-08-12T17:03:59Z","snapshot_observed_at":"2026-08-09T00:24:03.298508Z","submitted_at":"2025-08-12T17:03:59Z","title":"Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Hook Errors","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-05T21:18:49.405417Z"},"links":{"citing_paper":"/paper/2508.09082"},"observation_digest":"sha256:e3ab33c6ce00e6e11b9024f4c0e124271cb12ce63469201502260db11735371b","observation_id":"b651ea42-fc80-44dc-8806-8721584eb1ca","resolution":{"observed_at":"2026-08-05T21:18:56.059110Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T21:18:55.566256Z","title":"Sparse-graph codes for quantum error correction","venue":null,"work_id":"2ddab89e-d655-4492-9b55-50c6b7253fa2","year":2004},"citing_paper":{"arxiv_id":"2508.09082","last_updated":"2025-08-12T17:03:59Z","snapshot_observed_at":"2026-08-09T00:24:03.298508Z","submitted_at":"2025-08-12T17:03:59Z","title":"Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Hook Errors","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-05T21:18:49.493691Z"},"links":{"citing_paper":"/paper/2508.09082"},"observation_digest":"sha256:35852bfc5e9a61ff07abc40dfb981c49215d758f28d67e2e79aa2da71b2427b7","observation_id":"9da1de5f-1c9c-417e-bf94-a246f61685ef","resolution":{"observed_at":"2026-08-05T21:18:55.751749Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T21:18:55.264751Z","title":"Quantum twisted codes","venue":null,"work_id":"63a71a7e-3980-43f5-8d17-8703569df995","year":2000},"citing_paper":{"arxiv_id":"2508.09082","last_updated":"2025-08-12T17:03:59Z","snapshot_observed_at":"2026-08-09T00:24:03.298508Z","submitted_at":"2025-08-12T17:03:59Z","title":"Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Hook Errors","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-05T21:18:49.613949Z"},"links":{"citing_paper":"/paper/2508.09082"},"observation_digest":"sha256:947f444968f8fda637916184038d311fbfb0b705d895396a6ded61c97779de6c","observation_id":"47eef25a-95b3-436a-8226-3c2b2032ed00","resolution":{"observed_at":"2026-08-05T21:18:55.391051Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T21:18:54.999025Z","title":"Polynomial representation of additive cyclic codes and new quantum codes","venue":null,"work_id":"1f88e1f9-8a6e-4e90-870d-594c5a1c69dc","year":2025},"citing_paper":{"arxiv_id":"2508.09082","last_updated":"2025-08-12T17:03:59Z","snapshot_observed_at":"2026-08-09T00:24:03.298508Z","submitted_at":"2025-08-12T17:03:59Z","title":"Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Hook Errors","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-05T21:18:49.786375Z"},"links":{"citing_paper":"/paper/2508.09082"},"observation_digest":"sha256:582ed29b45635bc7614bf958145628882110ef658b6d12845a0efe04d07e486b","observation_id":"bcca859b-a1e2-496e-b6d3-ade9185bab36","resolution":{"observed_at":"2026-08-05T21:18:55.145438Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T21:18:54.708645Z","title":"Additive twisted codes: new distance bounds and infinite families of quantum codes","venue":null,"work_id":"95365c34-6d6b-448d-af1c-1d817d475283","year":2025},"citing_paper":{"arxiv_id":"2508.09082","last_updated":"2025-08-12T17:03:59Z","snapshot_observed_at":"2026-08-09T00:24:03.298508Z","submitted_at":"2025-08-12T17:03:59Z","title":"Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Hook Errors","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-05T21:18:49.947129Z"},"links":{"citing_paper":"/paper/2508.09082"},"observation_digest":"sha256:a8749185c44c975c849aeacdf8c4f19dfb69dabda42cb74523bdb1c781c5e9cd","observation_id":"4395e05a-1326-47ce-9712-b11ee6587877","resolution":{"observed_at":"2026-08-05T21:18:54.877962Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T21:18:54.468706Z","title":"Surface codes: Towards practical large-scale quantum computation","venue":null,"work_id":"b101cc62-000c-4cd5-a093-ec431282da9a","year":2012},"citing_paper":{"arxiv_id":"2508.09082","last_updated":"2025-08-12T17:03:59Z","snapshot_observed_at":"2026-08-09T00:24:03.298508Z","submitted_at":"2025-08-12T17:03:59Z","title":"Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Hook Errors","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-05T21:18:50.077213Z"},"links":{"citing_paper":"/paper/2508.09082"},"observation_digest":"sha256:18c7bb8aa815086c0b4cd2cfb80dca85a8aa8c97bd4b8b67f4ed19c4ec97e8fe","observation_id":"3980b0df-f4a9-437b-aa50-49b49f53441d","resolution":{"observed_at":"2026-08-05T21:18:54.599755Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T21:18:54.230834Z","title":"Low-distance surface codes under realistic quantum noise","venue":null,"work_id":"631988e1-910d-47a7-96ec-8fddf163a6b1","year":2014},"citing_paper":{"arxiv_id":"2508.09082","last_updated":"2025-08-12T17:03:59Z","snapshot_observed_at":"2026-08-09T00:24:03.298508Z","submitted_at":"2025-08-12T17:03:59Z","title":"Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Hook Errors","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-05T21:18:50.183728Z"},"links":{"citing_paper":"/paper/2508.09082"},"observation_digest":"sha256:c44707f1500aabc347834b372b7b6af8fca46edbddef6081b6fc407dcb813072","observation_id":"2e0847a6-fb58-40e0-843e-53152f2a2b93","resolution":{"observed_at":"2026-08-05T21:18:54.330683Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T21:18:54.039719Z","title":"Topological quantum memory","venue":null,"work_id":"556b3730-024f-4547-9195-1d1a63dfb6cd","year":2002},"citing_paper":{"arxiv_id":"2508.09082","last_updated":"2025-08-12T17:03:59Z","snapshot_observed_at":"2026-08-09T00:24:03.298508Z","submitted_at":"2025-08-12T17:03:59Z","title":"Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Hook Errors","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-05T21:18:50.316651Z"},"links":{"citing_paper":"/paper/2508.09082"},"observation_digest":"sha256:071a1e00c3b59c3054c35f6b5a6ba92cbb0344ad155d99ebb16e7a29cd89d33c","observation_id":"38be0e82-f49b-425b-a5e5-f6e31af710e3","resolution":{"observed_at":"2026-08-05T21:18:54.130599Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T21:18:53.810159Z","title":"Error-corrected hadamard gate simulated at the circuit level","venue":null,"work_id":"80028033-ebbd-422c-902b-4bc733bd1a16","year":2024},"citing_paper":{"arxiv_id":"2508.09082","last_updated":"2025-08-12T17:03:59Z","snapshot_observed_at":"2026-08-09T00:24:03.298508Z","submitted_at":"2025-08-12T17:03:59Z","title":"Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Hook Errors","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-05T21:18:50.455767Z"},"links":{"citing_paper":"/paper/2508.09082"},"observation_digest":"sha256:9ae184070061fb30ba634ea029cfa1915b406fc4e9710234e2804ec25dfbeb2f","observation_id":"72a57715-e0e7-464f-94c2-1ce7a90a3444","resolution":{"observed_at":"2026-08-05T21:18:53.908478Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T21:18:53.621922Z","title":"Distance-preserving stabilizer measurements in hypergraph product codes","venue":null,"work_id":"a48d88db-f3b0-4e62-a686-1ef0e3d26ccd","year":2025},"citing_paper":{"arxiv_id":"2508.09082","last_updated":"2025-08-12T17:03:59Z","snapshot_observed_at":"2026-08-09T00:24:03.298508Z","submitted_at":"2025-08-12T17:03:59Z","title":"Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Hook Errors","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-05T21:18:50.551719Z"},"links":{"citing_paper":"/paper/2508.09082"},"observation_digest":"sha256:9e4fe1c93c6c3d9fb79f86bf092212f950d315292ed1cb8991a512e26972cbdb","observation_id":"9cce3974-f838-4351-9723-100cdda26a2b","resolution":{"observed_at":"2026-08-05T21:18:53.743930Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T21:18:53.378627Z","title":"The magma algebra system i: The user language","venue":null,"work_id":"d49717fa-3386-4d2c-b6dd-00bb1649b206","year":1997},"citing_paper":{"arxiv_id":"2508.09082","last_updated":"2025-08-12T17:03:59Z","snapshot_observed_at":"2026-08-09T00:24:03.298508Z","submitted_at":"2025-08-12T17:03:59Z","title":"Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Hook Errors","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-05T21:18:50.701722Z"},"links":{"citing_paper":"/paper/2508.09082"},"observation_digest":"sha256:2ba794b088584cc9f402e9785aa765b57f8e6b819cbe89d5f4a173c9389893d2","observation_id":"688f4c44-94de-43ec-b5c6-a9b5b02738cb","resolution":{"observed_at":"2026-08-05T21:18:53.511006Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T21:18:53.069768Z","title":"Decoding algorithms for surface codes","venue":null,"work_id":"130ffb14-5d20-43f1-b5a0-2d4bdeb6227b","year":2024},"citing_paper":{"arxiv_id":"2508.09082","last_updated":"2025-08-12T17:03:59Z","snapshot_observed_at":"2026-08-09T00:24:03.298508Z","submitted_at":"2025-08-12T17:03:59Z","title":"Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Hook Errors","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-05T21:18:50.815361Z"},"links":{"citing_paper":"/paper/2508.09082"},"observation_digest":"sha256:e96d606c05dc3c3cfc647bc69c20294a6ab92db16699b5e99307b1ba2121c9d3","observation_id":"0d4bffd4-87eb-477f-8044-ef8d8720a221","resolution":{"observed_at":"2026-08-05T21:18:53.268714Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T21:18:52.866372Z","title":"Pymatching: A python package for decoding quantum codes with minimum-weight perfect matching","venue":null,"work_id":"9442d13c-f7ae-4332-8fdf-c5d36b07bf7a","year":2021},"citing_paper":{"arxiv_id":"2508.09082","last_updated":"2025-08-12T17:03:59Z","snapshot_observed_at":"2026-08-09T00:24:03.298508Z","submitted_at":"2025-08-12T17:03:59Z","title":"Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Hook Errors","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-05T21:18:50.865018Z"},"links":{"citing_paper":"/paper/2508.09082"},"observation_digest":"sha256:902ddc7bcbdaa0c83cb0e4936f77f1b38dd350722981607081e14bff4e91342c","observation_id":"f2bb3a27-5c7f-4ba8-b827-aec5855efe14","resolution":{"observed_at":"2026-08-05T21:18:52.973032Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T21:18:52.633097Z","title":null,"venue":null,"work_id":"18da485d-b5b0-4068-8719-d48fc6455865","year":2023},"citing_paper":{"arxiv_id":"2508.09082","last_updated":"2025-08-12T17:03:59Z","snapshot_observed_at":"2026-08-09T00:24:03.298508Z","submitted_at":"2025-08-12T17:03:59Z","title":"Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Hook Errors","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-05T21:18:50.982482Z"},"links":{"citing_paper":"/paper/2508.09082"},"observation_digest":"sha256:44c99e7f2d3f7d22944b90450382389402438cb93aea008bd19b59122f0d72a5","observation_id":"7f8425e3-f8a5-472f-95e2-5ab0704dad1b","resolution":{"observed_at":"2026-08-05T21:18:52.771040Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T21:18:52.322182Z","title":"LDPC: Python tools for low density parity check codes","venue":null,"work_id":"1001efab-dc06-4bc3-a47d-715e8897accb","year":2022},"citing_paper":{"arxiv_id":"2508.09082","last_updated":"2025-08-12T17:03:59Z","snapshot_observed_at":"2026-08-09T00:24:03.298508Z","submitted_at":"2025-08-12T17:03:59Z","title":"Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Hook Errors","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-05T21:18:51.102322Z"},"links":{"citing_paper":"/paper/2508.09082"},"observation_digest":"sha256:36da988eef999b40a65b001fb063e77936ef556cbff3ae12b3d55166b2479c01","observation_id":"40273197-3943-4a1b-992f-94b98c0143aa","resolution":{"observed_at":"2026-08-05T21:18:52.468551Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T21:18:52.115822Z","title":"Towards practical classical processing for the surface code","venue":null,"work_id":"e359ed09-53f1-44dd-8973-654ee133ce6e","year":2012},"citing_paper":{"arxiv_id":"2508.09082","last_updated":"2025-08-12T17:03:59Z","snapshot_observed_at":"2026-08-09T00:24:03.298508Z","submitted_at":"2025-08-12T17:03:59Z","title":"Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Hook Errors","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-05T21:18:51.285176Z"},"links":{"citing_paper":"/paper/2508.09082"},"observation_digest":"sha256:ecc878983ba8a69875028d890a998129f0b126a24ce96b59d1fd02c76fc1c2fb","observation_id":"d3bc8351-67e8-4334-9b4e-090d7b518d17","resolution":{"observed_at":"2026-08-05T21:18:52.215833Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.01440","last_updated":"2026-06-29T19:50:41Z","snapshot_observed_at":"2026-08-05T12:33:48.276318Z","submitted_at":"2024-09-02T19:50:57Z","title":"An almost-linear time decoding algorithm for quantum LDPC codes under circuit-level noise","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.01440","snapshot_observed_at":"2026-08-05T21:18:51.407738Z","title":"An almost-linear time decoding algorithm for quantum LDPC codes under circuit-level noise","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.09082","last_updated":"2025-08-12T17:03:59Z","snapshot_observed_at":"2026-08-09T00:24:03.298508Z","submitted_at":"2025-08-12T17:03:59Z","title":"Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Hook Errors","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-05T21:18:51.407738Z"},"links":{"cited_paper":"/paper/2409.01440","citing_paper":"/paper/2508.09082"},"observation_digest":"sha256:be606d93634ffe002cef07902dab2aa5ed438a284ae9842d67c54c8ddf6221ae","observation_id":"c52b3c35-73c3-4a8f-8301-24a9c6a4b735","resolution":{"observed_at":"2026-08-05T21:18:51.407738Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2508.09082","last_updated":"2025-08-12T17:03:59Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-09T00:24:03.298508Z","submitted_at":"2025-08-12T17:03:59Z","title":"Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Hook Errors"},"reference_resolution":{"displayed":48,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":10,"verified_exact":2,"verified_fuzzy":36},"total_outbound_references":48},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 48 of 48 outbound references and 2 inbound Pith citation observations for arXiv:2508.09082."}