{"as_of":"2026-08-09T23:36:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d87511d1a69488f5973effda4b77b3723dff159122213c1fa799fda27b6b97d9","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T10:47:12.182730Z","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-15T20:16:34.795449Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2503.13601","last_updated":"2025-08-12T20:55:01Z","snapshot_observed_at":"2026-08-07T16:56:58.428919Z","submitted_at":"2025-03-17T18:00:04Z","title":"Doubly-polylog-time-overhead fault-tolerant quantum computation by a polylog-time parallel minimum-weight perfect matching decoder","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.13601","snapshot_observed_at":"2026-08-04T10:47:12.182730Z","title":"Takada and H","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":28,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.182730Z"},"links":{"cited_paper":"/paper/2503.13601","citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:fc5f78d9d6f46cd652950475c8d9bfa9ea5f8d55f2f355f0ba8768e451977223","observation_id":"fa25d4c7-33b4-48c5-af7e-9c3ce148e3b4","resolution":{"observed_at":"2026-08-04T10:47:12.182730Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.13601","last_updated":"2025-08-12T20:55:01Z","snapshot_observed_at":"2026-08-07T16:56:58.428919Z","submitted_at":"2025-03-17T18:00:04Z","title":"Doubly-polylog-time-overhead fault-tolerant quantum computation by a polylog-time parallel minimum-weight perfect matching decoder","version":3},"cited_work":{"arxiv_id":"2503.13601","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.13601","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Takada and H","venue":null,"work_id":"daf76e96-4349-4989-b0a6-a5ca1317e282","year":2025},"citing_paper":{"arxiv_id":"2602.20238","last_updated":"2026-05-06T08:48:40Z","snapshot_observed_at":"2026-08-04T02:28:24.830535Z","submitted_at":"2026-02-23T19:00:00Z","title":"Proof of a finite threshold for the union-find decoder","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-15T20:12:10.149451Z"},"links":{"cited_paper":"/paper/2503.13601","citing_paper":"/paper/2602.20238"},"observation_digest":"sha256:eaa53890c07a9dea076b0911ac1f367402e25d743f4004bfa28f78826492a823","observation_id":"e2d74820-5846-4979-841e-1efe898789fb","resolution":{"observed_at":"2026-05-15T20:16:34.797262Z","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/2503.13601/citation-record","integrity":"/paper/2503.13601/integrity","json":"/paper/2503.13601/citation-record.json","paper":"/paper/2503.13601"},"outbound":[],"paper":{"arxiv_id":"2503.13601","last_updated":"2025-08-12T20:55:01Z","latest_version":3,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-07T16:56:58.428919Z","submitted_at":"2025-03-17T18:00:04Z","title":"Doubly-polylog-time-overhead fault-tolerant quantum computation by a polylog-time parallel minimum-weight perfect matching decoder"},"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 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2503.13601."}