{"as_of":"2026-08-22T17:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e4613e8203dda57ac89f9e9e2ceebaa9323a9b448b9fcd37c84ec2acf4cb6c0d","coverage":[{"denominator":23,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":23,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-15T01:42:39.110455Z","state":"measured"},{"denominator":25,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":25,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+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-08-11T23:22:37.595097Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-11T23:22:38.411277Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2605.14173","last_updated":"2026-05-13T22:52:01Z","snapshot_observed_at":"2026-08-12T19:25:16.247105Z","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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2605.14173","snapshot_observed_at":"2026-07-11T07:07:39.359688Z","title":"Rabeti and H","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.05386","last_updated":"2026-07-09T17:58:26Z","snapshot_observed_at":"2026-08-20T13:15:36.696597Z","submitted_at":"2026-07-06T17:56:55Z","title":"Logical Spectroscopy: Lifted-Product Codes with Addressable Bases","version":2},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-07-11T07:07:39.359688Z"},"links":{"cited_paper":"/paper/2605.14173","citing_paper":"/paper/2607.05386"},"observation_digest":"sha256:21c2477d1d40c74eab76514564a6cb7e7c743adc1d6a6217f07413ad9ffca985","observation_id":"236f07a9-6e8d-40f7-8125-4c0a92045379","resolution":{"observed_at":"2026-07-11T07:07:39.359688Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2605.14173","last_updated":"2026-05-13T22:52:01Z","snapshot_observed_at":"2026-08-12T19:25:16.247105Z","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-18T20:02:48.192039Z","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:57fb84143dc1b92ed3e98a2aabbe143562120aaee9b4e535c2a77822105c4e07","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-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2605.14173/citation-record","integrity":"/paper/2605.14173/integrity","json":"/paper/2605.14173/citation-record.json","paper":"/paper/2605.14173"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Low-density parity-check codes","venue":null,"work_id":"e4fcd8e9-c455-415e-b63f-fd5aa6f9b259","year":1962},"citing_paper":{"arxiv_id":"2605.14173","last_updated":"2026-05-13T22:52:01Z","snapshot_observed_at":"2026-08-12T19:25:16.247105Z","submitted_at":"2026-05-13T22:52:01Z","title":"Univariate Bicycle Quantum LDPC Codes: Explicit Logical Structure and Distance Bounds","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-15T01:42:39.110455Z"},"links":{"citing_paper":"/paper/2605.14173"},"observation_digest":"sha256:f455fe1ec59872bef77651a404162fd5dbb373b4e5aa2444f39b2d2cf3a98a8e","observation_id":"c3eb59ea-048f-433d-b89c-711876bb63f3","resolution":{"observed_at":"2026-05-15T01:43:28.278596Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Fifteen years of quantum LDPC coding and improved decoding strategies","venue":null,"work_id":"6d1032ff-1fa0-4f30-a96d-e26cb7c65ad3","year":2015},"citing_paper":{"arxiv_id":"2605.14173","last_updated":"2026-05-13T22:52:01Z","snapshot_observed_at":"2026-08-12T19:25:16.247105Z","submitted_at":"2026-05-13T22:52:01Z","title":"Univariate Bicycle Quantum LDPC Codes: Explicit Logical Structure and Distance Bounds","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-15T01:42:39.110455Z"},"links":{"citing_paper":"/paper/2605.14173"},"observation_digest":"sha256:3f1a2d3540822778285b199d0dad51df276cc8a5b2f8f895cf68bfb6198b38d6","observation_id":"057a6347-939e-48e3-8ef1-968e78b0c74a","resolution":{"observed_at":"2026-05-15T01:43:28.272499Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Quantum low-density parity- check codes","venue":null,"work_id":"fcccd828-c25e-4fb1-8187-d0d9eab61fdd","year":2021},"citing_paper":{"arxiv_id":"2605.14173","last_updated":"2026-05-13T22:52:01Z","snapshot_observed_at":"2026-08-12T19:25:16.247105Z","submitted_at":"2026-05-13T22:52:01Z","title":"Univariate Bicycle Quantum LDPC Codes: Explicit Logical Structure and Distance Bounds","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-15T01:42:39.110455Z"},"links":{"citing_paper":"/paper/2605.14173"},"observation_digest":"sha256:855f8cde95575c77053f94b46833c8d2745d3a6d13a23fc6e96ff6d80c8e3f38","observation_id":"6ac37bb2-1eef-4293-b390-2635ce693028","resolution":{"observed_at":"2026-05-15T01:43:28.276668Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2510.14090","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-03T06:07:41.946779Z","title":"Quantum low-density parity-check codes","venue":null,"work_id":"309b64a3-ed84-4a6b-ab00-a1b9d6ac53d0","year":2025},"citing_paper":{"arxiv_id":"2605.14173","last_updated":"2026-05-13T22:52:01Z","snapshot_observed_at":"2026-08-12T19:25:16.247105Z","submitted_at":"2026-05-13T22:52:01Z","title":"Univariate Bicycle Quantum LDPC Codes: Explicit Logical Structure and Distance Bounds","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-15T01:42:39.110455Z"},"links":{"citing_paper":"/paper/2605.14173"},"observation_digest":"sha256:8ab2173bb17894556199e1183d6b3885972a70bda9268265700b0de97ce37ac8","observation_id":"ba85923c-7ae1-4596-b4c0-7fbe4a357340","resolution":{"observed_at":"2026-05-15T01:43:27.509533Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Quantum kronecker sum-product low- density parity-check codes with finite rate","venue":null,"work_id":"68a35ce6-e9e0-4c98-9de2-94e71277ffbe","year":2013},"citing_paper":{"arxiv_id":"2605.14173","last_updated":"2026-05-13T22:52:01Z","snapshot_observed_at":"2026-08-12T19:25:16.247105Z","submitted_at":"2026-05-13T22:52:01Z","title":"Univariate Bicycle Quantum LDPC Codes: Explicit Logical Structure and Distance Bounds","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-15T01:42:39.110455Z"},"links":{"citing_paper":"/paper/2605.14173"},"observation_digest":"sha256:f241059f6773c9632c9c8205b2b4ec97a62fb1184f7814241e96fa53d2d2ebda","observation_id":"c821cfe3-508b-4bbe-9e3f-b63350262f23","resolution":{"observed_at":"2026-05-15T01:43:28.270692Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Degenerate quantum LDPC codes with good finite length performance","venue":null,"work_id":"45bee9f2-7c04-4106-9652-e6cd494b04c0","year":2021},"citing_paper":{"arxiv_id":"2605.14173","last_updated":"2026-05-13T22:52:01Z","snapshot_observed_at":"2026-08-12T19:25:16.247105Z","submitted_at":"2026-05-13T22:52:01Z","title":"Univariate Bicycle Quantum LDPC Codes: Explicit Logical Structure and Distance Bounds","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-15T01:42:39.110455Z"},"links":{"citing_paper":"/paper/2605.14173"},"observation_digest":"sha256:c75c53a1a204cd710c3109f0761d1a1f5a21d468f1fffb02b405ddc483ddb71c","observation_id":"5ae29171-32a0-478e-92ae-316a782c46b9","resolution":{"observed_at":"2026-05-15T01:43:28.268778Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Sparse-graph codes for quantum error correction","venue":null,"work_id":"7995982a-af81-4056-937b-207b57c20503","year":2004},"citing_paper":{"arxiv_id":"2605.14173","last_updated":"2026-05-13T22:52:01Z","snapshot_observed_at":"2026-08-12T19:25:16.247105Z","submitted_at":"2026-05-13T22:52:01Z","title":"Univariate Bicycle Quantum LDPC Codes: Explicit Logical Structure and Distance Bounds","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-15T01:42:39.110455Z"},"links":{"citing_paper":"/paper/2605.14173"},"observation_digest":"sha256:843082a250f800a1fe7e33b29d7142ef95f5b8b43d3d81e2cddf62d3930270f9","observation_id":"94ac298f-4381-488f-9227-4825a2f3bb21","resolution":{"observed_at":"2026-05-15T01:43:28.266525Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1103/physreva.54.1098","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Good quantum error-correcting codes ex- ist","venue":"Physical Review A","work_id":"0f614b04-e1e3-463f-b0a7-724e857358b2","year":1996},"citing_paper":{"arxiv_id":"2605.14173","last_updated":"2026-05-13T22:52:01Z","snapshot_observed_at":"2026-08-12T19:25:16.247105Z","submitted_at":"2026-05-13T22:52:01Z","title":"Univariate Bicycle Quantum LDPC Codes: Explicit Logical Structure and Distance Bounds","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-15T01:42:39.110455Z"},"links":{"citing_paper":"/paper/2605.14173"},"observation_digest":"sha256:37c307906aa8956264c6074437f0fc50e4b9a795d5db2f60a3d3e6d976590f52","observation_id":"f4dd55d4-bb2f-4d80-b33a-5d4fba43e7c2","resolution":{"observed_at":"2026-05-15T01:43:27.260678Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-07-13T12:20:33.178866+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T12:20:33.178866+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1103/physreva.54.4741","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Simple quantum error-correcting codes","venue":"Physical Review A","work_id":"58ac0783-9655-4508-a10a-94be8bf3a7ed","year":1996},"citing_paper":{"arxiv_id":"2605.14173","last_updated":"2026-05-13T22:52:01Z","snapshot_observed_at":"2026-08-12T19:25:16.247105Z","submitted_at":"2026-05-13T22:52:01Z","title":"Univariate Bicycle Quantum LDPC Codes: Explicit Logical Structure and Distance Bounds","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-15T01:42:39.110455Z"},"links":{"citing_paper":"/paper/2605.14173"},"observation_digest":"sha256:84b09484222475123484061a29a048538b3c541b09fb22889608781676dc4fcc","observation_id":"74748034-6d9f-4307-8b5e-79ed763625f6","resolution":{"observed_at":"2026-05-15T01:43:27.264541Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"High-threshold and low-overhead fault-tolerant quantum memory","venue":null,"work_id":"1077efd0-06de-4346-a9fc-2faccfd8cb43","year":2024},"citing_paper":{"arxiv_id":"2605.14173","last_updated":"2026-05-13T22:52:01Z","snapshot_observed_at":"2026-08-12T19:25:16.247105Z","submitted_at":"2026-05-13T22:52:01Z","title":"Univariate Bicycle Quantum LDPC Codes: Explicit Logical Structure and Distance Bounds","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-15T01:42:39.110455Z"},"links":{"citing_paper":"/paper/2605.14173"},"observation_digest":"sha256:85646d8c77101d5fa6be6b7ed8feb05b32fb5bd222fa897b1ea0e814b331be33","observation_id":"76680ab4-138d-470d-86e3-1fff6edcb152","resolution":{"observed_at":"2026-05-15T01:43:28.274672Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Coprime bivariate bicycle codes and their properties","venue":null,"work_id":"7613ece6-c1c4-4cab-a6e9-dce1c6a241da","year":2024},"citing_paper":{"arxiv_id":"2605.14173","last_updated":"2026-05-13T22:52:01Z","snapshot_observed_at":"2026-08-12T19:25:16.247105Z","submitted_at":"2026-05-13T22:52:01Z","title":"Univariate Bicycle Quantum LDPC Codes: Explicit Logical Structure and Distance Bounds","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-15T01:42:39.110455Z"},"links":{"citing_paper":"/paper/2605.14173"},"observation_digest":"sha256:562d64d705eea28453c8b57a9ce8a029ad2c57f94c2cde87b1e04da23149fc8e","observation_id":"e31a7ee1-6a96-4985-a883-8dbcf20a0a62","resolution":{"observed_at":"2026-05-15T01:43:28.258786Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.17052","last_updated":"2026-04-30T09:10:13Z","snapshot_observed_at":"2026-08-08T23:01:03.335704Z","submitted_at":"2025-02-24T11:04:15Z","title":"Existence and Characterisation of Bivariate Bicycle Codes","version":4},"cited_work":{"arxiv_id":"2502.17052","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.17052","snapshot_observed_at":"2026-07-02T23:17:30.073085Z","title":"Existence and Characterisation of Bivariate Bicycle Codes","venue":"quant-ph","work_id":"ecb8c7a6-7dc6-4455-a99b-5513043dbafe","year":2025},"citing_paper":{"arxiv_id":"2605.14173","last_updated":"2026-05-13T22:52:01Z","snapshot_observed_at":"2026-08-12T19:25:16.247105Z","submitted_at":"2026-05-13T22:52:01Z","title":"Univariate Bicycle Quantum LDPC Codes: Explicit Logical Structure and Distance Bounds","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-15T01:42:39.110455Z"},"links":{"cited_paper":"/paper/2502.17052","citing_paper":"/paper/2605.14173"},"observation_digest":"sha256:d9bb0dc8754492d935dd046f7d7cc1961f4000745bd8f890391179e8f3518382","observation_id":"bd968ebe-12da-48aa-84bd-64d38bdb2719","resolution":{"observed_at":"2026-05-15T01:43:27.496042Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/9705052","last_updated":"1997-05-28T23:51:29Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"1997-05-28T23:51:29Z","title":"Stabilizer Codes and Quantum Error Correction","version":1},"cited_work":{"arxiv_id":"quant-ph/9705052","doi":"10.48550/arxiv.quant-ph/9705052","metadata_source":"pith","pith_arxiv_id":"quant-ph/9705052","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Stabilizer Codes and Quantum Error Correction","venue":"quant-ph","work_id":"8dffbb8a-b91b-45a6-98ea-5fdf60573717","year":1997},"citing_paper":{"arxiv_id":"2605.14173","last_updated":"2026-05-13T22:52:01Z","snapshot_observed_at":"2026-08-12T19:25:16.247105Z","submitted_at":"2026-05-13T22:52:01Z","title":"Univariate Bicycle Quantum LDPC Codes: Explicit Logical Structure and Distance Bounds","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-15T01:42:39.110455Z"},"links":{"cited_paper":"/paper/quant-ph/9705052","citing_paper":"/paper/2605.14173"},"observation_digest":"sha256:9d417b02474bc7d72ba27dd7a7ff01186c04d8c9b282425f259acc551c188699","observation_id":"ce323386-059d-4439-b30b-fda4f2142756","resolution":{"observed_at":"2026-05-15T01:43:27.504961Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-07-13T23:19:54.826904+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T23:19:54.826904+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Logical operators of quantum codes","venue":null,"work_id":"a59bc50a-392f-4eee-899d-8e15f93dcc2a","year":2009},"citing_paper":{"arxiv_id":"2605.14173","last_updated":"2026-05-13T22:52:01Z","snapshot_observed_at":"2026-08-12T19:25:16.247105Z","submitted_at":"2026-05-13T22:52:01Z","title":"Univariate Bicycle Quantum LDPC Codes: Explicit Logical Structure and Distance Bounds","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-15T01:42:39.110455Z"},"links":{"citing_paper":"/paper/2605.14173"},"observation_digest":"sha256:34b528d4d71eac0c23541d24e3c459cd6fa031d29856a30f8ec100beb757c719","observation_id":"2ac11782-c682-46ca-aaa8-89458601063a","resolution":{"observed_at":"2026-05-15T01:43:28.264679Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On the hardness of the minimum distance problem of quantum codes","venue":null,"work_id":"3c70d523-a9ee-4f4a-b900-aa97d8307e48","year":2023},"citing_paper":{"arxiv_id":"2605.14173","last_updated":"2026-05-13T22:52:01Z","snapshot_observed_at":"2026-08-12T19:25:16.247105Z","submitted_at":"2026-05-13T22:52:01Z","title":"Univariate Bicycle Quantum LDPC Codes: Explicit Logical Structure and Distance Bounds","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-15T01:42:39.110455Z"},"links":{"citing_paper":"/paper/2605.14173"},"observation_digest":"sha256:7a27aaf8816e2ee7ecd05a7e05fe65d25e494c529828313da4b4f64bb93fd9c3","observation_id":"9d454dba-67e4-4d8c-8161-a0650c92950c","resolution":{"observed_at":"2026-05-15T01:43:28.254849Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"The intractability of computing the minimum distance of a code","venue":null,"work_id":"0d21b540-620d-4db5-b68b-4e532d8485a2","year":1997},"citing_paper":{"arxiv_id":"2605.14173","last_updated":"2026-05-13T22:52:01Z","snapshot_observed_at":"2026-08-12T19:25:16.247105Z","submitted_at":"2026-05-13T22:52:01Z","title":"Univariate Bicycle Quantum LDPC Codes: Explicit Logical Structure and Distance Bounds","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-15T01:42:39.110455Z"},"links":{"citing_paper":"/paper/2605.14173"},"observation_digest":"sha256:d511e5ed34a3b961b1ca26bb6ed474276ae584473f3abbaebb45b75677161613","observation_id":"caba3f5e-43c7-44e7-a828-de413d0c8963","resolution":{"observed_at":"2026-05-15T01:43:28.252891Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Distance verification for classical and quantum ldpc codes","venue":null,"work_id":"b43e55b7-0e96-4737-86b8-20c89052d6db","year":2017},"citing_paper":{"arxiv_id":"2605.14173","last_updated":"2026-05-13T22:52:01Z","snapshot_observed_at":"2026-08-12T19:25:16.247105Z","submitted_at":"2026-05-13T22:52:01Z","title":"Univariate Bicycle Quantum LDPC Codes: Explicit Logical Structure and Distance Bounds","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-15T01:42:39.110455Z"},"links":{"citing_paper":"/paper/2605.14173"},"observation_digest":"sha256:b6d9125655726f4a62a1920d57fcffe57d46b6f4b11588d49bcf946609b61e90","observation_id":"5d8fb032-4336-47f1-af1a-f1ab5eb697e3","resolution":{"observed_at":"2026-05-15T01:43:28.260753Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-20T04:30:27.545368Z","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-08-12T19:25:16.247105Z","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:dbb8f9bcb96b33db7730c3fd5ef65d3f2a02cfb4f4c34373c2268a538145476b","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-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Distance bounds for generalized bicycle codes","venue":null,"work_id":"33ccdb13-3478-4713-a89f-7289b2b06bd9","year":2022},"citing_paper":{"arxiv_id":"2605.14173","last_updated":"2026-05-13T22:52:01Z","snapshot_observed_at":"2026-08-12T19:25:16.247105Z","submitted_at":"2026-05-13T22:52:01Z","title":"Univariate Bicycle Quantum LDPC Codes: Explicit Logical Structure and Distance Bounds","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-15T01:42:39.110455Z"},"links":{"citing_paper":"/paper/2605.14173"},"observation_digest":"sha256:ddd2767cbf9d0c8b7aad3f75b205b289543355f9e2430c961837fb1abcd2e9ac","observation_id":"b9d6ee63-305a-4297-9240-34a01d5a5ae3","resolution":{"observed_at":"2026-05-15T01:43:28.256741Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2603.22532","last_updated":"2026-08-14T08:13:21Z","snapshot_observed_at":"2026-08-19T23:30:03.546465Z","submitted_at":"2026-03-23T19:52:23Z","title":"Distance-Finding Algorithms for Quantum Codes and Circuits","version":2},"cited_work":{"arxiv_id":"2603.22532","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2603.22532","snapshot_observed_at":"2026-08-17T02:09:27.147534Z","title":"Distance-finding algorithms for quantum codes and cir- cuits","venue":null,"work_id":"231e931c-9a0d-4191-875d-45385b0e438d","year":2026},"citing_paper":{"arxiv_id":"2605.14173","last_updated":"2026-05-13T22:52:01Z","snapshot_observed_at":"2026-08-12T19:25:16.247105Z","submitted_at":"2026-05-13T22:52:01Z","title":"Univariate Bicycle Quantum LDPC Codes: Explicit Logical Structure and Distance Bounds","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-15T01:42:39.110455Z"},"links":{"cited_paper":"/paper/2603.22532","citing_paper":"/paper/2605.14173"},"observation_digest":"sha256:a9eb30cd6f8b795e98beb4ec35c86d6a82a8bb406f30619aa1118719f2f42059","observation_id":"2ac5fc98-4a54-4e2a-90a0-6cbae28f1f0a","resolution":{"observed_at":"2026-08-17T02:09:27.147534Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"codeDistancePYPI","venue":null,"work_id":"bb88de3d-4a5a-4457-b7d4-510b4c287f96","year":2025},"citing_paper":{"arxiv_id":"2605.14173","last_updated":"2026-05-13T22:52:01Z","snapshot_observed_at":"2026-08-12T19:25:16.247105Z","submitted_at":"2026-05-13T22:52:01Z","title":"Univariate Bicycle Quantum LDPC Codes: Explicit Logical Structure and Distance Bounds","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-15T01:42:39.110455Z"},"links":{"citing_paper":"/paper/2605.14173"},"observation_digest":"sha256:b8c37858334aa35b4603938984328dec446c91664aaff0cbf753a89714dfc6a9","observation_id":"57af4fdf-fc3e-4fa9-b8a0-0d5393709a0f","resolution":{"observed_at":"2026-05-15T01:43:28.262728Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Decoding across the quantum low-density parity-check code landscape","venue":null,"work_id":"4eee47fa-557b-4699-a441-ac5c3f1e7a98","year":2020},"citing_paper":{"arxiv_id":"2605.14173","last_updated":"2026-05-13T22:52:01Z","snapshot_observed_at":"2026-08-12T19:25:16.247105Z","submitted_at":"2026-05-13T22:52:01Z","title":"Univariate Bicycle Quantum LDPC Codes: Explicit Logical Structure and Distance Bounds","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-15T01:42:39.110455Z"},"links":{"citing_paper":"/paper/2605.14173"},"observation_digest":"sha256:de14a063cd5a504cb6d4d6772c5e24b6a767a10957716aa4cedbd655418c6cb8","observation_id":"be126e76-7d3b-4e55-b8b2-e459d56a3ddc","resolution":{"observed_at":"2026-05-15T01:43:28.250743Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"LDPC: Python tools for low density parity check codes","venue":null,"work_id":"57b956d6-c8f6-40cf-af76-07175e6f8a53","year":2022},"citing_paper":{"arxiv_id":"2605.14173","last_updated":"2026-05-13T22:52:01Z","snapshot_observed_at":"2026-08-12T19:25:16.247105Z","submitted_at":"2026-05-13T22:52:01Z","title":"Univariate Bicycle Quantum LDPC Codes: Explicit Logical Structure and Distance Bounds","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-15T01:42:39.110455Z"},"links":{"citing_paper":"/paper/2605.14173"},"observation_digest":"sha256:3d665a47cb0cd7de8b28c43ebeff37e6889d128e60d061b5a5c0690292adc87a","observation_id":"aa8f79a6-616f-44da-b3ad-bda0f56f3a59","resolution":{"observed_at":"2026-05-15T01:43:28.248836Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2605.14173","last_updated":"2026-05-13T22:52:01Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-12T19:25:16.247105Z","submitted_at":"2026-05-13T22:52:01Z","title":"Univariate Bicycle Quantum LDPC Codes: Explicit Logical Structure and Distance Bounds"},"reference_resolution":{"displayed":23,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":7,"verified_fuzzy":15},"total_outbound_references":23},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 23 of 23 outbound references and 2 inbound Pith citation observations for arXiv:2605.14173."}