{"as_of":"2026-08-12T22:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a1062c87a303dd8ad672d4b1779162d929e3ace7e4d972a493c122e8a8075546","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T23:22:37.532680Z","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-09T03:06:06.266636Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1212.6703","last_updated":"2013-01-02T23:44:09Z","snapshot_observed_at":"2026-07-06T03:02:59.204238Z","submitted_at":"2012-12-30T11:19:24Z","title":"Quantum \"hyperbicycle\" low-density parity check codes with finite rate","version":2},"cited_work":{"arxiv_id":"1212.6703","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1212.6703","snapshot_observed_at":"2026-07-04T18:35:25.389492Z","title":null,"venue":null,"work_id":"7ad37928-209a-4311-82f0-972e057ae7c3","year":2013},"citing_paper":{"arxiv_id":"2602.11457","last_updated":"2026-05-05T14:58:57Z","snapshot_observed_at":"2026-08-12T02:03:48.174751Z","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":52,"source":"pdf_text","source_observed_at":"2026-05-16T05:27:23.269152Z"},"links":{"cited_paper":"/paper/1212.6703","citing_paper":"/paper/2602.11457"},"observation_digest":"sha256:d11b4f93e3ecca1e7f9b69369ed7c937970475a9adb17ed0d9fb189f5ba20780","observation_id":"9b84b3ad-6ee1-4f9b-80e4-d0da940b14af","resolution":{"observed_at":"2026-07-04T18:35:25.389492Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1212.6703","last_updated":"2013-01-02T23:44:09Z","snapshot_observed_at":"2026-07-06T03:02:59.204238Z","submitted_at":"2012-12-30T11:19:24Z","title":"Quantum \"hyperbicycle\" low-density parity check codes with finite rate","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1212.6703","snapshot_observed_at":"2026-07-11T07:07:39.359688Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.05386","last_updated":"2026-07-09T17:58:26Z","snapshot_observed_at":"2026-08-08T13:08:36.166528Z","submitted_at":"2026-07-06T17:56:55Z","title":"Logical Spectroscopy: Lifted-Product Codes with Addressable Bases","version":2},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-07-11T07:07:39.359688Z"},"links":{"cited_paper":"/paper/1212.6703","citing_paper":"/paper/2607.05386"},"observation_digest":"sha256:97333ca9cc7b6c45169adf2a0ad70bb488f9cf056258aa9b2ef826409d4225ec","observation_id":"05658321-08b3-4344-a6e2-a300be9c6032","resolution":{"observed_at":"2026-07-11T07:07:39.359688Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1212.6703","last_updated":"2013-01-02T23:44:09Z","snapshot_observed_at":"2026-07-06T03:02:59.204238Z","submitted_at":"2012-12-30T11:19:24Z","title":"Quantum \"hyperbicycle\" low-density parity check codes with finite rate","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1212.6703","snapshot_observed_at":"2026-08-04T18:53:46.899608Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2608.01887","last_updated":"2026-08-06T15:17:35Z","snapshot_observed_at":"2026-08-09T23:22:59.091938Z","submitted_at":"2026-08-03T08:28:21Z","title":"The Pangaea Architecture: Fault-Tolerant Heterogeneous Topological Codes via a Quantum Bus","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-04T18:53:46.899608Z"},"links":{"cited_paper":"/paper/1212.6703","citing_paper":"/paper/2608.01887"},"observation_digest":"sha256:45b3ecde7c7b1a00d5c1772eb7daf8445a85e68a8709cfc687f39dc437357c5f","observation_id":"19e43969-c841-4ccd-b65d-fc0df996a78d","resolution":{"observed_at":"2026-08-04T18:53:46.899608Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1212.6703","last_updated":"2013-01-02T23:44:09Z","snapshot_observed_at":"2026-07-06T03:02:59.204238Z","submitted_at":"2012-12-30T11:19:24Z","title":"Quantum \"hyperbicycle\" low-density parity check codes with finite rate","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1212.6703","snapshot_observed_at":"2026-08-07T04:10:11.386839Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2608.01887","last_updated":"2026-08-06T15:17:35Z","snapshot_observed_at":"2026-08-09T23:22:59.091938Z","submitted_at":"2026-08-03T08:28:21Z","title":"The Pangaea Architecture: Fault-Tolerant Heterogeneous Topological Codes via a Quantum Bus","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T04:10:11.386839Z"},"links":{"cited_paper":"/paper/1212.6703","citing_paper":"/paper/2608.01887"},"observation_digest":"sha256:e6a40f23cbd0655ce340348622daec00efcba7cbb8c64eacfeb57f78c4dcc616","observation_id":"00af20ab-51ed-40c7-92e1-29ee3d1a56a2","resolution":{"observed_at":"2026-08-07T04:10:11.386839Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1212.6703","last_updated":"2013-01-02T23:44:09Z","snapshot_observed_at":"2026-07-06T03:02:59.204238Z","submitted_at":"2012-12-30T11:19:24Z","title":"Quantum \"hyperbicycle\" low-density parity check codes with finite rate","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1212.6703","snapshot_observed_at":"2026-08-11T23:22:37.532680Z","title":"Quantum ‘hyperbicycle’ low-density parity check codes with finite rate,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2608.09115","last_updated":"2026-08-10T04:45:08Z","snapshot_observed_at":"2026-08-12T22:20:19.159326Z","submitted_at":"2026-08-10T04:45:08Z","title":"Quantum Bicycle LDPC Codes with High $kd^2/n$ from Divisor-Driven Search","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T23:22:37.532680Z"},"links":{"cited_paper":"/paper/1212.6703","citing_paper":"/paper/2608.09115"},"observation_digest":"sha256:4adcc0a08017d307e5105f8ae49e3ccac6a842e9599a9a98c1530a4390667a05","observation_id":"a5ade95c-a530-4d68-ae01-3543f095f49d","resolution":{"observed_at":"2026-08-11T23:22:37.532680Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1212.6703/citation-record","integrity":"/paper/1212.6703/integrity","json":"/paper/1212.6703/citation-record.json","paper":"/paper/1212.6703"},"outbound":[],"paper":{"arxiv_id":"1212.6703","last_updated":"2013-01-02T23:44:09Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-07-06T03:02:59.204238Z","submitted_at":"2012-12-30T11:19:24Z","title":"Quantum \"hyperbicycle\" low-density parity check codes with finite rate"},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:1212.6703."}