{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:WRVA4FESH5UNPCTVG5O6SWDYHL","short_pith_number":"pith:WRVA4FES","schema_version":"1.0","canonical_sha256":"b46a0e14923f68d78a75375de958783aca8f983326baee9567ae6617eb660cf4","source":{"kind":"arxiv","id":"1511.04385","version":3},"attestation_state":"computed","paper":{"title":"Factoring Safe Semiprimes with a Single Quantum Query","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Benjamin Smith, Fran\\c{c}ois Morain, Fr\\'ed\\'eric Grosshans, Thomas Lawson","submitted_at":"2015-11-13T18:14:37Z","abstract_excerpt":"Shor's factoring algorithm (SFA), by its ability to efficiently factor large numbers, has the potential to undermine contemporary encryption. At its heart is a process called order finding, which quantum mechanics lets us perform efficiently. SFA thus consists of a \\emph{quantum order finding algorithm} (QOFA), bookended by classical routines which, given the order, return the factors. But, with probability up to $1/2$, these classical routines fail, and QOFA must be rerun. We modify these routines using elementary results in number theory, improving the likelihood that they return the factors"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1511.04385","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-11-13T18:14:37Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"1d91d80904d53dd5a0086159db9e8362a15ce9bc805b59150decaee6b1eba353","abstract_canon_sha256":"c5af9b472c9b7513357552a799af99f23e98a36a37b16587082fc4df1c0a18be"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:42.614157Z","signature_b64":"rgOG3i4A21neKjQlsrKEY+Q0j/Juz0iByoBdba9xGWlzkDe2BGLU/+wDY6NuzP9zSGaZp89k1A6lVHcAxN8EDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b46a0e14923f68d78a75375de958783aca8f983326baee9567ae6617eb660cf4","last_reissued_at":"2026-05-18T00:49:42.613573Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:42.613573Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Factoring Safe Semiprimes with a Single Quantum Query","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Benjamin Smith, Fran\\c{c}ois Morain, Fr\\'ed\\'eric Grosshans, Thomas Lawson","submitted_at":"2015-11-13T18:14:37Z","abstract_excerpt":"Shor's factoring algorithm (SFA), by its ability to efficiently factor large numbers, has the potential to undermine contemporary encryption. At its heart is a process called order finding, which quantum mechanics lets us perform efficiently. SFA thus consists of a \\emph{quantum order finding algorithm} (QOFA), bookended by classical routines which, given the order, return the factors. But, with probability up to $1/2$, these classical routines fail, and QOFA must be rerun. We modify these routines using elementary results in number theory, improving the likelihood that they return the factors"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.04385","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1511.04385","created_at":"2026-05-18T00:49:42.613680+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.04385v3","created_at":"2026-05-18T00:49:42.613680+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.04385","created_at":"2026-05-18T00:49:42.613680+00:00"},{"alias_kind":"pith_short_12","alias_value":"WRVA4FESH5UN","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"WRVA4FESH5UNPCTV","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"WRVA4FES","created_at":"2026-05-18T12:29:47.479230+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WRVA4FESH5UNPCTVG5O6SWDYHL","json":"https://pith.science/pith/WRVA4FESH5UNPCTVG5O6SWDYHL.json","graph_json":"https://pith.science/api/pith-number/WRVA4FESH5UNPCTVG5O6SWDYHL/graph.json","events_json":"https://pith.science/api/pith-number/WRVA4FESH5UNPCTVG5O6SWDYHL/events.json","paper":"https://pith.science/paper/WRVA4FES"},"agent_actions":{"view_html":"https://pith.science/pith/WRVA4FESH5UNPCTVG5O6SWDYHL","download_json":"https://pith.science/pith/WRVA4FESH5UNPCTVG5O6SWDYHL.json","view_paper":"https://pith.science/paper/WRVA4FES","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.04385&json=true","fetch_graph":"https://pith.science/api/pith-number/WRVA4FESH5UNPCTVG5O6SWDYHL/graph.json","fetch_events":"https://pith.science/api/pith-number/WRVA4FESH5UNPCTVG5O6SWDYHL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WRVA4FESH5UNPCTVG5O6SWDYHL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WRVA4FESH5UNPCTVG5O6SWDYHL/action/storage_attestation","attest_author":"https://pith.science/pith/WRVA4FESH5UNPCTVG5O6SWDYHL/action/author_attestation","sign_citation":"https://pith.science/pith/WRVA4FESH5UNPCTVG5O6SWDYHL/action/citation_signature","submit_replication":"https://pith.science/pith/WRVA4FESH5UNPCTVG5O6SWDYHL/action/replication_record"}},"created_at":"2026-05-18T00:49:42.613680+00:00","updated_at":"2026-05-18T00:49:42.613680+00:00"}