{"as_of":"2026-08-19T23:31:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:12f1a44945e29fa4d14374b7ae428de80eb8119014931806047c949929e27f01","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":8,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":8,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":8,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":8,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-28T22:09:41.070396Z","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-04T20:00:08.567538Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2603.22532","last_updated":"2026-08-14T08:13:21Z","snapshot_observed_at":"2026-08-19T23:30:03.546465Z","submitted_at":"2026-03-23T19:52:23Z","title":"Distance-Finding Algorithms for Quantum Codes and Circuits","version":2},"cited_work":{"arxiv_id":"2603.22532","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2603.22532","snapshot_observed_at":"2026-08-17T02:09:27.147534Z","title":"Distance-finding algorithms for quantum codes and cir- cuits","venue":null,"work_id":"231e931c-9a0d-4191-875d-45385b0e438d","year":2026},"citing_paper":{"arxiv_id":"2604.09797","last_updated":"2026-04-20T21:10:18Z","snapshot_observed_at":"2026-08-11T13:13:15.082899Z","submitted_at":"2026-04-10T18:19:25Z","title":"Optimising Quantum Error Correction Using Morphing Circuits","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-05-10T17:55:08.272761Z"},"links":{"cited_paper":"/paper/2603.22532","citing_paper":"/paper/2604.09797"},"observation_digest":"sha256:69282f6a5c3ed071493e8ac25f961c7a3b13f2d1920308a9a7a4e60ed344ad27","observation_id":"8ed9e87c-c5ae-45d1-932a-74d87b5709a9","resolution":{"observed_at":"2026-08-17T02:09:27.147534Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2603.22532","last_updated":"2026-08-14T08:13:21Z","snapshot_observed_at":"2026-08-19T23:30:03.546465Z","submitted_at":"2026-03-23T19:52:23Z","title":"Distance-Finding Algorithms for Quantum Codes and Circuits","version":2},"cited_work":{"arxiv_id":"2603.22532","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2603.22532","snapshot_observed_at":"2026-08-17T02:09:27.147534Z","title":"Distance-finding algorithms for quantum codes and cir- cuits","venue":null,"work_id":"231e931c-9a0d-4191-875d-45385b0e438d","year":2026},"citing_paper":{"arxiv_id":"2604.19481","last_updated":"2026-04-21T14:02:12Z","snapshot_observed_at":"2026-08-02T05:59:04.891529Z","submitted_at":"2026-04-21T14:02:12Z","title":"Fault-Tolerant Quantum Computing with Trapped Ions: The Walking Cat Architecture","version":1},"reference_index":164,"source":"pdf_text","source_observed_at":"2026-05-10T02:15:19.433368Z"},"links":{"cited_paper":"/paper/2603.22532","citing_paper":"/paper/2604.19481"},"observation_digest":"sha256:f14dd94a4ff94777ec6d1fb0750a07add55cfcacb3290ef4cbdc94d534c41ac1","observation_id":"ba8370bc-5679-4f50-8737-c1b2218f7142","resolution":{"observed_at":"2026-08-17T02:09:27.147534Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2603.22532","last_updated":"2026-08-14T08:13:21Z","snapshot_observed_at":"2026-08-19T23:30:03.546465Z","submitted_at":"2026-03-23T19:52:23Z","title":"Distance-Finding Algorithms for Quantum Codes and Circuits","version":2},"cited_work":{"arxiv_id":"2603.22532","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2603.22532","snapshot_observed_at":"2026-08-17T02:09:27.147534Z","title":"Distance-finding algorithms for quantum codes and cir- cuits","venue":null,"work_id":"231e931c-9a0d-4191-875d-45385b0e438d","year":2026},"citing_paper":{"arxiv_id":"2605.14173","last_updated":"2026-05-13T22:52:01Z","snapshot_observed_at":"2026-08-12T19:25:16.247105Z","submitted_at":"2026-05-13T22:52:01Z","title":"Univariate Bicycle Quantum LDPC Codes: Explicit Logical Structure and Distance Bounds","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-15T01:42:39.110455Z"},"links":{"cited_paper":"/paper/2603.22532","citing_paper":"/paper/2605.14173"},"observation_digest":"sha256:02eab60341d1ee45a6e90ede965720cda14b0f15ffa56d6bcda1f1729220f48b","observation_id":"2ac5fc98-4a54-4e2a-90a0-6cbae28f1f0a","resolution":{"observed_at":"2026-08-17T02:09:27.147534Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2603.22532","last_updated":"2026-08-14T08:13:21Z","snapshot_observed_at":"2026-08-19T23:30:03.546465Z","submitted_at":"2026-03-23T19:52:23Z","title":"Distance-Finding Algorithms for Quantum Codes and Circuits","version":2},"cited_work":{"arxiv_id":"2603.22532","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2603.22532","snapshot_observed_at":"2026-08-17T02:09:27.147534Z","title":"Distance-finding algorithms for quantum codes and cir- cuits","venue":null,"work_id":"231e931c-9a0d-4191-875d-45385b0e438d","year":2026},"citing_paper":{"arxiv_id":"2605.15348","last_updated":"2026-05-14T19:18:25Z","snapshot_observed_at":"2026-08-15T23:02:26.962229Z","submitted_at":"2026-05-14T19:18:25Z","title":"Clifford-deformed zero-rate LDPC codes with 50% biased noise thresholds","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-05-19T15:44:51.075184Z"},"links":{"cited_paper":"/paper/2603.22532","citing_paper":"/paper/2605.15348"},"observation_digest":"sha256:032f334620a1ea47bc12432e8089e18a29d54689380c2a663350967c52878eaa","observation_id":"4b7ad231-0ce1-490d-b167-bccad73e6e12","resolution":{"observed_at":"2026-08-17T02:09:27.147534Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2603.22532","last_updated":"2026-08-14T08:13:21Z","snapshot_observed_at":"2026-08-19T23:30:03.546465Z","submitted_at":"2026-03-23T19:52:23Z","title":"Distance-Finding Algorithms for Quantum Codes and Circuits","version":2},"cited_work":{"arxiv_id":"2603.22532","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2603.22532","snapshot_observed_at":"2026-08-17T02:09:27.147534Z","title":"Distance-finding algorithms for quantum codes and cir- cuits","venue":null,"work_id":"231e931c-9a0d-4191-875d-45385b0e438d","year":2026},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"cited_paper":"/paper/2603.22532","citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:1979133f0f20d5b2d848f984e71805796fe180e3f076993c40f76d29614a8b3a","observation_id":"be7815ff-bdcf-4df5-8dc1-dd029094f45e","resolution":{"observed_at":"2026-08-17T02:09:27.147534Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2603.22532","last_updated":"2026-08-14T08:13:21Z","snapshot_observed_at":"2026-08-19T23:30:03.546465Z","submitted_at":"2026-03-23T19:52:23Z","title":"Distance-Finding Algorithms for Quantum Codes and Circuits","version":2},"cited_work":{"arxiv_id":"2603.22532","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2603.22532","snapshot_observed_at":"2026-08-17T02:09:27.147534Z","title":"Distance-finding algorithms for quantum codes and cir- cuits","venue":null,"work_id":"231e931c-9a0d-4191-875d-45385b0e438d","year":2026},"citing_paper":{"arxiv_id":"2606.12445","last_updated":"2026-05-29T15:34:33Z","snapshot_observed_at":"2026-08-15T19:24:08.051720Z","submitted_at":"2026-05-29T15:34:33Z","title":"SAT, MaxSAT, and SMT for QLDPC Distance Computation: A Large-Scale Empirical Study","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-06-28T22:09:41.070396Z"},"links":{"cited_paper":"/paper/2603.22532","citing_paper":"/paper/2606.12445"},"observation_digest":"sha256:cffe464497cae1303ab527bcf76ec36216565b4b8df83df715e1831ca1a727e5","observation_id":"78382f34-593f-4b37-86c4-458f5bd0443e","resolution":{"observed_at":"2026-08-17T02:09:27.147534Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2603.22532","last_updated":"2026-08-14T08:13:21Z","snapshot_observed_at":"2026-08-19T23:30:03.546465Z","submitted_at":"2026-03-23T19:52:23Z","title":"Distance-Finding Algorithms for Quantum Codes and Circuits","version":2},"cited_work":{"arxiv_id":"2603.22532","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2603.22532","snapshot_observed_at":"2026-08-17T02:09:27.147534Z","title":"Distance-finding algorithms for quantum codes and cir- cuits","venue":null,"work_id":"231e931c-9a0d-4191-875d-45385b0e438d","year":2026},"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":106,"source":"pdf_text","source_observed_at":"2026-06-26T16:51:59.233119Z"},"links":{"cited_paper":"/paper/2603.22532","citing_paper":"/paper/2606.20263"},"observation_digest":"sha256:aa33b4ee50f26622ff3b864c6c574d01b75a4f4749f740566e1a840094a014f3","observation_id":"0c3c4bf9-99ef-4cd5-a176-eb1f8aa8bb54","resolution":{"observed_at":"2026-08-17T02:09:27.147534Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2603.22532","last_updated":"2026-08-14T08:13:21Z","snapshot_observed_at":"2026-08-19T23:30:03.546465Z","submitted_at":"2026-03-23T19:52:23Z","title":"Distance-Finding Algorithms for Quantum Codes and Circuits","version":2},"cited_work":{"arxiv_id":"2603.22532","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2603.22532","snapshot_observed_at":"2026-08-17T02:09:27.147534Z","title":"Distance-finding algorithms for quantum codes and cir- cuits","venue":null,"work_id":"231e931c-9a0d-4191-875d-45385b0e438d","year":2026},"citing_paper":{"arxiv_id":"2606.25870","last_updated":"2026-06-24T14:19:43Z","snapshot_observed_at":"2026-08-08T20:58:25.821330Z","submitted_at":"2026-06-24T14:19:43Z","title":"Evolving Quantum Error-Correcting Encodings for Molecular Simulation","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-06-25T20:51:06.703483Z"},"links":{"cited_paper":"/paper/2603.22532","citing_paper":"/paper/2606.25870"},"observation_digest":"sha256:55f767d9f2210542cc31ebad9b683abb85238f303fb2b54b2d49fd766cb778ee","observation_id":"9a1531fe-173b-491e-9f2b-45df36488c77","resolution":{"observed_at":"2026-08-17T02:09:27.147534Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2603.22532/citation-record","integrity":"/paper/2603.22532/integrity","json":"/paper/2603.22532/citation-record.json","paper":"/paper/2603.22532"},"outbound":[],"paper":{"arxiv_id":"2603.22532","last_updated":"2026-08-14T08:13:21Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-19T23:30:03.546465Z","submitted_at":"2026-03-23T19:52:23Z","title":"Distance-Finding Algorithms for Quantum Codes and Circuits"},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 8 inbound Pith citation observations for arXiv:2603.22532."}