{"as_of":"2026-08-16T22:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bdeff3e835335176eb245a72e2c16603d64842ba7deb8c87078d7f40fb7704fb","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-16T06:30:59.297886+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-07T15:21:31.020239Z","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":"2401.12434","last_updated":"2024-03-15T05:49:46Z","snapshot_observed_at":"2026-08-16T14:25:22.294645Z","submitted_at":"2024-01-23T02:01:33Z","title":"Efficient near-optimal decoding of the surface code through ensembling","version":3},"cited_work":{"arxiv_id":"2401.12434","doi":"10.48550/arxiv.2401.12434","metadata_source":"arxiv_reference","pith_arxiv_id":"2401.12434","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Efficient near-optimal decoding of the surface code through ensembling","venue":"arXiv (Cornell University)","work_id":"7c3c03ab-2d7e-4327-940c-46d7322b6e32","year":2024},"citing_paper":{"arxiv_id":"2409.17595","last_updated":"2024-09-26T07:21:58Z","snapshot_observed_at":"2026-08-13T21:53:07.774758Z","submitted_at":"2024-09-26T07:21:58Z","title":"Magic state cultivation: growing T states as cheap as CNOT gates","version":1},"reference_index":228,"source":"arxiv_source","source_observed_at":"2026-05-13T00:09:25.996037Z"},"links":{"cited_paper":"/paper/2401.12434","citing_paper":"/paper/2409.17595"},"observation_digest":"sha256:df2c253984acddacb72c6d1bdef5ad71b82237b9d7ba47107d3ee44a492b121c","observation_id":"8c0cc18d-5cb9-4a47-a57c-e6dd3c8fe219","resolution":{"observed_at":"2026-05-13T00:09:26.211665Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.12434","last_updated":"2024-03-15T05:49:46Z","snapshot_observed_at":"2026-08-16T14:25:22.294645Z","submitted_at":"2024-01-23T02:01:33Z","title":"Efficient near-optimal decoding of the surface code through ensembling","version":3},"cited_work":{"arxiv_id":"2401.12434","doi":"10.48550/arxiv.2401.12434","metadata_source":"arxiv_reference","pith_arxiv_id":"2401.12434","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Efficient near-optimal decoding of the surface code through ensembling","venue":"arXiv (Cornell University)","work_id":"7c3c03ab-2d7e-4327-940c-46d7322b6e32","year":2024},"citing_paper":{"arxiv_id":"2504.01164","last_updated":"2026-04-13T18:19:39Z","snapshot_observed_at":"2026-08-16T07:00:44.035289Z","submitted_at":"2025-04-01T20:04:27Z","title":"Diversity Methods for Improving Convergence and Accuracy of Quantum Error Correction Decoders Through Hardware Emulation","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-22T21:29:18.734737Z"},"links":{"cited_paper":"/paper/2401.12434","citing_paper":"/paper/2504.01164"},"observation_digest":"sha256:629882eab41f8e2ca6cea3992625a5cfdb1253f8c0f154108022204fe5725e1e","observation_id":"611dfcc8-daf3-4e2a-a8bf-de996799ebe3","resolution":{"observed_at":"2026-05-22T21:32:10.289664Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.12434","last_updated":"2024-03-15T05:49:46Z","snapshot_observed_at":"2026-08-16T14:25:22.294645Z","submitted_at":"2024-01-23T02:01:33Z","title":"Efficient near-optimal decoding of the surface code through ensembling","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.12434","snapshot_observed_at":"2026-08-07T15:21:31.020239Z","title":"Shutty, M","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15758","last_updated":"2026-07-19T17:42:03Z","snapshot_observed_at":"2026-08-10T08:16:59.905907Z","submitted_at":"2025-05-21T17:03:15Z","title":"A partition function framework for estimating logical error curves in stabilizer codes","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T15:21:31.020239Z"},"links":{"cited_paper":"/paper/2401.12434","citing_paper":"/paper/2505.15758"},"observation_digest":"sha256:96515228a548689c034b63745b823d68e42411611c9582806c785c90df07a4cd","observation_id":"b3c800a3-010f-4cca-8326-bcfd49f26908","resolution":{"observed_at":"2026-08-07T15:21:31.020239Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.12434","last_updated":"2024-03-15T05:49:46Z","snapshot_observed_at":"2026-08-16T14:25:22.294645Z","submitted_at":"2024-01-23T02:01:33Z","title":"Efficient near-optimal decoding of the surface code through ensembling","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.12434","snapshot_observed_at":"2026-08-05T10:43:31.783776Z","title":"Efficient near-optimal decoding of the surface code through ensembling","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.03815","last_updated":"2025-09-04T02:02:27Z","snapshot_observed_at":"2026-08-13T07:30:29.527758Z","submitted_at":"2025-09-04T02:02:27Z","title":"Learning Neural Decoding with Parallelism and Self-Coordination for Quantum Error Correction","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-05T10:43:31.783776Z"},"links":{"cited_paper":"/paper/2401.12434","citing_paper":"/paper/2509.03815"},"observation_digest":"sha256:f3fc8ebfa99833e12a43bf02733c7081b47df2216d65faca1e83587a70cf87fb","observation_id":"4c49ce19-3d8d-41bd-afca-38a3f7f7a8e4","resolution":{"observed_at":"2026-08-05T10:43:31.783776Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.12434","last_updated":"2024-03-15T05:49:46Z","snapshot_observed_at":"2026-08-16T14:25:22.294645Z","submitted_at":"2024-01-23T02:01:33Z","title":"Efficient near-optimal decoding of the surface code through ensembling","version":3},"cited_work":{"arxiv_id":"2401.12434","doi":"10.48550/arxiv.2401.12434","metadata_source":"arxiv_reference","pith_arxiv_id":"2401.12434","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Efficient near-optimal decoding of the surface code through ensembling","venue":"arXiv (Cornell University)","work_id":"7c3c03ab-2d7e-4327-940c-46d7322b6e32","year":2024},"citing_paper":{"arxiv_id":"2606.20263","last_updated":"2026-06-18T14:11:14Z","snapshot_observed_at":"2026-08-12T08:17:03.587781Z","submitted_at":"2026-06-18T14:11:14Z","title":"Vine Codes: Low-Overhead Quantum LDPC Codes on a Planar Square Grid","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-26T16:51:59.233119Z"},"links":{"cited_paper":"/paper/2401.12434","citing_paper":"/paper/2606.20263"},"observation_digest":"sha256:ad8121472e932afa838b49af3eea0f869fd795fd5f928994e01d61f0f6c4b6b3","observation_id":"1cc59e75-f913-42e8-ab46-080438af96ec","resolution":{"observed_at":"2026-07-04T04:39:34.799345Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.12434","last_updated":"2024-03-15T05:49:46Z","snapshot_observed_at":"2026-08-16T14:25:22.294645Z","submitted_at":"2024-01-23T02:01:33Z","title":"Efficient near-optimal decoding of the surface code through ensembling","version":3},"cited_work":{"arxiv_id":"2401.12434","doi":"10.48550/arxiv.2401.12434","metadata_source":"arxiv_reference","pith_arxiv_id":"2401.12434","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Efficient near-optimal decoding of the surface code through ensembling","venue":"arXiv (Cornell University)","work_id":"7c3c03ab-2d7e-4327-940c-46d7322b6e32","year":2024},"citing_paper":{"arxiv_id":"2607.01887","last_updated":"2026-07-02T08:38:27Z","snapshot_observed_at":"2026-08-04T01:19:10.602015Z","submitted_at":"2026-07-02T08:38:27Z","title":"LUCI on IBM Hardware: Error Suppression with Almost Half Syndrome Density","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-07-03T12:16:51.954644Z"},"links":{"cited_paper":"/paper/2401.12434","citing_paper":"/paper/2607.01887"},"observation_digest":"sha256:a47f8563e38ee500475b57bf7281685fb0fd85c2c11bfec4b523e6486d18044d","observation_id":"51d41094-6bce-4cb6-9de5-7bfd68923d39","resolution":{"observed_at":"2026-07-03T12:18:06.091606Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2401.12434/citation-record","integrity":"/paper/2401.12434/integrity","json":"/paper/2401.12434/citation-record.json","paper":"/paper/2401.12434"},"outbound":[],"paper":{"arxiv_id":"2401.12434","last_updated":"2024-03-15T05:49:46Z","latest_version":3,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-16T14:25:22.294645Z","submitted_at":"2024-01-23T02:01:33Z","title":"Efficient near-optimal decoding of the surface code through ensembling"},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2401.12434."}