{"as_of":"2026-08-04T17:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cd30d051365a0cf613d8d77cc6d54ab1345952945480134c772fdc3a4d0f1547","coverage":[{"denominator":35,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":35,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-08T19:33:49.421779Z","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-04T06:34:03.388597+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.208200Z","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.01942","last_updated":"2026-05-03T16:00:45Z","snapshot_observed_at":"2026-07-06T23:15:07.159340Z","submitted_at":"2026-05-03T16:00:45Z","title":"Combinatorial Analysis of Dyadic and Quasi-Dyadic Codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2605.01942","snapshot_observed_at":"2026-08-02T00:40:19.208200Z","title":"Gómez-Fonseca, G","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-03T19:46:24.792527Z","submitted_at":"2026-07-16T13:38:00Z","title":"Quantum XYZ Stabilizer Codes","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-02T00:40:19.208200Z"},"links":{"cited_paper":"/paper/2605.01942","citing_paper":"/paper/2607.14988"},"observation_digest":"sha256:dd85ff92c58052d1aa9ab9fc7568e378897fc12c32d7e5fc7fa99a567fb55abb","observation_id":"1f0454b2-9033-4b7e-abe5-448e54e5c9a0","resolution":{"observed_at":"2026-08-02T00:40:19.208200Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2605.01942/citation-record","integrity":"/paper/2605.01942/integrity","json":"/paper/2605.01942/citation-record.json","paper":"/paper/2605.01942"},"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":"Analysis of absorbing sets and fully absorbing sets of array-based LDPC codes","venue":null,"work_id":"960b9b84-23d5-4124-a439-b661a90f1bf1","year":2009},"citing_paper":{"arxiv_id":"2605.01942","last_updated":"2026-05-03T16:00:45Z","snapshot_observed_at":"2026-07-06T23:15:07.159340Z","submitted_at":"2026-05-03T16:00:45Z","title":"Combinatorial Analysis of Dyadic and Quasi-Dyadic Codes","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-08T19:33:49.421779Z"},"links":{"citing_paper":"/paper/2605.01942"},"observation_digest":"sha256:ff9d697c736b067fb2fb512b8656367bb8d26686ae5ac3daec9a0b852eeecb54","observation_id":"bfbe24aa-2903-4620-acf8-f44051f603b4","resolution":{"observed_at":"2026-05-26T02:41:32.297735Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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":"Absorbing sets in quantum LDPC codes","venue":null,"work_id":"3ee32f08-6198-4e6a-b25c-6f80c5e703f9","year":2026},"citing_paper":{"arxiv_id":"2605.01942","last_updated":"2026-05-03T16:00:45Z","snapshot_observed_at":"2026-07-06T23:15:07.159340Z","submitted_at":"2026-05-03T16:00:45Z","title":"Combinatorial Analysis of Dyadic and Quasi-Dyadic Codes","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-08T19:33:49.421779Z"},"links":{"citing_paper":"/paper/2605.01942"},"observation_digest":"sha256:724537a547bd1e637e2bc5287f44498ad19cdc31dacd2b4c49e5844fd9e25df6","observation_id":"73a086b7-b10f-48fd-b6b0-e5799c7ed5c2","resolution":{"observed_at":"2026-05-26T02:41:32.233896Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1049/el_19730172","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Simple matrix-theory proof of the discrete dyadic convolution theorem","venue":null,"work_id":"aa5f6634-8864-4bc2-bbe1-ac3a002d5c31","year":1973},"citing_paper":{"arxiv_id":"2605.01942","last_updated":"2026-05-03T16:00:45Z","snapshot_observed_at":"2026-07-06T23:15:07.159340Z","submitted_at":"2026-05-03T16:00:45Z","title":"Combinatorial Analysis of Dyadic and Quasi-Dyadic Codes","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-08T19:33:49.421779Z"},"links":{"citing_paper":"/paper/2605.01942"},"observation_digest":"sha256:b62e1842e0fa6a5cbdec8bf5370b4824581c7f1442000c06021805554e7a89d2","observation_id":"42fdb118-afcc-4317-a618-ca36520ea203","resolution":{"observed_at":"2026-05-08T19:34:04.128307Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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":"Codes based on dyadic matrices and their generalizations","venue":null,"work_id":"76205f76-6e0c-4345-a2ed-aac929f063cd","year":2024},"citing_paper":{"arxiv_id":"2605.01942","last_updated":"2026-05-03T16:00:45Z","snapshot_observed_at":"2026-07-06T23:15:07.159340Z","submitted_at":"2026-05-03T16:00:45Z","title":"Combinatorial Analysis of Dyadic and Quasi-Dyadic Codes","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-08T19:33:49.421779Z"},"links":{"citing_paper":"/paper/2605.01942"},"observation_digest":"sha256:e380da2874219c48e6daedabc248c151635abd6052f5cffbd1d641a5fe636b44","observation_id":"476ee23c-6d60-40b8-b73c-b3b813bb8b13","resolution":{"observed_at":"2026-05-26T02:41:32.266590Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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":"A low complexity PEG-like algorithm to construct quasi-cyclic LDPC codes","venue":null,"work_id":"7f29380c-b548-45e1-a59b-919804cd1f25","year":2023},"citing_paper":{"arxiv_id":"2605.01942","last_updated":"2026-05-03T16:00:45Z","snapshot_observed_at":"2026-07-06T23:15:07.159340Z","submitted_at":"2026-05-03T16:00:45Z","title":"Combinatorial Analysis of Dyadic and Quasi-Dyadic Codes","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-08T19:33:49.421779Z"},"links":{"citing_paper":"/paper/2605.01942"},"observation_digest":"sha256:ac9412603d05ac0a76d43bd583837b741346bf83367ff22279974479f6b95e38","observation_id":"b43c48bd-bea6-4f72-8d3a-7a1af5fdfe97","resolution":{"observed_at":"2026-05-26T02:41:32.272895Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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":"An efficient strategy to count cycles in the Tanner graph of quasi-cyclic LDPC codes","venue":null,"work_id":"f38a8ba6-519b-4956-996e-d835be25e4e5","year":2023},"citing_paper":{"arxiv_id":"2605.01942","last_updated":"2026-05-03T16:00:45Z","snapshot_observed_at":"2026-07-06T23:15:07.159340Z","submitted_at":"2026-05-03T16:00:45Z","title":"Combinatorial Analysis of Dyadic and Quasi-Dyadic Codes","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-08T19:33:49.421779Z"},"links":{"citing_paper":"/paper/2605.01942"},"observation_digest":"sha256:d441daec163b3bead3944970aa6acb3c925e3e4fa2e1ac554287eb2666308d92","observation_id":"b9e95bea-f12a-4bc7-ba2a-5e50fe711c04","resolution":{"observed_at":"2026-05-26T02:41:32.269999Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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":"Regular and irregular progressive edge-growth Tannergraphs","venue":null,"work_id":"d9474173-2373-4b22-a374-a78ee3ebbec1","year":2005},"citing_paper":{"arxiv_id":"2605.01942","last_updated":"2026-05-03T16:00:45Z","snapshot_observed_at":"2026-07-06T23:15:07.159340Z","submitted_at":"2026-05-03T16:00:45Z","title":"Combinatorial Analysis of Dyadic and Quasi-Dyadic Codes","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-08T19:33:49.421779Z"},"links":{"citing_paper":"/paper/2605.01942"},"observation_digest":"sha256:9d3fa3fa4c43d4b50ab3776ffa0c37fb6c0614171221b0cd095d86958c65cb0e","observation_id":"ac370a5c-89e8-4c3a-9799-508cac1754f5","resolution":{"observed_at":"2026-05-26T02:41:32.227580Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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":"Extremal absorbing sets in low-density parity-check codes","venue":null,"work_id":"8ff0a22d-18d7-44c1-a80d-5e8585846b8d","year":2023},"citing_paper":{"arxiv_id":"2605.01942","last_updated":"2026-05-03T16:00:45Z","snapshot_observed_at":"2026-07-06T23:15:07.159340Z","submitted_at":"2026-05-03T16:00:45Z","title":"Combinatorial Analysis of Dyadic and Quasi-Dyadic Codes","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-08T19:33:49.421779Z"},"links":{"citing_paper":"/paper/2605.01942"},"observation_digest":"sha256:6af5edfdfd946cb869c94e2826aa0d4cf5c4de0f548a74c5d7f2b481cc740d83","observation_id":"523b47a9-daa8-4f1a-9b5f-1bed5daa6f8d","resolution":{"observed_at":"2026-05-26T02:41:32.230679Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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 CSS LDPC codes with quasi-dyadic structure","venue":null,"work_id":"e2756da5-05a8-44bf-9c77-fa5479c2509f","year":2025},"citing_paper":{"arxiv_id":"2605.01942","last_updated":"2026-05-03T16:00:45Z","snapshot_observed_at":"2026-07-06T23:15:07.159340Z","submitted_at":"2026-05-03T16:00:45Z","title":"Combinatorial Analysis of Dyadic and Quasi-Dyadic Codes","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-08T19:33:49.421779Z"},"links":{"citing_paper":"/paper/2605.01942"},"observation_digest":"sha256:16a433fdc3e6c384005288bc8eacf4750e1942d1f83e10b197aa1504471bf7e1","observation_id":"596df622-67ce-46e3-ad93-93c062103549","resolution":{"observed_at":"2026-05-26T02:41:32.218334Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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 error correction with girth-16 non-binary LDPC codes via affine permuta- tion construction","venue":null,"work_id":"0609b64f-2c8b-4e77-a52c-989c5c5c2801","year":2025},"citing_paper":{"arxiv_id":"2605.01942","last_updated":"2026-05-03T16:00:45Z","snapshot_observed_at":"2026-07-06T23:15:07.159340Z","submitted_at":"2026-05-03T16:00:45Z","title":"Combinatorial Analysis of Dyadic and Quasi-Dyadic Codes","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-08T19:33:49.421779Z"},"links":{"citing_paper":"/paper/2605.01942"},"observation_digest":"sha256:c9f8112f60210261753b9b2f9d1d7928e1a15f521d4ecfdf4d9bc15406e36abd","observation_id":"fe37094d-f6f9-42db-bfa1-92efe2e768a3","resolution":{"observed_at":"2026-05-26T02:41:32.224776Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1515/jmc-2020-0003","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Reproducible families of codes and cryptographic applications","venue":null,"work_id":"b25d994b-e85c-4abf-ad81-8717ad96b641","year":2022},"citing_paper":{"arxiv_id":"2605.01942","last_updated":"2026-05-03T16:00:45Z","snapshot_observed_at":"2026-07-06T23:15:07.159340Z","submitted_at":"2026-05-03T16:00:45Z","title":"Combinatorial Analysis of Dyadic and Quasi-Dyadic Codes","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-08T19:33:49.421779Z"},"links":{"citing_paper":"/paper/2605.01942"},"observation_digest":"sha256:335fc9e41c13458468a6da53e5d85754683c853544ebeb6de337ad0053f9374e","observation_id":"7ae2947a-e89e-43b1-a17f-2f33160987b5","resolution":{"observed_at":"2026-05-08T19:34:04.135722Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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":"Low-densityparity-check(LDPC)codesconstructedfromprotographs","venue":null,"work_id":"b14476df-d996-4223-8e54-c6ce5f713367","year":2003},"citing_paper":{"arxiv_id":"2605.01942","last_updated":"2026-05-03T16:00:45Z","snapshot_observed_at":"2026-07-06T23:15:07.159340Z","submitted_at":"2026-05-03T16:00:45Z","title":"Combinatorial Analysis of Dyadic and Quasi-Dyadic Codes","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-08T19:33:49.421779Z"},"links":{"citing_paper":"/paper/2605.01942"},"observation_digest":"sha256:9a20d00e35321063fdd6aa980ba8679a61079e56eea43b480327859a2384a4a2","observation_id":"931a6046-6d11-43ed-a193-a35e7929da7c","resolution":{"observed_at":"2026-05-26T02:41:32.214916Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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":"A recursive approach to low complexity codes","venue":null,"work_id":"4dc4656b-acf2-4ff1-92c0-576f77c0aa44","year":1981},"citing_paper":{"arxiv_id":"2605.01942","last_updated":"2026-05-03T16:00:45Z","snapshot_observed_at":"2026-07-06T23:15:07.159340Z","submitted_at":"2026-05-03T16:00:45Z","title":"Combinatorial Analysis of Dyadic and Quasi-Dyadic Codes","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-08T19:33:49.421779Z"},"links":{"citing_paper":"/paper/2605.01942"},"observation_digest":"sha256:4dfb8d43d2db86fe31df58f82f3cbbd2f4f331672111fae049f3f4c8d44b4346","observation_id":"1497416c-2d19-4b13-90a3-ef8cdb8027cd","resolution":{"observed_at":"2026-05-26T02:41:32.294483Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1103/physreva.54.1098","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-03T12:18:06.010295Z","title":"Good quantum error-correcting codes ex- ist","venue":null,"work_id":"0f614b04-e1e3-463f-b0a7-724e857358b2","year":1996},"citing_paper":{"arxiv_id":"2605.01942","last_updated":"2026-05-03T16:00:45Z","snapshot_observed_at":"2026-07-06T23:15:07.159340Z","submitted_at":"2026-05-03T16:00:45Z","title":"Combinatorial Analysis of Dyadic and Quasi-Dyadic Codes","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-08T19:33:49.421779Z"},"links":{"citing_paper":"/paper/2605.01942"},"observation_digest":"sha256:e991d950786a86c9e7c8d008b1bc1cfd63e5842ea9fee4e68507d512a7528bf8","observation_id":"33bda355-0b5c-429c-bbcc-4cc940e81443","resolution":{"observed_at":"2026-05-08T19:34:04.131757Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+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-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1103/physreva.54.4741","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Simple quantum error-correcting codes","venue":null,"work_id":"58ac0783-9655-4508-a10a-94be8bf3a7ed","year":1996},"citing_paper":{"arxiv_id":"2605.01942","last_updated":"2026-05-03T16:00:45Z","snapshot_observed_at":"2026-07-06T23:15:07.159340Z","submitted_at":"2026-05-03T16:00:45Z","title":"Combinatorial Analysis of Dyadic and Quasi-Dyadic Codes","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-08T19:33:49.421779Z"},"links":{"citing_paper":"/paper/2605.01942"},"observation_digest":"sha256:a19e46b6dad1e4462d3a8cc614cfd31405290dd02c6179202e2424de0ce7c024","observation_id":"f8b38efa-4a6d-40c9-8393-10580a5950da","resolution":{"observed_at":"2026-05-08T19:34:04.147279Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-11T02:17:54.399890Z","title":"Degenerate quantum LDPC codes with good finite length performance","venue":null,"work_id":"7f05dbf5-70fd-4c79-8fb7-3fde0f9968d2","year":2021},"citing_paper":{"arxiv_id":"2605.01942","last_updated":"2026-05-03T16:00:45Z","snapshot_observed_at":"2026-07-06T23:15:07.159340Z","submitted_at":"2026-05-03T16:00:45Z","title":"Combinatorial Analysis of Dyadic and Quasi-Dyadic Codes","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-08T19:33:49.421779Z"},"links":{"citing_paper":"/paper/2605.01942"},"observation_digest":"sha256:6418d18bb4c1e98a7a7c016e119f79ebfa837debf0841197ab46ebd6ebf76f8e","observation_id":"5eba391e-3513-4b02-8b88-eed1b2985585","resolution":{"observed_at":"2026-05-26T02:41:32.281662Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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":"0fe0c68f-0f69-4065-bab6-f14142283f6a","year":2013},"citing_paper":{"arxiv_id":"2605.01942","last_updated":"2026-05-03T16:00:45Z","snapshot_observed_at":"2026-07-06T23:15:07.159340Z","submitted_at":"2026-05-03T16:00:45Z","title":"Combinatorial Analysis of Dyadic and Quasi-Dyadic Codes","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-08T19:33:49.421779Z"},"links":{"citing_paper":"/paper/2605.01942"},"observation_digest":"sha256:b523f2521e09c19fb18d805841cd02b87dc324ea90fed664712236c222873235","observation_id":"3bc4a53a-4064-4252-813c-d9cbe9998d4c","resolution":{"observed_at":"2026-05-26T02:41:32.221632Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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 LDPC codes with positive rate and minimum distance proportional to the square root of the blocklength","venue":null,"work_id":"d40ce2a8-6dec-432d-a774-e092edfbaa8f","year":2013},"citing_paper":{"arxiv_id":"2605.01942","last_updated":"2026-05-03T16:00:45Z","snapshot_observed_at":"2026-07-06T23:15:07.159340Z","submitted_at":"2026-05-03T16:00:45Z","title":"Combinatorial Analysis of Dyadic and Quasi-Dyadic Codes","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-08T19:33:49.421779Z"},"links":{"citing_paper":"/paper/2605.01942"},"observation_digest":"sha256:aeb903fb8761e526bfcd5b4a0281ef28a155991a010926dccb4f04b76c198e4b","observation_id":"17fb4bbf-3492-4f4c-854d-c28710494ea7","resolution":{"observed_at":"2026-05-26T02:41:32.285034Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/tit.2021.3119384","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T12:15:00.875560Z","title":"Quantum LDPC codes with almost linear minimum distance","venue":null,"work_id":"b37b21ee-02bb-4731-918a-4d97e1226974","year":2022},"citing_paper":{"arxiv_id":"2605.01942","last_updated":"2026-05-03T16:00:45Z","snapshot_observed_at":"2026-07-06T23:15:07.159340Z","submitted_at":"2026-05-03T16:00:45Z","title":"Combinatorial Analysis of Dyadic and Quasi-Dyadic Codes","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-08T19:33:49.421779Z"},"links":{"citing_paper":"/paper/2605.01942"},"observation_digest":"sha256:6f3e7873fd484de443790f227e0bc157b84a9aa924764b3d789e4203f7bbe544","observation_id":"4ff8f6b8-9301-45f4-b53f-99c6be729bcd","resolution":{"observed_at":"2026-05-08T19:34:04.142579Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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":"Bounds on the minimum distance of linear codes and quantum codes","venue":null,"work_id":"e41bf014-5df6-4f3e-9df6-2e7bd08583d6","year":2007},"citing_paper":{"arxiv_id":"2605.01942","last_updated":"2026-05-03T16:00:45Z","snapshot_observed_at":"2026-07-06T23:15:07.159340Z","submitted_at":"2026-05-03T16:00:45Z","title":"Combinatorial Analysis of Dyadic and Quasi-Dyadic Codes","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-08T19:33:49.421779Z"},"links":{"citing_paper":"/paper/2605.01942"},"observation_digest":"sha256:1e7eac3690e5252f8b34d2e76976af402b6c33b00e7fcd380b0ecea6b7d93439","observation_id":"ddfbcd86-3504-484c-b728-670260d5c0a6","resolution":{"observed_at":"2026-05-26T02:41:32.291207Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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":"A necessary and sufficient condition for determining the girth of quasi-cyclic LDPC codes","venue":null,"work_id":"5a0f6c2d-c920-464f-8c25-491d02b48a07","year":2008},"citing_paper":{"arxiv_id":"2605.01942","last_updated":"2026-05-03T16:00:45Z","snapshot_observed_at":"2026-07-06T23:15:07.159340Z","submitted_at":"2026-05-03T16:00:45Z","title":"Combinatorial Analysis of Dyadic and Quasi-Dyadic Codes","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-08T19:33:49.421779Z"},"links":{"citing_paper":"/paper/2605.01942"},"observation_digest":"sha256:20645804722a784ba957d5c0cef25517a2d314b7cd819f14afa0de304149cf0c","observation_id":"aafee769-1771-49b5-863f-ee652a64996d","resolution":{"observed_at":"2026-05-26T02:41:32.275853Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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":"Loop removal from LDPC codes","venue":null,"work_id":"1e2e4481-a247-4bd4-904a-a8af12d96d7e","year":2003},"citing_paper":{"arxiv_id":"2605.01942","last_updated":"2026-05-03T16:00:45Z","snapshot_observed_at":"2026-07-06T23:15:07.159340Z","submitted_at":"2026-05-03T16:00:45Z","title":"Combinatorial Analysis of Dyadic and Quasi-Dyadic Codes","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-08T19:33:49.421779Z"},"links":{"citing_paper":"/paper/2605.01942"},"observation_digest":"sha256:9f42cc4113a8183bcfd122392d3d181cfcca4ef676d5e59e3e62e4214f9b09cc","observation_id":"d1dac9c8-8af6-46ee-857c-88cda87d48fc","resolution":{"observed_at":"2026-05-26T02:41:32.287907Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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":null,"venue":null,"work_id":"84234d32-e2dc-487d-833b-8571a2b559f8","year":1987},"citing_paper":{"arxiv_id":"2605.01942","last_updated":"2026-05-03T16:00:45Z","snapshot_observed_at":"2026-07-06T23:15:07.159340Z","submitted_at":"2026-05-03T16:00:45Z","title":"Combinatorial Analysis of Dyadic and Quasi-Dyadic Codes","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-08T19:33:49.421779Z"},"links":{"citing_paper":"/paper/2605.01942"},"observation_digest":"sha256:ff9614d086128ed39b73daa1a46ba34372e65f27194aeedde60bf0c56d40c68f","observation_id":"bc02ba64-0f2d-4dd9-9406-52982e8a153c","resolution":{"observed_at":"2026-05-26T02:41:32.300574Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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":"Design of irregular quasi-cyclic protograph codes with low error floors","venue":null,"work_id":"69870644-0101-4ab7-9099-fc60dbb9758a","year":2011},"citing_paper":{"arxiv_id":"2605.01942","last_updated":"2026-05-03T16:00:45Z","snapshot_observed_at":"2026-07-06T23:15:07.159340Z","submitted_at":"2026-05-03T16:00:45Z","title":"Combinatorial Analysis of Dyadic and Quasi-Dyadic Codes","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-08T19:33:49.421779Z"},"links":{"citing_paper":"/paper/2605.01942"},"observation_digest":"sha256:e686610ed5f617855f20d3473fa3334aef7421db7d72ee9d15ca7e37bde45083","observation_id":"7653cd65-1136-4a3f-99e1-f6ab5cd11009","resolution":{"observed_at":"2026-05-26T02:41:32.278395Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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":"Lowering the error floor of LDPC codes using cyclic liftings","venue":null,"work_id":"89e22ad2-d567-41d5-9346-5280cbdbb8b5","year":2011},"citing_paper":{"arxiv_id":"2605.01942","last_updated":"2026-05-03T16:00:45Z","snapshot_observed_at":"2026-07-06T23:15:07.159340Z","submitted_at":"2026-05-03T16:00:45Z","title":"Combinatorial Analysis of Dyadic and Quasi-Dyadic Codes","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-08T19:33:49.421779Z"},"links":{"citing_paper":"/paper/2605.01942"},"observation_digest":"sha256:4bb828fd9f21652a3b530edb53e9d5ec0f4be8b35032a2cae0747030353ca015","observation_id":"bf00789c-6197-441a-a7d4-9b45eeea90ef","resolution":{"observed_at":"2026-05-26T02:41:32.257702Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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 codes designed via algebraic lifts of graphs","venue":null,"work_id":"31ba9f49-ab0f-4d4d-a559-e0f60a114f09","year":2008},"citing_paper":{"arxiv_id":"2605.01942","last_updated":"2026-05-03T16:00:45Z","snapshot_observed_at":"2026-07-06T23:15:07.159340Z","submitted_at":"2026-05-03T16:00:45Z","title":"Combinatorial Analysis of Dyadic and Quasi-Dyadic Codes","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-08T19:33:49.421779Z"},"links":{"citing_paper":"/paper/2605.01942"},"observation_digest":"sha256:e918ee644c21ea0067b3653a5c6bdc61a4e83f4e5fec0b71ecda2ac38054ed4f","observation_id":"924b8e96-fdc6-40e5-a0f8-e2d7911dcb85","resolution":{"observed_at":"2026-05-26T02:41:32.306555Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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":"Message-passing algorithms for counting short cycles in a graph","venue":null,"work_id":"12faba79-5bac-4e98-9395-fc8e5e1065b1","year":2013},"citing_paper":{"arxiv_id":"2605.01942","last_updated":"2026-05-03T16:00:45Z","snapshot_observed_at":"2026-07-06T23:15:07.159340Z","submitted_at":"2026-05-03T16:00:45Z","title":"Combinatorial Analysis of Dyadic and Quasi-Dyadic Codes","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-08T19:33:49.421779Z"},"links":{"citing_paper":"/paper/2605.01942"},"observation_digest":"sha256:2d5ef1727884af05082febc103f7b743a1248ad4810bb6a45e29a337869de5aa","observation_id":"6d59a6af-ebf9-4251-b612-d536c7afd692","resolution":{"observed_at":"2026-05-26T02:41:32.303665Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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":"A heuristic search for good low-density parity-check codes at short block lengths","venue":null,"work_id":"528157ca-8cae-428b-ab61-ffb0cc8d971e","year":2001},"citing_paper":{"arxiv_id":"2605.01942","last_updated":"2026-05-03T16:00:45Z","snapshot_observed_at":"2026-07-06T23:15:07.159340Z","submitted_at":"2026-05-03T16:00:45Z","title":"Combinatorial Analysis of Dyadic and Quasi-Dyadic Codes","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-08T19:33:49.421779Z"},"links":{"citing_paper":"/paper/2605.01942"},"observation_digest":"sha256:161869ed82fae3e19a4fd6f3b8f7f9fa96338d1e40f329f166e1c7cdbca6ccf8","observation_id":"b685aa34-1618-4f73-a642-5720524f9695","resolution":{"observed_at":"2026-05-26T02:41:32.253977Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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":"An algorithm for counting short cycles in bipartite graphs","venue":null,"work_id":"4fe33d99-85bc-4c35-aec7-a30429a7ac63","year":2006},"citing_paper":{"arxiv_id":"2605.01942","last_updated":"2026-05-03T16:00:45Z","snapshot_observed_at":"2026-07-06T23:15:07.159340Z","submitted_at":"2026-05-03T16:00:45Z","title":"Combinatorial Analysis of Dyadic and Quasi-Dyadic Codes","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-08T19:33:49.421779Z"},"links":{"citing_paper":"/paper/2605.01942"},"observation_digest":"sha256:6b5b8a549147c90619b0edc5048c7dc9545baad3335c4fd6cd16881f12f3db07","observation_id":"a8ac1ef1-d9e4-47e3-a864-eca1b70f6571","resolution":{"observed_at":"2026-05-26T02:41:32.260673Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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 absorbing sets of structured sparse graph codes","venue":null,"work_id":"fc1553b9-6762-4eeb-8905-bbe3f3fc1518","year":2010},"citing_paper":{"arxiv_id":"2605.01942","last_updated":"2026-05-03T16:00:45Z","snapshot_observed_at":"2026-07-06T23:15:07.159340Z","submitted_at":"2026-05-03T16:00:45Z","title":"Combinatorial Analysis of Dyadic and Quasi-Dyadic Codes","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-08T19:33:49.421779Z"},"links":{"citing_paper":"/paper/2605.01942"},"observation_digest":"sha256:ee7052e152b9859368ee78efb41ab1a681ac46cfdabf60bf776d1440b7379966","observation_id":"fe448e08-042e-4aeb-9fb9-e59b0045a875","resolution":{"observed_at":"2026-05-26T02:41:32.263493Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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":"Towards improved LDPC code designs using absorbing set spectrum properties","venue":null,"work_id":"e58cff10-3da2-43bb-89c3-b1e3509b56d0","year":2010},"citing_paper":{"arxiv_id":"2605.01942","last_updated":"2026-05-03T16:00:45Z","snapshot_observed_at":"2026-07-06T23:15:07.159340Z","submitted_at":"2026-05-03T16:00:45Z","title":"Combinatorial Analysis of Dyadic and Quasi-Dyadic Codes","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-08T19:33:49.421779Z"},"links":{"citing_paper":"/paper/2605.01942"},"observation_digest":"sha256:ae8fd60f3dd86b2699a62cb406200a49b83c9a1cd23d00e0894ac85b2265a5a3","observation_id":"c2c63ceb-25d5-464c-a80d-8d36f3f54489","resolution":{"observed_at":"2026-05-26T02:41:32.251273Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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":"Absorbing sets of codes from finite geometries","venue":null,"work_id":"698f3273-e226-4c8c-9db7-ae5a2238477c","year":2019},"citing_paper":{"arxiv_id":"2605.01942","last_updated":"2026-05-03T16:00:45Z","snapshot_observed_at":"2026-07-06T23:15:07.159340Z","submitted_at":"2026-05-03T16:00:45Z","title":"Combinatorial Analysis of Dyadic and Quasi-Dyadic Codes","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-08T19:33:49.421779Z"},"links":{"citing_paper":"/paper/2605.01942"},"observation_digest":"sha256:c63d0ac4f777b8795131f316b84b399985cbc50f84cbe6034a94ac8b6e63ad18","observation_id":"4bc1632e-706a-400c-acd8-45ed3e8a570a","resolution":{"observed_at":"2026-05-26T02:41:32.237553Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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":"Analysis of syndrome-based iterative decoder failure of QLDPC codes","venue":null,"work_id":"23c95d33-0e2a-44eb-8261-9aa3160ab4a1","year":2023},"citing_paper":{"arxiv_id":"2605.01942","last_updated":"2026-05-03T16:00:45Z","snapshot_observed_at":"2026-07-06T23:15:07.159340Z","submitted_at":"2026-05-03T16:00:45Z","title":"Combinatorial Analysis of Dyadic and Quasi-Dyadic Codes","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-08T19:33:49.421779Z"},"links":{"citing_paper":"/paper/2605.01942"},"observation_digest":"sha256:80577ce5d0dad89a178b38d4793aa72d7edea8da1e3fcbe56a955d4badb9e160","observation_id":"b6a50edd-683f-4b1a-960a-554329c57f26","resolution":{"observed_at":"2026-05-26T02:41:32.241179Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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":"Reduced complexity iterative decoding of low- density parity check codes based on belief propagation","venue":null,"work_id":"230e4ae5-0f8b-43fb-b0f2-632c7958392d","year":1999},"citing_paper":{"arxiv_id":"2605.01942","last_updated":"2026-05-03T16:00:45Z","snapshot_observed_at":"2026-07-06T23:15:07.159340Z","submitted_at":"2026-05-03T16:00:45Z","title":"Combinatorial Analysis of Dyadic and Quasi-Dyadic Codes","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-08T19:33:49.421779Z"},"links":{"citing_paper":"/paper/2605.01942"},"observation_digest":"sha256:ef7ada6b2fc9205d3aeb3c6e7142e418c6633252bffa1edaef2dd3074e38c09c","observation_id":"c0312a30-4a94-46bd-8c9e-7805d621b3ec","resolution":{"observed_at":"2026-05-26T02:41:32.244786Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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":"b9173bfc-3f62-400c-90a3-f7c436893fb5","year":2022},"citing_paper":{"arxiv_id":"2605.01942","last_updated":"2026-05-03T16:00:45Z","snapshot_observed_at":"2026-07-06T23:15:07.159340Z","submitted_at":"2026-05-03T16:00:45Z","title":"Combinatorial Analysis of Dyadic and Quasi-Dyadic Codes","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-08T19:33:49.421779Z"},"links":{"citing_paper":"/paper/2605.01942"},"observation_digest":"sha256:c1063b325a2d5b7168038a80f7256f0a2584e14dbf50891ff7592bea65632d90","observation_id":"9b39de60-300d-48d5-aa76-e1b8cec0124c","resolution":{"observed_at":"2026-05-26T02:41:32.248082Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2605.01942","last_updated":"2026-05-03T16:00:45Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-07-06T23:15:07.159340Z","submitted_at":"2026-05-03T16:00:45Z","title":"Combinatorial Analysis of Dyadic and Quasi-Dyadic Codes"},"reference_resolution":{"displayed":35,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":5,"verified_fuzzy":29},"total_outbound_references":35},"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-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"thesis":"As of 4 August 2026, this Paper Citation Record lists 35 of 35 outbound references and 1 inbound Pith citation observation for arXiv:2605.01942."}