{"as_of":"2026-08-11T14:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:50262e67b6ccbaee8b3f5b64d4bdd2b078ccaafa4aea576fe85747517ed9f412","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T19:57:57.810346Z","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-23T16:53:12.917200Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.08817","last_updated":"2024-12-11T23:14:23Z","snapshot_observed_at":"2026-07-06T20:05:36.919481Z","submitted_at":"2024-12-11T23:14:23Z","title":"Cluster Decomposition for Improved Erasure Decoding of Quantum LDPC Codes","version":1},"cited_work":{"arxiv_id":"2412.08817","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.08817","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"d64db91a-ed5f-4d55-969c-e5a836185e6b","year":2024},"citing_paper":{"arxiv_id":"2411.13509","last_updated":"2026-05-01T18:51:06Z","snapshot_observed_at":"2026-07-06T19:53:17.024873Z","submitted_at":"2024-11-20T18:02:05Z","title":"Degenerate quantum erasure decoding","version":3},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-05-23T16:50:50.088518Z"},"links":{"cited_paper":"/paper/2412.08817","citing_paper":"/paper/2411.13509"},"observation_digest":"sha256:9a8bcde350ea7e07fa36e8d855f9f0265dea47b13628b0ec4db2d6e3ebe1b0bc","observation_id":"123a49da-f94e-4f8b-a835-c1a0b61f8274","resolution":{"observed_at":"2026-05-23T16:53:12.920039Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.08817","last_updated":"2024-12-11T23:14:23Z","snapshot_observed_at":"2026-07-06T20:05:36.919481Z","submitted_at":"2024-12-11T23:14:23Z","title":"Cluster Decomposition for Improved Erasure Decoding of Quantum LDPC Codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.08817","snapshot_observed_at":"2026-08-10T19:57:57.810346Z","title":"Cluster decomposition for improved erasure decoding of quantum ldpc codes,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.09622","last_updated":"2025-06-05T14:30:00Z","snapshot_observed_at":"2026-08-10T20:08:19.646091Z","submitted_at":"2025-01-16T16:01:02Z","title":"Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-10T19:57:57.810346Z"},"links":{"cited_paper":"/paper/2412.08817","citing_paper":"/paper/2501.09622"},"observation_digest":"sha256:3bcaf029ce8e97c9042fff23077460674eec5846c23f57b5179fa96bc68f5f79","observation_id":"b091ab9f-ac58-4b5c-ba24-6f519a333dd3","resolution":{"observed_at":"2026-08-10T19:57:57.810346Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.08817","last_updated":"2024-12-11T23:14:23Z","snapshot_observed_at":"2026-07-06T20:05:36.919481Z","submitted_at":"2024-12-11T23:14:23Z","title":"Cluster Decomposition for Improved Erasure Decoding of Quantum LDPC Codes","version":1},"cited_work":{"arxiv_id":"2412.08817","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.08817","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"d64db91a-ed5f-4d55-969c-e5a836185e6b","year":2024},"citing_paper":{"arxiv_id":"2604.18714","last_updated":"2026-04-20T18:14:28Z","snapshot_observed_at":"2026-08-03T04:33:55.994506Z","submitted_at":"2026-04-20T18:14:28Z","title":"Efficient Routing of Quantum LDPC Codes on Programmable 2D Toric Architectures","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-05-10T04:46:26.589764Z"},"links":{"cited_paper":"/paper/2412.08817","citing_paper":"/paper/2604.18714"},"observation_digest":"sha256:9ae2d8ecf50672918c381620aec68eac6c5f4a60f8a13e6878531f268f05d3f8","observation_id":"520fdc67-7ee5-419a-8390-59ba847aeaea","resolution":{"observed_at":"2026-05-10T11:40:19.657098Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.08817","last_updated":"2024-12-11T23:14:23Z","snapshot_observed_at":"2026-07-06T20:05:36.919481Z","submitted_at":"2024-12-11T23:14:23Z","title":"Cluster Decomposition for Improved Erasure Decoding of Quantum LDPC Codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.08817","snapshot_observed_at":"2026-07-11T07:07:39.359688Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.05386","last_updated":"2026-07-09T17:58:26Z","snapshot_observed_at":"2026-08-08T13:08:36.166528Z","submitted_at":"2026-07-06T17:56:55Z","title":"Logical Spectroscopy: Lifted-Product Codes with Addressable Bases","version":2},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-07-11T07:07:39.359688Z"},"links":{"cited_paper":"/paper/2412.08817","citing_paper":"/paper/2607.05386"},"observation_digest":"sha256:64a8be35f7771adfa1ed351117047601c4ccd9530b698b366e323bd585a2235a","observation_id":"6488af9a-2c0d-45d9-8493-5fea8f40c992","resolution":{"observed_at":"2026-07-11T07:07:39.359688Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2412.08817/citation-record","integrity":"/paper/2412.08817/integrity","json":"/paper/2412.08817/citation-record.json","paper":"/paper/2412.08817"},"outbound":[],"paper":{"arxiv_id":"2412.08817","last_updated":"2024-12-11T23:14:23Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-07-06T20:05:36.919481Z","submitted_at":"2024-12-11T23:14:23Z","title":"Cluster Decomposition for Improved Erasure Decoding of Quantum LDPC 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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2412.08817."}