{"as_of":"2026-08-10T10:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4be435e3f35d6582af5c09096f5e52561d9b7a117dfc228caade8b77cf9ca407","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":9,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":9,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":9,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":9,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:15:04.242868Z","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-04T17:20:00.293255Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1905.09749","last_updated":"2021-04-13T00:09:59Z","snapshot_observed_at":"2026-07-06T07:55:00.249738Z","submitted_at":"2019-05-23T16:09:46Z","title":"How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits","version":3},"cited_work":{"arxiv_id":"1905.09749","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1905.09749","snapshot_observed_at":"2026-07-04T17:20:00.293255Z","title":"How to factor 2048 bit rsa integers in 8 hours using 20 million noisy qubits","venue":null,"work_id":"3205e32b-66f2-445c-a7a3-e5bcf69b0a5c","year":2048},"citing_paper":{"arxiv_id":"2404.10659","last_updated":"2024-04-16T15:36:23Z","snapshot_observed_at":"2026-07-06T18:01:01.206270Z","submitted_at":"2024-04-16T15:36:23Z","title":"Cybersecurity in the Quantum Era: Assessing the Impact of Quantum Computing on Infrastructure","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-24T02:22:37.932053Z"},"links":{"cited_paper":"/paper/1905.09749","citing_paper":"/paper/2404.10659"},"observation_digest":"sha256:3a4d4302e67dfd40a883c9644f64ea99b13c123497df079c59de47105b60916e","observation_id":"8c01c295-1f5c-4666-9d9c-7cbe643f374a","resolution":{"observed_at":"2026-05-24T02:23:45.820727Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1905.09749","last_updated":"2021-04-13T00:09:59Z","snapshot_observed_at":"2026-07-06T07:55:00.249738Z","submitted_at":"2019-05-23T16:09:46Z","title":"How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits","version":3},"cited_work":{"arxiv_id":"1905.09749","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1905.09749","snapshot_observed_at":"2026-07-04T17:20:00.293255Z","title":"How to factor 2048 bit rsa integers in 8 hours using 20 million noisy qubits","venue":null,"work_id":"3205e32b-66f2-445c-a7a3-e5bcf69b0a5c","year":2048},"citing_paper":{"arxiv_id":"2410.01252","last_updated":"2026-04-17T05:10:34Z","snapshot_observed_at":"2026-07-06T19:25:42.156795Z","submitted_at":"2024-10-02T05:51:33Z","title":"Resource-efficient equivariant quantum convolutional neural networks","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-23T20:30:57.645894Z"},"links":{"cited_paper":"/paper/1905.09749","citing_paper":"/paper/2410.01252"},"observation_digest":"sha256:0fa0fbd269de8af7e2a6ee7f04b71bd33e02c6f0af796f7d5cf83051aaa607bb","observation_id":"a8b045c5-0bf1-40b5-8a3b-da4b95835a23","resolution":{"observed_at":"2026-05-23T20:33:25.750228Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1905.09749","last_updated":"2021-04-13T00:09:59Z","snapshot_observed_at":"2026-07-06T07:55:00.249738Z","submitted_at":"2019-05-23T16:09:46Z","title":"How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits","version":3},"cited_work":{"arxiv_id":"1905.09749","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1905.09749","snapshot_observed_at":"2026-07-04T17:20:00.293255Z","title":"How to factor 2048 bit rsa integers in 8 hours using 20 million noisy qubits","venue":null,"work_id":"3205e32b-66f2-445c-a7a3-e5bcf69b0a5c","year":2048},"citing_paper":{"arxiv_id":"2411.01880","last_updated":"2026-05-05T17:05:33Z","snapshot_observed_at":"2026-07-06T19:44:38.954993Z","submitted_at":"2024-11-04T08:20:37Z","title":"Magic states are rarely the best resource to optimize: An analytical tool for qubit resource estimation in concatenated codes","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-05-23T17:54:58.589372Z"},"links":{"cited_paper":"/paper/1905.09749","citing_paper":"/paper/2411.01880"},"observation_digest":"sha256:6a28f738c85ba0c15ad297d9b83dda5c70b182034aba837c6a52a902bd742ee3","observation_id":"147faa9a-a66a-4b6f-a699-ea39c7fbfaab","resolution":{"observed_at":"2026-05-23T17:55:44.720411Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1905.09749","last_updated":"2021-04-13T00:09:59Z","snapshot_observed_at":"2026-07-06T07:55:00.249738Z","submitted_at":"2019-05-23T16:09:46Z","title":"How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.09749","snapshot_observed_at":"2026-08-07T14:15:04.242868Z","title":"How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.20265","last_updated":"2025-05-26T17:42:56Z","snapshot_observed_at":"2026-08-09T08:36:50.787787Z","submitted_at":"2025-05-26T17:42:56Z","title":"A distillation-teleportation protocol for fault-tolerant QRAM","version":1},"reference_index":122,"source":"pdf_text","source_observed_at":"2026-08-07T14:15:04.242868Z"},"links":{"cited_paper":"/paper/1905.09749","citing_paper":"/paper/2505.20265"},"observation_digest":"sha256:31e25b12ae22858cdc5618fc55c9efeab85560293944d0917cc4a2c7b85af07d","observation_id":"5028807f-442c-4668-86a7-cfa2ea5a76fc","resolution":{"observed_at":"2026-08-07T14:15:04.242868Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1905.09749","last_updated":"2021-04-13T00:09:59Z","snapshot_observed_at":"2026-07-06T07:55:00.249738Z","submitted_at":"2019-05-23T16:09:46Z","title":"How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits","version":3},"cited_work":{"arxiv_id":"1905.09749","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1905.09749","snapshot_observed_at":"2026-07-04T17:20:00.293255Z","title":"How to factor 2048 bit rsa integers in 8 hours using 20 million noisy qubits","venue":null,"work_id":"3205e32b-66f2-445c-a7a3-e5bcf69b0a5c","year":2048},"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":22,"source":"pdf_text","source_observed_at":"2026-05-16T05:27:23.269152Z"},"links":{"cited_paper":"/paper/1905.09749","citing_paper":"/paper/2602.11457"},"observation_digest":"sha256:ab86aacc5b07cd9137dcddd31683323b100a252185c548613a0535a0090766ae","observation_id":"adb6d60b-3e34-47fa-b07b-c500fec88d10","resolution":{"observed_at":"2026-05-09T03:06:06.368609Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1905.09749","last_updated":"2021-04-13T00:09:59Z","snapshot_observed_at":"2026-07-06T07:55:00.249738Z","submitted_at":"2019-05-23T16:09:46Z","title":"How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits","version":3},"cited_work":{"arxiv_id":"1905.09749","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1905.09749","snapshot_observed_at":"2026-07-04T17:20:00.293255Z","title":"How to factor 2048 bit rsa integers in 8 hours using 20 million noisy qubits","venue":null,"work_id":"3205e32b-66f2-445c-a7a3-e5bcf69b0a5c","year":2048},"citing_paper":{"arxiv_id":"2605.12149","last_updated":"2026-05-12T14:06:27Z","snapshot_observed_at":"2026-07-06T23:23:54.142937Z","submitted_at":"2026-05-12T14:06:27Z","title":"Zeno-Enhanced Probabilistic Error Cancellation with Quantum Error Detection Codes","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-13T04:11:44.162259Z"},"links":{"cited_paper":"/paper/1905.09749","citing_paper":"/paper/2605.12149"},"observation_digest":"sha256:337224f76ff4cd376f8326ef4af15fc2af9b764ea149b19dc0ae920b64ed7291","observation_id":"2040a632-7e8e-433b-a5a0-e5daac3cfc2d","resolution":{"observed_at":"2026-05-13T04:12:13.786894Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1905.09749","last_updated":"2021-04-13T00:09:59Z","snapshot_observed_at":"2026-07-06T07:55:00.249738Z","submitted_at":"2019-05-23T16:09:46Z","title":"How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits","version":3},"cited_work":{"arxiv_id":"1905.09749","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1905.09749","snapshot_observed_at":"2026-07-04T17:20:00.293255Z","title":"How to factor 2048 bit rsa integers in 8 hours using 20 million noisy qubits","venue":null,"work_id":"3205e32b-66f2-445c-a7a3-e5bcf69b0a5c","year":2048},"citing_paper":{"arxiv_id":"2606.25011","last_updated":"2026-06-23T17:55:45Z","snapshot_observed_at":"2026-07-06T23:59:32.831481Z","submitted_at":"2026-06-23T17:55:45Z","title":"Fast and Parallel High-Rate STAR Architecture for Megaquop Quantum Simulation","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-25T23:47:24.120587Z"},"links":{"cited_paper":"/paper/1905.09749","citing_paper":"/paper/2606.25011"},"observation_digest":"sha256:2814f58a2f50245183821feac52ba9d1c73cf427937c7beace07d55ecab05f50","observation_id":"b883ca8a-b332-430a-b950-7d050d73b307","resolution":{"observed_at":"2026-07-04T17:20:00.294767Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1905.09749","last_updated":"2021-04-13T00:09:59Z","snapshot_observed_at":"2026-07-06T07:55:00.249738Z","submitted_at":"2019-05-23T16:09:46Z","title":"How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits","version":3},"cited_work":{"arxiv_id":"1905.09749","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1905.09749","snapshot_observed_at":"2026-07-04T17:20:00.293255Z","title":"How to factor 2048 bit rsa integers in 8 hours using 20 million noisy qubits","venue":null,"work_id":"3205e32b-66f2-445c-a7a3-e5bcf69b0a5c","year":2048},"citing_paper":{"arxiv_id":"2606.28518","last_updated":"2026-07-13T15:13:28Z","snapshot_observed_at":"2026-08-08T13:09:52.406008Z","submitted_at":"2026-06-26T18:14:09Z","title":"Borrowed Identities: Malleable Distillation Factories and a Unified Numerical Search","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-30T01:10:28.412502Z"},"links":{"cited_paper":"/paper/1905.09749","citing_paper":"/paper/2606.28518"},"observation_digest":"sha256:456d6d2b7cc9d056397e4a1ef85fc932426d27d001cbee5e07700698ed9b8f47","observation_id":"a83b06f0-b4ee-407b-8745-c670295715e0","resolution":{"observed_at":"2026-07-01T15:45:48.269672Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1905.09749","last_updated":"2021-04-13T00:09:59Z","snapshot_observed_at":"2026-07-06T07:55:00.249738Z","submitted_at":"2019-05-23T16:09:46Z","title":"How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.09749","snapshot_observed_at":"2026-07-14T17:12:06.320233Z","title":"Gidney and M","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.28518","last_updated":"2026-07-13T15:13:28Z","snapshot_observed_at":"2026-08-08T13:09:52.406008Z","submitted_at":"2026-06-26T18:14:09Z","title":"Borrowed Identities: Malleable Distillation Factories and a Unified Numerical Search","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-14T17:12:06.320233Z"},"links":{"cited_paper":"/paper/1905.09749","citing_paper":"/paper/2606.28518"},"observation_digest":"sha256:baad427cc526503f07d4713dff8799cac7fa840555c398a5f027190a34261cf0","observation_id":"70560b05-b0bd-422d-870b-70fbf1b02388","resolution":{"observed_at":"2026-07-14T17:12:06.320233Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1905.09749/citation-record","integrity":"/paper/1905.09749/integrity","json":"/paper/1905.09749/citation-record.json","paper":"/paper/1905.09749"},"outbound":[],"paper":{"arxiv_id":"1905.09749","last_updated":"2021-04-13T00:09:59Z","latest_version":3,"primary_category":"quant-ph","snapshot_observed_at":"2026-07-06T07:55:00.249738Z","submitted_at":"2019-05-23T16:09:46Z","title":"How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 9 inbound Pith citation observations for arXiv:1905.09749."}