{"as_of":"2026-08-13T07:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:95739dd822dda26709a4a00492142928604888eac57aafd2b6a5166663c43b85","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-13T06:32:02.005865+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-12T11:29:28.341074Z","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-19T16:07:40.945731Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2403.03272","last_updated":"2025-04-07T16:29:51Z","snapshot_observed_at":"2026-08-13T04:02:44.439286Z","submitted_at":"2024-03-05T19:13:32Z","title":"Correlated decoding of logical algorithms with transversal gates","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.03272","snapshot_observed_at":"2026-08-12T11:29:28.341074Z","title":"Correlated decoding of logical algorithms with transversal gates","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.18287","last_updated":"2024-11-27T12:17:56Z","snapshot_observed_at":"2026-08-13T04:53:46.891436Z","submitted_at":"2024-11-27T12:17:56Z","title":"Fault-Tolerant Constant-Depth Clifford Gates on Toric Codes","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T11:29:28.341074Z"},"links":{"cited_paper":"/paper/2403.03272","citing_paper":"/paper/2411.18287"},"observation_digest":"sha256:f75034237b51cfd24d3f3c2a66275069b673d4899bb0c91d66eedf344a240213","observation_id":"2a211273-c965-4014-89e0-1dd7e77c94aa","resolution":{"observed_at":"2026-08-12T11:29:28.341074Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.03272","last_updated":"2025-04-07T16:29:51Z","snapshot_observed_at":"2026-08-13T04:02:44.439286Z","submitted_at":"2024-03-05T19:13:32Z","title":"Correlated decoding of logical algorithms with transversal gates","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.03272","snapshot_observed_at":"2026-08-04T15:51:50.350861Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.18294","last_updated":"2026-05-29T17:17:12Z","snapshot_observed_at":"2026-08-04T15:50:28.664459Z","submitted_at":"2025-09-22T18:23:28Z","title":"Transversal architecture for megaquop-scale quantum simulation with neutral atoms","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-04T15:51:50.350861Z"},"links":{"cited_paper":"/paper/2403.03272","citing_paper":"/paper/2509.18294"},"observation_digest":"sha256:2e9b530a9665a535f196cfc2b069c0abb17ccc2683b81794d3cd931608618d01","observation_id":"82fd946b-3f30-4996-add4-bc5c209e7e2d","resolution":{"observed_at":"2026-08-04T15:51:50.350861Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.03272","last_updated":"2025-04-07T16:29:51Z","snapshot_observed_at":"2026-08-13T04:02:44.439286Z","submitted_at":"2024-03-05T19:13:32Z","title":"Correlated decoding of logical algorithms with transversal gates","version":2},"cited_work":{"arxiv_id":"2403.03272","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2403.03272","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Correlated decoding of logical algorithms with transversal gates","venue":null,"work_id":"56be599d-8b1d-4714-a5df-7553afe53291","year":2025},"citing_paper":{"arxiv_id":"2602.20238","last_updated":"2026-05-06T08:48:40Z","snapshot_observed_at":"2026-08-11T12:47:46.459709Z","submitted_at":"2026-02-23T19:00:00Z","title":"Proof of a finite threshold for the union-find decoder","version":2},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-05-15T20:12:10.149451Z"},"links":{"cited_paper":"/paper/2403.03272","citing_paper":"/paper/2602.20238"},"observation_digest":"sha256:460c746c615c3eed4de5805331c8240d6e64dd4577c1587e5fb33d4ac29ff2e1","observation_id":"a76605a4-4e8c-419e-ab10-62b747dab267","resolution":{"observed_at":"2026-05-15T20:16:34.815456Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.03272","last_updated":"2025-04-07T16:29:51Z","snapshot_observed_at":"2026-08-13T04:02:44.439286Z","submitted_at":"2024-03-05T19:13:32Z","title":"Correlated decoding of logical algorithms with transversal gates","version":2},"cited_work":{"arxiv_id":"2403.03272","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2403.03272","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Correlated decoding of logical algorithms with transversal gates","venue":null,"work_id":"56be599d-8b1d-4714-a5df-7553afe53291","year":2025},"citing_paper":{"arxiv_id":"2604.25094","last_updated":"2026-04-28T00:58:22Z","snapshot_observed_at":"2026-08-10T21:08:35.038712Z","submitted_at":"2026-04-28T00:58:22Z","title":"INJEQT: Improved Magic-State Injection Protocol for Fault-Tolerant Quantum Extractor Architectures","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-07T17:09:23.033476Z"},"links":{"cited_paper":"/paper/2403.03272","citing_paper":"/paper/2604.25094"},"observation_digest":"sha256:473c1e8981b7092d00c7575e91a6e88a5b524af63913da471ffcacaa56788c03","observation_id":"53c3a293-7459-4bcc-9267-bc1711857156","resolution":{"observed_at":"2026-05-11T23:21:55.406396Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.03272","last_updated":"2025-04-07T16:29:51Z","snapshot_observed_at":"2026-08-13T04:02:44.439286Z","submitted_at":"2024-03-05T19:13:32Z","title":"Correlated decoding of logical algorithms with transversal gates","version":2},"cited_work":{"arxiv_id":"2403.03272","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2403.03272","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Correlated decoding of logical algorithms with transversal gates","venue":null,"work_id":"56be599d-8b1d-4714-a5df-7553afe53291","year":2025},"citing_paper":{"arxiv_id":"2605.03951","last_updated":"2026-05-05T16:37:52Z","snapshot_observed_at":"2026-07-06T23:16:49.553583Z","submitted_at":"2026-05-05T16:37:52Z","title":"Factoring $2048$ bit RSA integers with a half-million-qubit modular atomic processor","version":1},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-05-07T16:27:43.867877Z"},"links":{"cited_paper":"/paper/2403.03272","citing_paper":"/paper/2605.03951"},"observation_digest":"sha256:3512dde6425c897a47e5292ce7541c78b974c7b77ffc17505a43295bd1cee618","observation_id":"75eabfe0-a33e-4ee6-a6ff-eb9de202a83b","resolution":{"observed_at":"2026-05-11T23:41:18.487731Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.03272","last_updated":"2025-04-07T16:29:51Z","snapshot_observed_at":"2026-08-13T04:02:44.439286Z","submitted_at":"2024-03-05T19:13:32Z","title":"Correlated decoding of logical algorithms with transversal gates","version":2},"cited_work":{"arxiv_id":"2403.03272","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2403.03272","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Correlated decoding of logical algorithms with transversal gates","venue":null,"work_id":"56be599d-8b1d-4714-a5df-7553afe53291","year":2025},"citing_paper":{"arxiv_id":"2605.15297","last_updated":"2026-05-14T18:11:04Z","snapshot_observed_at":"2026-07-06T23:26:37.362117Z","submitted_at":"2026-05-14T18:11:04Z","title":"Towards Deploying Optimistic Quantum Fourier Transforms: An Architecture-Algorithm Co-Design Study","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-19T16:06:33.998019Z"},"links":{"cited_paper":"/paper/2403.03272","citing_paper":"/paper/2605.15297"},"observation_digest":"sha256:ca37d23198c99e84d1e78847a274b84c4f5250810585858dacaf3b2f2ad19af9","observation_id":"46135830-e2c2-4890-adbb-7ae2262fdd7d","resolution":{"observed_at":"2026-05-19T16:07:40.950074Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.03272","last_updated":"2025-04-07T16:29:51Z","snapshot_observed_at":"2026-08-13T04:02:44.439286Z","submitted_at":"2024-03-05T19:13:32Z","title":"Correlated decoding of logical algorithms with transversal gates","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.03272","snapshot_observed_at":"2026-08-01T01:20:48.007009Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.25865","last_updated":"2026-07-28T15:31:26Z","snapshot_observed_at":"2026-08-03T03:26:50.763218Z","submitted_at":"2026-07-28T15:31:26Z","title":"OmniQEC: discovering practical quantum error-correcting codes by an AI scientist","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-01T01:20:48.007009Z"},"links":{"cited_paper":"/paper/2403.03272","citing_paper":"/paper/2607.25865"},"observation_digest":"sha256:90bc10fdc37765a8637b0ff1aaaa234f560156d01cc1d7f3897b2cdb7cf9c971","observation_id":"ca33a3a0-a4b8-4307-8dc8-7a405c862006","resolution":{"observed_at":"2026-08-01T01:20:48.007009Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2403.03272/citation-record","integrity":"/paper/2403.03272/integrity","json":"/paper/2403.03272/citation-record.json","paper":"/paper/2403.03272"},"outbound":[],"paper":{"arxiv_id":"2403.03272","last_updated":"2025-04-07T16:29:51Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-13T04:02:44.439286Z","submitted_at":"2024-03-05T19:13:32Z","title":"Correlated decoding of logical algorithms with transversal gates"},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 7 inbound Pith citation observations for arXiv:2403.03272."}