{"as_of":"2026-08-10T09:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:707d0113e697dec7f2127e7b1cacd4c2256a7eff2c2b4a18168591d8cbeee885","coverage":[{"denominator":39,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":39,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T21:28:23.086039Z","state":"measured"},{"denominator":46,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":46,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":7,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T10:47:12.392532Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":0,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2507.00254","last_updated":"2026-02-10T16:10:46Z","snapshot_observed_at":"2026-08-06T21:18:08.311292Z","submitted_at":"2025-06-30T20:47:28Z","title":"Fully Parallelized BP Decoding for Quantum LDPC Codes Can Outperform BP-OSD","version":3},"cited_work":{"arxiv_id":"2507.00254","doi":"10.48550/arxiv.2507.00254","metadata_source":"arxiv_reference","pith_arxiv_id":"2507.00254","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fully parallelized bp decod- ing for quantum ldpc codes can outperform bp-osd","venue":"arXiv (Cornell University)","work_id":"6ae73b2e-9362-406f-b491-5ceb266b4f45","year":2026},"citing_paper":{"arxiv_id":"2509.01892","last_updated":"2026-04-17T16:32:39Z","snapshot_observed_at":"2026-08-07T08:32:01.737029Z","submitted_at":"2025-09-02T02:30:02Z","title":"Accelerating BP-based decoders for QLDPC Codes with Local Syndrome-Based Preprocessing","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-05-18T20:26:16.981457Z"},"links":{"cited_paper":"/paper/2507.00254","citing_paper":"/paper/2509.01892"},"observation_digest":"sha256:6bfc6f812b358bb68e3e8d2435c31f78377e15a446061f1768fceea93003ddbe","observation_id":"bd04526a-a335-4c3e-a1cd-ff2195e3f68f","resolution":{"observed_at":"2026-07-29T01:24:23.835287Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-07-18T09:21:05.094478+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-18T09:21:05.094478+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.00254","last_updated":"2026-02-10T16:10:46Z","snapshot_observed_at":"2026-08-06T21:18:08.311292Z","submitted_at":"2025-06-30T20:47:28Z","title":"Fully Parallelized BP Decoding for Quantum LDPC Codes Can Outperform BP-OSD","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.00254","snapshot_observed_at":"2026-08-04T10:47:12.392532Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.08695","last_updated":"2026-07-08T05:33:05Z","snapshot_observed_at":"2026-08-08T12:27:05.745065Z","submitted_at":"2025-10-09T18:01:30Z","title":"Degeneracy Cutting: A Local and Efficient Post-Processing for Belief Propagation Decoding of Quantum Low-Density Parity-Check Codes","version":2},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.392532Z"},"links":{"cited_paper":"/paper/2507.00254","citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:aa1cb82cd5998ff7f8c503c085e5fef76474c77ae2262f49d6b73330231879de","observation_id":"bb7e520e-f76f-4510-be95-d229ac152014","resolution":{"observed_at":"2026-08-04T10:47:12.392532Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.00254","last_updated":"2026-02-10T16:10:46Z","snapshot_observed_at":"2026-08-06T21:18:08.311292Z","submitted_at":"2025-06-30T20:47:28Z","title":"Fully Parallelized BP Decoding for Quantum LDPC Codes Can Outperform BP-OSD","version":3},"cited_work":{"arxiv_id":"2507.00254","doi":"10.48550/arxiv.2507.00254","metadata_source":"arxiv_reference","pith_arxiv_id":"2507.00254","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fully parallelized bp decod- ing for quantum ldpc codes can outperform bp-osd","venue":"arXiv (Cornell University)","work_id":"6ae73b2e-9362-406f-b491-5ceb266b4f45","year":2026},"citing_paper":{"arxiv_id":"2604.21468","last_updated":"2026-07-01T05:02:10Z","snapshot_observed_at":"2026-08-07T22:10:34.893183Z","submitted_at":"2026-04-23T09:28:19Z","title":"Novelty-Based Generation of Continuous Landscapes with Diverse Local Optima Networks","version":2},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-07-05T01:27:19.545404Z"},"links":{"cited_paper":"/paper/2507.00254","citing_paper":"/paper/2604.21468"},"observation_digest":"sha256:6648d9e501edcf4e0d1a524de2ebd5c31272eecad9c9ffc4bd0b4d2cd09fc44d","observation_id":"c078d7ca-93ff-4810-ab74-60374f2aaa74","resolution":{"observed_at":"2026-07-29T01:24:23.835287Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-07-18T09:21:05.094478+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-18T09:21:05.094478+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.00254","last_updated":"2026-02-10T16:10:46Z","snapshot_observed_at":"2026-08-06T21:18:08.311292Z","submitted_at":"2025-06-30T20:47:28Z","title":"Fully Parallelized BP Decoding for Quantum LDPC Codes Can Outperform BP-OSD","version":3},"cited_work":{"arxiv_id":"2507.00254","doi":"10.48550/arxiv.2507.00254","metadata_source":"arxiv_reference","pith_arxiv_id":"2507.00254","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fully parallelized bp decod- ing for quantum ldpc codes can outperform bp-osd","venue":"arXiv (Cornell University)","work_id":"6ae73b2e-9362-406f-b491-5ceb266b4f45","year":2026},"citing_paper":{"arxiv_id":"2604.21472","last_updated":"2026-06-03T02:27:08Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-23T09:30:00Z","title":"LightStim: A Framework for QEC Protocol Evaluation and Prototyping with Automated DEM Construction","version":1},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-05-09T22:30:01.774437Z"},"links":{"cited_paper":"/paper/2507.00254","citing_paper":"/paper/2604.21472"},"observation_digest":"sha256:bd602b4aad015a3e5072523aa9ea00de57dbd709a466e6d0ef8b515a53e0f1a0","observation_id":"62119ef7-a5f0-4764-acb8-7bb4f0a93c16","resolution":{"observed_at":"2026-07-29T01:24:23.835287Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-07-18T09:21:05.094478+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-18T09:21:05.094478+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.00254","last_updated":"2026-02-10T16:10:46Z","snapshot_observed_at":"2026-08-06T21:18:08.311292Z","submitted_at":"2025-06-30T20:47:28Z","title":"Fully Parallelized BP Decoding for Quantum LDPC Codes Can Outperform BP-OSD","version":3},"cited_work":{"arxiv_id":"2507.00254","doi":"10.48550/arxiv.2507.00254","metadata_source":"arxiv_reference","pith_arxiv_id":"2507.00254","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fully parallelized bp decod- ing for quantum ldpc codes can outperform bp-osd","venue":"arXiv (Cornell University)","work_id":"6ae73b2e-9362-406f-b491-5ceb266b4f45","year":2026},"citing_paper":{"arxiv_id":"2605.03951","last_updated":"2026-05-05T16:37:52Z","snapshot_observed_at":"2026-07-06T23:16:49.553583Z","submitted_at":"2026-05-05T16:37:52Z","title":"Factoring $2048$ bit RSA integers with a half-million-qubit modular atomic processor","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-07T16:27:43.867877Z"},"links":{"cited_paper":"/paper/2507.00254","citing_paper":"/paper/2605.03951"},"observation_digest":"sha256:a283d47866caa2bf85887038f7fcfff3bff4880cff90c9c5f008383963dad601","observation_id":"40fc96e7-5dce-4fcc-bc93-9e666fad1e93","resolution":{"observed_at":"2026-07-29T01:24:23.835287Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-07-18T09:21:05.094478+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-18T09:21:05.094478+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.00254","last_updated":"2026-02-10T16:10:46Z","snapshot_observed_at":"2026-08-06T21:18:08.311292Z","submitted_at":"2025-06-30T20:47:28Z","title":"Fully Parallelized BP Decoding for Quantum LDPC Codes Can Outperform BP-OSD","version":3},"cited_work":{"arxiv_id":"2507.00254","doi":"10.48550/arxiv.2507.00254","metadata_source":"arxiv_reference","pith_arxiv_id":"2507.00254","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fully parallelized bp decod- ing for quantum ldpc codes can outperform bp-osd","venue":"arXiv (Cornell University)","work_id":"6ae73b2e-9362-406f-b491-5ceb266b4f45","year":2026},"citing_paper":{"arxiv_id":"2606.20926","last_updated":"2026-06-18T20:38:03Z","snapshot_observed_at":"2026-08-05T00:51:27.699339Z","submitted_at":"2026-06-18T20:38:03Z","title":"Learning-Based List Sequential Belief Propagation Decoding of Quantum LDPC Codes","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-26T15:05:36.951330Z"},"links":{"cited_paper":"/paper/2507.00254","citing_paper":"/paper/2606.20926"},"observation_digest":"sha256:65576e2929270294af22efa0668bcddc4162260284e0f893b6344d65eb0bc25c","observation_id":"7261412d-a382-46bd-b31b-c6cea72a61af","resolution":{"observed_at":"2026-07-29T01:24:23.835287Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-07-18T09:21:05.094478+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-18T09:21:05.094478+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.00254","last_updated":"2026-02-10T16:10:46Z","snapshot_observed_at":"2026-08-06T21:18:08.311292Z","submitted_at":"2025-06-30T20:47:28Z","title":"Fully Parallelized BP Decoding for Quantum LDPC Codes Can Outperform BP-OSD","version":3},"cited_work":{"arxiv_id":"2507.00254","doi":"10.48550/arxiv.2507.00254","metadata_source":"arxiv_reference","pith_arxiv_id":"2507.00254","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fully parallelized bp decod- ing for quantum ldpc codes can outperform bp-osd","venue":"arXiv (Cornell University)","work_id":"6ae73b2e-9362-406f-b491-5ceb266b4f45","year":2026},"citing_paper":{"arxiv_id":"2607.08386","last_updated":"2026-07-09T12:05:00Z","snapshot_observed_at":"2026-08-03T19:49:16.659516Z","submitted_at":"2026-07-09T12:05:00Z","title":"Parallel QEC Decoding Applied to Distributed Quantum Computing","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-10T08:18:31.237361Z"},"links":{"cited_paper":"/paper/2507.00254","citing_paper":"/paper/2607.08386"},"observation_digest":"sha256:5e4467338d008cacab529202c55d70bcd3e25eeee6e39b4394988657c604410d","observation_id":"2f804f72-45e7-469e-b5db-3b2c9c88090b","resolution":{"observed_at":"2026-07-29T01:24:23.835287Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-07-18T09:21:05.094478+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-18T09:21:05.094478+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2507.00254/citation-record","integrity":"/paper/2507.00254/integrity","json":"/paper/2507.00254/citation-record.json","paper":"/paper/2507.00254"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:28:28.484317Z","title":"On the inherent intractability of certain coding problems (corresp.),","venue":null,"work_id":"25c9d523-8258-4536-b47c-99f1c701207e","year":1978},"citing_paper":{"arxiv_id":"2507.00254","last_updated":"2026-02-10T16:10:46Z","snapshot_observed_at":"2026-08-06T21:18:08.311292Z","submitted_at":"2025-06-30T20:47:28Z","title":"Fully Parallelized BP Decoding for Quantum LDPC Codes Can Outperform BP-OSD","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:20.629411Z"},"links":{"citing_paper":"/paper/2507.00254"},"observation_digest":"sha256:001d4c9b339b8e40e61d1cbf49f6734e7dd88f4c963a530c781deaa564de5a78","observation_id":"5e4ff5cb-1eee-41df-a458-f965e9480ceb","resolution":{"observed_at":"2026-08-06T21:28:28.634743Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:28:28.246171Z","title":"High-threshold and low-overhead fault-tolerant quantum memory,","venue":null,"work_id":"8986be00-85e4-437f-84a1-fde9f11bc922","year":2024},"citing_paper":{"arxiv_id":"2507.00254","last_updated":"2026-02-10T16:10:46Z","snapshot_observed_at":"2026-08-06T21:18:08.311292Z","submitted_at":"2025-06-30T20:47:28Z","title":"Fully Parallelized BP Decoding for Quantum LDPC Codes Can Outperform BP-OSD","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:20.716031Z"},"links":{"citing_paper":"/paper/2507.00254"},"observation_digest":"sha256:78c3c99f558e331d666edbe7c6d5a8e1ad2d0fb56e912de4ba28f2d92c989eab","observation_id":"90275317-5c13-423b-b2e6-d7d172d2abcf","resolution":{"observed_at":"2026-08-06T21:28:28.353601Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:28:20.870945Z","title":"Class of algorithms for decoding block codes with channel measurement information,","venue":null,"work_id":null,"year":1972},"citing_paper":{"arxiv_id":"2507.00254","last_updated":"2026-02-10T16:10:46Z","snapshot_observed_at":"2026-08-06T21:18:08.311292Z","submitted_at":"2025-06-30T20:47:28Z","title":"Fully Parallelized BP Decoding for Quantum LDPC Codes Can Outperform BP-OSD","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:20.870945Z"},"links":{"citing_paper":"/paper/2507.00254"},"observation_digest":"sha256:ab638c97ba4569a2999ff937d4f428b435bc0684727a4a6619f5fb709143e4e4","observation_id":"dfccad90-6e2a-47dc-8a65-0c59a14419cd","resolution":{"observed_at":"2026-08-06T21:28:20.870945Z","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-06T21:28:20.993255Z","title":"Improved Belief Propagation Decoding Algorithms for Surface Codes ,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.00254","last_updated":"2026-02-10T16:10:46Z","snapshot_observed_at":"2026-08-06T21:18:08.311292Z","submitted_at":"2025-06-30T20:47:28Z","title":"Fully Parallelized BP Decoding for Quantum LDPC Codes Can Outperform BP-OSD","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:20.993255Z"},"links":{"citing_paper":"/paper/2507.00254"},"observation_digest":"sha256:571654d3a594e79fbb30f0d070d95681e19489ac2fa3b76f2ed8e53cbfbc653f","observation_id":"64374632-ff28-4d19-8aa6-f8a9fad0ed5b","resolution":{"observed_at":"2026-08-06T21:28:20.993255Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:28:27.982653Z","title":"Enhanced message-passing decoding of degenerate quantum codes utilizing trapping set dynamics,","venue":null,"work_id":"0c35ff83-c11f-4398-a3a5-daf9235e64bd","year":2024},"citing_paper":{"arxiv_id":"2507.00254","last_updated":"2026-02-10T16:10:46Z","snapshot_observed_at":"2026-08-06T21:18:08.311292Z","submitted_at":"2025-06-30T20:47:28Z","title":"Fully Parallelized BP Decoding for Quantum LDPC Codes Can Outperform BP-OSD","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:21.103123Z"},"links":{"citing_paper":"/paper/2507.00254"},"observation_digest":"sha256:4154377339d4af66dcec50b6edbf3813ee6534df728ed072cf23f71c4550838b","observation_id":"93172b54-62a4-44a4-b145-47467afeacbc","resolution":{"observed_at":"2026-08-06T21:28:28.118509Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:28:21.239578Z","title":"Lilliput: a lightweight low- latency lookup-table decoder for near-term quantum error correction,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.00254","last_updated":"2026-02-10T16:10:46Z","snapshot_observed_at":"2026-08-06T21:18:08.311292Z","submitted_at":"2025-06-30T20:47:28Z","title":"Fully Parallelized BP Decoding for Quantum LDPC Codes Can Outperform BP-OSD","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:21.239578Z"},"links":{"citing_paper":"/paper/2507.00254"},"observation_digest":"sha256:95b14f152772d0d6753b9c6d7da44306abb51fc27948e226077a5398c451c3e5","observation_id":"ce5ca826-1b6f-47bb-a96e-63020b1bcc27","resolution":{"observed_at":"2026-08-06T21:28:21.239578Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:28:27.718488Z","title":"Afs: Accurate, fast, and scalable error- decoding for fault-tolerant quantum computers,","venue":null,"work_id":"5e2083e8-1afd-4033-80a6-bec7fbf8db48","year":2022},"citing_paper":{"arxiv_id":"2507.00254","last_updated":"2026-02-10T16:10:46Z","snapshot_observed_at":"2026-08-06T21:18:08.311292Z","submitted_at":"2025-06-30T20:47:28Z","title":"Fully Parallelized BP Decoding for Quantum LDPC Codes Can Outperform BP-OSD","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:21.375736Z"},"links":{"citing_paper":"/paper/2507.00254"},"observation_digest":"sha256:37cb805f6e062d7b967b61fbf8023ccd8012db1b380f319683440232666394a6","observation_id":"6d88a9b0-4a3b-4ebd-a93d-cf5376b56006","resolution":{"observed_at":"2026-08-06T21:28:27.839748Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:28:27.471836Z","title":"Low cost ldpc decoder for dvb-s2,","venue":null,"work_id":"f19078ed-2bf9-49c9-b477-6f1f417ff99d","year":2006},"citing_paper":{"arxiv_id":"2507.00254","last_updated":"2026-02-10T16:10:46Z","snapshot_observed_at":"2026-08-06T21:18:08.311292Z","submitted_at":"2025-06-30T20:47:28Z","title":"Fully Parallelized BP Decoding for Quantum LDPC Codes Can Outperform BP-OSD","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:21.483770Z"},"links":{"citing_paper":"/paper/2507.00254"},"observation_digest":"sha256:247602d95aa8f2540f99f01cf75364e0be09673a28918629f3fc2212b5a303d1","observation_id":"1ccb507b-4fd5-4b51-9ac2-defb909ad965","resolution":{"observed_at":"2026-08-06T21:28:27.565249Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/tcomm.2009.07.070621","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Improved random redundant iterative hdpc decoding,","venue":"IEEE Transactions on Communications","work_id":"9da7755e-5699-4a05-ba27-6652bdb84908","year":1982},"citing_paper":{"arxiv_id":"2507.00254","last_updated":"2026-02-10T16:10:46Z","snapshot_observed_at":"2026-08-06T21:18:08.311292Z","submitted_at":"2025-06-30T20:47:28Z","title":"Fully Parallelized BP Decoding for Quantum LDPC Codes Can Outperform BP-OSD","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:21.607501Z"},"links":{"citing_paper":"/paper/2507.00254"},"observation_digest":"sha256:6965e0ff5dbead76f64633a217b52ad26a98391974151f3be61eb33dfe7b3646","observation_id":"fe2aeeec-8ba5-4247-a633-dd5748868b42","resolution":{"observed_at":"2026-08-06T21:28:23.234452Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:28:21.680810Z","title":"Stim: a fast stabilizer circuit simulator,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.00254","last_updated":"2026-02-10T16:10:46Z","snapshot_observed_at":"2026-08-06T21:18:08.311292Z","submitted_at":"2025-06-30T20:47:28Z","title":"Fully Parallelized BP Decoding for Quantum LDPC Codes Can Outperform BP-OSD","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:21.680810Z"},"links":{"citing_paper":"/paper/2507.00254"},"observation_digest":"sha256:c786beda32a5cbd048d5bd756ee6f47f92a5cccbdf52b832d729007eb4d6cfb4","observation_id":"b1475c5b-af50-47ac-aa5d-0c0c7b2f714e","resolution":{"observed_at":"2026-08-06T21:28:21.680810Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.18901","last_updated":"2024-03-27T18:00:04Z","snapshot_observed_at":"2026-08-07T04:55:20.799391Z","submitted_at":"2024-03-27T18:00:04Z","title":"Toward Low-latency Iterative Decoding of QLDPC Codes Under Circuit-Level Noise","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.18901","snapshot_observed_at":"2026-08-06T21:28:21.719800Z","title":"Toward low-latency iterative decoding of qldpc codes under circuit-level noise,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.00254","last_updated":"2026-02-10T16:10:46Z","snapshot_observed_at":"2026-08-06T21:18:08.311292Z","submitted_at":"2025-06-30T20:47:28Z","title":"Fully Parallelized BP Decoding for Quantum LDPC Codes Can Outperform BP-OSD","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:21.719800Z"},"links":{"cited_paper":"/paper/2403.18901","citing_paper":"/paper/2507.00254"},"observation_digest":"sha256:7da52edf10bfb3a5f0ad2bb3be4eb91d304e50346dc3e20b310fed982b755056","observation_id":"de06ed66-6f73-441b-8a47-2fe65e4b92e2","resolution":{"observed_at":"2026-08-06T21:28:21.719800Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:28:27.229424Z","title":"Random redundant soft-in soft-out decoding of linear block codes,","venue":null,"work_id":"e495f96a-e25a-42cf-8579-6b997f553c7b","year":2006},"citing_paper":{"arxiv_id":"2507.00254","last_updated":"2026-02-10T16:10:46Z","snapshot_observed_at":"2026-08-06T21:18:08.311292Z","submitted_at":"2025-06-30T20:47:28Z","title":"Fully Parallelized BP Decoding for Quantum LDPC Codes Can Outperform BP-OSD","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:21.765318Z"},"links":{"citing_paper":"/paper/2507.00254"},"observation_digest":"sha256:69797e47b5dec5f9bf9da2ba78845f7fa364b4f8e634a7f78258e8e854ed3252","observation_id":"533587c8-8fb6-40ba-a4fb-34e1b8368c43","resolution":{"observed_at":"2026-08-06T21:28:27.337387Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:28:21.829972Z","title":"Localized statistics decoding: A parallel decoding algo- rithm for quantum low-density parity-check codes,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.00254","last_updated":"2026-02-10T16:10:46Z","snapshot_observed_at":"2026-08-06T21:18:08.311292Z","submitted_at":"2025-06-30T20:47:28Z","title":"Fully Parallelized BP Decoding for Quantum LDPC Codes Can Outperform BP-OSD","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:21.829972Z"},"links":{"citing_paper":"/paper/2507.00254"},"observation_digest":"sha256:87fefe623116f2d4f29048c4414493eefc3b15862e570afda448c3cff04ab843","observation_id":"482197d8-0894-4775-90e5-44e7eebe99c0","resolution":{"observed_at":"2026-08-06T21:28:21.829972Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:28:26.936001Z","title":"Hardness of decoding quantum stabilizer codes,","venue":null,"work_id":"52a02544-3ed7-45c8-b6e0-7f5f939cc1ab","year":null},"citing_paper":{"arxiv_id":"2507.00254","last_updated":"2026-02-10T16:10:46Z","snapshot_observed_at":"2026-08-06T21:18:08.311292Z","submitted_at":"2025-06-30T20:47:28Z","title":"Fully Parallelized BP Decoding for Quantum LDPC Codes Can Outperform BP-OSD","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:21.904990Z"},"links":{"citing_paper":"/paper/2507.00254"},"observation_digest":"sha256:ecf475ef445777487e407198dee99db5bc49045695b0ee1f1efc79807a8727ee","observation_id":"8554e2a5-1df3-4909-84c1-934f4a2783af","resolution":{"observed_at":"2026-08-06T21:28:27.030017Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"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-06T21:28:22.007744Z","title":"Auto- morphism ensemble decoding of quantum ldpc codes,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.00254","last_updated":"2026-02-10T16:10:46Z","snapshot_observed_at":"2026-08-06T21:18:08.311292Z","submitted_at":"2025-06-30T20:47:28Z","title":"Fully Parallelized BP Decoding for Quantum LDPC Codes Can Outperform BP-OSD","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:22.007744Z"},"links":{"cited_paper":"/paper/2503.01738","citing_paper":"/paper/2507.00254"},"observation_digest":"sha256:7986f7a5de7fe1f047cad2127d57c5722f3a383b800986518506f0dc6335bc32","observation_id":"f2b07ff6-9b4d-4244-a18b-7062f54d3698","resolution":{"observed_at":"2026-08-06T21:28:22.007744Z","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-06T21:28:22.059426Z","title":"Computing efficiently in qldpc codes,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.00254","last_updated":"2026-02-10T16:10:46Z","snapshot_observed_at":"2026-08-06T21:18:08.311292Z","submitted_at":"2025-06-30T20:47:28Z","title":"Fully Parallelized BP Decoding for Quantum LDPC Codes Can Outperform BP-OSD","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:22.059426Z"},"links":{"citing_paper":"/paper/2507.00254"},"observation_digest":"sha256:04696b32325cc2f8c1b55bcdae803253d082ba19c269183365fefd73632d5c0f","observation_id":"a56d9cd6-d9e6-4340-956f-9946d4e1ab5c","resolution":{"observed_at":"2026-08-06T21:28:22.059426Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.01779","last_updated":"2025-08-22T12:35:33Z","snapshot_observed_at":"2026-08-07T11:31:27.391798Z","submitted_at":"2025-06-02T15:23:00Z","title":"Improved belief propagation is sufficient for real-time decoding of quantum memory","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.01779","snapshot_observed_at":"2026-08-06T21:28:22.087640Z","title":"Improved belief propagation is sufficient for real-time decoding of quantum memory,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.00254","last_updated":"2026-02-10T16:10:46Z","snapshot_observed_at":"2026-08-06T21:18:08.311292Z","submitted_at":"2025-06-30T20:47:28Z","title":"Fully Parallelized BP Decoding for Quantum LDPC Codes Can Outperform BP-OSD","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:22.087640Z"},"links":{"cited_paper":"/paper/2506.01779","citing_paper":"/paper/2507.00254"},"observation_digest":"sha256:06a38911565c7f85c4fb6741c8e1c3a05eeb249e921dcd7a2314e600ac7a5e06","observation_id":"e01eb043-2d4b-44fa-b58c-53de12156da0","resolution":{"observed_at":"2026-08-06T21:28:22.087640Z","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-06T21:28:22.137172Z","title":"Degenerate quantum LDPC codes with good finite length performance,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.00254","last_updated":"2026-02-10T16:10:46Z","snapshot_observed_at":"2026-08-06T21:18:08.311292Z","submitted_at":"2025-06-30T20:47:28Z","title":"Fully Parallelized BP Decoding for Quantum LDPC Codes Can Outperform BP-OSD","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:22.137172Z"},"links":{"citing_paper":"/paper/2507.00254"},"observation_digest":"sha256:36753a14c993e97cfd104ed8bbe812ec8dd2baab163da3f1a91b6211a77ce9c6","observation_id":"1108c120-5797-4303-a774-3de93407f451","resolution":{"observed_at":"2026-08-06T21:28:22.137172Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"0801.1241","last_updated":"2008-07-01T15:09:21Z","snapshot_observed_at":"2026-08-03T02:16:55.914959Z","submitted_at":"2008-01-08T14:25:30Z","title":"On the iterative decoding of sparse quantum codes","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0801.1241","snapshot_observed_at":"2026-08-06T21:28:22.180133Z","title":"On the iterative decoding of sparse quantum codes,","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2507.00254","last_updated":"2026-02-10T16:10:46Z","snapshot_observed_at":"2026-08-06T21:18:08.311292Z","submitted_at":"2025-06-30T20:47:28Z","title":"Fully Parallelized BP Decoding for Quantum LDPC Codes Can Outperform BP-OSD","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:22.180133Z"},"links":{"cited_paper":"/paper/0801.1241","citing_paper":"/paper/2507.00254"},"observation_digest":"sha256:355fa17744f83bcbe55cad140d49d459fb01ccded9cf53ad8ce9a6dc19cb9429","observation_id":"41434ded-8b94-4294-bbe3-b2a2479abbd8","resolution":{"observed_at":"2026-08-06T21:28:22.180133Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:28:26.582553Z","title":"Trapping sets of quantum ldpc codes,","venue":null,"work_id":"d9da94b6-68a9-49f4-ac4f-e8d0e69b27db","year":2021},"citing_paper":{"arxiv_id":"2507.00254","last_updated":"2026-02-10T16:10:46Z","snapshot_observed_at":"2026-08-06T21:18:08.311292Z","submitted_at":"2025-06-30T20:47:28Z","title":"Fully Parallelized BP Decoding for Quantum LDPC Codes Can Outperform BP-OSD","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:22.215929Z"},"links":{"citing_paper":"/paper/2507.00254"},"observation_digest":"sha256:0ae24a39af758d55338cab67f8efb849fd6c90779e626eaaa954493a5b408c7d","observation_id":"541c5a56-9d21-41bc-92ad-f7d1dedf3fb4","resolution":{"observed_at":"2026-08-06T21:28:26.726397Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:28:26.333925Z","title":"Design of capacity- approaching irregular low-density parity-check codes,","venue":null,"work_id":"aabb56f1-e9fc-4cbd-9061-e4bbc238bc34","year":2001},"citing_paper":{"arxiv_id":"2507.00254","last_updated":"2026-02-10T16:10:46Z","snapshot_observed_at":"2026-08-06T21:18:08.311292Z","submitted_at":"2025-06-30T20:47:28Z","title":"Fully Parallelized BP Decoding for Quantum LDPC Codes Can Outperform BP-OSD","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:22.238848Z"},"links":{"citing_paper":"/paper/2507.00254"},"observation_digest":"sha256:a6b9a091f9172f3ce289540d1b22adb126565be565ff2b429740545271e8ae5f","observation_id":"5c7d4f0c-a107-4074-86fd-c1f7488bd24c","resolution":{"observed_at":"2026-08-06T21:28:26.423261Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:28:22.272213Z","title":"LDPC: Python tools for low density parity check codes,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.00254","last_updated":"2026-02-10T16:10:46Z","snapshot_observed_at":"2026-08-06T21:18:08.311292Z","submitted_at":"2025-06-30T20:47:28Z","title":"Fully Parallelized BP Decoding for Quantum LDPC Codes Can Outperform BP-OSD","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:22.272213Z"},"links":{"citing_paper":"/paper/2507.00254"},"observation_digest":"sha256:a113f58e3323fc00c688940b4855927412c60e7099d82860e3d4f793f5eafd20","observation_id":"0eba1d16-a7bf-4f87-95b1-226a115dd58f","resolution":{"observed_at":"2026-08-06T21:28:22.272213Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:28:26.066732Z","title":"Decoding across the quantum low-density parity-check code landscape,","venue":null,"work_id":"2cd15f41-2855-44bc-9926-2fc1c9ececb1","year":2020},"citing_paper":{"arxiv_id":"2507.00254","last_updated":"2026-02-10T16:10:46Z","snapshot_observed_at":"2026-08-06T21:18:08.311292Z","submitted_at":"2025-06-30T20:47:28Z","title":"Fully Parallelized BP Decoding for Quantum LDPC Codes Can Outperform BP-OSD","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:22.329861Z"},"links":{"citing_paper":"/paper/2507.00254"},"observation_digest":"sha256:7ac35b4bc47585c46419443625377c5b1dd37563fbcf83f9b02ad7aa961d2b37","observation_id":"209d5ca2-fe59-4795-83af-e5cecb0c2632","resolution":{"observed_at":"2026-08-06T21:28:26.182415Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:28:22.356476Z","title":"A 58.6/91.3 pj/b dual-mode belief-propagation decoder for ldpc and polar codes in the 5g communi- cations standard,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.00254","last_updated":"2026-02-10T16:10:46Z","snapshot_observed_at":"2026-08-06T21:18:08.311292Z","submitted_at":"2025-06-30T20:47:28Z","title":"Fully Parallelized BP Decoding for Quantum LDPC Codes Can Outperform BP-OSD","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:22.356476Z"},"links":{"citing_paper":"/paper/2507.00254"},"observation_digest":"sha256:a7d4b280b669b96357d40a7d8badd19d2f5313cfddbe9c96de0ce7ec18372511","observation_id":"41d7204b-1767-49ad-874e-030c05c1e378","resolution":{"observed_at":"2026-08-06T21:28:22.356476Z","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-06T21:28:22.407015Z","title":"Quantum error correction for quantum memories,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2507.00254","last_updated":"2026-02-10T16:10:46Z","snapshot_observed_at":"2026-08-06T21:18:08.311292Z","submitted_at":"2025-06-30T20:47:28Z","title":"Fully Parallelized BP Decoding for Quantum LDPC Codes Can Outperform BP-OSD","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:22.407015Z"},"links":{"citing_paper":"/paper/2507.00254"},"observation_digest":"sha256:0f2165d2fd4fa8ec3a5a3a97c2b1bedc207619bd920006c9d290d7cf462b1ba9","observation_id":"b559008b-0e8a-42d7-8f7a-bf29744d93ed","resolution":{"observed_at":"2026-08-06T21:28:22.407015Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:28:25.767215Z","title":"[Online]","venue":null,"work_id":"01102ecf-cf1a-4cfa-8864-4c0c6e8e74e3","year":2024},"citing_paper":{"arxiv_id":"2507.00254","last_updated":"2026-02-10T16:10:46Z","snapshot_observed_at":"2026-08-06T21:18:08.311292Z","submitted_at":"2025-06-30T20:47:28Z","title":"Fully Parallelized BP Decoding for Quantum LDPC Codes Can Outperform BP-OSD","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:22.471410Z"},"links":{"citing_paper":"/paper/2507.00254"},"observation_digest":"sha256:3c85522c1e22c3f39173f9e1cba2c438c23fdda7a9ad3df270276255a6bc4ff9","observation_id":"73fa988f-6d5b-41ec-bf0c-07fac280b047","resolution":{"observed_at":"2026-08-06T21:28:25.928263Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:28:25.502366Z","title":"Quantum ldpc codes with positive rate and minimum distance proportional to the square root of the blocklength,","venue":null,"work_id":"74f931e6-af1c-47fa-ab07-8b8a329f1891","year":2014},"citing_paper":{"arxiv_id":"2507.00254","last_updated":"2026-02-10T16:10:46Z","snapshot_observed_at":"2026-08-06T21:18:08.311292Z","submitted_at":"2025-06-30T20:47:28Z","title":"Fully Parallelized BP Decoding for Quantum LDPC Codes Can Outperform BP-OSD","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:22.517374Z"},"links":{"citing_paper":"/paper/2507.00254"},"observation_digest":"sha256:7b43a0afcb7bf8b599aece045a9424bae4f23af77d48d68ad3e32f9eac91f0f8","observation_id":"ca60630e-7793-4496-b180-ad052b10adc6","resolution":{"observed_at":"2026-08-06T21:28:25.611906Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:28:25.286604Z","title":"Syndrome- based min-sum vs osd-0 decoders: Fpga implementation and analysis for quantum ldpc codes,","venue":null,"work_id":"2366eb48-4459-4cea-aa85-c93fe30f9a91","year":2021},"citing_paper":{"arxiv_id":"2507.00254","last_updated":"2026-02-10T16:10:46Z","snapshot_observed_at":"2026-08-06T21:18:08.311292Z","submitted_at":"2025-06-30T20:47:28Z","title":"Fully Parallelized BP Decoding for Quantum LDPC Codes Can Outperform BP-OSD","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:22.581963Z"},"links":{"citing_paper":"/paper/2507.00254"},"observation_digest":"sha256:aba5361ac4f2b4f62e34e54c53b0a81e087c7ea0d2feb2c412f6e6b3871bc774","observation_id":"34bc15ec-4de6-4e06-857c-aca163f966eb","resolution":{"observed_at":"2026-08-06T21:28:25.353352Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:28:22.635177Z","title":"Swiper: Minimizing fault-tolerant quantum program latency via speculative window decoding,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.00254","last_updated":"2026-02-10T16:10:46Z","snapshot_observed_at":"2026-08-06T21:18:08.311292Z","submitted_at":"2025-06-30T20:47:28Z","title":"Fully Parallelized BP Decoding for Quantum LDPC Codes Can Outperform BP-OSD","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:22.635177Z"},"links":{"citing_paper":"/paper/2507.00254"},"observation_digest":"sha256:e0ebe5b9a2082224353db8b58dee57e0b9502388393d9745aa17cc3c81d7c0cf","observation_id":"307a3187-2c3f-413f-bed9-c6832afabf05","resolution":{"observed_at":"2026-08-06T21:28:22.635177Z","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-06T21:28:22.696171Z","title":"Astrea: Accurate quantum error-decoding via practical minimum-weight perfect-matching,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.00254","last_updated":"2026-02-10T16:10:46Z","snapshot_observed_at":"2026-08-06T21:18:08.311292Z","submitted_at":"2025-06-30T20:47:28Z","title":"Fully Parallelized BP Decoding for Quantum LDPC Codes Can Outperform BP-OSD","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:22.696171Z"},"links":{"citing_paper":"/paper/2507.00254"},"observation_digest":"sha256:49683aa36c835f47e8938feb354d358d37731074c700792a4ea1c7f332c9f59a","observation_id":"8b1a4948-e7a4-4b5e-bbe9-3e539edb3e7d","resolution":{"observed_at":"2026-08-06T21:28:22.696171Z","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-06T21:28:22.743061Z","title":"Flag-Proxy Networks: Overcoming the Architectural, Scheduling and Decoding Obstacles of Quantum LDPC Codes ,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.00254","last_updated":"2026-02-10T16:10:46Z","snapshot_observed_at":"2026-08-06T21:18:08.311292Z","submitted_at":"2025-06-30T20:47:28Z","title":"Fully Parallelized BP Decoding for Quantum LDPC Codes Can Outperform BP-OSD","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:22.743061Z"},"links":{"citing_paper":"/paper/2507.00254"},"observation_digest":"sha256:c615cfcff66dd675f3fa570f0a330e34d37d4d7e3d365a92f29d85f97607e81b","observation_id":"0cc0e933-5725-4666-a428-db7426f01aeb","resolution":{"observed_at":"2026-08-06T21:28:22.743061Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:28:25.035011Z","title":"Neural layered min-sum decoders for cyclic codes,","venue":null,"work_id":"eaeebc0f-c147-48b7-a29f-5037d70a7fd7","year":2023},"citing_paper":{"arxiv_id":"2507.00254","last_updated":"2026-02-10T16:10:46Z","snapshot_observed_at":"2026-08-06T21:18:08.311292Z","submitted_at":"2025-06-30T20:47:28Z","title":"Fully Parallelized BP Decoding for Quantum LDPC Codes Can Outperform BP-OSD","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:22.810365Z"},"links":{"citing_paper":"/paper/2507.00254"},"observation_digest":"sha256:5a3a0bd2d6de221eef7223d04f9e7e9fa247ad182c2ee86d447c62465aa05e53","observation_id":"1ea30bcd-5ae4-4a71-9ff3-839c1a8b051c","resolution":{"observed_at":"2026-08-06T21:28:25.134077Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:28:22.859021Z","title":"Coprime bivariate bicycle codes and their properties,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.00254","last_updated":"2026-02-10T16:10:46Z","snapshot_observed_at":"2026-08-06T21:18:08.311292Z","submitted_at":"2025-06-30T20:47:28Z","title":"Fully Parallelized BP Decoding for Quantum LDPC Codes Can Outperform BP-OSD","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:22.859021Z"},"links":{"citing_paper":"/paper/2507.00254"},"observation_digest":"sha256:8cfdee8366aa1a3c689ae134a5009a84108f5417d37856f6571e264d6d371cd0","observation_id":"9f41bf25-0bbd-4d27-b07b-ddc639641711","resolution":{"observed_at":"2026-08-06T21:28:22.859021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.14527","last_updated":"2025-01-03T16:40:42Z","snapshot_observed_at":"2026-08-05T00:02:31.204110Z","submitted_at":"2024-06-20T17:39:31Z","title":"Ambiguity Clustering: an accurate and efficient decoder for qLDPC codes","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.14527","snapshot_observed_at":"2026-08-06T21:28:22.909864Z","title":"Ambiguity clustering: an accurate and efficient decoder for qldpc codes,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.00254","last_updated":"2026-02-10T16:10:46Z","snapshot_observed_at":"2026-08-06T21:18:08.311292Z","submitted_at":"2025-06-30T20:47:28Z","title":"Fully Parallelized BP Decoding for Quantum LDPC Codes Can Outperform BP-OSD","version":3},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:22.909864Z"},"links":{"cited_paper":"/paper/2406.14527","citing_paper":"/paper/2507.00254"},"observation_digest":"sha256:b86cc49c25cbd7c7d6cd40a91879c8a36f194ad9eb4706ac597c9bf979466d52","observation_id":"b151eb24-da4b-488a-a591-5a96297513b6","resolution":{"observed_at":"2026-08-06T21:28:22.909864Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:28:24.707429Z","title":"Belief propagation decoding of quantum ldpc codes with guided decimation,","venue":null,"work_id":"7c721d75-5c92-4200-a505-db208423d20b","year":2024},"citing_paper":{"arxiv_id":"2507.00254","last_updated":"2026-02-10T16:10:46Z","snapshot_observed_at":"2026-08-06T21:18:08.311292Z","submitted_at":"2025-06-30T20:47:28Z","title":"Fully Parallelized BP Decoding for Quantum LDPC Codes Can Outperform BP-OSD","version":3},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:22.955991Z"},"links":{"citing_paper":"/paper/2507.00254"},"observation_digest":"sha256:d76ceb2b844a8ec71f3c892a432b17173320fe09e755b95592ce5e310cc13816","observation_id":"16dea36f-b90c-4258-bb8b-c0e755a13677","resolution":{"observed_at":"2026-08-06T21:28:24.865674Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.02885","last_updated":"2024-12-03T22:45:43Z","snapshot_observed_at":"2026-07-06T20:01:14.493111Z","submitted_at":"2024-12-03T22:45:43Z","title":"SymBreak: Mitigating Quantum Degeneracy Issues in QLDPC Code Decoders by Breaking Symmetry","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.02885","snapshot_observed_at":"2026-08-06T21:28:23.022954Z","title":"Symbreak: Mitigating quantum degeneracy issues in qldpc code decoders by breaking symmetry,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.00254","last_updated":"2026-02-10T16:10:46Z","snapshot_observed_at":"2026-08-06T21:18:08.311292Z","submitted_at":"2025-06-30T20:47:28Z","title":"Fully Parallelized BP Decoding for Quantum LDPC Codes Can Outperform BP-OSD","version":3},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:23.022954Z"},"links":{"cited_paper":"/paper/2412.02885","citing_paper":"/paper/2507.00254"},"observation_digest":"sha256:2d9be1c364f0f0e0f44beeb3175ea97d5b48f21457b270f87ea953735d1d17d7","observation_id":"ddb7de30-95fd-4301-93e2-4b22bc5b885f","resolution":{"observed_at":"2026-08-06T21:28:23.022954Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:28:24.444901Z","title":"An efficient 10gbase-t ethernet ldpc decoder design with low error floors,","venue":null,"work_id":"b9bcd45c-c3e5-4326-815b-537237236398","year":2010},"citing_paper":{"arxiv_id":"2507.00254","last_updated":"2026-02-10T16:10:46Z","snapshot_observed_at":"2026-08-06T21:18:08.311292Z","submitted_at":"2025-06-30T20:47:28Z","title":"Fully Parallelized BP Decoding for Quantum LDPC Codes Can Outperform BP-OSD","version":3},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:23.086039Z"},"links":{"citing_paper":"/paper/2507.00254"},"observation_digest":"sha256:b0421579dd210d7b4a16cf40ff96d158b072e7fabe1b2f1653a556d8d8e871eb","observation_id":"ecb73e0e-a668-4e6c-9d68-f8d4f8927fcc","resolution":{"observed_at":"2026-08-06T21:28:24.581973Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2015.24222","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:28:23.961270Z","title":"Available: https://doi.org/10.1109/TIT.2015.2422294","venue":null,"work_id":"b7d57ff6-071d-47e8-861a-71c33ebfbad3","year":2015},"citing_paper":{"arxiv_id":"2507.00254","last_updated":"2026-02-10T16:10:46Z","snapshot_observed_at":"2026-08-06T21:18:08.311292Z","submitted_at":"2025-06-30T20:47:28Z","title":"Fully Parallelized BP Decoding for Quantum LDPC Codes Can Outperform BP-OSD","version":3},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:21.943500Z"},"links":{"citing_paper":"/paper/2507.00254"},"observation_digest":"sha256:3572ca399d9c2a1f89a5717b57e4a5dceb791a6003ac085e79aa04a8818cc3e1","observation_id":"c1959e36-4224-42ad-a23d-a29df761ed96","resolution":{"observed_at":"2026-08-06T21:28:24.082414Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:28:22.298325Z","title":"Available: https://pypi.org/project/ldpc/","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.00254","last_updated":"2026-02-10T16:10:46Z","snapshot_observed_at":"2026-08-06T21:18:08.311292Z","submitted_at":"2025-06-30T20:47:28Z","title":"Fully Parallelized BP Decoding for Quantum LDPC Codes Can Outperform BP-OSD","version":3},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:22.298325Z"},"links":{"citing_paper":"/paper/2507.00254"},"observation_digest":"sha256:0c50634b07fec3c583be606d01f78a207a538d41a6786d03bdab60c62a49f5f9","observation_id":"dfc6dfd9-25f4-4397-abe6-ea14c7d21763","resolution":{"observed_at":"2026-08-06T21:28:22.298325Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2507.00254","last_updated":"2026-02-10T16:10:46Z","latest_version":3,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-06T21:18:08.311292Z","submitted_at":"2025-06-30T20:47:28Z","title":"Fully Parallelized BP Decoding for Quantum LDPC Codes Can Outperform BP-OSD"},"reference_resolution":{"displayed":39,"state_counts":{"malformed_identifier":1,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":20,"verified_exact":1,"verified_fuzzy":16},"total_outbound_references":39},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 39 of 39 outbound references and 7 inbound Pith citation observations for arXiv:2507.00254."}