{"as_of":"2026-08-10T01:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f12ee67d5e4e50bb86faf018450a8c5c9ca8d2c20a2dc4da23530e1f5b4ee833","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":7,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":7,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":7,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T11:40:11.848443Z","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-04T04:49:36.088121Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"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-07T11:40:11.848443Z","title":null,"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":31,"source":"pdf_text","source_observed_at":"2026-08-07T11:40:11.848443Z"},"links":{"cited_paper":"/paper/2502.16408","citing_paper":"/paper/2506.01779"},"observation_digest":"sha256:7030351ad71d89bbd19b2d5c0beecb1689d2bd0356a4823cb52cd14842041384","observation_id":"9a2b6102-8428-4571-b616-6df7281977ad","resolution":{"observed_at":"2026-08-07T11:40:11.848443Z","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-06T16:48:48.088282Z","title":"Decision-tree decoders for general quantum ldpc codes, feb","venue":null,"work_id":null,"year":2025},"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":76,"source":"pdf_text","source_observed_at":"2026-08-06T16:48:48.088282Z"},"links":{"cited_paper":"/paper/2502.16408","citing_paper":"/paper/2507.12511"},"observation_digest":"sha256:17164709d0fea5c276424b0be317df7424de835b6214b4493c419e120d1bac0e","observation_id":"70f8685f-0240-4f44-9152-84d041ed8cff","resolution":{"observed_at":"2026-08-06T16:48:48.088282Z","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":{"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":"2502.16408","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.16408","snapshot_observed_at":"2026-07-04T04:49:36.088121Z","title":"arXiv preprint arXiv:2502.16408 , year=","venue":null,"work_id":"34e096b2-3890-43ef-913e-a8cb863fc548","year":2025},"citing_paper":{"arxiv_id":"2603.19062","last_updated":"2026-04-26T15:45:47Z","snapshot_observed_at":"2026-08-07T17:49:15.193238Z","submitted_at":"2026-03-19T15:53:51Z","title":"Fair Decoder Baselines and Rigorous Finite-Size Scaling for Bivariate Bicycle Codes on the Quantum Erasure Channel","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-15T08:16:11.388532Z"},"links":{"cited_paper":"/paper/2502.16408","citing_paper":"/paper/2603.19062"},"observation_digest":"sha256:da45c5fe404144aa7c2f69d72005d5e57937e005acb574a4c6673966cc3314ab","observation_id":"dd5ee219-95d5-4baf-939c-50de04dfc8bc","resolution":{"observed_at":"2026-05-15T08:19:52.680601Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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"}},{"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":"2502.16408","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.16408","snapshot_observed_at":"2026-07-04T04:49:36.088121Z","title":"arXiv preprint arXiv:2502.16408 , year=","venue":null,"work_id":"34e096b2-3890-43ef-913e-a8cb863fc548","year":2025},"citing_paper":{"arxiv_id":"2605.20346","last_updated":"2026-06-23T18:51:06Z","snapshot_observed_at":"2026-07-06T23:30:58.549353Z","submitted_at":"2026-05-19T18:03:20Z","title":"Forced Gap Post-Selection for Quantum LDPC Codes and their Operations","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-05-21T07:31:03.385889Z"},"links":{"cited_paper":"/paper/2502.16408","citing_paper":"/paper/2605.20346"},"observation_digest":"sha256:d06e8a41ed78dc6e19e7f8c02bb6ab7d28edee45d7c8148ddb3105b773ca986d","observation_id":"103b894f-ec81-45d7-8d12-88bd885dd3a5","resolution":{"observed_at":"2026-05-21T07:34:02.760982Z","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"}},{"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":"2502.16408","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.16408","snapshot_observed_at":"2026-07-04T04:49:36.088121Z","title":"arXiv preprint arXiv:2502.16408 , year=","venue":null,"work_id":"34e096b2-3890-43ef-913e-a8cb863fc548","year":2025},"citing_paper":{"arxiv_id":"2606.20513","last_updated":"2026-06-18T17:34:11Z","snapshot_observed_at":"2026-08-05T04:29:45.109124Z","submitted_at":"2026-06-18T17:34:11Z","title":"Approximating optimal decoding of quantum LDPC codes with narrow frontiers","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-26T16:42:17.891781Z"},"links":{"cited_paper":"/paper/2502.16408","citing_paper":"/paper/2606.20513"},"observation_digest":"sha256:e16400f4bfea17a5e64aa12721daf49e62a946ac13f970bf6fdce8232f6c0d6e","observation_id":"cdb36878-c709-4ec5-aa22-22f3892824bd","resolution":{"observed_at":"2026-07-04T04:49:36.090827Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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"}},{"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":"2502.16408","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.16408","snapshot_observed_at":"2026-07-04T04:49:36.088121Z","title":"arXiv preprint arXiv:2502.16408 , year=","venue":null,"work_id":"34e096b2-3890-43ef-913e-a8cb863fc548","year":2025},"citing_paper":{"arxiv_id":"2606.30592","last_updated":"2026-06-29T17:34:21Z","snapshot_observed_at":"2026-08-08T10:46:51.440110Z","submitted_at":"2026-06-29T17:34:21Z","title":"Untangling QLDPC Codes with Biased Noise Ancilla","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-06-30T05:55:29.858800Z"},"links":{"cited_paper":"/paper/2502.16408","citing_paper":"/paper/2606.30592"},"observation_digest":"sha256:7a71ee82ab0d90fce81416090e2da6a4cfcbbc5e16dccdbde6b21f2e1e5fae56","observation_id":"fab67e90-a1a7-4410-8c4d-4add285fe49e","resolution":{"observed_at":"2026-06-30T13:34:40.972742Z","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/2502.16408/citation-record","integrity":"/paper/2502.16408/integrity","json":"/paper/2502.16408/citation-record.json","paper":"/paper/2502.16408"},"outbound":[],"paper":{"arxiv_id":"2502.16408","last_updated":"2025-02-23T02:29:14Z","latest_version":1,"primary_category":"quant-ph","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"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 7 inbound Pith citation observations for arXiv:2502.16408."}