{"as_of":"2026-08-08T02:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cb6da92e566b660336081c3c80e93bab33ce406689b6f361d1c05c320c80b9d6","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-07T06:34:17.273281+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-05T21:18:47.296735Z","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-11T23:41:18.522166Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.19406","last_updated":"2025-08-06T07:01:11Z","snapshot_observed_at":"2026-08-07T17:45:17.408885Z","submitted_at":"2025-02-26T18:54:19Z","title":"Single-shot and two-shot decoding with generalized bicycle codes","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.19406","snapshot_observed_at":"2026-08-05T21:18:47.296735Z","title":"Single-shot and two-shot decoding with generalized bicycle codes","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.09082","last_updated":"2025-08-12T17:03:59Z","snapshot_observed_at":"2026-08-05T21:18:35.909389Z","submitted_at":"2025-08-12T17:03:59Z","title":"Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Hook Errors","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-05T21:18:47.296735Z"},"links":{"cited_paper":"/paper/2502.19406","citing_paper":"/paper/2508.09082"},"observation_digest":"sha256:926f059821655a42bdbbef50e3b60bb636955fd10bf8af88f99c497932c776cb","observation_id":"3d602cce-6b2d-4855-a8ba-fbebcc13b548","resolution":{"observed_at":"2026-08-05T21:18:47.296735Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.19406","last_updated":"2025-08-06T07:01:11Z","snapshot_observed_at":"2026-08-07T17:45:17.408885Z","submitted_at":"2025-02-26T18:54:19Z","title":"Single-shot and two-shot decoding with generalized bicycle codes","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.19406","snapshot_observed_at":"2026-08-03T08:00:03.859343Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.18879","last_updated":"2026-05-24T01:40:16Z","snapshot_observed_at":"2026-08-03T11:12:49.778747Z","submitted_at":"2026-01-26T19:00:03Z","title":"Multivariate Multicycle Codes for Complete Single-Shot Decoding","version":2},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-08-03T08:00:03.859343Z"},"links":{"cited_paper":"/paper/2502.19406","citing_paper":"/paper/2601.18879"},"observation_digest":"sha256:98544dfdc28a22589834d737967e9bddc13b74c235f924af76b89df81fcc0763","observation_id":"e7f47448-8ba9-4b6e-960d-0acbf9b929a6","resolution":{"observed_at":"2026-08-03T08:00:03.859343Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.19406","last_updated":"2025-08-06T07:01:11Z","snapshot_observed_at":"2026-08-07T17:45:17.408885Z","submitted_at":"2025-02-26T18:54:19Z","title":"Single-shot and two-shot decoding with generalized bicycle codes","version":3},"cited_work":{"arxiv_id":"2502.19406","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.19406","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Single-shot and two-shot decod- ing with generalized bicycle codes","venue":null,"work_id":"c24608ed-e2b4-4288-9303-527bbd290a6f","year":2025},"citing_paper":{"arxiv_id":"2602.11457","last_updated":"2026-05-05T14:58:57Z","snapshot_observed_at":"2026-07-06T22:45:34.674215Z","submitted_at":"2026-02-12T00:30:48Z","title":"The Pinnacle Architecture: Reducing the cost of breaking RSA-2048 to 100 000 physical qubits using quantum LDPC codes","version":2},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-05-16T05:27:23.269152Z"},"links":{"cited_paper":"/paper/2502.19406","citing_paper":"/paper/2602.11457"},"observation_digest":"sha256:972b86771913d45856722f11b9d90ae98c914159bda9485594e5ad7b0b041c19","observation_id":"1318a447-001d-45ea-9b4b-8b602a2db7dd","resolution":{"observed_at":"2026-05-09T03:06:06.287172Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.19406","last_updated":"2025-08-06T07:01:11Z","snapshot_observed_at":"2026-08-07T17:45:17.408885Z","submitted_at":"2025-02-26T18:54:19Z","title":"Single-shot and two-shot decoding with generalized bicycle codes","version":3},"cited_work":{"arxiv_id":"2502.19406","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.19406","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Single-shot and two-shot decod- ing with generalized bicycle codes","venue":null,"work_id":"c24608ed-e2b4-4288-9303-527bbd290a6f","year":2025},"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":159,"source":"pdf_text","source_observed_at":"2026-05-10T02:15:19.433368Z"},"links":{"cited_paper":"/paper/2502.19406","citing_paper":"/paper/2604.19481"},"observation_digest":"sha256:9256dcc36f490f1471995461d633e21584559ba31e1abb5bf90cac8590867ccd","observation_id":"7d08f6c5-f867-4a0d-9b57-38421ff5c01f","resolution":{"observed_at":"2026-05-11T13:11:04.998671Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.19406","last_updated":"2025-08-06T07:01:11Z","snapshot_observed_at":"2026-08-07T17:45:17.408885Z","submitted_at":"2025-02-26T18:54:19Z","title":"Single-shot and two-shot decoding with generalized bicycle codes","version":3},"cited_work":{"arxiv_id":"2502.19406","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.19406","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Single-shot and two-shot decod- ing with generalized bicycle codes","venue":null,"work_id":"c24608ed-e2b4-4288-9303-527bbd290a6f","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":77,"source":"pdf_text","source_observed_at":"2026-05-07T16:27:43.867877Z"},"links":{"cited_paper":"/paper/2502.19406","citing_paper":"/paper/2605.03951"},"observation_digest":"sha256:5452fa2ef0f9cd07d14db19970e3560605e54b9e0d3d6647c4aad2aa841a10be","observation_id":"b161f871-7d64-4c9a-84b4-0c3d161c4b1c","resolution":{"observed_at":"2026-05-11T23:41:18.525097Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.19406","last_updated":"2025-08-06T07:01:11Z","snapshot_observed_at":"2026-08-07T17:45:17.408885Z","submitted_at":"2025-02-26T18:54:19Z","title":"Single-shot and two-shot decoding with generalized bicycle codes","version":3},"cited_work":{"arxiv_id":"2502.19406","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.19406","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Single-shot and two-shot decod- ing with generalized bicycle codes","venue":null,"work_id":"c24608ed-e2b4-4288-9303-527bbd290a6f","year":2025},"citing_paper":{"arxiv_id":"2605.04151","last_updated":"2026-05-05T18:00:05Z","snapshot_observed_at":"2026-07-06T23:16:59.568304Z","submitted_at":"2026-05-05T18:00:05Z","title":"Topological subsystem bivariate bicycle codes with four-qubit check operators","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-08T18:24:23.246501Z"},"links":{"cited_paper":"/paper/2502.19406","citing_paper":"/paper/2605.04151"},"observation_digest":"sha256:0ec6a40fec9e70b7e3cf136da4bf830f27411b8cc5831c3b28c65cc787ec2d84","observation_id":"866020c9-f01a-458b-ab03-4c6c4dfb6fdb","resolution":{"observed_at":"2026-05-09T06:30:40.816197Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2502.19406/citation-record","integrity":"/paper/2502.19406/integrity","json":"/paper/2502.19406/citation-record.json","paper":"/paper/2502.19406"},"outbound":[],"paper":{"arxiv_id":"2502.19406","last_updated":"2025-08-06T07:01:11Z","latest_version":3,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-07T17:45:17.408885Z","submitted_at":"2025-02-26T18:54:19Z","title":"Single-shot and two-shot decoding with generalized bicycle 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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2502.19406."}