{"as_of":"2026-08-10T08:13:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bb698c4b2ed2f3cd8e7c47b869490d36d55526b560762f1fbf61bf87e6910cb7","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":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T11:40:12.026459Z","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-05-23T00:47:18.978290Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"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":"2501.05021","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.05021","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Enhanced Min- Sum Decoding of Quantum Codes Us- ing Previous Iteration Dynamics","venue":null,"work_id":"451ba1e5-714b-47f3-967c-c71d201d6db3","year":2025},"citing_paper":{"arxiv_id":"2503.03936","last_updated":"2026-05-06T17:18:03Z","snapshot_observed_at":"2026-08-01T00:06:48.458306Z","submitted_at":"2025-03-05T22:11:22Z","title":"Construction and Decoding of Quantum Margulis Codes","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-23T00:47:00.360215Z"},"links":{"cited_paper":"/paper/2501.05021","citing_paper":"/paper/2503.03936"},"observation_digest":"sha256:85955c0a853f659b6890538fcd6a23bd73a45dc118de59ecb8a1710208776c6f","observation_id":"d3f211de-452c-4dd7-82d8-27a35b364b6e","resolution":{"observed_at":"2026-05-23T00:47:18.982408Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-07T11:40:12.026459Z","title":"Chytas, N","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":36,"source":"pdf_text","source_observed_at":"2026-08-07T11:40:12.026459Z"},"links":{"cited_paper":"/paper/2501.05021","citing_paper":"/paper/2506.01779"},"observation_digest":"sha256:e96dad5f4b0d52416429c82c386df643db6c4ee2cc05d8f46aae2a07c8007114","observation_id":"6898c9a9-2d4a-47db-9356-00a45f2ed04e","resolution":{"observed_at":"2026-08-07T11:40:12.026459Z","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":"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":"2501.05021","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.05021","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Enhanced Min- Sum Decoding of Quantum Codes Us- ing Previous Iteration Dynamics","venue":null,"work_id":"451ba1e5-714b-47f3-967c-c71d201d6db3","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":14,"source":"pdf_text","source_observed_at":"2026-05-08T18:01:02.695918Z"},"links":{"cited_paper":"/paper/2501.05021","citing_paper":"/paper/2605.03218"},"observation_digest":"sha256:3d4eda7f5bf6b957129ec3061049e9a390e0ee2e0977fb23802ce9387e26cd82","observation_id":"d5aba941-6979-455c-a6fb-576d10b1748e","resolution":{"observed_at":"2026-05-12T10:51:29.837267Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"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":"2501.05021","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.05021","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Enhanced Min- Sum Decoding of Quantum Codes Us- ing Previous Iteration Dynamics","venue":null,"work_id":"451ba1e5-714b-47f3-967c-c71d201d6db3","year":2025},"citing_paper":{"arxiv_id":"2605.10433","last_updated":"2026-05-11T12:04:44Z","snapshot_observed_at":"2026-07-06T23:22:23.287792Z","submitted_at":"2026-05-11T12:04:44Z","title":"Syndrome Adaptive Gain Control for Min-Sum Decoding of Quantum LDPC Codes","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-12T05:27:26.295347Z"},"links":{"cited_paper":"/paper/2501.05021","citing_paper":"/paper/2605.10433"},"observation_digest":"sha256:526b18b68e5a6c0f1b70ea4339edf49c18416d8bef8a21cfd9ca9f744a2c52d2","observation_id":"e14db264-278c-454e-84ea-8c1243aae935","resolution":{"observed_at":"2026-05-12T05:31:24.023445Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"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":"2501.05021","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.05021","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Enhanced Min- Sum Decoding of Quantum Codes Us- ing Previous Iteration Dynamics","venue":null,"work_id":"451ba1e5-714b-47f3-967c-c71d201d6db3","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":8,"source":"pdf_text","source_observed_at":"2026-05-15T01:46:49.909583Z"},"links":{"cited_paper":"/paper/2501.05021","citing_paper":"/paper/2605.14170"},"observation_digest":"sha256:3792afd98d54d74d1d12d491c902e1b7dee5424a60c5d9f26a0b4dc0ea0ac777","observation_id":"fe855e51-22bc-4948-bf35-72621fbf2789","resolution":{"observed_at":"2026-05-15T01:48:28.443651Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2501.05021/citation-record","integrity":"/paper/2501.05021/integrity","json":"/paper/2501.05021/citation-record.json","paper":"/paper/2501.05021"},"outbound":[],"paper":{"arxiv_id":"2501.05021","last_updated":"2025-01-09T07:28:26Z","latest_version":1,"primary_category":"quant-ph","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"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2501.05021."}