{"as_of":"2026-08-08T02:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3334ecb245eaa00e08a3aef8641fd48940f8b9d86d90acae2eaa802155446eeb","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":18,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":18,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":18,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":18,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:48:27.634142Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":1,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"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":"2406.14527","doi":"10.48550/arxiv.2406.14527","metadata_source":"arxiv_reference","pith_arxiv_id":"2406.14527","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2406.14527 (2024)","venue":"arXiv (Cornell University)","work_id":"a11065e7-927c-4d2a-ae95-3d2b3f4980bb","year":2025},"citing_paper":{"arxiv_id":"2406.17995","last_updated":"2026-03-11T16:38:21Z","snapshot_observed_at":"2026-07-06T18:37:04.753504Z","submitted_at":"2024-06-26T00:50:10Z","title":"Managing Classical Processing Requirements for Quantum Error Correction","version":4},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-05-24T00:08:21.027779Z"},"links":{"cited_paper":"/paper/2406.14527","citing_paper":"/paper/2406.17995"},"observation_digest":"sha256:a80e879c6d341b1c822d860a0c4641a4e5f951f31b54845e0437da885cb3f707","observation_id":"1484c75c-3158-4160-aa87-903fabcb98f3","resolution":{"observed_at":"2026-05-24T00:08:38.775078Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"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":"2406.14527","doi":"10.48550/arxiv.2406.14527","metadata_source":"arxiv_reference","pith_arxiv_id":"2406.14527","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2406.14527 (2024)","venue":"arXiv (Cornell University)","work_id":"a11065e7-927c-4d2a-ae95-3d2b3f4980bb","year":2025},"citing_paper":{"arxiv_id":"2410.11942","last_updated":"2026-05-11T04:48:38Z","snapshot_observed_at":"2026-07-06T19:34:05.643989Z","submitted_at":"2024-10-15T18:00:00Z","title":"Operator algebra and algorithmic construction of boundaries and defects in (2+1)D topological Pauli stabilizer codes","version":5},"reference_index":116,"source":"pdf_text","source_observed_at":"2026-05-23T18:41:14.926900Z"},"links":{"cited_paper":"/paper/2406.14527","citing_paper":"/paper/2410.11942"},"observation_digest":"sha256:9b7986ec31f5bae26ab6f763abe6b0d81c3a9e4510fdfaad30e5435541e9736d","observation_id":"f457fcc7-84b3-4175-a719-527598a5f1a8","resolution":{"observed_at":"2026-05-23T18:43:19.026741Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"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":"2406.14527","doi":"10.48550/arxiv.2406.14527","metadata_source":"arxiv_reference","pith_arxiv_id":"2406.14527","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2406.14527 (2024)","venue":"arXiv (Cornell University)","work_id":"a11065e7-927c-4d2a-ae95-3d2b3f4980bb","year":2025},"citing_paper":{"arxiv_id":"2501.08036","last_updated":"2026-04-23T05:46:25Z","snapshot_observed_at":"2026-07-06T20:20:51.583343Z","submitted_at":"2025-01-14T11:41:45Z","title":"Decoding Quantum LDPC Codes using Collaborative Check Node Removal","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-23T05:33:14.238988Z"},"links":{"cited_paper":"/paper/2406.14527","citing_paper":"/paper/2501.08036"},"observation_digest":"sha256:267e397894dd9c880bc5bce9dbb63724ea4c5a275a06b402b87e5886a65a8377","observation_id":"c16fbf80-42be-4a51-a0da-deec59c4b501","resolution":{"observed_at":"2026-05-23T05:35:27.096248Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-07T14:48:27.634142Z","title":"Wolanski and B","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.17718","last_updated":"2025-05-23T10:35:36Z","snapshot_observed_at":"2026-08-07T23:14:50.286548Z","submitted_at":"2025-05-23T10:35:36Z","title":"Leveraging biased noise for more efficient quantum error correction at the circuit-level with two-level qubits","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-07T14:48:27.634142Z"},"links":{"cited_paper":"/paper/2406.14527","citing_paper":"/paper/2505.17718"},"observation_digest":"sha256:5b0fbf0e10a79b3989a0564ec2f8de5bcf41850dc4cbf310ee846bd347cf836e","observation_id":"f5aec1b8-9e9b-41fb-9f7a-e83308aeaebc","resolution":{"observed_at":"2026-08-07T14:48:27.634142Z","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-07T12:50:21.594804Z","title":"Wolanski and B","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.23567","last_updated":"2025-05-29T15:41:11Z","snapshot_observed_at":"2026-08-07T12:40:56.951455Z","submitted_at":"2025-05-29T15:41:11Z","title":"Scalable decoding protocols for fast transversal logic in the surface code","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-07T12:50:21.594804Z"},"links":{"cited_paper":"/paper/2406.14527","citing_paper":"/paper/2505.23567"},"observation_digest":"sha256:d7b90eca79414f594bce01ad108cee549df2661f9d84e77368ba87954449de08","observation_id":"407978e8-ec59-42f1-98f8-a5d8f281ee19","resolution":{"observed_at":"2026-08-07T12:50:21.594804Z","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-07T11:40:11.030014Z","title":"Wolanski and B","venue":null,"work_id":null,"year":2025},"citing_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},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T11:40:11.030014Z"},"links":{"cited_paper":"/paper/2406.14527","citing_paper":"/paper/2506.01779"},"observation_digest":"sha256:96551e01487fd540cc31d38241124899eda6cade5b0afe5ee36c3925d96ffdde","observation_id":"d47f5b59-6aa1-4424-847a-3d44267742f9","resolution":{"observed_at":"2026-08-07T11:40:11.030014Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.14527","last_updated":"2025-01-03T16:40:42Z","snapshot_observed_at":"2026-08-05T00:02:31.204110Z","submitted_at":"2024-06-20T17:39:31Z","title":"Ambiguity Clustering: an accurate and efficient decoder for qLDPC codes","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.14527","snapshot_observed_at":"2026-08-06T21:28:22.909864Z","title":"Ambiguity clustering: an accurate and efficient decoder for qldpc codes,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.00254","last_updated":"2026-02-10T16:10:46Z","snapshot_observed_at":"2026-08-06T21:18:08.311292Z","submitted_at":"2025-06-30T20:47:28Z","title":"Fully Parallelized BP Decoding for Quantum LDPC Codes Can Outperform BP-OSD","version":3},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:22.909864Z"},"links":{"cited_paper":"/paper/2406.14527","citing_paper":"/paper/2507.00254"},"observation_digest":"sha256:b86cc49c25cbd7c7d6cd40a91879c8a36f194ad9eb4706ac597c9bf979466d52","observation_id":"b151eb24-da4b-488a-a591-5a96297513b6","resolution":{"observed_at":"2026-08-06T21:28:22.909864Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"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-06T16:48:48.354348Z","title":"Ambiguity clustering: an accurate and efficient decoder for qldpc codes","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.12511","last_updated":"2025-07-16T18:00:00Z","snapshot_observed_at":"2026-08-06T16:42:30.539435Z","submitted_at":"2025-07-16T18:00:00Z","title":"Unfolded distillation: very low-cost magic state preparation for biased-noise qubits","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-06T16:48:48.354348Z"},"links":{"cited_paper":"/paper/2406.14527","citing_paper":"/paper/2507.12511"},"observation_digest":"sha256:4eb45dd00d8bb824469871fff5cda5940d740939951c7e3bf5a317e3b4e84bf8","observation_id":"cde867ed-d651-42f1-bd43-1806197105d0","resolution":{"observed_at":"2026-08-06T16:48:48.354348Z","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":"2406.14527","doi":"10.48550/arxiv.2406.14527","metadata_source":"arxiv_reference","pith_arxiv_id":"2406.14527","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2406.14527 (2024)","venue":"arXiv (Cornell University)","work_id":"a11065e7-927c-4d2a-ae95-3d2b3f4980bb","year":2025},"citing_paper":{"arxiv_id":"2509.01892","last_updated":"2026-04-17T16:32:39Z","snapshot_observed_at":"2026-08-07T08:32:01.737029Z","submitted_at":"2025-09-02T02:30:02Z","title":"Accelerating BP-based decoders for QLDPC Codes with Local Syndrome-Based Preprocessing","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-05-18T20:26:16.981457Z"},"links":{"cited_paper":"/paper/2406.14527","citing_paper":"/paper/2509.01892"},"observation_digest":"sha256:ee16549bbdce57610d3bab2b2ee23efb24522575ce5d9e8ab9e3b0e0d0989ebe","observation_id":"3cc2d8ab-c32c-469a-86a2-df60b731d641","resolution":{"observed_at":"2026-05-18T20:26:51.106378Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-04T11:21:14.934911Z","title":"Ambiguity clustering: an accurate and e fficient decoder for qLDPC codes","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.05795","last_updated":"2026-01-25T15:28:48Z","snapshot_observed_at":"2026-08-04T11:21:02.732345Z","submitted_at":"2025-10-07T11:11:50Z","title":"Efficient Post-Selection for General Quantum LDPC Codes","version":4},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-04T11:21:14.934911Z"},"links":{"cited_paper":"/paper/2406.14527","citing_paper":"/paper/2510.05795"},"observation_digest":"sha256:aabd2dd48d701d4ebc91732584b863a8fbd6da4ac5163e8bcefdd3cb1c2a8bf4","observation_id":"f5af2fcb-de84-4e09-b084-6ce1e430f37f","resolution":{"observed_at":"2026-08-04T11:21:14.934911Z","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-06T13:54:37.204027Z","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:b0e9225ac06c93dcde719e6aa59eaf651872055b7e354780ba478fb14c0c0814","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":"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-03T13:17:49.204207Z","title":"Ambiguity Clustering: an accurate and efficient decoder for qLDPC codes,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.00064","last_updated":"2026-06-24T06:13:08Z","snapshot_observed_at":"2026-08-03T13:17:43.736589Z","submitted_at":"2025-12-31T19:00:01Z","title":"Pauli stabilizer formalism for topological quantum field theories and generalized statistics","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-03T13:17:49.204207Z"},"links":{"cited_paper":"/paper/2406.14527","citing_paper":"/paper/2601.00064"},"observation_digest":"sha256:389ed67d6cf127bbd38967a8327e323b842e66ab2d48ea54cbf51ffab2b73264","observation_id":"69d58a19-22cf-4659-89e3-3c1a22110c8a","resolution":{"observed_at":"2026-08-03T13:17:49.204207Z","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-02T20:44:35.913815Z","title":"Wolanski and B","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.22770","last_updated":"2026-06-08T17:16:15Z","snapshot_observed_at":"2026-08-02T20:44:31.689074Z","submitted_at":"2026-02-26T09:00:20Z","title":"A matching decoder for bivariate bicycle codes","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-02T20:44:35.913815Z"},"links":{"cited_paper":"/paper/2406.14527","citing_paper":"/paper/2602.22770"},"observation_digest":"sha256:72152bcea63766fd609f813ade7c4e5dddd20d690efb69e84578d3f8a9bd0253","observation_id":"43cd0408-c8cb-4e1f-99a2-3f3dbbd3c318","resolution":{"observed_at":"2026-08-02T20:44:35.913815Z","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":"2406.14527","doi":"10.48550/arxiv.2406.14527","metadata_source":"arxiv_reference","pith_arxiv_id":"2406.14527","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2406.14527 (2024)","venue":"arXiv (Cornell University)","work_id":"a11065e7-927c-4d2a-ae95-3d2b3f4980bb","year":2025},"citing_paper":{"arxiv_id":"2605.03218","last_updated":"2026-05-04T23:16:16Z","snapshot_observed_at":"2026-07-06T23:16:10.769968Z","submitted_at":"2026-05-04T23:16:16Z","title":"Edge-Based Anisotropic Decoding for Generalized Bicycle Codes","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-08T18:01:02.695918Z"},"links":{"cited_paper":"/paper/2406.14527","citing_paper":"/paper/2605.03218"},"observation_digest":"sha256:00ea1ba4c7a02497b053d3c858bfa70199efc2b842e9790bfe745663936ddfe8","observation_id":"f1f40dd7-e430-4efa-80ae-69c8b06bd9c3","resolution":{"observed_at":"2026-05-12T10:51:29.869773Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"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":"2406.14527","doi":"10.48550/arxiv.2406.14527","metadata_source":"arxiv_reference","pith_arxiv_id":"2406.14527","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2406.14527 (2024)","venue":"arXiv (Cornell University)","work_id":"a11065e7-927c-4d2a-ae95-3d2b3f4980bb","year":2025},"citing_paper":{"arxiv_id":"2605.04151","last_updated":"2026-05-05T18:00:05Z","snapshot_observed_at":"2026-07-06T23:16:59.568304Z","submitted_at":"2026-05-05T18:00:05Z","title":"Topological subsystem bivariate bicycle codes with four-qubit check operators","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-08T18:24:23.246501Z"},"links":{"cited_paper":"/paper/2406.14527","citing_paper":"/paper/2605.04151"},"observation_digest":"sha256:137db4238d2252568c41e514e8c81d788dcbcd417f904d3c3851537fcf4aaaba","observation_id":"dc01d8c1-2db1-425e-b379-9a228c400906","resolution":{"observed_at":"2026-05-09T06:30:40.768161Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"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":"2406.14527","doi":"10.48550/arxiv.2406.14527","metadata_source":"arxiv_reference","pith_arxiv_id":"2406.14527","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2406.14527 (2024)","venue":"arXiv (Cornell University)","work_id":"a11065e7-927c-4d2a-ae95-3d2b3f4980bb","year":2025},"citing_paper":{"arxiv_id":"2605.14170","last_updated":"2026-05-13T22:49:35Z","snapshot_observed_at":"2026-07-06T23:25:39.415637Z","submitted_at":"2026-05-13T22:49:35Z","title":"Multiple-Bases Belief Propagation List Decoding for Quantum LDPC Codes","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-15T01:46:49.909583Z"},"links":{"cited_paper":"/paper/2406.14527","citing_paper":"/paper/2605.14170"},"observation_digest":"sha256:0bc9e324a5f3e14ff46ef33de1cd7df57e7815a27caf045d6ca89b37307cf2bf","observation_id":"0579da58-c966-453b-89f3-b5205451f0e4","resolution":{"observed_at":"2026-05-15T01:48:28.440402Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"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":"2406.14527","doi":"10.48550/arxiv.2406.14527","metadata_source":"arxiv_reference","pith_arxiv_id":"2406.14527","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2406.14527 (2024)","venue":"arXiv (Cornell University)","work_id":"a11065e7-927c-4d2a-ae95-3d2b3f4980bb","year":2025},"citing_paper":{"arxiv_id":"2606.18240","last_updated":"2026-06-16T17:58:26Z","snapshot_observed_at":"2026-08-06T08:32:28.438138Z","submitted_at":"2026-06-16T17:58:26Z","title":"Impulse Decoding of Quantum LDPC Codes: Equivalence of Degeneracy and Code-Shortening","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-27T00:46:20.548908Z"},"links":{"cited_paper":"/paper/2406.14527","citing_paper":"/paper/2606.18240"},"observation_digest":"sha256:11a09c7a44572c63209e6cd627b888a285d3ce9f18bc18f83a47be90d815aca9","observation_id":"7b07138b-ce02-44d1-8f16-5c7d7051acce","resolution":{"observed_at":"2026-07-03T21:18:58.559222Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"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":"2406.14527","doi":"10.48550/arxiv.2406.14527","metadata_source":"arxiv_reference","pith_arxiv_id":"2406.14527","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2406.14527 (2024)","venue":"arXiv (Cornell University)","work_id":"a11065e7-927c-4d2a-ae95-3d2b3f4980bb","year":2025},"citing_paper":{"arxiv_id":"2606.20263","last_updated":"2026-06-18T14:11:14Z","snapshot_observed_at":"2026-07-06T23:55:25.144457Z","submitted_at":"2026-06-18T14:11:14Z","title":"Vine Codes: Low-Overhead Quantum LDPC Codes on a Planar Square Grid","version":1},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-06-26T16:51:59.233119Z"},"links":{"cited_paper":"/paper/2406.14527","citing_paper":"/paper/2606.20263"},"observation_digest":"sha256:eb9fb2eb3d144389a198baaf92bed5970b81e63c8c753805261bb49d0b24f90b","observation_id":"f407b93b-476c-4767-83c5-c2cfb704f076","resolution":{"observed_at":"2026-07-04T04:39:34.758298Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2406.14527/citation-record","integrity":"/paper/2406.14527/integrity","json":"/paper/2406.14527/citation-record.json","paper":"/paper/2406.14527"},"outbound":[],"paper":{"arxiv_id":"2406.14527","last_updated":"2025-01-03T16:40:42Z","latest_version":2,"primary_category":"quant-ph","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"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 18 inbound Pith citation observations for arXiv:2406.14527."}