{"as_of":"2026-08-12T14:02:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:788dcbbf718141fa8ff1cbeac4dbad88f14747b03f68931e64cc67dd66f536af","coverage":[{"denominator":36,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":36,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T23:22:37.696590Z","state":"measured"},{"denominator":36,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":36,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2608.09115/citation-record","integrity":"/paper/2608.09115/integrity","json":"/paper/2608.09115/citation-record.json","paper":"/paper/2608.09115"},"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-11T23:22:38.672177Z","title":"Fault-tolerant quantum computation by anyons,","venue":null,"work_id":"57a945dc-8a2c-4b29-aaf5-79babdcc3595","year":2003},"citing_paper":{"arxiv_id":"2608.09115","last_updated":"2026-08-10T04:45:08Z","snapshot_observed_at":"2026-08-12T13:19:10.025347Z","submitted_at":"2026-08-10T04:45:08Z","title":"Quantum Bicycle LDPC Codes with High $kd^2/n$ from Divisor-Driven Search","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T23:22:37.522264Z"},"links":{"citing_paper":"/paper/2608.09115"},"observation_digest":"sha256:2191ee388ec5216f93e8ce3c713f70b064832584298575146f3ff147fc9491d5","observation_id":"983dc349-4d00-4e9c-a321-d89065e8b111","resolution":{"observed_at":"2026-08-11T23:22:38.677623Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T23:22:38.655159Z","title":"Quantum LDPC codes with positive rate and minimum distance proportional to the square root of the blocklength,","venue":null,"work_id":"a0762639-145a-4ee3-9bd0-851901d228d4","year":2014},"citing_paper":{"arxiv_id":"2608.09115","last_updated":"2026-08-10T04:45:08Z","snapshot_observed_at":"2026-08-12T13:19:10.025347Z","submitted_at":"2026-08-10T04:45:08Z","title":"Quantum Bicycle LDPC Codes with High $kd^2/n$ from Divisor-Driven Search","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T23:22:37.527244Z"},"links":{"citing_paper":"/paper/2608.09115"},"observation_digest":"sha256:27a86209339297bc893b7e0ff66aa9b8c52503cf39b8cb56ed9c404e9dcf8dc7","observation_id":"e01dcc1d-4a05-46ee-864d-24645870844a","resolution":{"observed_at":"2026-08-11T23:22:38.660557Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1212.6703","last_updated":"2013-01-02T23:44:09Z","snapshot_observed_at":"2026-07-06T03:02:59.204238Z","submitted_at":"2012-12-30T11:19:24Z","title":"Quantum \"hyperbicycle\" low-density parity check codes with finite rate","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1212.6703","snapshot_observed_at":"2026-08-11T23:22:37.532680Z","title":"Quantum ‘hyperbicycle’ low-density parity check codes with finite rate,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2608.09115","last_updated":"2026-08-10T04:45:08Z","snapshot_observed_at":"2026-08-12T13:19:10.025347Z","submitted_at":"2026-08-10T04:45:08Z","title":"Quantum Bicycle LDPC Codes with High $kd^2/n$ from Divisor-Driven Search","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T23:22:37.532680Z"},"links":{"cited_paper":"/paper/1212.6703","citing_paper":"/paper/2608.09115"},"observation_digest":"sha256:aaaaeecceb84bc190677c2c21eb5e85ce8797336ea93a1375af255012c941af6","observation_id":"a5ade95c-a530-4d68-ae01-3543f095f49d","resolution":{"observed_at":"2026-08-11T23:22:37.532680Z","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-11T23:22:38.638894Z","title":"Quantum LDPC codes with almost linear minimum distance,","venue":null,"work_id":"c1daa5fc-cd2a-4118-ac26-f3ec73094c84","year":2022},"citing_paper":{"arxiv_id":"2608.09115","last_updated":"2026-08-10T04:45:08Z","snapshot_observed_at":"2026-08-12T13:19:10.025347Z","submitted_at":"2026-08-10T04:45:08Z","title":"Quantum Bicycle LDPC Codes with High $kd^2/n$ from Divisor-Driven Search","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T23:22:37.538539Z"},"links":{"citing_paper":"/paper/2608.09115"},"observation_digest":"sha256:f05e9b700dd316f70baa34b457422a54e90b0aa16d0f9cef3d0d522e4c262d71","observation_id":"6d382984-5aa0-4eb7-aacd-ad7dfd177099","resolution":{"observed_at":"2026-08-11T23:22:38.644365Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T23:22:38.620337Z","title":"Quantum tanner codes,","venue":null,"work_id":"85c9cb92-d78d-4498-a23c-809b978095f3","year":2022},"citing_paper":{"arxiv_id":"2608.09115","last_updated":"2026-08-10T04:45:08Z","snapshot_observed_at":"2026-08-12T13:19:10.025347Z","submitted_at":"2026-08-10T04:45:08Z","title":"Quantum Bicycle LDPC Codes with High $kd^2/n$ from Divisor-Driven Search","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T23:22:37.543283Z"},"links":{"citing_paper":"/paper/2608.09115"},"observation_digest":"sha256:4bbd9db2cb935d8287da91b126373b8328e309c7fcdc3482d17d5d0f4a6e92fe","observation_id":"ca6306de-9396-444f-9508-fb7d4e7ac70f","resolution":{"observed_at":"2026-08-11T23:22:38.625685Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2208.05537","last_updated":"2022-12-08T15:21:30Z","snapshot_observed_at":"2026-08-04T07:02:38.635681Z","submitted_at":"2022-08-10T19:50:18Z","title":"Decoding quantum Tanner codes","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2208.05537","snapshot_observed_at":"2026-08-11T23:22:37.548832Z","title":"Decoding quantum tanner codes,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.09115","last_updated":"2026-08-10T04:45:08Z","snapshot_observed_at":"2026-08-12T13:19:10.025347Z","submitted_at":"2026-08-10T04:45:08Z","title":"Quantum Bicycle LDPC Codes with High $kd^2/n$ from Divisor-Driven Search","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T23:22:37.548832Z"},"links":{"cited_paper":"/paper/2208.05537","citing_paper":"/paper/2608.09115"},"observation_digest":"sha256:68ff1359768fcf85c86875522b4b2d31075fe85b4e3405606aabbdf6bb159e4e","observation_id":"a0d7d49a-ef46-4fc9-bc6e-a3536afdab9d","resolution":{"observed_at":"2026-08-11T23:22:37.548832Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:22:37.554849Z","title":"Sparse-graph codes for quantum error correction,","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2608.09115","last_updated":"2026-08-10T04:45:08Z","snapshot_observed_at":"2026-08-12T13:19:10.025347Z","submitted_at":"2026-08-10T04:45:08Z","title":"Quantum Bicycle LDPC Codes with High $kd^2/n$ from Divisor-Driven Search","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T23:22:37.554849Z"},"links":{"citing_paper":"/paper/2608.09115"},"observation_digest":"sha256:abaef827aa341ad9f81676f5fc5e46ec7a186c8c60516a6c47929016f3171b65","observation_id":"8fba53f7-7518-4eee-9e10-5b27ad6110f5","resolution":{"observed_at":"2026-08-11T23:22:37.554849Z","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-11T23:22:38.594170Z","title":"Quantum kronecker sum-product low-density parity-check codes with finite rate,","venue":null,"work_id":"05cb528b-c9a5-4fad-96d6-9a68abe2ef57","year":2013},"citing_paper":{"arxiv_id":"2608.09115","last_updated":"2026-08-10T04:45:08Z","snapshot_observed_at":"2026-08-12T13:19:10.025347Z","submitted_at":"2026-08-10T04:45:08Z","title":"Quantum Bicycle LDPC Codes with High $kd^2/n$ from Divisor-Driven Search","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T23:22:37.559740Z"},"links":{"citing_paper":"/paper/2608.09115"},"observation_digest":"sha256:81d0025acf2ebe822de82084c27d24551266baf51127131612f71529c30fd1d6","observation_id":"d605ddd7-bced-4a34-a72b-56155c4783de","resolution":{"observed_at":"2026-08-11T23:22:38.598792Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T23:22:38.577177Z","title":"Quantum two-block group algebra codes,","venue":null,"work_id":"4ae0463a-48ee-4a7c-bed6-6253312a71a7","year":2024},"citing_paper":{"arxiv_id":"2608.09115","last_updated":"2026-08-10T04:45:08Z","snapshot_observed_at":"2026-08-12T13:19:10.025347Z","submitted_at":"2026-08-10T04:45:08Z","title":"Quantum Bicycle LDPC Codes with High $kd^2/n$ from Divisor-Driven Search","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T23:22:37.564293Z"},"links":{"citing_paper":"/paper/2608.09115"},"observation_digest":"sha256:d24978357f8efff2783eb1ee473ec5299f2abd2d4ba32d8299bdcf40d697fcef","observation_id":"bf8d8902-ad98-45fd-8a45-3b3480a8b2b6","resolution":{"observed_at":"2026-08-11T23:22:38.582538Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.06890","last_updated":"2023-07-31T00:45:52Z","snapshot_observed_at":"2026-07-06T15:26:03.107454Z","submitted_at":"2023-05-11T15:28:02Z","title":"Abelian and non-abelian quantum two-block codes","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.06890","snapshot_observed_at":"2026-08-11T23:22:37.569183Z","title":"Abelian and non-abelian quantum two-block codes,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.09115","last_updated":"2026-08-10T04:45:08Z","snapshot_observed_at":"2026-08-12T13:19:10.025347Z","submitted_at":"2026-08-10T04:45:08Z","title":"Quantum Bicycle LDPC Codes with High $kd^2/n$ from Divisor-Driven Search","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T23:22:37.569183Z"},"links":{"cited_paper":"/paper/2305.06890","citing_paper":"/paper/2608.09115"},"observation_digest":"sha256:ca1ff4359dda69e6326acabe43655366bfc02eed45dc7c9ed2cf6310f84dd7da","observation_id":"dddc52cb-66fd-46f6-ac6d-8e79323fc48a","resolution":{"observed_at":"2026-08-11T23:22:37.569183Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:22:37.574497Z","title":"High-threshold and low-overhead fault-tolerant quantum memory,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.09115","last_updated":"2026-08-10T04:45:08Z","snapshot_observed_at":"2026-08-12T13:19:10.025347Z","submitted_at":"2026-08-10T04:45:08Z","title":"Quantum Bicycle LDPC Codes with High $kd^2/n$ from Divisor-Driven Search","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T23:22:37.574497Z"},"links":{"citing_paper":"/paper/2608.09115"},"observation_digest":"sha256:60b4e6d88a2cecc1e314e3441feeae315ce6a4ffa7eda36be1c172b48d5af6cf","observation_id":"12b8df4a-8b61-4455-aabd-ac109b163036","resolution":{"observed_at":"2026-08-11T23:22:37.574497Z","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-11T23:22:37.580024Z","title":"Small quantum codes from algebraic extensions of generalized bicycle codes,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.09115","last_updated":"2026-08-10T04:45:08Z","snapshot_observed_at":"2026-08-12T13:19:10.025347Z","submitted_at":"2026-08-10T04:45:08Z","title":"Quantum Bicycle LDPC Codes with High $kd^2/n$ from Divisor-Driven Search","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T23:22:37.580024Z"},"links":{"cited_paper":"/paper/2401.07583","citing_paper":"/paper/2608.09115"},"observation_digest":"sha256:990ef7514afc99b14419bd851a4fa24e28d07821a5ed442eb7003a11e580441b","observation_id":"7df5bae6-516f-417d-abf5-b6e4c636b3b2","resolution":{"observed_at":"2026-08-11T23:22:37.580024Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.09082","snapshot_observed_at":"2026-08-11T23:22:37.585516Z","title":"Generalized bicycle codes with low connectivity: Minimum distance bounds and hook errors,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.09115","last_updated":"2026-08-10T04:45:08Z","snapshot_observed_at":"2026-08-12T13:19:10.025347Z","submitted_at":"2026-08-10T04:45:08Z","title":"Quantum Bicycle LDPC Codes with High $kd^2/n$ from Divisor-Driven Search","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T23:22:37.585516Z"},"links":{"cited_paper":"/paper/2508.09082","citing_paper":"/paper/2608.09115"},"observation_digest":"sha256:0109efa8bf6036465366acb1a2fd8e86a14ba70d684241f7727d3aa948ae7df1","observation_id":"662f0c9b-c309-44b0-93ba-0a300eb738e6","resolution":{"observed_at":"2026-08-11T23:22:37.585516Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.21237","last_updated":"2025-07-28T18:00:40Z","snapshot_observed_at":"2026-08-10T00:18:41.111784Z","submitted_at":"2025-07-28T18:00:40Z","title":"(2,2)-GB Codes: Classification and Comparison with weight-4 Surface Codes","version":1},"cited_work":{"arxiv_id":"2507.21237","doi":null,"metadata_source":"pith","pith_arxiv_id":"2507.21237","snapshot_observed_at":"2026-08-11T23:22:38.434005Z","title":"(2,2)-GB Codes: Classification and Comparison with weight-4 Surface Codes","venue":"cs.IT","work_id":"aced10d7-c8f1-41e6-872c-ac27205d9aef","year":2025},"citing_paper":{"arxiv_id":"2608.09115","last_updated":"2026-08-10T04:45:08Z","snapshot_observed_at":"2026-08-12T13:19:10.025347Z","submitted_at":"2026-08-10T04:45:08Z","title":"Quantum Bicycle LDPC Codes with High $kd^2/n$ from Divisor-Driven Search","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T23:22:37.590560Z"},"links":{"cited_paper":"/paper/2507.21237","citing_paper":"/paper/2608.09115"},"observation_digest":"sha256:be6cb4043f3aa648a4f8627faed81e3941c5cecae155cb548642e5e56d4f8478","observation_id":"f5395ce4-9e63-4e97-89cd-ef551cd4522b","resolution":{"observed_at":"2026-08-11T23:22:38.439316Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2605.14173","doi":null,"metadata_source":"pith","pith_arxiv_id":"2605.14173","snapshot_observed_at":"2026-08-11T23:22:38.411277Z","title":"Univariate Bicycle Quantum LDPC Codes: Explicit Logical Structure and Distance Bounds","venue":"cs.IT","work_id":"07606bac-bd10-45f7-805f-74c52471175c","year":2026},"citing_paper":{"arxiv_id":"2608.09115","last_updated":"2026-08-10T04:45:08Z","snapshot_observed_at":"2026-08-12T13:19:10.025347Z","submitted_at":"2026-08-10T04:45:08Z","title":"Quantum Bicycle LDPC Codes with High $kd^2/n$ from Divisor-Driven Search","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T23:22:37.595097Z"},"links":{"cited_paper":"/paper/2605.14173","citing_paper":"/paper/2608.09115"},"observation_digest":"sha256:32ad65be000b684a915b65a1be882cf90ace07c1c235d3f14dfb38592e7fdf86","observation_id":"c90577b0-c5e0-40a4-adef-a52e54aab5b9","resolution":{"observed_at":"2026-08-11T23:22:38.416725Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2606.05044","last_updated":"2026-06-03T16:05:40Z","snapshot_observed_at":"2026-07-06T23:45:02.342193Z","submitted_at":"2026-06-03T16:05:40Z","title":"Generalized Bicycle Codes as Cyclic Submodules and their Automorphism Structure","version":1},"cited_work":{"arxiv_id":"2606.05044","doi":null,"metadata_source":"pith","pith_arxiv_id":"2606.05044","snapshot_observed_at":"2026-08-11T23:22:38.384017Z","title":"Generalized Bicycle Codes as Cyclic Submodules and their Automorphism Structure","venue":"quant-ph","work_id":"a869d516-27d9-4cf3-b7af-283f04a930fe","year":2026},"citing_paper":{"arxiv_id":"2608.09115","last_updated":"2026-08-10T04:45:08Z","snapshot_observed_at":"2026-08-12T13:19:10.025347Z","submitted_at":"2026-08-10T04:45:08Z","title":"Quantum Bicycle LDPC Codes with High $kd^2/n$ from Divisor-Driven Search","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T23:22:37.600299Z"},"links":{"cited_paper":"/paper/2606.05044","citing_paper":"/paper/2608.09115"},"observation_digest":"sha256:f3ffa59efc7a97050db40a0e89f6738b802333ee2b1c8495750b1b0cceb175eb","observation_id":"c624ecd6-66eb-437d-be7e-7022d1d97631","resolution":{"observed_at":"2026-08-11T23:22:38.392241Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.19151","last_updated":"2025-02-20T17:50:53Z","snapshot_observed_at":"2026-07-31T00:54:15.211830Z","submitted_at":"2024-06-27T13:10:37Z","title":"Multivariate Bicycle Codes","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.19151","snapshot_observed_at":"2026-08-11T23:22:37.605065Z","title":"Multivariate bicycle codes,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.09115","last_updated":"2026-08-10T04:45:08Z","snapshot_observed_at":"2026-08-12T13:19:10.025347Z","submitted_at":"2026-08-10T04:45:08Z","title":"Quantum Bicycle LDPC Codes with High $kd^2/n$ from Divisor-Driven Search","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T23:22:37.605065Z"},"links":{"cited_paper":"/paper/2406.19151","citing_paper":"/paper/2608.09115"},"observation_digest":"sha256:e3021d891850aa96a98fc3b71c0ebf48af938938ca3809358ba156f12f24384c","observation_id":"4681a66f-f635-47ec-8c90-1a3096f69c71","resolution":{"observed_at":"2026-08-11T23:22:37.605065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:22:37.609738Z","title":"Independent trivariate bicycle codes,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.09115","last_updated":"2026-08-10T04:45:08Z","snapshot_observed_at":"2026-08-12T13:19:10.025347Z","submitted_at":"2026-08-10T04:45:08Z","title":"Quantum Bicycle LDPC Codes with High $kd^2/n$ from Divisor-Driven Search","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-11T23:22:37.609738Z"},"links":{"citing_paper":"/paper/2608.09115"},"observation_digest":"sha256:db4dd4d4168cd47adfcbf54125c055c29b23186b0928a393528a10b77ae62b7a","observation_id":"b3b810f2-c7e3-4a72-ba49-5dd121b1d45e","resolution":{"observed_at":"2026-08-11T23:22:37.609738Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2601.18879","last_updated":"2026-05-24T01:40:16Z","snapshot_observed_at":"2026-08-03T11:12:49.778747Z","submitted_at":"2026-01-26T19:00:03Z","title":"Multivariate Multicycle Codes for Complete Single-Shot Decoding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2601.18879","snapshot_observed_at":"2026-08-11T23:22:37.613822Z","title":"Multivariate multicycle codes for complete single-shot decoding,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.09115","last_updated":"2026-08-10T04:45:08Z","snapshot_observed_at":"2026-08-12T13:19:10.025347Z","submitted_at":"2026-08-10T04:45:08Z","title":"Quantum Bicycle LDPC Codes with High $kd^2/n$ from Divisor-Driven Search","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T23:22:37.613822Z"},"links":{"cited_paper":"/paper/2601.18879","citing_paper":"/paper/2608.09115"},"observation_digest":"sha256:c3c605dfcb07f5e0de7f103eeb1bb64f56502fb40ce7ce29520d2a8903685e0a","observation_id":"f633c3f3-9505-463b-bdbe-0839a664f96f","resolution":{"observed_at":"2026-08-11T23:22:37.613822Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:22:37.618862Z","title":"Cyclic hypergraph product code,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.09115","last_updated":"2026-08-10T04:45:08Z","snapshot_observed_at":"2026-08-12T13:19:10.025347Z","submitted_at":"2026-08-10T04:45:08Z","title":"Quantum Bicycle LDPC Codes with High $kd^2/n$ from Divisor-Driven Search","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T23:22:37.618862Z"},"links":{"citing_paper":"/paper/2608.09115"},"observation_digest":"sha256:3d92aca7bc272aa1240b08778930637454b8acc5a3d06e147821410d1b7d772f","observation_id":"3070c294-02d1-4fc2-9f1a-8f5e04cb2753","resolution":{"observed_at":"2026-08-11T23:22:37.618862Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.03973","last_updated":"2024-07-04T14:49:35Z","snapshot_observed_at":"2026-07-06T18:41:35.995594Z","submitted_at":"2024-07-04T14:49:35Z","title":"Logical Operators and Fold-Transversal Gates of Bivariate Bicycle Codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.03973","snapshot_observed_at":"2026-08-11T23:22:37.622835Z","title":"Logical operators and fold-transversal gates of bivariate bicycle codes,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.09115","last_updated":"2026-08-10T04:45:08Z","snapshot_observed_at":"2026-08-12T13:19:10.025347Z","submitted_at":"2026-08-10T04:45:08Z","title":"Quantum Bicycle LDPC Codes with High $kd^2/n$ from Divisor-Driven Search","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-11T23:22:37.622835Z"},"links":{"cited_paper":"/paper/2407.03973","citing_paper":"/paper/2608.09115"},"observation_digest":"sha256:8ab02edd4dda471e2e3db7203ce2212ac0deba2b74a94eb8e2b16c2ed3ffffbe","observation_id":"a351a300-d52c-4e50-b70c-fa9d921b40e1","resolution":{"observed_at":"2026-08-11T23:22:37.622835Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:22:37.627016Z","title":"Self-dual bivariate bicycle codes with transversal clifford gates,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.09115","last_updated":"2026-08-10T04:45:08Z","snapshot_observed_at":"2026-08-12T13:19:10.025347Z","submitted_at":"2026-08-10T04:45:08Z","title":"Quantum Bicycle LDPC Codes with High $kd^2/n$ from Divisor-Driven Search","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-11T23:22:37.627016Z"},"links":{"citing_paper":"/paper/2608.09115"},"observation_digest":"sha256:9e1255c6571b853790d606413f2f21e0c36503f69e48ff9bb2ad4a81827d37c7","observation_id":"697498c8-051e-41ae-86f3-e32342bfc0fc","resolution":{"observed_at":"2026-08-11T23:22:37.627016Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.04181","last_updated":"2024-12-05T14:20:44Z","snapshot_observed_at":"2026-08-11T21:37:47.268744Z","submitted_at":"2024-12-05T14:20:44Z","title":"Pruning qLDPC codes: Towards bivariate bicycle codes with open boundary conditions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.04181","snapshot_observed_at":"2026-08-11T23:22:37.631259Z","title":"Pruning QLDPC codes: Towards bivariate bicycle codes with open boundary conditions,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.09115","last_updated":"2026-08-10T04:45:08Z","snapshot_observed_at":"2026-08-12T13:19:10.025347Z","submitted_at":"2026-08-10T04:45:08Z","title":"Quantum Bicycle LDPC Codes with High $kd^2/n$ from Divisor-Driven Search","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-11T23:22:37.631259Z"},"links":{"cited_paper":"/paper/2412.04181","citing_paper":"/paper/2608.09115"},"observation_digest":"sha256:32949bd100055150fb351275281173dbf92f21feb6d45006135489f38b86c0db","observation_id":"c84ceffe-4ccc-4df8-bec8-d769ec0e33af","resolution":{"observed_at":"2026-08-11T23:22:37.631259Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.08887","last_updated":"2025-08-22T04:09:12Z","snapshot_observed_at":"2026-08-09T02:46:39.635268Z","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-11T23:22:37.635822Z","title":"Planar quantum low-density parity-check codes with open boundaries,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.09115","last_updated":"2026-08-10T04:45:08Z","snapshot_observed_at":"2026-08-12T13:19:10.025347Z","submitted_at":"2026-08-10T04:45:08Z","title":"Quantum Bicycle LDPC Codes with High $kd^2/n$ from Divisor-Driven Search","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-11T23:22:37.635822Z"},"links":{"cited_paper":"/paper/2504.08887","citing_paper":"/paper/2608.09115"},"observation_digest":"sha256:3cbf47cc5a962be49fd79d420e8d07d1710f5424851c952ae46e640e7aaf3e00","observation_id":"4ad9f358-23c9-477a-91c5-9ebdbdd10da9","resolution":{"observed_at":"2026-08-11T23:22:37.635822Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:22:37.641543Z","title":"Degenerate quantum LDPC codes with good finite length performance,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.09115","last_updated":"2026-08-10T04:45:08Z","snapshot_observed_at":"2026-08-12T13:19:10.025347Z","submitted_at":"2026-08-10T04:45:08Z","title":"Quantum Bicycle LDPC Codes with High $kd^2/n$ from Divisor-Driven Search","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-11T23:22:37.641543Z"},"links":{"citing_paper":"/paper/2608.09115"},"observation_digest":"sha256:67d7571ab2d6e9d68a1b21f6dc2038ee4e42bec88f1dc2aba1140560401189c1","observation_id":"74992fd6-6acc-47b7-b81f-a97d497dcb02","resolution":{"observed_at":"2026-08-11T23:22:37.641543Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-11T23:22:37.646293Z","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":"2608.09115","last_updated":"2026-08-10T04:45:08Z","snapshot_observed_at":"2026-08-12T13:19:10.025347Z","submitted_at":"2026-08-10T04:45:08Z","title":"Quantum Bicycle LDPC Codes with High $kd^2/n$ from Divisor-Driven Search","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-11T23:22:37.646293Z"},"links":{"cited_paper":"/paper/2409.01440","citing_paper":"/paper/2608.09115"},"observation_digest":"sha256:e1c657dce8e4d79d24dbb9565d765d3d1edff6cf871f1cf80ebdd169116b6b13","observation_id":"d300dd87-29c8-4a82-abc8-9207a37161ac","resolution":{"observed_at":"2026-08-11T23:22:37.646293Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2602.22770","last_updated":"2026-06-08T17:16:15Z","snapshot_observed_at":"2026-08-02T20:44:31.689074Z","submitted_at":"2026-02-26T09:00:20Z","title":"A matching decoder for bivariate bicycle codes","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2602.22770","snapshot_observed_at":"2026-08-11T23:22:37.651402Z","title":"A matching decoder for bivariate bicycle codes,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.09115","last_updated":"2026-08-10T04:45:08Z","snapshot_observed_at":"2026-08-12T13:19:10.025347Z","submitted_at":"2026-08-10T04:45:08Z","title":"Quantum Bicycle LDPC Codes with High $kd^2/n$ from Divisor-Driven Search","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-11T23:22:37.651402Z"},"links":{"cited_paper":"/paper/2602.22770","citing_paper":"/paper/2608.09115"},"observation_digest":"sha256:8e988386371c7272c8061c31268c67bfa716d0e6b11354b37c74459f8aa843be","observation_id":"3439c983-efa8-4286-9cd9-645bb749defe","resolution":{"observed_at":"2026-08-11T23:22:37.651402Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:22:37.657393Z","title":"List decoding and new bicycle code constructions for quantum LDPC codes,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.09115","last_updated":"2026-08-10T04:45:08Z","snapshot_observed_at":"2026-08-12T13:19:10.025347Z","submitted_at":"2026-08-10T04:45:08Z","title":"Quantum Bicycle LDPC Codes with High $kd^2/n$ from Divisor-Driven Search","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-11T23:22:37.657393Z"},"links":{"citing_paper":"/paper/2608.09115"},"observation_digest":"sha256:16c152ae1c319e0325ffbf284930164cae5741ddb422bf75e1569debc9541346","observation_id":"c7792ce4-03e9-416d-a738-92fb26ce9f45","resolution":{"observed_at":"2026-08-11T23:22:37.657393Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2109.14599","last_updated":"2021-09-29T17:52:16Z","snapshot_observed_at":"2026-08-11T11:29:09.510724Z","submitted_at":"2021-09-29T17:52:16Z","title":"Bounds on stabilizer measurement circuits and obstructions to local implementations of quantum LDPC codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2109.14599","snapshot_observed_at":"2026-08-11T23:22:37.662304Z","title":"Bounds on stabilizer measurement circuits and obstructions to local implementations of quantum LDPC codes,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.09115","last_updated":"2026-08-10T04:45:08Z","snapshot_observed_at":"2026-08-12T13:19:10.025347Z","submitted_at":"2026-08-10T04:45:08Z","title":"Quantum Bicycle LDPC Codes with High $kd^2/n$ from Divisor-Driven Search","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-11T23:22:37.662304Z"},"links":{"cited_paper":"/paper/2109.14599","citing_paper":"/paper/2608.09115"},"observation_digest":"sha256:abc3a3a19056bb3b47c7f592f73c0563f5d3566d0fb68783d1d5201fe4dda80d","observation_id":"4e3c83cc-a832-4882-a3d4-b4c286c1f678","resolution":{"observed_at":"2026-08-11T23:22:37.662304Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.17676","last_updated":"2025-01-09T15:31:04Z","snapshot_observed_at":"2026-07-06T18:06:20.657123Z","submitted_at":"2024-04-26T19:48:07Z","title":"Toward a 2D Local Implementation of Quantum LDPC Codes","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.17676","snapshot_observed_at":"2026-08-11T23:22:37.667022Z","title":"Toward a 2d local implementation of quantum LDPC codes,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.09115","last_updated":"2026-08-10T04:45:08Z","snapshot_observed_at":"2026-08-12T13:19:10.025347Z","submitted_at":"2026-08-10T04:45:08Z","title":"Quantum Bicycle LDPC Codes with High $kd^2/n$ from Divisor-Driven Search","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-11T23:22:37.667022Z"},"links":{"cited_paper":"/paper/2404.17676","citing_paper":"/paper/2608.09115"},"observation_digest":"sha256:6ca7ddcbfc57c7626c1d32db262b5105289ec02061ec1b0e895c19d977e13838","observation_id":"1bddaa59-3c9e-4276-98a2-051b85f76d97","resolution":{"observed_at":"2026-08-11T23:22:37.667022Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.16336","last_updated":"2025-03-26T12:39:33Z","snapshot_observed_at":"2026-08-11T16:21:41.726441Z","submitted_at":"2024-07-23T09:35:49Z","title":"Lowering Connectivity Requirements For Bivariate Bicycle Codes Using Morphing Circuits","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.16336","snapshot_observed_at":"2026-08-11T23:22:37.671803Z","title":"Lowering connectivity requirements for bivariate bicycle codes using morphing circuits,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.09115","last_updated":"2026-08-10T04:45:08Z","snapshot_observed_at":"2026-08-12T13:19:10.025347Z","submitted_at":"2026-08-10T04:45:08Z","title":"Quantum Bicycle LDPC Codes with High $kd^2/n$ from Divisor-Driven Search","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-11T23:22:37.671803Z"},"links":{"cited_paper":"/paper/2407.16336","citing_paper":"/paper/2608.09115"},"observation_digest":"sha256:72c8b9cb00bb398953054727b860ed2b07f6e3d534a7d778e64b6e9d3e58674d","observation_id":"82eb7875-2443-4e8e-9412-534af35d0ad8","resolution":{"observed_at":"2026-08-11T23:22:37.671803Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.23011","last_updated":"2025-09-13T00:02:56Z","snapshot_observed_at":"2026-07-06T22:05:22.373440Z","submitted_at":"2025-07-30T18:19:44Z","title":"Placing and routing quantum LDPC codes in multilayer superconducting hardware","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.23011","snapshot_observed_at":"2026-08-11T23:22:37.676923Z","title":"Placing and routing quantum LDPC codes in multilayer superconducting hardware,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.09115","last_updated":"2026-08-10T04:45:08Z","snapshot_observed_at":"2026-08-12T13:19:10.025347Z","submitted_at":"2026-08-10T04:45:08Z","title":"Quantum Bicycle LDPC Codes with High $kd^2/n$ from Divisor-Driven Search","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-11T23:22:37.676923Z"},"links":{"cited_paper":"/paper/2507.23011","citing_paper":"/paper/2608.09115"},"observation_digest":"sha256:f877641619dc9a4cf43f42c20501d68a36c7a5dbee05d90d3e2ff25a17bb7d6c","observation_id":"f5704568-aaed-436b-ad7c-5554fce1fc60","resolution":{"observed_at":"2026-08-11T23:22:37.676923Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:22:37.682387Z","title":"Quantum low-density parity-check codes for erasure-biased atomic quantum processors,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.09115","last_updated":"2026-08-10T04:45:08Z","snapshot_observed_at":"2026-08-12T13:19:10.025347Z","submitted_at":"2026-08-10T04:45:08Z","title":"Quantum Bicycle LDPC Codes with High $kd^2/n$ from Divisor-Driven Search","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-11T23:22:37.682387Z"},"links":{"citing_paper":"/paper/2608.09115"},"observation_digest":"sha256:8de2c44fcd608569f7f196b290f136492b1fdf93261c471ab0882173f9fcb554","observation_id":"60afff25-6cae-4842-bd48-48ad59de38c0","resolution":{"observed_at":"2026-08-11T23:22:37.682387Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2605.04663","last_updated":"2026-05-06T09:10:28Z","snapshot_observed_at":"2026-08-11T09:46:51.614672Z","submitted_at":"2026-05-06T09:10:28Z","title":"Distributed Quantum Error Correction with Bivariate Bicycle Codes in a Modular Architecture","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2605.04663","snapshot_observed_at":"2026-08-11T23:22:37.686859Z","title":"Distributed quantum error correction with bivariate bicycle codes in a modular architecture,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.09115","last_updated":"2026-08-10T04:45:08Z","snapshot_observed_at":"2026-08-12T13:19:10.025347Z","submitted_at":"2026-08-10T04:45:08Z","title":"Quantum Bicycle LDPC Codes with High $kd^2/n$ from Divisor-Driven Search","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-11T23:22:37.686859Z"},"links":{"cited_paper":"/paper/2605.04663","citing_paper":"/paper/2608.09115"},"observation_digest":"sha256:47d29bcb6b4ebf9694eeeaea373a3103dbabc18e637d5528646baedc45b12b0d","observation_id":"41b42457-e43a-46f0-9f0a-d25f92aadf01","resolution":{"observed_at":"2026-08-11T23:22:37.686859Z","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-11T23:22:38.536222Z","title":"Quantum error correction via codes over GF(4),","venue":null,"work_id":"4e7623f8-c2da-4061-b46f-82f9db622a0c","year":1998},"citing_paper":{"arxiv_id":"2608.09115","last_updated":"2026-08-10T04:45:08Z","snapshot_observed_at":"2026-08-12T13:19:10.025347Z","submitted_at":"2026-08-10T04:45:08Z","title":"Quantum Bicycle LDPC Codes with High $kd^2/n$ from Divisor-Driven Search","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-11T23:22:37.691689Z"},"links":{"citing_paper":"/paper/2608.09115"},"observation_digest":"sha256:cd6e9192fc08924b9c5311dcc56159319eae09e37c9983d254f344105a0b92da","observation_id":"00aafb5e-93b1-4eac-a328-7c332a277855","resolution":{"observed_at":"2026-08-11T23:22:38.541342Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2606.17268","last_updated":"2026-06-15T20:20:57Z","snapshot_observed_at":"2026-08-06T01:32:19.966047Z","submitted_at":"2026-06-15T20:20:57Z","title":"Breaking the bicycle frame: Coset-based quantum LDPC codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2606.17268","snapshot_observed_at":"2026-08-11T23:22:37.696590Z","title":"Breaking the bicycle frame: Coset-based quantum LDPC codes,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.09115","last_updated":"2026-08-10T04:45:08Z","snapshot_observed_at":"2026-08-12T13:19:10.025347Z","submitted_at":"2026-08-10T04:45:08Z","title":"Quantum Bicycle LDPC Codes with High $kd^2/n$ from Divisor-Driven Search","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-11T23:22:37.696590Z"},"links":{"cited_paper":"/paper/2606.17268","citing_paper":"/paper/2608.09115"},"observation_digest":"sha256:ef30f717f63c62eed14998a96f416eecf607d265bdfce47a1f5d5ffdb22bd2c6","observation_id":"e7ffc0b8-dd1a-49be-8341-eb380b57b626","resolution":{"observed_at":"2026-08-11T23:22:37.696590Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2608.09115","last_updated":"2026-08-10T04:45:08Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-12T13:19:10.025347Z","submitted_at":"2026-08-10T04:45:08Z","title":"Quantum Bicycle LDPC Codes with High $kd^2/n$ from Divisor-Driven Search"},"reference_resolution":{"displayed":36,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":26,"verified_exact":3,"verified_fuzzy":7},"total_outbound_references":36},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 36 of 36 outbound references and 0 inbound Pith citation observations for arXiv:2608.09115."}