{"as_of":"2026-08-09T23:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1d6c1394b26a73ebb6c8ef43bbb6b31a662ff4db87624737d48670408248927c","coverage":[{"denominator":80,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":80,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T10:47:12.489398Z","state":"measured"},{"denominator":81,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":81,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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-06-27T00:46:20.548908Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-03T21:18:58.573950Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_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},"cited_work":{"arxiv_id":"2510.08695","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2510.08695","snapshot_observed_at":"2026-07-09T02:19:38.080118Z","title":"Degeneracy cutting: A lo- cal and efficient post-processing for belief propagation decoding of quan- tum low-density parity-check codes,","venue":null,"work_id":"e920a4b8-cfa0-4d26-ad9e-00d82f500c94","year":2025},"citing_paper":{"arxiv_id":"2606.18240","last_updated":"2026-06-16T17:58:26Z","snapshot_observed_at":"2026-08-08T17:49:49.840758Z","submitted_at":"2026-06-16T17:58:26Z","title":"Impulse Decoding of Quantum LDPC Codes: Equivalence of Degeneracy and Code-Shortening","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-06-27T00:46:20.548908Z"},"links":{"cited_paper":"/paper/2510.08695","citing_paper":"/paper/2606.18240"},"observation_digest":"sha256:6a195e5e367c51d7455fbb227cfd4a4f08f45f7ff1d441c6137d473496247708","observation_id":"08070c90-79c2-42c5-bae6-315a78da7d90","resolution":{"observed_at":"2026-07-09T02:19:38.080118Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2510.08695/citation-record","integrity":"/paper/2510.08695/integrity","json":"/paper/2510.08695/citation-record.json","paper":"/paper/2510.08695"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:47:12.036275Z","title":"In this work, we consider therotated surface code of code distanced[52, 53], which is defined on ad×dsquare lattice and has parameters [[d 2,1, d]]","venue":null,"work_id":null,"year":null},"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":1,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.036275Z"},"links":{"citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:e9de0fe3cdecaaae622ba92da5be80df1fad97fd467c2ef96ef0739cec9a5d5a","observation_id":"63a6a677-83ce-4293-9a92-eafd821d4741","resolution":{"observed_at":"2026-08-04T10:47:12.036275Z","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-04T10:47:12.042406Z","title":"Let Il ∈F l×l 2 denote the identity matrix andS l ∈F l×l 2 the cyclic shift matrix, defined by (S l)i,j = 1 ifj= i+ 1 modl, and 0 otherwise","venue":null,"work_id":null,"year":null},"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":2,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.042406Z"},"links":{"citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:2c951c758e96ef0b3979fdd9ef7b9fcc84c11207dad27a8972f01f51a18128a4","observation_id":"2f4f024e-6f65-4b96-8161-720d203ff264","resolution":{"observed_at":"2026-08-04T10:47:12.042406Z","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-04T10:47:12.048760Z","title":"Given the prior bit-flip probabili- tiesp= (p 1,","venue":null,"work_id":null,"year":null},"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":3,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.048760Z"},"links":{"citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:e05eeff48926bd117d325015069e332fd008cae7d58d54b07cba787db2e7dd71","observation_id":"11f29484-cf9b-4f09-bf86-4625b2bd374a","resolution":{"observed_at":"2026-08-04T10:47:12.048760Z","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-04T10:47:12.054923Z","title":"!\"#=\"′!\"#","venue":null,"work_id":null,"year":null},"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":4,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.054923Z"},"links":{"citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:a700483d7853714f0a43ecf26805da79180c5222f9427caa72bde101a1123dc2","observation_id":"c3fdf409-80a4-4c9c-87a3-961a4dad29d5","resolution":{"observed_at":"2026-08-04T10:47:12.054923Z","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-04T10:47:12.062164Z","title":null,"venue":null,"work_id":null,"year":1996},"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":5,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.062164Z"},"links":{"citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:d434557de26f1cded51f224e93ffac7eb00220c516764f7ab1eeb4fb746a4c82","observation_id":"3b2df511-0b0a-46c7-ad36-6d47d98546c3","resolution":{"observed_at":"2026-08-04T10:47:12.062164Z","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-04T10:47:12.067028Z","title":"Aharonov and M","venue":null,"work_id":null,"year":1997},"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":6,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.067028Z"},"links":{"citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:aa4472fc0cd139ee8acc311b389791c95eacfe4e354befa59e650b2a5fbd838b","observation_id":"92eaea7c-aaaa-4495-b4bf-2601c1eac456","resolution":{"observed_at":"2026-08-04T10:47:12.067028Z","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-04T10:47:12.073125Z","title":"Aliferis, D","venue":null,"work_id":null,"year":2006},"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":7,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.073125Z"},"links":{"citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:7169c0356508becba5edaf81e04c88d626625817a49d67e99e174cb8463296d1","observation_id":"3d8090f6-82dc-42d0-ba76-95406a9a9b09","resolution":{"observed_at":"2026-08-04T10:47:12.073125Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"0904.2557","last_updated":"2009-04-16T18:40:02Z","snapshot_observed_at":"2026-08-02T06:03:48.397877Z","submitted_at":"2009-04-16T18:40:02Z","title":"An Introduction to Quantum Error Correction and Fault-Tolerant Quantum Computation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0904.2557","snapshot_observed_at":"2026-08-04T10:47:12.078251Z","title":"Gottesman, An introduction to quantum error correction and fault-tolerant quantum computation, arXiv:0904.2557 (2009)","venue":null,"work_id":null,"year":2009},"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":8,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.078251Z"},"links":{"cited_paper":"/paper/0904.2557","citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:ff248ecf6dcf88b2b0cbedbb85ef61d82e287d799760d0613ba242b606be71d0","observation_id":"85f05885-3679-4795-a03f-6996b50265fe","resolution":{"observed_at":"2026-08-04T10:47:12.078251Z","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-04T10:47:12.084407Z","title":null,"venue":null,"work_id":null,"year":2010},"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":9,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.084407Z"},"links":{"citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:e24272ed45e49e11953deef383088f3d4a7d878cdaa571c215821d4758906d8e","observation_id":"7509a5e0-6dcc-4917-bd34-b90f2794426b","resolution":{"observed_at":"2026-08-04T10:47:12.084407Z","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-04T10:47:12.089407Z","title":"Gottesman, Fault-tolerant quantum computation with constant overhead, Quantum Inf","venue":null,"work_id":null,"year":2014},"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":10,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.089407Z"},"links":{"citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:b19fe8c4be89eed700ae0651c1e46f2ae26589b64c6866ee714d1cc82ada3091","observation_id":"3278622e-a7db-448f-8a1f-4a86e38a66ee","resolution":{"observed_at":"2026-08-04T10:47:12.089407Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.03683","last_updated":"2024-12-05T17:49:53Z","snapshot_observed_at":"2026-07-06T19:45:57.808548Z","submitted_at":"2024-11-06T06:06:36Z","title":"Polylog-time- and constant-space-overhead fault-tolerant quantum computation with quantum low-density parity-check codes","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.03683","snapshot_observed_at":"2026-08-04T10:47:12.096051Z","title":"Tamiya, M","venue":null,"work_id":null,"year":2024},"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":11,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.096051Z"},"links":{"cited_paper":"/paper/2411.03683","citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:3f5ece7d748a271fdaf4fc7951b2d1adf1b05f7cedb7506aecdef540014abfab","observation_id":"389608c3-9b99-45c5-b8ec-72ef468b93bc","resolution":{"observed_at":"2026-08-04T10:47:12.096051Z","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-04T10:47:12.100914Z","title":"Yamasaki and M","venue":null,"work_id":null,"year":2024},"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":12,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.100914Z"},"links":{"citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:da2f59106f39d58312c3eea79ce96c326164b92a7cda3a757a4f3e65544b2c12","observation_id":"61289daa-222d-4ac6-815f-76e9789ff584","resolution":{"observed_at":"2026-08-04T10:47:12.100914Z","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-04T10:47:12.105644Z","title":"Tillich and G","venue":null,"work_id":null,"year":2014},"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":13,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.105644Z"},"links":{"citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:48daa61579a9d69f053fc2ae2f6b339dd7b4548a3912d1f0828c9df704e4831f","observation_id":"f594b067-6cc9-44fa-85cb-c0b2aecf4cfa","resolution":{"observed_at":"2026-08-04T10:47:12.105644Z","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-04T10:47:12.110871Z","title":"Leverrier, J.-P","venue":null,"work_id":null,"year":2015},"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":14,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.110871Z"},"links":{"citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:f6e35ce7d9d9e2f037dd0c904c84c23c76883c9a0167fd2cdd6012a197fc5acc","observation_id":"d2ddb195-385f-4a08-96f2-ddb2ba362aea","resolution":{"observed_at":"2026-08-04T10:47:12.110871Z","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-04T10:47:12.115601Z","title":null,"venue":null,"work_id":null,"year":2021},"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":15,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.115601Z"},"links":{"citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:339bf9e0bf1368f7e2e667ac7333c653ddefd4781b9185e28ebe981c231ae5d4","observation_id":"1c350e52-5214-40e7-8ae2-b56d22cfa70f","resolution":{"observed_at":"2026-08-04T10:47:12.115601Z","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-04T10:47:12.120863Z","title":null,"venue":null,"work_id":null,"year":2021},"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":16,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.120863Z"},"links":{"citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:689e4de15ce3fc78adaf71398d47376f7aad85bed61595bd5b572bd69cf2fb1b","observation_id":"966d1154-b344-4472-bc10-dd2051198100","resolution":{"observed_at":"2026-08-04T10:47:12.120863Z","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-04T10:47:12.125830Z","title":"Panteleev and G","venue":null,"work_id":null,"year":2022},"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":17,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.125830Z"},"links":{"citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:e3b636739c9cb541bf86b1951190b2faed4e76d9b3d5bd519803a1c157e02361","observation_id":"1beacbeb-0798-4435-bab9-7a826096b890","resolution":{"observed_at":"2026-08-04T10:47:12.125830Z","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-04T10:47:12.130363Z","title":"Panteleev and G","venue":null,"work_id":null,"year":2022},"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":18,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.130363Z"},"links":{"citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:54e8e32539ad077d4f00211ea70786f071b80537ebe220473d5609148ff07829","observation_id":"7f68b90d-9961-4fd3-b114-56b0611b9a9c","resolution":{"observed_at":"2026-08-04T10:47:12.130363Z","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-04T10:47:12.135110Z","title":"Dinur, M.-H","venue":null,"work_id":null,"year":2023},"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":19,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.135110Z"},"links":{"citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:6945d7c77c1ab66d2605ca597ab4b4ebaaf7fd16778cedc253d4ba07d44809d8","observation_id":"54685046-f686-4d68-9ab4-63c9fa2a07bb","resolution":{"observed_at":"2026-08-04T10:47:12.135110Z","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-04T10:47:12.139429Z","title":"Bravyi, A","venue":null,"work_id":null,"year":2024},"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":20,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.139429Z"},"links":{"citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:361808e6793b35cfaf5937af4edfd5da1a140cd5aa298e72869b06bc25216fea","observation_id":"a098ad9c-33ee-4330-82f2-67fd2c189060","resolution":{"observed_at":"2026-08-04T10:47:12.139429Z","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-04T10:47:12.144361Z","title":"Fawzi, A","venue":null,"work_id":null,"year":2020},"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":21,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.144361Z"},"links":{"citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:b68496f53198b2e9c5238b34dd75f11a1c561e21b39d019d49a88f7c66188e09","observation_id":"d1607d2a-61a2-4715-900a-6827c0d1a335","resolution":{"observed_at":"2026-08-04T10:47:12.144361Z","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-04T10:47:12.149417Z","title":null,"venue":null,"work_id":null,"year":2022},"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":22,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.149417Z"},"links":{"citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:d96aa290b6ec06fc222ffa9d88c6322e388aa6af82f1f14f9b23a4259093f611","observation_id":"79499f2f-8f9b-45a1-b84b-0bf8c3a2cb39","resolution":{"observed_at":"2026-08-04T10:47:12.149417Z","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-04T10:47:12.154471Z","title":null,"venue":null,"work_id":null,"year":2024},"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":23,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.154471Z"},"links":{"citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:db3a93ad61ae3aeabf222b70971bdb1cd60ecdf6459dfe274a5c11a825eac1a0","observation_id":"089e86b4-9d53-44f8-8078-3f65dcb5ced6","resolution":{"observed_at":"2026-08-04T10:47:12.154471Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-04T10:47:12.160496Z","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":24,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.160496Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:54443a106419abff4637d8fc161dab122752947cf26b2b71a7c25928679db7e8","observation_id":"da55ae40-dc37-429c-b6e9-0d46828a6fdc","resolution":{"observed_at":"2026-08-04T10:47:12.160496Z","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-04T10:47:12.166396Z","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":25,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.166396Z"},"links":{"citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:35209e224f1238a24e9860aa3534d10c41005c3adb174fbe2e4fe6139c1d671e","observation_id":"ffb4d87e-cce4-41fd-949d-b20dcff3c49d","resolution":{"observed_at":"2026-08-04T10:47:12.166396Z","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-04T10:47:12.171821Z","title":null,"venue":null,"work_id":null,"year":2015},"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":26,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.171821Z"},"links":{"citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:21a20cdd435ceb6e55b675477c644adc3eb4a0d4f618f57868c77b5f74d9927c","observation_id":"c2b7615c-2785-45cc-b7b0-dea78f8aa797","resolution":{"observed_at":"2026-08-04T10:47:12.171821Z","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-04T10:47:12.177055Z","title":"Barber, K","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":27,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.177055Z"},"links":{"citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:79efd095e81f5a4e9931849f8b3c156f20d23b9d5ee01ef044cccffa98f8cd1d","observation_id":"0b2951f8-0108-44ac-97a0-948e20799a9b","resolution":{"observed_at":"2026-08-04T10:47:12.177055Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.13601","last_updated":"2025-08-12T20:55:01Z","snapshot_observed_at":"2026-08-07T16:56:58.428919Z","submitted_at":"2025-03-17T18:00:04Z","title":"Doubly-polylog-time-overhead fault-tolerant quantum computation by a polylog-time parallel minimum-weight perfect matching decoder","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.13601","snapshot_observed_at":"2026-08-04T10:47:12.182730Z","title":"Takada and H","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":28,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.182730Z"},"links":{"cited_paper":"/paper/2503.13601","citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:fc5f78d9d6f46cd652950475c8d9bfa9ea5f8d55f2f355f0ba8768e451977223","observation_id":"fa25d4c7-33b4-48c5-af7e-9c3ce148e3b4","resolution":{"observed_at":"2026-08-04T10:47:12.182730Z","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-04T10:47:12.188726Z","title":"Gallager, Low-density parity-check codes, IRE Trans","venue":null,"work_id":null,"year":1962},"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":29,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.188726Z"},"links":{"citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:30094754a6f21feee37bf195f999fcdc0b39275047ae181f940753031cb1b330","observation_id":"e67584f7-eeb1-4591-9e25-e8ae81b7326f","resolution":{"observed_at":"2026-08-04T10:47:12.188726Z","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-04T10:47:12.195401Z","title":null,"venue":null,"work_id":null,"year":1996},"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":30,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.195401Z"},"links":{"citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:33457add0a3457c46b859b2b4a8bab1eb78080a117d41ed00b72b25ed9101db0","observation_id":"2ac13c5c-64d3-4a3e-9bb3-2bced75cb41f","resolution":{"observed_at":"2026-08-04T10:47:12.195401Z","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-04T10:47:12.201677Z","title":null,"venue":null,"work_id":null,"year":2001},"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":31,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.201677Z"},"links":{"citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:4d6b7701fc7bdbe827f35d92e9294a4c15ce6bfa295eb6ddc3b8d01a82e9ebcb","observation_id":"b15b5475-ca11-48b8-a7fc-9b20a3f6b273","resolution":{"observed_at":"2026-08-04T10:47:12.201677Z","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-04T10:47:12.208389Z","title":null,"venue":null,"work_id":null,"year":2001},"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":32,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.208389Z"},"links":{"citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:5ba0d454a114d8ab0e0c26c120089a28eb9bfdd1164974fa96a4b15e77e2c4b7","observation_id":"54f64e24-8711-4ce0-9f46-a979edc01908","resolution":{"observed_at":"2026-08-04T10:47:12.208389Z","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-04T10:47:12.215307Z","title":"Tanner, A recursive approach to low complexity codes, IEEE Trans","venue":null,"work_id":null,"year":1981},"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":33,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.215307Z"},"links":{"citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:287c7c0c8cc545ce36516a28f30c8f95c5aebdfb2b2ca8e55052164c1586a384","observation_id":"972e1e60-5d89-45b6-9b3f-a8bc142680ef","resolution":{"observed_at":"2026-08-04T10:47:12.215307Z","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-04T10:47:12.220400Z","title":"Poulin and Y","venue":null,"work_id":null,"year":2008},"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":34,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.220400Z"},"links":{"citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:f5202869cb637064939603a737f5451b16153865b3e1566ec739bac2568a5ff7","observation_id":"34f23cae-424c-4ddd-af1e-e1c37cab2edb","resolution":{"observed_at":"2026-08-04T10:47:12.220400Z","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-04T10:47:12.227438Z","title":"Raveendran and B","venue":null,"work_id":null,"year":2021},"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":35,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.227438Z"},"links":{"citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:b08f252d6ec01d01732c1897f03740c395c2d11a297da1858164e63cf0787317","observation_id":"0e7f36fa-20a6-45a4-b619-dd7d6c6f4ea3","resolution":{"observed_at":"2026-08-04T10:47:12.227438Z","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-04T10:47:12.232826Z","title":"Fuentes, J","venue":null,"work_id":null,"year":2021},"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":36,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.232826Z"},"links":{"citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:bdc62a20debb69039330398b484608a28ce6c56d318d31f54c1aaf318741d653","observation_id":"b27b680b-367b-49b8-9513-8e8c038eb8f7","resolution":{"observed_at":"2026-08-04T10:47:12.232826Z","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-04T10:47:12.238005Z","title":"Panteleev and G","venue":null,"work_id":null,"year":2021},"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":37,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.238005Z"},"links":{"citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:a15ad6265bc502607375462f7299c0f4e6304118cc768edcccfba26e0559c95a","observation_id":"5f81541b-3632-43b5-bab0-ce14ad4624b7","resolution":{"observed_at":"2026-08-04T10:47:12.238005Z","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-04T10:47:12.244126Z","title":"Roffe, D","venue":null,"work_id":null,"year":2020},"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":38,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.244126Z"},"links":{"citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:de8d98fe988def999ff762df975f2c399105ce58095d4c796d33698c4eac71f9","observation_id":"39ab1f87-9b31-48e1-8021-cc0830fd6c3d","resolution":{"observed_at":"2026-08-04T10:47:12.244126Z","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-04T10:47:12.250390Z","title":"Du Crest, M","venue":null,"work_id":null,"year":2022},"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":39,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.250390Z"},"links":{"citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:c0f4abd161c969156647cd87c58c765e5f9bf18d6a2911c5b6d14ef01867b444","observation_id":"3b319c24-d090-4b69-ae81-bd4f921e3522","resolution":{"observed_at":"2026-08-04T10:47:12.250390Z","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-04T10:47:12.255545Z","title":"Du Crest, F","venue":null,"work_id":null,"year":2024},"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":40,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.255545Z"},"links":{"citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:982e94a82935df83465b4b479eec18c1901d83b0710815ddf934b2619787fa14","observation_id":"6fd81adc-3bbe-4b80-b332-295189dbe146","resolution":{"observed_at":"2026-08-04T10:47:12.255545Z","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-04T10:47:12.261398Z","title":null,"venue":null,"work_id":null,"year":2024},"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":41,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.261398Z"},"links":{"citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:898729277e21fc624bfabf833dbdde5677aeaae29060a11e04aceade7acea3a6","observation_id":"a987d454-234f-4f54-ad53-f9c6c3a977dd","resolution":{"observed_at":"2026-08-04T10:47:12.261398Z","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-04T10:47:12.266716Z","title":null,"venue":null,"work_id":null,"year":2024},"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":42,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.266716Z"},"links":{"cited_paper":"/paper/2403.18901","citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:678a7bab833beae6cf0105f8520e5a106763f953ea1a7d3ca9f8053f94ca793a","observation_id":"96e0cffe-cb87-4a9f-8bd2-394001c4f2bf","resolution":{"observed_at":"2026-08-04T10:47:12.266716Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.01532","last_updated":"2024-02-14T15:02:44Z","snapshot_observed_at":"2026-08-09T13:13:49.277867Z","submitted_at":"2024-02-02T16:22:32Z","title":"The closed-branch decoder for quantum LDPC codes","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.01532","snapshot_observed_at":"2026-08-04T10:47:12.273090Z","title":null,"venue":null,"work_id":null,"year":2024},"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":43,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.273090Z"},"links":{"cited_paper":"/paper/2402.01532","citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:27aaf7a5dce87d1a2233fa4302fb87332616b08b4d9355453743a88c819a7859","observation_id":"a68d8705-2438-4339-adf2-4fe8840ddbbe","resolution":{"observed_at":"2026-08-04T10:47:12.273090Z","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-04T10:47:12.279089Z","title":"Hillmann, L","venue":null,"work_id":null,"year":2024},"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":44,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.279089Z"},"links":{"citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:5b89cfbd7590df46b88636ca99864905d71d00092dcf55e3e092d04d7166e052","observation_id":"fc45d961-3111-4c79-b1fe-b9b163d67810","resolution":{"observed_at":"2026-08-04T10:47:12.279089Z","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-04T10:47:12.285142Z","title":"Wolanski and B","venue":null,"work_id":null,"year":2024},"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":45,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.285142Z"},"links":{"cited_paper":"/paper/2406.14527","citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:823dee627e91aee0232146b0d098cd8231928171678177dc3434b003ed82c1e7","observation_id":"c8730f70-af57-4d37-99fe-a7bdc8c79955","resolution":{"observed_at":"2026-08-04T10:47:12.285142Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.01440","last_updated":"2026-06-29T19:50:41Z","snapshot_observed_at":"2026-08-05T12:33:48.276318Z","submitted_at":"2024-09-02T19:50:57Z","title":"An almost-linear time decoding algorithm for quantum LDPC codes under circuit-level noise","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.01440","snapshot_observed_at":"2026-08-04T10:47:12.291011Z","title":null,"venue":null,"work_id":null,"year":2024},"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":46,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.291011Z"},"links":{"cited_paper":"/paper/2409.01440","citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:a7e634e5ab07fbb188232e3c186ee800fe86cfbbb44ad50ac6fc4d2c2e2a57db","observation_id":"8eaadeab-c7de-4b0f-802e-a228b59ac6aa","resolution":{"observed_at":"2026-08-04T10:47:12.291011Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-04T10:47:12.297190Z","title":null,"venue":null,"work_id":null,"year":2024},"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":47,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.297190Z"},"links":{"cited_paper":"/paper/2412.02885","citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:65cc1155bd5dff866f897e2c5a695fc69a9e7ece449db0ef7ac951e351b61c56","observation_id":"ea73adad-422d-4480-a2ff-0c84fcf7d50d","resolution":{"observed_at":"2026-08-04T10:47:12.297190Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.16408","last_updated":"2025-02-23T02:29:14Z","snapshot_observed_at":"2026-08-07T17:55:47.988656Z","submitted_at":"2025-02-23T02:29:14Z","title":"Decision-tree decoders for general quantum LDPC codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.16408","snapshot_observed_at":"2026-08-04T10:47:12.303867Z","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":48,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.303867Z"},"links":{"cited_paper":"/paper/2502.16408","citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:9d8b37c2d662b60db9f433bc121f06f05d14781bbd9a775edbb75d7576178caf","observation_id":"6bbfc7e9-fb59-472d-96e4-5fea37dd1495","resolution":{"observed_at":"2026-08-04T10:47:12.303867Z","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-04T10:47:12.311258Z","title":"Dennis, A","venue":null,"work_id":null,"year":2002},"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":49,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.311258Z"},"links":{"citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:97847a13a7feec94ef15c8d89589d589f8481cf72a59093219b630c23dbfd7d5","observation_id":"c24d6121-8e53-42cb-b968-1107aeeb9783","resolution":{"observed_at":"2026-08-04T10:47:12.311258Z","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-04T10:47:12.316938Z","title":null,"venue":null,"work_id":null,"year":2003},"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":50,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.316938Z"},"links":{"citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:6042e50a0aa37da1ef2b2cc883ae2e7d63e880de844df8bba027eb4b560da4e1","observation_id":"33309e97-3932-4700-92b6-32a178d8f667","resolution":{"observed_at":"2026-08-04T10:47:12.316938Z","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-04T10:47:12.323191Z","title":null,"venue":null,"work_id":null,"year":2012},"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":51,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.323191Z"},"links":{"citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:f73f6bd1e812e52bbbc1835c0fe3a3ef1471189b9bbfbbf6b7b1389632a930cb","observation_id":"d7ef4c56-d699-4861-bb03-fd46f0631cb9","resolution":{"observed_at":"2026-08-04T10:47:12.323191Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.18979","last_updated":"2025-06-23T18:00:02Z","snapshot_observed_at":"2026-08-09T13:14:09.613871Z","submitted_at":"2025-06-23T18:00:02Z","title":"Transversal Surface-Code Game Powered by Neutral Atoms","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.18979","snapshot_observed_at":"2026-08-04T10:47:12.328358Z","title":"Sunami, A","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":52,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.328358Z"},"links":{"cited_paper":"/paper/2506.18979","citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:c14310bc88edd105ce69d47b389a6d4f865cb5e422e207ba000fc1729c72f7c2","observation_id":"3a6a10d2-0f82-436a-a3ef-9e6ae6afc031","resolution":{"observed_at":"2026-08-04T10:47:12.328358Z","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-04T10:47:12.334298Z","title":"Sunami, S","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":53,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.334298Z"},"links":{"citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:538217e93562fe30a0df3926c4a27d5c194c0d815d5be9466bddeb55fe7bc3ef","observation_id":"9adc00ff-6a99-4f83-91cb-ad526278246e","resolution":{"observed_at":"2026-08-04T10:47:12.334298Z","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-04T10:47:12.340263Z","title":null,"venue":null,"work_id":null,"year":1996},"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":54,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.340263Z"},"links":{"citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:6b3a95a2866ea2c820920400c3153c43cd1a047a0f0dd7eb26b57fcd2c1809af","observation_id":"589fe7eb-1967-4f40-9acb-c9f8014409a5","resolution":{"observed_at":"2026-08-04T10:47:12.340263Z","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-04T10:47:12.345761Z","title":"Steane, Multiple particle interference and quantum er- ror correction, Proceedings of the Royal Society A: Math- ematical, Physical and Engineering Sciences452(1996)","venue":null,"work_id":null,"year":1996},"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":55,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.345761Z"},"links":{"citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:49a49c981de828c69f65021b4dd6add4b9f9e3aa35f4e3907d9dc45920873ea3","observation_id":"c73195a0-ad4b-4cec-99e3-953a1a3f814f","resolution":{"observed_at":"2026-08-04T10:47:12.345761Z","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-04T10:47:12.351889Z","title":"Bombin and M","venue":null,"work_id":null,"year":2007},"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":56,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.351889Z"},"links":{"citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:9d63abcba6b07553e8c5fd43eb5867afcb0585c5673e40d16e80b37c7480916b","observation_id":"01ff9c80-5c35-42d2-9cab-333687328d67","resolution":{"observed_at":"2026-08-04T10:47:12.351889Z","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-04T10:47:12.358030Z","title":"Tomita and K","venue":null,"work_id":null,"year":2014},"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":57,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.358030Z"},"links":{"citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:502760d0e323bfd998aef553e9d22af5bc71643be392e43312102439c9f5ea22","observation_id":"23f23367-a398-4101-8c72-a54d8935acc1","resolution":{"observed_at":"2026-08-04T10:47:12.358030Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1108.5738","last_updated":"2011-08-29T20:00:37Z","snapshot_observed_at":"2026-08-07T01:38:33.049066Z","submitted_at":"2011-08-29T20:00:37Z","title":"Fault-tolerant quantum computing with color codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1108.5738","snapshot_observed_at":"2026-08-04T10:47:12.363122Z","title":null,"venue":null,"work_id":null,"year":2011},"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":58,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.363122Z"},"links":{"cited_paper":"/paper/1108.5738","citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:afae43ebc903b07fb74a5e58e0535221640f8fdbd49eb8243cde4d7da0961d4f","observation_id":"992447fd-5c66-4719-8868-159c33e5454e","resolution":{"observed_at":"2026-08-04T10:47:12.363122Z","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-04T10:47:12.369172Z","title":"Mansour and N","venue":null,"work_id":null,"year":2003},"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":59,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.369172Z"},"links":{"citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:a89297f53b6821ca121ccbd49addf599041459d3a14bd3acdab79010941a68b9","observation_id":"cbb985e1-2a9e-4aca-a59b-158593859994","resolution":{"observed_at":"2026-08-04T10:47:12.369172Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.05021","last_updated":"2025-01-09T07:28:26Z","snapshot_observed_at":"2026-07-06T20:18:35.429115Z","submitted_at":"2025-01-09T07:28:26Z","title":"Enhanced Min-Sum Decoding of Quantum Codes Using Previous Iteration Dynamics","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.05021","snapshot_observed_at":"2026-08-04T10:47:12.374209Z","title":"Chytas, N","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":60,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.374209Z"},"links":{"cited_paper":"/paper/2501.05021","citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:99ef92466ba0aa332187d4299b989941d2f45b78acc92bebc7c0063478b1aa2d","observation_id":"37a705fc-d47d-4b2c-bb74-189d15085ff5","resolution":{"observed_at":"2026-08-04T10:47:12.374209Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.01738","last_updated":"2025-03-03T16:58:24Z","snapshot_observed_at":"2026-08-07T17:33:03.144687Z","submitted_at":"2025-03-03T16:58:24Z","title":"Automorphism Ensemble Decoding of Quantum LDPC Codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.01738","snapshot_observed_at":"2026-08-04T10:47:12.380102Z","title":"Koutsioumpas, H","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":61,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.380102Z"},"links":{"cited_paper":"/paper/2503.01738","citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:2e7b78fcf4008f5372602c86c09b16288e40239ea0cc62f2d90f0043ea4f6fb4","observation_id":"51022372-cd92-4fe6-948b-f25b9ee25bdf","resolution":{"observed_at":"2026-08-04T10:47:12.380102Z","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-04T10:47:12.386039Z","title":"M¨ uller, T","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":62,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.386039Z"},"links":{"cited_paper":"/paper/2506.01779","citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:e18551ec72868935092d8439ac8363d27dfc1dbd9b8a7ed47ebc4260e2aa139c","observation_id":"c1ad74e2-7929-46d4-abfb-6788b5fc0a6e","resolution":{"observed_at":"2026-08-04T10:47:12.386039Z","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":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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:47:12.398028Z","title":null,"venue":null,"work_id":null,"year":2024},"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":64,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.398028Z"},"links":{"citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:fac20f980cc054b7065359e32b6fdb0f412721d2966921e5bcda4a82ce54acf3","observation_id":"e60516a1-574e-4ee9-9f2a-85c2c1f968fe","resolution":{"observed_at":"2026-08-04T10:47:12.398028Z","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-04T10:47:12.403801Z","title":"Higgott and C","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":65,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.403801Z"},"links":{"citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:26dc720014c553c61b534f3f06c4ec8aa94306743ad9fa92dd076ee5854b8f39","observation_id":"2199c13e-eb50-4cce-b66a-186c7cbd67ce","resolution":{"observed_at":"2026-08-04T10:47:12.403801Z","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-04T10:47:12.409513Z","title":"Gidney, Stim: a fast stabilizer circuit simulator, Quan- tum5, 497 (2021)","venue":null,"work_id":null,"year":2021},"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":66,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.409513Z"},"links":{"citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:aceb0ae400972d78f9be2baa839cc57aa04fa73657f1495cf0812a1b1e92fd61","observation_id":"991ff704-ed83-4cfc-be6f-1c4549fdaa81","resolution":{"observed_at":"2026-08-04T10:47:12.409513Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.14765","last_updated":"2024-10-11T06:26:07Z","snapshot_observed_at":"2026-08-06T17:06:37.436998Z","submitted_at":"2024-09-23T07:27:20Z","title":"Compare the Pair: Rotated vs. Unrotated Surface Codes at Equal Logical Error Rates","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.14765","snapshot_observed_at":"2026-08-04T10:47:12.416063Z","title":null,"venue":null,"work_id":null,"year":2024},"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":67,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.416063Z"},"links":{"cited_paper":"/paper/2409.14765","citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:380a07c5785676b6deb72b92ee4b22a9155b7f9e1af270c0cfda4a44a9eb0d7d","observation_id":"088d59ae-cbf0-4441-8f82-8669c7e5817a","resolution":{"observed_at":"2026-08-04T10:47:12.416063Z","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-04T10:47:12.422146Z","title":null,"venue":null,"work_id":null,"year":null},"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":68,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.422146Z"},"links":{"citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:3f460986e367729f7fcd2107d62f6fb7a6d2af2b7e29c3224c77586a6d68ebfb","observation_id":"50f9c486-d586-48ef-97de-5c7d06abf6dc","resolution":{"observed_at":"2026-08-04T10:47:12.422146Z","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-04T10:47:12.428341Z","title":"Then, the following eight steps are repeated forTrounds:","venue":null,"work_id":null,"year":null},"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":69,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.428341Z"},"links":{"citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:d1f9e08698e315556a5f9fd8cd606a8c3154f6fad10f75ad709df661de618ffc","observation_id":"a4d3dab2-1843-4b4b-8dcd-4ff93234dab3","resolution":{"observed_at":"2026-08-04T10:47:12.428341Z","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-04T10:47:12.435098Z","title":null,"venue":null,"work_id":null,"year":null},"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":70,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.435098Z"},"links":{"citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:b1afc60a083bf3430b794823e8d1aba6e21fcc09b8fa8fc0eaf3353c676baf85","observation_id":"e706ed05-5914-4aa3-9506-d299ad61f383","resolution":{"observed_at":"2026-08-04T10:47:12.435098Z","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-04T10:47:12.440184Z","title":null,"venue":null,"work_id":null,"year":null},"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":71,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.440184Z"},"links":{"citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:f5b6802663042a801b1bce555df837ff50251ec0a5149d633df99bd3e1f6af6c","observation_id":"e71f8bab-e4fa-4d6c-b910-d7fe9558004f","resolution":{"observed_at":"2026-08-04T10:47:12.440184Z","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-04T10:47:12.446117Z","title":null,"venue":null,"work_id":null,"year":null},"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":72,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.446117Z"},"links":{"citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:4adbc88008fd430bfeed9340ad48ec5a839ea7bb1c52eded36ec54a4b11b27ff","observation_id":"959ba450-7a91-4275-960e-9533b31eac05","resolution":{"observed_at":"2026-08-04T10:47:12.446117Z","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-04T10:47:12.450998Z","title":null,"venue":null,"work_id":null,"year":null},"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":73,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.450998Z"},"links":{"citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:53c1592d0b0242b162f4f8107223dbbfc42aad218b47ce1323525083111e83f7","observation_id":"d376ebce-9f62-4158-a469-3f50ccdee0f9","resolution":{"observed_at":"2026-08-04T10:47:12.450998Z","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-04T10:47:12.456127Z","title":null,"venue":null,"work_id":null,"year":null},"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":74,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.456127Z"},"links":{"citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:eb7d3dbf12f8ebbae15b2a1204b02c657f16fb6d8cb6064eb9a8d5da2b35676a","observation_id":"3ec95b5e-fc42-4d13-84f8-e2f85cd6b2dd","resolution":{"observed_at":"2026-08-04T10:47:12.456127Z","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-04T10:47:12.462174Z","title":null,"venue":null,"work_id":null,"year":null},"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":75,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.462174Z"},"links":{"citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:d3e88dca86404bccf256a8a6ae619d8a447ea637cedbeedab785de0e66c0e57b","observation_id":"d8c9fc9c-abb2-4d1c-9936-b84d14b3c515","resolution":{"observed_at":"2026-08-04T10:47:12.462174Z","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-04T10:47:12.467578Z","title":null,"venue":null,"work_id":null,"year":null},"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":76,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.467578Z"},"links":{"citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:e971723e2608060f5d3fd8cbb9d36cc11b217ba1e18c8fa735e8077689e8e50b","observation_id":"5538401b-85a3-4adc-bfb6-8201964b14fc","resolution":{"observed_at":"2026-08-04T10:47:12.467578Z","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-04T10:47:12.472814Z","title":"In the circuit-level noise model, each operation de- scribed above is followed by a potential error character- ized by a physical error ratep","venue":null,"work_id":null,"year":null},"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":77,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.472814Z"},"links":{"citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:c91128753cf64cc7e7e9c05d0e2a3bae33c3bb57710a5d85786b16d27f24708c","observation_id":"f8520f56-ef92-4008-878f-17f70f082db7","resolution":{"observed_at":"2026-08-04T10:47:12.472814Z","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-04T10:47:12.478073Z","title":"!\"#=\"′!\"#","venue":null,"work_id":null,"year":null},"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":78,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.478073Z"},"links":{"citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:89f78c0d8fe70f48f3600910936ced9fce825e619139955548eb6d95623d9c29","observation_id":"f181a135-0676-43fa-8e16-6f9b607eedf5","resolution":{"observed_at":"2026-08-04T10:47:12.478073Z","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-04T10:47:12.484058Z","title":"′!\"#\"!!#=","venue":null,"work_id":null,"year":null},"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":79,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.484058Z"},"links":{"citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:9fe9e834f011e9d9347d15e673b613e7c1bd8c5e3172cf3da859b73c37b65e7a","observation_id":"3fe760a3-d92a-4462-b491-82f5804c8e3e","resolution":{"observed_at":"2026-08-04T10:47:12.484058Z","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-04T10:47:12.489398Z","title":"We numerically verify that all weight-3 errorsesat- isfyingeH ⊤ DCM =0andeO ⊤ =0are included as row vectors ofH DDM for all BB codes presented in Ref","venue":null,"work_id":null,"year":null},"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":80,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.489398Z"},"links":{"citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:7cfe66741d651a8ce3bce51002f22d43843806ed11edcb751c5b3d1fc8c8943c","observation_id":"aeda53db-4733-4d44-9713-2da87322d131","resolution":{"observed_at":"2026-08-04T10:47:12.489398Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2510.08695","last_updated":"2026-07-08T05:33:05Z","latest_version":2,"primary_category":"quant-ph","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"},"reference_resolution":{"displayed":80,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":80,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":80},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 80 of 80 outbound references and 1 inbound Pith citation observation for arXiv:2510.08695."}