{"as_of":"2026-08-14T20:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:019a893aa6c2c55667d89dc93ba0d30a88c5a0c9a3e69e3c25eeea3a2d5911c4","coverage":[{"denominator":40,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":40,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T15:01:13.005993Z","state":"measured"},{"denominator":41,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":41,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T00:40:19.205501Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2605.03631","last_updated":"2026-07-22T13:39:45Z","snapshot_observed_at":"2026-08-14T07:21:36.352645Z","submitted_at":"2026-05-05T11:00:37Z","title":"Design and Analysis of Quantum Dual-Containing CSS LDPC Codes based on Quasi-Dyadic Matrices","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2605.03631","snapshot_observed_at":"2026-08-02T00:40:19.205501Z","title":"Baldelli, M","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.14988","last_updated":"2026-07-16T13:38:00Z","snapshot_observed_at":"2026-08-14T07:22:14.652011Z","submitted_at":"2026-07-16T13:38:00Z","title":"Quantum XYZ Stabilizer Codes","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-02T00:40:19.205501Z"},"links":{"cited_paper":"/paper/2605.03631","citing_paper":"/paper/2607.14988"},"observation_digest":"sha256:8a41e0553e7449fd1e9ba19d9797a7b8048bb1b6b3d0e5d7de8f1933bac5b4d3","observation_id":"fd190cf4-e205-49a3-9c57-8fc6d231c4aa","resolution":{"observed_at":"2026-08-02T00:40:19.205501Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2605.03631/citation-record","integrity":"/paper/2605.03631/integrity","json":"/paper/2605.03631/citation-record.json","paper":"/paper/2605.03631"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T15:01:09.119686Z","title":"Quantum CSS LDPC codes with quasi-dyadic structure,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.03631","last_updated":"2026-07-22T13:39:45Z","snapshot_observed_at":"2026-08-14T07:21:36.352645Z","submitted_at":"2026-05-05T11:00:37Z","title":"Design and Analysis of Quantum Dual-Containing CSS LDPC Codes based on Quasi-Dyadic Matrices","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-02T15:01:09.119686Z"},"links":{"citing_paper":"/paper/2605.03631"},"observation_digest":"sha256:9d22b0eaa6a32e27ab65f18dd56d1364ada586dd4e6a9ccaee585ccf4bdfa7b4","observation_id":"ed5d2076-9df5-4ac3-8a75-106e5a80effc","resolution":{"observed_at":"2026-08-02T15:01:09.119686Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/9811052","last_updated":"1998-11-20T03:23:13Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"1998-11-20T03:23:13Z","title":"Quantum codes on a lattice with boundary","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/9811052","snapshot_observed_at":"2026-08-02T15:01:09.209035Z","title":"Quantum codes on a lattice with boundary","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2605.03631","last_updated":"2026-07-22T13:39:45Z","snapshot_observed_at":"2026-08-14T07:21:36.352645Z","submitted_at":"2026-05-05T11:00:37Z","title":"Design and Analysis of Quantum Dual-Containing CSS LDPC Codes based on Quasi-Dyadic Matrices","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-02T15:01:09.209035Z"},"links":{"cited_paper":"/paper/quant-ph/9811052","citing_paper":"/paper/2605.03631"},"observation_digest":"sha256:5339efdc46d35aa5872232a5ec8408da71e47eebbeba4b12ee3ac91a3027f9b6","observation_id":"0a07cefb-ccb4-4590-a78a-51df02b89ea5","resolution":{"observed_at":"2026-08-02T15:01:09.209035Z","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-02T15:01:09.302718Z","title":"Topological quantum memory,","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2605.03631","last_updated":"2026-07-22T13:39:45Z","snapshot_observed_at":"2026-08-14T07:21:36.352645Z","submitted_at":"2026-05-05T11:00:37Z","title":"Design and Analysis of Quantum Dual-Containing CSS LDPC Codes based on Quasi-Dyadic Matrices","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-02T15:01:09.302718Z"},"links":{"citing_paper":"/paper/2605.03631"},"observation_digest":"sha256:a13ec99cae818178406a54041fc298990fba0db78a888d1d83a73ed6df80f42c","observation_id":"929d0b7e-dec0-43ec-bd0d-8c3719e419de","resolution":{"observed_at":"2026-08-02T15:01:09.302718Z","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-02T15:01:09.371091Z","title":"Quantum error correction with imperfect gates,","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2605.03631","last_updated":"2026-07-22T13:39:45Z","snapshot_observed_at":"2026-08-14T07:21:36.352645Z","submitted_at":"2026-05-05T11:00:37Z","title":"Design and Analysis of Quantum Dual-Containing CSS LDPC Codes based on Quasi-Dyadic Matrices","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-02T15:01:09.371091Z"},"links":{"citing_paper":"/paper/2605.03631"},"observation_digest":"sha256:eb6c2ae1192b0d976fd146f253fb6a2a0949950a12e163eef610ec4bca6c3fac","observation_id":"c1bf7e34-e43e-4884-a392-bb06a5011983","resolution":{"observed_at":"2026-08-02T15:01:09.371091Z","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-02T15:01:09.460141Z","title":"Quantum computations: Algorithms and error correc- tion,","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2605.03631","last_updated":"2026-07-22T13:39:45Z","snapshot_observed_at":"2026-08-14T07:21:36.352645Z","submitted_at":"2026-05-05T11:00:37Z","title":"Design and Analysis of Quantum Dual-Containing CSS LDPC Codes based on Quasi-Dyadic Matrices","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-02T15:01:09.460141Z"},"links":{"citing_paper":"/paper/2605.03631"},"observation_digest":"sha256:32d4fcf3050fff2bedd969d6e33a806251e6c61f08799dd4a7a46ca979b58847","observation_id":"086b521e-a182-4254-bef9-6e24528ff1bd","resolution":{"observed_at":"2026-08-02T15:01:09.460141Z","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-02T15:01:09.549571Z","title":"Projective plane and planar quantum codes,","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2605.03631","last_updated":"2026-07-22T13:39:45Z","snapshot_observed_at":"2026-08-14T07:21:36.352645Z","submitted_at":"2026-05-05T11:00:37Z","title":"Design and Analysis of Quantum Dual-Containing CSS LDPC Codes based on Quasi-Dyadic Matrices","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-02T15:01:09.549571Z"},"links":{"citing_paper":"/paper/2605.03631"},"observation_digest":"sha256:e4c512a822218315cbae7fdf37c12ad2bf6b63a5847ac62dba41fd705714158e","observation_id":"9f4dd42a-8345-4abe-aeab-37c0a52c2058","resolution":{"observed_at":"2026-08-02T15:01:09.549571Z","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-02T15:01:09.729285Z","title":"Confinement-Higgs transition in a disordered gauge theory and the accuracy threshold for quantum memory,","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2605.03631","last_updated":"2026-07-22T13:39:45Z","snapshot_observed_at":"2026-08-14T07:21:36.352645Z","submitted_at":"2026-05-05T11:00:37Z","title":"Design and Analysis of Quantum Dual-Containing CSS LDPC Codes based on Quasi-Dyadic Matrices","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-02T15:01:09.729285Z"},"links":{"citing_paper":"/paper/2605.03631"},"observation_digest":"sha256:f796a1c9d8ae793ec1c7def42751264cd16167fc52a2dd9b5ecada6438a73a26","observation_id":"9829ee31-2bd9-4c5e-920c-2faa7cd7dba0","resolution":{"observed_at":"2026-08-02T15:01:09.729285Z","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-02T15:01:09.860762Z","title":"Surface codes: Towards practical large-scale quantum computation,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2605.03631","last_updated":"2026-07-22T13:39:45Z","snapshot_observed_at":"2026-08-14T07:21:36.352645Z","submitted_at":"2026-05-05T11:00:37Z","title":"Design and Analysis of Quantum Dual-Containing CSS LDPC Codes based on Quasi-Dyadic Matrices","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-02T15:01:09.860762Z"},"links":{"citing_paper":"/paper/2605.03631"},"observation_digest":"sha256:b9467b57b6f2519f8ce398ca6b30c328e46d5b591414bc2fdc9abc4412499370","observation_id":"43db350f-4cd0-444e-ae55-bc019bc615d8","resolution":{"observed_at":"2026-08-02T15:01:09.860762Z","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-02T15:01:09.983693Z","title":"Quantum error correction: An introductory guide,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2605.03631","last_updated":"2026-07-22T13:39:45Z","snapshot_observed_at":"2026-08-14T07:21:36.352645Z","submitted_at":"2026-05-05T11:00:37Z","title":"Design and Analysis of Quantum Dual-Containing CSS LDPC Codes based on Quasi-Dyadic Matrices","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-02T15:01:09.983693Z"},"links":{"citing_paper":"/paper/2605.03631"},"observation_digest":"sha256:a18d7aa91ebe003b318651890159bc17cf2ed5839d3f5fa7d8fe33bee913caeb","observation_id":"4c1f1b31-2186-480a-8a28-6f29da2a231e","resolution":{"observed_at":"2026-08-02T15:01:09.983693Z","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-02T15:01:10.057499Z","title":"Sparse-graph codes for quantum error correction,","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2605.03631","last_updated":"2026-07-22T13:39:45Z","snapshot_observed_at":"2026-08-14T07:21:36.352645Z","submitted_at":"2026-05-05T11:00:37Z","title":"Design and Analysis of Quantum Dual-Containing CSS LDPC Codes based on Quasi-Dyadic Matrices","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-02T15:01:10.057499Z"},"links":{"citing_paper":"/paper/2605.03631"},"observation_digest":"sha256:67cebbafcacd2bbb0b11ebd5898ec17c23b44e903781fc6b090fb4c2718dff58","observation_id":"6a62f3da-053e-4ce4-9715-ad2b3f3073e2","resolution":{"observed_at":"2026-08-02T15:01:10.057499Z","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-02T15:01:10.168037Z","title":"Quantum quasi-cyclic LDPC codes,","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2605.03631","last_updated":"2026-07-22T13:39:45Z","snapshot_observed_at":"2026-08-14T07:21:36.352645Z","submitted_at":"2026-05-05T11:00:37Z","title":"Design and Analysis of Quantum Dual-Containing CSS LDPC Codes based on Quasi-Dyadic Matrices","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-02T15:01:10.168037Z"},"links":{"citing_paper":"/paper/2605.03631"},"observation_digest":"sha256:7c7b2e88da0cee3f65e6c9661769ad78a26614b993724e7e57068583a7a01c37","observation_id":"4dcbca68-c20c-4146-b76d-e1ac81364950","resolution":{"observed_at":"2026-08-02T15:01:10.168037Z","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-02T15:01:10.321929Z","title":"Fifteen years of quantum LDPC coding and improved decoding strategies,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2605.03631","last_updated":"2026-07-22T13:39:45Z","snapshot_observed_at":"2026-08-14T07:21:36.352645Z","submitted_at":"2026-05-05T11:00:37Z","title":"Design and Analysis of Quantum Dual-Containing CSS LDPC Codes based on Quasi-Dyadic Matrices","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-02T15:01:10.321929Z"},"links":{"citing_paper":"/paper/2605.03631"},"observation_digest":"sha256:661683056329bd948b5c6952ac0fb299676d5f40715fc1ee9e3191dc5379012d","observation_id":"94f7ab3a-4b07-471d-86fb-7d354a4084fb","resolution":{"observed_at":"2026-08-02T15:01:10.321929Z","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-02T15:01:10.376687Z","title":"Quantum LDPC codes with positive rate and minimum distance proportional to the square root of the blocklength,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2605.03631","last_updated":"2026-07-22T13:39:45Z","snapshot_observed_at":"2026-08-14T07:21:36.352645Z","submitted_at":"2026-05-05T11:00:37Z","title":"Design and Analysis of Quantum Dual-Containing CSS LDPC Codes based on Quasi-Dyadic Matrices","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-02T15:01:10.376687Z"},"links":{"citing_paper":"/paper/2605.03631"},"observation_digest":"sha256:14572f5fc9b4ee72a8485eadf2615f4ab6b5e5533b5048d6eb04c14a2fb20608","observation_id":"edef8739-cbcb-48d1-aa79-bef1ff1a23b8","resolution":{"observed_at":"2026-08-02T15:01:10.376687Z","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-02T15:01:10.471051Z","title":"Quantum Tanner codes,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.03631","last_updated":"2026-07-22T13:39:45Z","snapshot_observed_at":"2026-08-14T07:21:36.352645Z","submitted_at":"2026-05-05T11:00:37Z","title":"Design and Analysis of Quantum Dual-Containing CSS LDPC Codes based on Quasi-Dyadic Matrices","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-02T15:01:10.471051Z"},"links":{"citing_paper":"/paper/2605.03631"},"observation_digest":"sha256:387508e8bad64cf80b127b68348c42f8e97d883fd399f97dff58271285cc93ef","observation_id":"2c7df6e2-a659-4d8e-8592-caf168145a24","resolution":{"observed_at":"2026-08-02T15:01:10.471051Z","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-02T15:01:10.570051Z","title":"Quantum LDPC codes with almost linear minimum distance,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.03631","last_updated":"2026-07-22T13:39:45Z","snapshot_observed_at":"2026-08-14T07:21:36.352645Z","submitted_at":"2026-05-05T11:00:37Z","title":"Design and Analysis of Quantum Dual-Containing CSS LDPC Codes based on Quasi-Dyadic Matrices","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-02T15:01:10.570051Z"},"links":{"citing_paper":"/paper/2605.03631"},"observation_digest":"sha256:5a20bb1edf7a9260a0c741c73be2c165992b4cbce7c11a241f7b0c601d720987","observation_id":"80c55887-ae92-4f2c-852d-2c718ed59d28","resolution":{"observed_at":"2026-08-02T15:01:10.570051Z","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-02T15:01:10.636932Z","title":"Asymptotically good quantum and locally testable classical LDPC codes,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.03631","last_updated":"2026-07-22T13:39:45Z","snapshot_observed_at":"2026-08-14T07:21:36.352645Z","submitted_at":"2026-05-05T11:00:37Z","title":"Design and Analysis of Quantum Dual-Containing CSS LDPC Codes based on Quasi-Dyadic Matrices","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-02T15:01:10.636932Z"},"links":{"citing_paper":"/paper/2605.03631"},"observation_digest":"sha256:eed9eafe0e310496dd6076d2d127f491710387bfcfcce32b1ec803f2f02ef18b","observation_id":"5fff1f64-81f6-4f4e-96b1-9fe12ade32b6","resolution":{"observed_at":"2026-08-02T15:01:10.636932Z","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-02T15:01:10.735294Z","title":"Classical product code constructions for quantum Calderbank-Shor-Steane codes,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.03631","last_updated":"2026-07-22T13:39:45Z","snapshot_observed_at":"2026-08-14T07:21:36.352645Z","submitted_at":"2026-05-05T11:00:37Z","title":"Design and Analysis of Quantum Dual-Containing CSS LDPC Codes based on Quasi-Dyadic Matrices","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-02T15:01:10.735294Z"},"links":{"citing_paper":"/paper/2605.03631"},"observation_digest":"sha256:139653185dd7253c460c23ee909a4d754cb8c04c6ae00cc21d260a367d4ced7c","observation_id":"c51e64b1-605e-4ad2-869a-5f91871ff7a8","resolution":{"observed_at":"2026-08-02T15:01:10.735294Z","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-02T15:01:10.803066Z","title":"High-threshold and low-overhead fault-tolerant quantum memory,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.03631","last_updated":"2026-07-22T13:39:45Z","snapshot_observed_at":"2026-08-14T07:21:36.352645Z","submitted_at":"2026-05-05T11:00:37Z","title":"Design and Analysis of Quantum Dual-Containing CSS LDPC Codes based on Quasi-Dyadic Matrices","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-02T15:01:10.803066Z"},"links":{"citing_paper":"/paper/2605.03631"},"observation_digest":"sha256:bbed244f85fb6af5d2d4200434a17a32d4dbc0beec18c0a2045f04ca3a5e32ae","observation_id":"b9d15882-3e3b-45f0-84bb-36c52a1da34f","resolution":{"observed_at":"2026-08-02T15:01:10.803066Z","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-02T15:01:10.881800Z","title":"Self-orthogonal quasi-cyclic codes,","venue":null,"work_id":null,"year":1967},"citing_paper":{"arxiv_id":"2605.03631","last_updated":"2026-07-22T13:39:45Z","snapshot_observed_at":"2026-08-14T07:21:36.352645Z","submitted_at":"2026-05-05T11:00:37Z","title":"Design and Analysis of Quantum Dual-Containing CSS LDPC Codes based on Quasi-Dyadic Matrices","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-02T15:01:10.881800Z"},"links":{"citing_paper":"/paper/2605.03631"},"observation_digest":"sha256:a387be017afe23c54eb32456eca040ddbfc9f5b6820e0f5df84dad2d7a78cf90","observation_id":"006edde5-f762-4302-aed3-1972f9445953","resolution":{"observed_at":"2026-08-02T15:01:10.881800Z","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-02T15:01:10.968274Z","title":"Degenerate quantum LDPC codes with good finite length performance,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2605.03631","last_updated":"2026-07-22T13:39:45Z","snapshot_observed_at":"2026-08-14T07:21:36.352645Z","submitted_at":"2026-05-05T11:00:37Z","title":"Design and Analysis of Quantum Dual-Containing CSS LDPC Codes based on Quasi-Dyadic Matrices","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-02T15:01:10.968274Z"},"links":{"citing_paper":"/paper/2605.03631"},"observation_digest":"sha256:449a8b8868a42f6fff82c2e51e3f3654efdff8230164aa45b5f85724994ca245","observation_id":"579f4bc5-eccb-4859-b125-f15eefcaaeaa","resolution":{"observed_at":"2026-08-02T15:01:10.968274Z","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-02T15:01:11.061829Z","title":"Reproducible families of codes and cryptographic applications,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.03631","last_updated":"2026-07-22T13:39:45Z","snapshot_observed_at":"2026-08-14T07:21:36.352645Z","submitted_at":"2026-05-05T11:00:37Z","title":"Design and Analysis of Quantum Dual-Containing CSS LDPC Codes based on Quasi-Dyadic Matrices","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-02T15:01:11.061829Z"},"links":{"citing_paper":"/paper/2605.03631"},"observation_digest":"sha256:1f7316d9c0571bdc5326ab6de75cd0ea64db7b4670d6d04fa9aae3431885cecb","observation_id":"5b5a5ad0-378f-4d10-b07b-94a5b96b660b","resolution":{"observed_at":"2026-08-02T15:01:11.061829Z","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-02T15:01:11.136638Z","title":"Quasicyclic dyadic codes in Walsh- Hadamard domain,","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2605.03631","last_updated":"2026-07-22T13:39:45Z","snapshot_observed_at":"2026-08-14T07:21:36.352645Z","submitted_at":"2026-05-05T11:00:37Z","title":"Design and Analysis of Quantum Dual-Containing CSS LDPC Codes based on Quasi-Dyadic Matrices","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-02T15:01:11.136638Z"},"links":{"citing_paper":"/paper/2605.03631"},"observation_digest":"sha256:cf2cbe12ed9ed0735f3d6be18ea2dbaf9d45ca0419a5acaf5372ba8cda1b4eef","observation_id":"2471d116-9db3-41d0-8c48-b1259d97e1d8","resolution":{"observed_at":"2026-08-02T15:01:11.136638Z","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-02T15:01:11.262622Z","title":"Designing efficient dyadic operations for cryptographic applications,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2605.03631","last_updated":"2026-07-22T13:39:45Z","snapshot_observed_at":"2026-08-14T07:21:36.352645Z","submitted_at":"2026-05-05T11:00:37Z","title":"Design and Analysis of Quantum Dual-Containing CSS LDPC Codes based on Quasi-Dyadic Matrices","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-02T15:01:11.262622Z"},"links":{"citing_paper":"/paper/2605.03631"},"observation_digest":"sha256:a3ca6af7ecadf69e201d2a844436a3ae58976069f5d05df7ac80154960bc4857","observation_id":"8ba46072-290e-443c-909c-759a182a8c72","resolution":{"observed_at":"2026-08-02T15:01:11.262622Z","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-02T15:01:11.394394Z","title":"Codes based on dyadic matrices and their generalizations,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.03631","last_updated":"2026-07-22T13:39:45Z","snapshot_observed_at":"2026-08-14T07:21:36.352645Z","submitted_at":"2026-05-05T11:00:37Z","title":"Design and Analysis of Quantum Dual-Containing CSS LDPC Codes based on Quasi-Dyadic Matrices","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-02T15:01:11.394394Z"},"links":{"citing_paper":"/paper/2605.03631"},"observation_digest":"sha256:f67d47d0b017614070c81c235ee68bcbf1f15f593251cef0b486c9ebfaf64153","observation_id":"8725809a-c371-4ef1-b798-4603170efa4e","resolution":{"observed_at":"2026-08-02T15:01:11.394394Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/9705052","snapshot_observed_at":"2026-08-02T15:01:11.514843Z","title":"Stabilizer codes and quantum error correction,","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2605.03631","last_updated":"2026-07-22T13:39:45Z","snapshot_observed_at":"2026-08-14T07:21:36.352645Z","submitted_at":"2026-05-05T11:00:37Z","title":"Design and Analysis of Quantum Dual-Containing CSS LDPC Codes based on Quasi-Dyadic Matrices","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-02T15:01:11.514843Z"},"links":{"cited_paper":"/paper/quant-ph/9705052","citing_paper":"/paper/2605.03631"},"observation_digest":"sha256:f7a3f0fb5fcf54af27f3c56bbf5eb4e40a87a9a02aa8cf2b83a85ed5adfca89f","observation_id":"fcc0e52c-dd45-40f7-bf7e-5a80b8893e9a","resolution":{"observed_at":"2026-08-02T15:01:11.514843Z","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-02T15:01:11.580591Z","title":"Quantum Margulis codes,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.03631","last_updated":"2026-07-22T13:39:45Z","snapshot_observed_at":"2026-08-14T07:21:36.352645Z","submitted_at":"2026-05-05T11:00:37Z","title":"Design and Analysis of Quantum Dual-Containing CSS LDPC Codes based on Quasi-Dyadic Matrices","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-02T15:01:11.580591Z"},"links":{"citing_paper":"/paper/2605.03631"},"observation_digest":"sha256:bb811884363d189029495f9b266c4d1ae782960d0b40b681c0e3404bf3854580","observation_id":"c384e95f-6f7b-4179-a4af-51427f1c2dcd","resolution":{"observed_at":"2026-08-02T15:01:11.580591Z","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-02T15:01:11.675538Z","title":"Leveraging automorphisms of quantum codes for fault-tolerant quantum computation,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2605.03631","last_updated":"2026-07-22T13:39:45Z","snapshot_observed_at":"2026-08-14T07:21:36.352645Z","submitted_at":"2026-05-05T11:00:37Z","title":"Design and Analysis of Quantum Dual-Containing CSS LDPC Codes based on Quasi-Dyadic Matrices","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-02T15:01:11.675538Z"},"links":{"citing_paper":"/paper/2605.03631"},"observation_digest":"sha256:68f8f9f6e37d31695ef4311d0459ddace723b82744d630b75af506ed6ef7bc2f","observation_id":"d08a4faf-d8e9-438a-a35c-d797ab208d02","resolution":{"observed_at":"2026-08-02T15:01:11.675538Z","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-02T15:01:11.768954Z","title":null,"venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2605.03631","last_updated":"2026-07-22T13:39:45Z","snapshot_observed_at":"2026-08-14T07:21:36.352645Z","submitted_at":"2026-05-05T11:00:37Z","title":"Design and Analysis of Quantum Dual-Containing CSS LDPC Codes based on Quasi-Dyadic Matrices","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-02T15:01:11.768954Z"},"links":{"citing_paper":"/paper/2605.03631"},"observation_digest":"sha256:9dde02b48041738b6de223231508431ead4f042b0111f1a8960542c3a1f93075","observation_id":"0d0ffdb6-b885-47da-9edb-112a1bcf7db7","resolution":{"observed_at":"2026-08-02T15:01:11.768954Z","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-02T15:01:11.891488Z","title":"Good quantum error-correcting codes exist,","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2605.03631","last_updated":"2026-07-22T13:39:45Z","snapshot_observed_at":"2026-08-14T07:21:36.352645Z","submitted_at":"2026-05-05T11:00:37Z","title":"Design and Analysis of Quantum Dual-Containing CSS LDPC Codes based on Quasi-Dyadic Matrices","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-02T15:01:11.891488Z"},"links":{"citing_paper":"/paper/2605.03631"},"observation_digest":"sha256:d88eb80b61e1181354bf11efab94210970f3246013ebfcfbbe2beb881c134a6c","observation_id":"218a3634-3b45-4af6-9790-1f7c15a618dc","resolution":{"observed_at":"2026-08-02T15:01:11.891488Z","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-02T15:01:11.991083Z","title":"Error correcting codes in quantum theory,","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2605.03631","last_updated":"2026-07-22T13:39:45Z","snapshot_observed_at":"2026-08-14T07:21:36.352645Z","submitted_at":"2026-05-05T11:00:37Z","title":"Design and Analysis of Quantum Dual-Containing CSS LDPC Codes based on Quasi-Dyadic Matrices","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-02T15:01:11.991083Z"},"links":{"citing_paper":"/paper/2605.03631"},"observation_digest":"sha256:64c633ceb5b5533316a0c07815f6616ba10ca5bebdf878c2dfcdd9e3d22a3fc4","observation_id":"2087dedc-befe-4751-b41c-c2ede769c31c","resolution":{"observed_at":"2026-08-02T15:01:11.991083Z","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-02T15:01:12.096424Z","title":"Low-density parity-check codes,","venue":null,"work_id":null,"year":1962},"citing_paper":{"arxiv_id":"2605.03631","last_updated":"2026-07-22T13:39:45Z","snapshot_observed_at":"2026-08-14T07:21:36.352645Z","submitted_at":"2026-05-05T11:00:37Z","title":"Design and Analysis of Quantum Dual-Containing CSS LDPC Codes based on Quasi-Dyadic Matrices","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-02T15:01:12.096424Z"},"links":{"citing_paper":"/paper/2605.03631"},"observation_digest":"sha256:544130979fea7dbbdc707eaf09fa46eefdbd6d67fdc4f7ae07edf013da3f5570","observation_id":"d47db2ea-5018-4f33-a464-1d9eebffe1cd","resolution":{"observed_at":"2026-08-02T15:01:12.096424Z","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-02T15:01:12.205446Z","title":"A recursive approach to low complexity codes,","venue":null,"work_id":null,"year":1981},"citing_paper":{"arxiv_id":"2605.03631","last_updated":"2026-07-22T13:39:45Z","snapshot_observed_at":"2026-08-14T07:21:36.352645Z","submitted_at":"2026-05-05T11:00:37Z","title":"Design and Analysis of Quantum Dual-Containing CSS LDPC Codes based on Quasi-Dyadic Matrices","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-02T15:01:12.205446Z"},"links":{"citing_paper":"/paper/2605.03631"},"observation_digest":"sha256:7ab1e6cbdb02d3c1ae8e31f6871b986554f0bf636bbc067be4b2d1ef2a20bab5","observation_id":"9775e6dd-bdbe-4bc8-9f0d-7f501b85f90f","resolution":{"observed_at":"2026-08-02T15:01:12.205446Z","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-02T15:01:12.300938Z","title":"The theory of error correcting codes (F. J. MacWilliams and N. J. A. Sloane),","venue":null,"work_id":null,"year":1980},"citing_paper":{"arxiv_id":"2605.03631","last_updated":"2026-07-22T13:39:45Z","snapshot_observed_at":"2026-08-14T07:21:36.352645Z","submitted_at":"2026-05-05T11:00:37Z","title":"Design and Analysis of Quantum Dual-Containing CSS LDPC Codes based on Quasi-Dyadic Matrices","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-02T15:01:12.300938Z"},"links":{"citing_paper":"/paper/2605.03631"},"observation_digest":"sha256:61e6531a2aa5738e336e57a7a6703ee843349be939316690ee804ae8db51f3d3","observation_id":"fa56bda2-f7f5-467d-8dc7-10d30f8a98dc","resolution":{"observed_at":"2026-08-02T15:01:12.300938Z","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-02T15:01:12.405990Z","title":"On a family of circulant matrices for quasi-cyclic low-density generator matrix codes,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2605.03631","last_updated":"2026-07-22T13:39:45Z","snapshot_observed_at":"2026-08-14T07:21:36.352645Z","submitted_at":"2026-05-05T11:00:37Z","title":"Design and Analysis of Quantum Dual-Containing CSS LDPC Codes based on Quasi-Dyadic Matrices","version":3},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-02T15:01:12.405990Z"},"links":{"citing_paper":"/paper/2605.03631"},"observation_digest":"sha256:2b68a80373585eda453f8879724b4092355d839749f42a0c4eae2909357cb5ff","observation_id":"dda065df-00aa-4a14-82db-2838daf04019","resolution":{"observed_at":"2026-08-02T15:01:12.405990Z","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-02T15:01:12.498303Z","title":"Quantum Kronecker sum-product low-density parity-check codes with finite rate,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2605.03631","last_updated":"2026-07-22T13:39:45Z","snapshot_observed_at":"2026-08-14T07:21:36.352645Z","submitted_at":"2026-05-05T11:00:37Z","title":"Design and Analysis of Quantum Dual-Containing CSS LDPC Codes based on Quasi-Dyadic Matrices","version":3},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-02T15:01:12.498303Z"},"links":{"citing_paper":"/paper/2605.03631"},"observation_digest":"sha256:23456501994bade64ea5cb9faa825277ef2d7512c625c6cc2733eb9bc5e7aee5","observation_id":"8dececa2-9c88-4103-8e72-5010247a5c1b","resolution":{"observed_at":"2026-08-02T15:01:12.498303Z","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-02T15:01:12.592738Z","title":"Minimum distance and other properties of quasi-dyadic parity check codes,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.03631","last_updated":"2026-07-22T13:39:45Z","snapshot_observed_at":"2026-08-14T07:21:36.352645Z","submitted_at":"2026-05-05T11:00:37Z","title":"Design and Analysis of Quantum Dual-Containing CSS LDPC Codes based on Quasi-Dyadic Matrices","version":3},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-02T15:01:12.592738Z"},"links":{"citing_paper":"/paper/2605.03631"},"observation_digest":"sha256:25d6cee41fbdae64fd77c8a694f04d9907bcc7937a3338939448e45c883f3790","observation_id":"6806cc6f-db13-4da8-8912-14b45e91aa39","resolution":{"observed_at":"2026-08-02T15:01:12.592738Z","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-02T15:01:12.725740Z","title":"Quasi-cyclic low-density parity-check codes from circulant permutation matrices,","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2605.03631","last_updated":"2026-07-22T13:39:45Z","snapshot_observed_at":"2026-08-14T07:21:36.352645Z","submitted_at":"2026-05-05T11:00:37Z","title":"Design and Analysis of Quantum Dual-Containing CSS LDPC Codes based on Quasi-Dyadic Matrices","version":3},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-02T15:01:12.725740Z"},"links":{"citing_paper":"/paper/2605.03631"},"observation_digest":"sha256:3a003caaf40a632af0b74539ea396cbcc3d24881ce3c33a568c0264958ac9bd3","observation_id":"764d1995-ebc8-495c-b3fc-3fc65a83c02a","resolution":{"observed_at":"2026-08-02T15:01:12.725740Z","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-02T15:01:12.818519Z","title":"Reduced complexity iterative decoding of low-density parity check codes based on belief propagation,","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2605.03631","last_updated":"2026-07-22T13:39:45Z","snapshot_observed_at":"2026-08-14T07:21:36.352645Z","submitted_at":"2026-05-05T11:00:37Z","title":"Design and Analysis of Quantum Dual-Containing CSS LDPC Codes based on Quasi-Dyadic Matrices","version":3},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-02T15:01:12.818519Z"},"links":{"citing_paper":"/paper/2605.03631"},"observation_digest":"sha256:e8aecebb7c087a4a535f6c194f979bbf2b0ca2e5a566e740332d65f0f581e629","observation_id":"6a3378f1-3287-4ce5-9cb9-df0d9f44b9ab","resolution":{"observed_at":"2026-08-02T15:01:12.818519Z","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-02T15:01:12.911840Z","title":"Source code for approximating the mindist problem of LDPC codes","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2605.03631","last_updated":"2026-07-22T13:39:45Z","snapshot_observed_at":"2026-08-14T07:21:36.352645Z","submitted_at":"2026-05-05T11:00:37Z","title":"Design and Analysis of Quantum Dual-Containing CSS LDPC Codes based on Quasi-Dyadic Matrices","version":3},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-02T15:01:12.911840Z"},"links":{"citing_paper":"/paper/2605.03631"},"observation_digest":"sha256:fba20a1fe7863d0a1a9a29abab3222a11b9e2f736a793892fb089d4687e4b0ca","observation_id":"452c6768-4bcb-43a0-823f-01990676b3e3","resolution":{"observed_at":"2026-08-02T15:01:12.911840Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.01738","last_updated":"2025-03-03T16:58:24Z","snapshot_observed_at":"2026-08-07T17:33:03.144687Z","submitted_at":"2025-03-03T16:58:24Z","title":"Automorphism Ensemble Decoding of Quantum LDPC Codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.01738","snapshot_observed_at":"2026-08-02T15:01:13.005993Z","title":"Au- tomorphism ensemble decoding of quantum LDPC codes","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2605.03631","last_updated":"2026-07-22T13:39:45Z","snapshot_observed_at":"2026-08-14T07:21:36.352645Z","submitted_at":"2026-05-05T11:00:37Z","title":"Design and Analysis of Quantum Dual-Containing CSS LDPC Codes based on Quasi-Dyadic Matrices","version":3},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-02T15:01:13.005993Z"},"links":{"cited_paper":"/paper/2503.01738","citing_paper":"/paper/2605.03631"},"observation_digest":"sha256:39174804d1c39a307faf7b438464dec4781d9d25dcc59f11e5df7075634750c0","observation_id":"54eb5454-a0f0-4d9b-ac53-1fdde02302c2","resolution":{"observed_at":"2026-08-02T15:01:13.005993Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2605.03631","last_updated":"2026-07-22T13:39:45Z","latest_version":3,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-14T07:21:36.352645Z","submitted_at":"2026-05-05T11:00:37Z","title":"Design and Analysis of Quantum Dual-Containing CSS LDPC Codes based on Quasi-Dyadic Matrices"},"reference_resolution":{"displayed":40,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":40,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":40},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 40 of 40 outbound references and 1 inbound Pith citation observation for arXiv:2605.03631."}