{"as_of":"2026-08-20T21:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:20ac5c1da4016547b6e096d366e43f9a601e061daafa93a5fbbcdb3fc993915a","coverage":[{"denominator":34,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":34,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T02:52:48.363343Z","state":"measured"},{"denominator":34,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":34,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.14082/citation-record","integrity":"/paper/2607.14082/integrity","json":"/paper/2607.14082/citation-record.json","paper":"/paper/2607.14082"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T02:52:43.923878Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.14082","last_updated":"2026-07-15T17:56:58Z","snapshot_observed_at":"2026-08-15T00:55:53.850476Z","submitted_at":"2026-07-15T17:56:58Z","title":"Building Shor's Algorithm in Lean: An Agentic Formalization of Quantum Attacks on RSA-2048 and P-256","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-02T02:52:43.923878Z"},"links":{"citing_paper":"/paper/2607.14082"},"observation_digest":"sha256:756082e9a577862e5edbf5526690065d84e37224754808d7638a02f7c4272a24","observation_id":"ffb8d5b4-c051-429f-a6f3-301f244e7a9a","resolution":{"observed_at":"2026-08-02T02:52:43.923878Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T02:52:43.975576Z","title":"Quantum computing: Lecture notes, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.14082","last_updated":"2026-07-15T17:56:58Z","snapshot_observed_at":"2026-08-15T00:55:53.850476Z","submitted_at":"2026-07-15T17:56:58Z","title":"Building Shor's Algorithm in Lean: An Agentic Formalization of Quantum Attacks on RSA-2048 and P-256","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-02T02:52:43.975576Z"},"links":{"citing_paper":"/paper/2607.14082"},"observation_digest":"sha256:9a07d4f3968104292967f1f4d4acc20d231e288bc4ca839fb01a09d8157b053b","observation_id":"bf26792c-c358-4a65-9ddc-06307d3d7026","resolution":{"observed_at":"2026-08-02T02:52:43.975576Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T02:52:44.121740Z","title":"Quantum algorithms: An overview.npj Quantum Information, 2(1):15023, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.14082","last_updated":"2026-07-15T17:56:58Z","snapshot_observed_at":"2026-08-15T00:55:53.850476Z","submitted_at":"2026-07-15T17:56:58Z","title":"Building Shor's Algorithm in Lean: An Agentic Formalization of Quantum Attacks on RSA-2048 and P-256","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-02T02:52:44.121740Z"},"links":{"citing_paper":"/paper/2607.14082"},"observation_digest":"sha256:e61d58ee48ae15edf249ab50b0e24611cb490d226c631a327d0b0214d766a14f","observation_id":"acd08374-3da4-48c4-a0a1-c241a43540fb","resolution":{"observed_at":"2026-08-02T02:52:44.121740Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T02:52:44.265886Z","title":"Lecture notes on quantum algorithms for scientific computation, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.14082","last_updated":"2026-07-15T17:56:58Z","snapshot_observed_at":"2026-08-15T00:55:53.850476Z","submitted_at":"2026-07-15T17:56:58Z","title":"Building Shor's Algorithm in Lean: An Agentic Formalization of Quantum Attacks on RSA-2048 and P-256","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-02T02:52:44.265886Z"},"links":{"citing_paper":"/paper/2607.14082"},"observation_digest":"sha256:85bbb0a99c144112a39e2472691ccd652f67fccade256a63132eb821c61f5fd8","observation_id":"b6e29be6-6d73-44b6-a16b-3a500bb80ceb","resolution":{"observed_at":"2026-08-02T02:52:44.265886Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T02:52:44.352823Z","title":null,"venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2607.14082","last_updated":"2026-07-15T17:56:58Z","snapshot_observed_at":"2026-08-15T00:55:53.850476Z","submitted_at":"2026-07-15T17:56:58Z","title":"Building Shor's Algorithm in Lean: An Agentic Formalization of Quantum Attacks on RSA-2048 and P-256","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-02T02:52:44.352823Z"},"links":{"citing_paper":"/paper/2607.14082"},"observation_digest":"sha256:cdd3256fb29549102b95503d39607595ab4dfb8854aace18c9b10da0d852d998","observation_id":"c25231ad-e41c-431b-82cd-7c6154f43187","resolution":{"observed_at":"2026-08-02T02:52:44.352823Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T02:52:44.533984Z","title":"Rivest, Adi Shamir, and Leonard Adleman","venue":null,"work_id":null,"year":1978},"citing_paper":{"arxiv_id":"2607.14082","last_updated":"2026-07-15T17:56:58Z","snapshot_observed_at":"2026-08-15T00:55:53.850476Z","submitted_at":"2026-07-15T17:56:58Z","title":"Building Shor's Algorithm in Lean: An Agentic Formalization of Quantum Attacks on RSA-2048 and P-256","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-02T02:52:44.533984Z"},"links":{"citing_paper":"/paper/2607.14082"},"observation_digest":"sha256:c2f324bb94f5d359d072c2d39e3ee67a80a4e66339b2cf7762d41c95d007c8ae","observation_id":"b423f52b-a417-4dbd-bb9f-fb5bad266686","resolution":{"observed_at":"2026-08-02T02:52:44.533984Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T02:52:44.577107Z","title":"Svore, and Kristin Lauter","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.14082","last_updated":"2026-07-15T17:56:58Z","snapshot_observed_at":"2026-08-15T00:55:53.850476Z","submitted_at":"2026-07-15T17:56:58Z","title":"Building Shor's Algorithm in Lean: An Agentic Formalization of Quantum Attacks on RSA-2048 and P-256","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-02T02:52:44.577107Z"},"links":{"citing_paper":"/paper/2607.14082"},"observation_digest":"sha256:56fb51ea8a116d3b8625cac55c450b765833cac1d388a6e54e06ce24dd183f4f","observation_id":"18166914-ce5f-4e90-a396-b550b65fe9ee","resolution":{"observed_at":"2026-08-02T02:52:44.577107Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T02:52:44.729007Z","title":"Recommendations for discrete logarithm-based cryptography: Elliptic curve domain parameters","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.14082","last_updated":"2026-07-15T17:56:58Z","snapshot_observed_at":"2026-08-15T00:55:53.850476Z","submitted_at":"2026-07-15T17:56:58Z","title":"Building Shor's Algorithm in Lean: An Agentic Formalization of Quantum Attacks on RSA-2048 and P-256","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-02T02:52:44.729007Z"},"links":{"citing_paper":"/paper/2607.14082"},"observation_digest":"sha256:9e09cc037f55eb6b59eecb4f7139d2ebfc28b30ac2c014269460d06c91e0fef9","observation_id":"4a426316-7b47-4334-b26e-36c3741828f6","resolution":{"observed_at":"2026-08-02T02:52:44.729007Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T02:52:44.853024Z","title":"Quantum factoring, discrete logarithms, and the hidden subgroup problem.Computing in Science & Engineering, 3(2):34–43, 2001","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.14082","last_updated":"2026-07-15T17:56:58Z","snapshot_observed_at":"2026-08-15T00:55:53.850476Z","submitted_at":"2026-07-15T17:56:58Z","title":"Building Shor's Algorithm in Lean: An Agentic Formalization of Quantum Attacks on RSA-2048 and P-256","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-02T02:52:44.853024Z"},"links":{"citing_paper":"/paper/2607.14082"},"observation_digest":"sha256:fa1b091a8d64014e3ab41cbacf2d25d7f1ff386eb9511046ec65fd01279b59b2","observation_id":"06d27d45-c502-4cf7-9364-4d77eff54095","resolution":{"observed_at":"2026-08-02T02:52:44.853024Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T02:52:44.990471Z","title":"Childs and Wim van Dam","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.14082","last_updated":"2026-07-15T17:56:58Z","snapshot_observed_at":"2026-08-15T00:55:53.850476Z","submitted_at":"2026-07-15T17:56:58Z","title":"Building Shor's Algorithm in Lean: An Agentic Formalization of Quantum Attacks on RSA-2048 and P-256","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-02T02:52:44.990471Z"},"links":{"citing_paper":"/paper/2607.14082"},"observation_digest":"sha256:7aef920aea562db2ed4b5ade792e78188871fd544816ce140321cf043bfe1a04","observation_id":"dd04aa0b-6202-4893-ab19-75fe5070679e","resolution":{"observed_at":"2026-08-02T02:52:44.990471Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T02:52:45.129027Z","title":"An auto- mated deductive verification framework for circuit-building quantum programs","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.14082","last_updated":"2026-07-15T17:56:58Z","snapshot_observed_at":"2026-08-15T00:55:53.850476Z","submitted_at":"2026-07-15T17:56:58Z","title":"Building Shor's Algorithm in Lean: An Agentic Formalization of Quantum Attacks on RSA-2048 and P-256","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-02T02:52:45.129027Z"},"links":{"citing_paper":"/paper/2607.14082"},"observation_digest":"sha256:a1ce2eabc3a4f9dadaeee3bee8d56067a6fcecad00774a83f26d4a5c6e57279a","observation_id":"57deca84-f92e-41b8-a8e4-2c229e905483","resolution":{"observed_at":"2026-08-02T02:52:45.129027Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T02:52:45.303066Z","title":"Quantum hoare logic with classical variables.ACM Transactions on Quantum Computing, 2(4):16:1–16:43, December 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.14082","last_updated":"2026-07-15T17:56:58Z","snapshot_observed_at":"2026-08-15T00:55:53.850476Z","submitted_at":"2026-07-15T17:56:58Z","title":"Building Shor's Algorithm in Lean: An Agentic Formalization of Quantum Attacks on RSA-2048 and P-256","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-02T02:52:45.303066Z"},"links":{"citing_paper":"/paper/2607.14082"},"observation_digest":"sha256:e735904eb145434507a9a48f3fe3f1fb50803c3d2e64a1ceab7cd7e651624f14","observation_id":"c606a3a8-ff8d-4e8e-8cbe-d956c5d20bc6","resolution":{"observed_at":"2026-08-02T02:52:45.303066Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T02:52:45.415495Z","title":"Qafny: A quantum-program verifier","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.14082","last_updated":"2026-07-15T17:56:58Z","snapshot_observed_at":"2026-08-15T00:55:53.850476Z","submitted_at":"2026-07-15T17:56:58Z","title":"Building Shor's Algorithm in Lean: An Agentic Formalization of Quantum Attacks on RSA-2048 and P-256","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-02T02:52:45.415495Z"},"links":{"citing_paper":"/paper/2607.14082"},"observation_digest":"sha256:73248eb6bf16972abf69982f7498f56e05cb3a1db6eb1ec5534cb1a8932a112b","observation_id":"4a4a8e79-2e3e-42cd-a99b-e1eca249da04","resolution":{"observed_at":"2026-08-02T02:52:45.415495Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T02:52:45.474953Z","title":"A formally certified end-to-end implementation of shor’s factorization algorithm.Proceedings of the National Academy of Sciences, 120(21):e2218775120, May 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.14082","last_updated":"2026-07-15T17:56:58Z","snapshot_observed_at":"2026-08-15T00:55:53.850476Z","submitted_at":"2026-07-15T17:56:58Z","title":"Building Shor's Algorithm in Lean: An Agentic Formalization of Quantum Attacks on RSA-2048 and P-256","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-02T02:52:45.474953Z"},"links":{"citing_paper":"/paper/2607.14082"},"observation_digest":"sha256:ac7f6765c912edc69a8eb5ff513b698c0b74a7db0156887fabf217c793757325","observation_id":"ddbc3152-fffd-4eeb-aceb-f90aab2efc1a","resolution":{"observed_at":"2026-08-02T02:52:45.474953Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T02:52:45.555944Z","title":"The Lean mathematical library","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.14082","last_updated":"2026-07-15T17:56:58Z","snapshot_observed_at":"2026-08-15T00:55:53.850476Z","submitted_at":"2026-07-15T17:56:58Z","title":"Building Shor's Algorithm in Lean: An Agentic Formalization of Quantum Attacks on RSA-2048 and P-256","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-02T02:52:45.555944Z"},"links":{"citing_paper":"/paper/2607.14082"},"observation_digest":"sha256:ae07c973f7dd4341d873ee24ce6340cf4478ae0f2ffb747977da28d62b5855da","observation_id":"2d586273-cb4f-4a05-9020-ef9c6add8ef7","resolution":{"observed_at":"2026-08-02T02:52:45.555944Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T02:52:45.649972Z","title":"CSLib: The Lean computer science library, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.14082","last_updated":"2026-07-15T17:56:58Z","snapshot_observed_at":"2026-08-15T00:55:53.850476Z","submitted_at":"2026-07-15T17:56:58Z","title":"Building Shor's Algorithm in Lean: An Agentic Formalization of Quantum Attacks on RSA-2048 and P-256","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-02T02:52:45.649972Z"},"links":{"citing_paper":"/paper/2607.14082"},"observation_digest":"sha256:b0c89db343f280a6efe1e9200e9bed60c58d35731e79fbc27aac2fb70d2482b6","observation_id":"2579d77e-eb71-48c5-9835-c2ff44a656d8","resolution":{"observed_at":"2026-08-02T02:52:45.649972Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T02:52:45.803941Z","title":"Lean-QIT: Towards a formal infrastructure for quantum information theory, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.14082","last_updated":"2026-07-15T17:56:58Z","snapshot_observed_at":"2026-08-15T00:55:53.850476Z","submitted_at":"2026-07-15T17:56:58Z","title":"Building Shor's Algorithm in Lean: An Agentic Formalization of Quantum Attacks on RSA-2048 and P-256","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-02T02:52:45.803941Z"},"links":{"citing_paper":"/paper/2607.14082"},"observation_digest":"sha256:af7096052952516a912d05db05db617211f78a5356bfa6a6680edcc3a37f9003","observation_id":"0532f2e1-07b9-42ba-85ee-407d1f1c6e16","resolution":{"observed_at":"2026-08-02T02:52:45.803941Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T02:52:45.949790Z","title":"Swope, Alex Gu, Rahul Chalamala, Peiyang Song, Shixing Yu, Saad Godil, Ryan J","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.14082","last_updated":"2026-07-15T17:56:58Z","snapshot_observed_at":"2026-08-15T00:55:53.850476Z","submitted_at":"2026-07-15T17:56:58Z","title":"Building Shor's Algorithm in Lean: An Agentic Formalization of Quantum Attacks on RSA-2048 and P-256","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-02T02:52:45.949790Z"},"links":{"citing_paper":"/paper/2607.14082"},"observation_digest":"sha256:3c0af0354fd8fc848be6a96e2b191e36a9de0e85d1b75d69c5d4932ff848da49","observation_id":"8c5683a1-c38a-46a1-a891-0d06a09a95ff","resolution":{"observed_at":"2026-08-02T02:52:45.949790Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T02:52:46.122892Z","title":"Quantum algorithms for computing short discrete logarithms and factoring RSA integers","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.14082","last_updated":"2026-07-15T17:56:58Z","snapshot_observed_at":"2026-08-15T00:55:53.850476Z","submitted_at":"2026-07-15T17:56:58Z","title":"Building Shor's Algorithm in Lean: An Agentic Formalization of Quantum Attacks on RSA-2048 and P-256","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-02T02:52:46.122892Z"},"links":{"citing_paper":"/paper/2607.14082"},"observation_digest":"sha256:a5f0458cd72cd98ec8d216cd162652902a38a7877efe1c2c225c45faa67ebb91","observation_id":"bf31976f-24a5-4098-86b1-f5ba974cef71","resolution":{"observed_at":"2026-08-02T02:52:46.122892Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T02:52:46.192790Z","title":"An agentic formalization for certified quantum neural network design, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.14082","last_updated":"2026-07-15T17:56:58Z","snapshot_observed_at":"2026-08-15T00:55:53.850476Z","submitted_at":"2026-07-15T17:56:58Z","title":"Building Shor's Algorithm in Lean: An Agentic Formalization of Quantum Attacks on RSA-2048 and P-256","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-02T02:52:46.192790Z"},"links":{"citing_paper":"/paper/2607.14082"},"observation_digest":"sha256:6cc7f2cf071ced42112e2cbf51ccdfb675417dc7ad3e8183c8958d3dabac09d1","observation_id":"e4aac06e-b057-4792-9edc-4c81628c9aeb","resolution":{"observed_at":"2026-08-02T02:52:46.192790Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T02:52:46.347401Z","title":"How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits.Quantum, 5:433, 2021","venue":null,"work_id":null,"year":2048},"citing_paper":{"arxiv_id":"2607.14082","last_updated":"2026-07-15T17:56:58Z","snapshot_observed_at":"2026-08-15T00:55:53.850476Z","submitted_at":"2026-07-15T17:56:58Z","title":"Building Shor's Algorithm in Lean: An Agentic Formalization of Quantum Attacks on RSA-2048 and P-256","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-02T02:52:46.347401Z"},"links":{"citing_paper":"/paper/2607.14082"},"observation_digest":"sha256:e530e775c0aebd51c0ab1faf578ccde533423996aeeacb82ae61908ead19a16d","observation_id":"4640ce8e-cf9a-4bd9-908b-e0313dc869d7","resolution":{"observed_at":"2026-08-02T02:52:46.347401Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T02:52:46.448363Z","title":"Shor’s discrete logarithm quantum algorithm for elliptic curves, 2004","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.14082","last_updated":"2026-07-15T17:56:58Z","snapshot_observed_at":"2026-08-15T00:55:53.850476Z","submitted_at":"2026-07-15T17:56:58Z","title":"Building Shor's Algorithm in Lean: An Agentic Formalization of Quantum Attacks on RSA-2048 and P-256","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-02T02:52:46.448363Z"},"links":{"citing_paper":"/paper/2607.14082"},"observation_digest":"sha256:0d23dc52b253da0ef50973ed293b2077aebe6c10666acf023091141ca6592d7e","observation_id":"cdcc3e35-f931-4014-bf99-d48812d76db6","resolution":{"observed_at":"2026-08-02T02:52:46.448363Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T02:52:46.592106Z","title":"Floyd–hoare logic for quantum programs.ACM Transactions on Programming Languages and Systems, 33(6):19:1–19:49, 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.14082","last_updated":"2026-07-15T17:56:58Z","snapshot_observed_at":"2026-08-15T00:55:53.850476Z","submitted_at":"2026-07-15T17:56:58Z","title":"Building Shor's Algorithm in Lean: An Agentic Formalization of Quantum Attacks on RSA-2048 and P-256","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-02T02:52:46.592106Z"},"links":{"citing_paper":"/paper/2607.14082"},"observation_digest":"sha256:3ba4f45f528b1419a9d658202aa88e0bf7ee5aa66fcaaf9790183b56a54f1618","observation_id":"8c732666-9f12-413c-947a-9dfcd92e3bd7","resolution":{"observed_at":"2026-08-02T02:52:46.592106Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T02:52:46.706202Z","title":"A practical quantum hoare logic with classical variables, I.Information and Computation, 309:105417, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.14082","last_updated":"2026-07-15T17:56:58Z","snapshot_observed_at":"2026-08-15T00:55:53.850476Z","submitted_at":"2026-07-15T17:56:58Z","title":"Building Shor's Algorithm in Lean: An Agentic Formalization of Quantum Attacks on RSA-2048 and P-256","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-02T02:52:46.706202Z"},"links":{"citing_paper":"/paper/2607.14082"},"observation_digest":"sha256:5dd7303cee60b734da864e0c84197ea46446c034fee9ebafbe1537b188bc9b55","observation_id":"91525230-2af1-4324-b4e1-25ef60639cdc","resolution":{"observed_at":"2026-08-02T02:52:46.706202Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T02:52:46.908557Z","title":"The Coq proof assistant (8.20), 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.14082","last_updated":"2026-07-15T17:56:58Z","snapshot_observed_at":"2026-08-15T00:55:53.850476Z","submitted_at":"2026-07-15T17:56:58Z","title":"Building Shor's Algorithm in Lean: An Agentic Formalization of Quantum Attacks on RSA-2048 and P-256","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-02T02:52:46.908557Z"},"links":{"citing_paper":"/paper/2607.14082"},"observation_digest":"sha256:5efc2efe771b830d6cadd8d40b54384b30933cada5c5dad3b6c52481ec5291e0","observation_id":"c99a6803-5735-4e9d-ad37-a672dc7c0053","resolution":{"observed_at":"2026-08-02T02:52:46.908557Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T02:52:47.087978Z","title":"CoqQ: Foundational verification of quantum programs.Proceedings of the ACM on Programming Languages, 7(POPL):833– 865, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.14082","last_updated":"2026-07-15T17:56:58Z","snapshot_observed_at":"2026-08-15T00:55:53.850476Z","submitted_at":"2026-07-15T17:56:58Z","title":"Building Shor's Algorithm in Lean: An Agentic Formalization of Quantum Attacks on RSA-2048 and P-256","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-02T02:52:47.087978Z"},"links":{"citing_paper":"/paper/2607.14082"},"observation_digest":"sha256:bfc347d4fe5500bd9875825ca4237f38646f6059f4dc1a2733f2e142e686b223","observation_id":"a3d6481f-a4cc-4e11-935d-ff11e0a6bd02","resolution":{"observed_at":"2026-08-02T02:52:47.087978Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T02:52:47.236253Z","title":"Quantum algorithms revisited","venue":null,"work_id":null,"year":1969},"citing_paper":{"arxiv_id":"2607.14082","last_updated":"2026-07-15T17:56:58Z","snapshot_observed_at":"2026-08-15T00:55:53.850476Z","submitted_at":"2026-07-15T17:56:58Z","title":"Building Shor's Algorithm in Lean: An Agentic Formalization of Quantum Attacks on RSA-2048 and P-256","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-02T02:52:47.236253Z"},"links":{"citing_paper":"/paper/2607.14082"},"observation_digest":"sha256:50ec03407ddfe63bd4e73432450837ce81ceb63e3f6704a3b415697fac5a4d4a","observation_id":"4328cf13-31d3-48df-b86e-975811aff726","resolution":{"observed_at":"2026-08-02T02:52:47.236253Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T02:52:47.421973Z","title":"Nielsen and Isaac L","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.14082","last_updated":"2026-07-15T17:56:58Z","snapshot_observed_at":"2026-08-15T00:55:53.850476Z","submitted_at":"2026-07-15T17:56:58Z","title":"Building Shor's Algorithm in Lean: An Agentic Formalization of Quantum Attacks on RSA-2048 and P-256","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-02T02:52:47.421973Z"},"links":{"citing_paper":"/paper/2607.14082"},"observation_digest":"sha256:6a440694b54b1a16bd0e0a8f3dab415c89164080942da584efadbba1341c579e","observation_id":"f5c6077e-243f-41ab-8a23-7a9b342ec17f","resolution":{"observed_at":"2026-08-02T02:52:47.421973Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T02:52:47.603767Z","title":"Quantum networks for elementary arithmetic operations.Physical Review A, 54(1):147–153, 1996","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2607.14082","last_updated":"2026-07-15T17:56:58Z","snapshot_observed_at":"2026-08-15T00:55:53.850476Z","submitted_at":"2026-07-15T17:56:58Z","title":"Building Shor's Algorithm in Lean: An Agentic Formalization of Quantum Attacks on RSA-2048 and P-256","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-02T02:52:47.603767Z"},"links":{"citing_paper":"/paper/2607.14082"},"observation_digest":"sha256:fe91d72e2bec55557af77b85e56239d536f7bd67658b0b6c99a7483357c341e0","observation_id":"e4c6b9b1-55cd-4143-9871-bce9dd5b1144","resolution":{"observed_at":"2026-08-02T02:52:47.603767Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.15917","last_updated":"2025-05-21T18:11:44Z","snapshot_observed_at":"2026-08-16T11:59:04.129297Z","submitted_at":"2025-05-21T18:11:44Z","title":"How to factor 2048 bit RSA integers with less than a million noisy qubits","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.15917","snapshot_observed_at":"2026-08-02T02:52:47.716767Z","title":"How to factor 2048 bit RSA integers with less than a million noisy qubits, 2025","venue":null,"work_id":null,"year":2048},"citing_paper":{"arxiv_id":"2607.14082","last_updated":"2026-07-15T17:56:58Z","snapshot_observed_at":"2026-08-15T00:55:53.850476Z","submitted_at":"2026-07-15T17:56:58Z","title":"Building Shor's Algorithm in Lean: An Agentic Formalization of Quantum Attacks on RSA-2048 and P-256","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-02T02:52:47.716767Z"},"links":{"cited_paper":"/paper/2505.15917","citing_paper":"/paper/2607.14082"},"observation_digest":"sha256:1bf0b95767dff745d6a3b45b14d6d47c79a4aba406ccbd40e48e38a661be9ef7","observation_id":"d24c3e62-f7da-4aa2-a5f4-b140353c0b88","resolution":{"observed_at":"2026-08-02T02:52:47.716767Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2602.11457","snapshot_observed_at":"2026-08-02T02:52:47.853037Z","title":"Hockings, Nouédyn Baspin, Felix Thomsen, Samuel C","venue":null,"work_id":null,"year":2048},"citing_paper":{"arxiv_id":"2607.14082","last_updated":"2026-07-15T17:56:58Z","snapshot_observed_at":"2026-08-15T00:55:53.850476Z","submitted_at":"2026-07-15T17:56:58Z","title":"Building Shor's Algorithm in Lean: An Agentic Formalization of Quantum Attacks on RSA-2048 and P-256","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-02T02:52:47.853037Z"},"links":{"cited_paper":"/paper/2602.11457","citing_paper":"/paper/2607.14082"},"observation_digest":"sha256:eb32764a277c4564e87e65a0e5a084d625a195b3ccab0bbc4ebc980ed265e93a","observation_id":"b93c7ebb-2223-413e-9821-e9bd2f41a1a8","resolution":{"observed_at":"2026-08-02T02:52:47.853037Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2603.28627","last_updated":"2026-03-30T16:10:08Z","snapshot_observed_at":"2026-08-09T07:47:35.087503Z","submitted_at":"2026-03-30T16:10:08Z","title":"Shor's algorithm is possible with as few as 10,000 reconfigurable atomic qubits","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2603.28627","snapshot_observed_at":"2026-08-02T02:52:48.056524Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.14082","last_updated":"2026-07-15T17:56:58Z","snapshot_observed_at":"2026-08-15T00:55:53.850476Z","submitted_at":"2026-07-15T17:56:58Z","title":"Building Shor's Algorithm in Lean: An Agentic Formalization of Quantum Attacks on RSA-2048 and P-256","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-02T02:52:48.056524Z"},"links":{"cited_paper":"/paper/2603.28627","citing_paper":"/paper/2607.14082"},"observation_digest":"sha256:6ee7b951e171213420a9e730d6a74cab7142d10b5032defecf41f93910b43f98","observation_id":"429fafdb-85ab-4cd4-ab02-bbb1140f5e3e","resolution":{"observed_at":"2026-08-02T02:52:48.056524Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T02:52:48.224716Z","title":"Improved quantum circuits for elliptic curve discrete logarithms","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.14082","last_updated":"2026-07-15T17:56:58Z","snapshot_observed_at":"2026-08-15T00:55:53.850476Z","submitted_at":"2026-07-15T17:56:58Z","title":"Building Shor's Algorithm in Lean: An Agentic Formalization of Quantum Attacks on RSA-2048 and P-256","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-02T02:52:48.224716Z"},"links":{"citing_paper":"/paper/2607.14082"},"observation_digest":"sha256:d93e8449c0c16283aa76d108ada9cad7361e23dd4a9ca91227588ce29078d37e","observation_id":"44823161-b23a-463f-a1ac-583f1fddd8e2","resolution":{"observed_at":"2026-08-02T02:52:48.224716Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2604.02311","last_updated":"2026-04-18T08:20:32Z","snapshot_observed_at":"2026-08-11T12:57:43.469203Z","submitted_at":"2026-04-02T17:52:00Z","title":"Space-Efficient Quantum Algorithm for Elliptic Curve Discrete Logarithms with Resource Estimation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2604.02311","snapshot_observed_at":"2026-08-02T02:52:48.363343Z","title":"Space-efficient quantum algorithm for elliptic curve discrete logarithms with resource estimation, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.14082","last_updated":"2026-07-15T17:56:58Z","snapshot_observed_at":"2026-08-15T00:55:53.850476Z","submitted_at":"2026-07-15T17:56:58Z","title":"Building Shor's Algorithm in Lean: An Agentic Formalization of Quantum Attacks on RSA-2048 and P-256","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-02T02:52:48.363343Z"},"links":{"cited_paper":"/paper/2604.02311","citing_paper":"/paper/2607.14082"},"observation_digest":"sha256:83e8c24b76d6b497d01535ef30bc20066cbad40692bbea14de0df4aaa40984fb","observation_id":"2261c965-aa31-40b6-91a0-7deac5474b75","resolution":{"observed_at":"2026-08-02T02:52:48.363343Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.14082","last_updated":"2026-07-15T17:56:58Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-15T00:55:53.850476Z","submitted_at":"2026-07-15T17:56:58Z","title":"Building Shor's Algorithm in Lean: An Agentic Formalization of Quantum Attacks on RSA-2048 and P-256"},"reference_resolution":{"displayed":34,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":34,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":34},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 34 of 34 outbound references and 0 inbound Pith citation observations for arXiv:2607.14082."}