{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:7S4IFZVDOWLMDPO54ZXAXUHOJT","short_pith_number":"pith:7S4IFZVD","schema_version":"1.0","canonical_sha256":"fcb882e6a37596c1bddde66e0bd0ee4cf33e9275b81f9426d96c8632491e457f","source":{"kind":"arxiv","id":"1402.1201","version":2},"attestation_state":"computed","paper":{"title":"Using Simulated Annealing to Factor Numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"math.NT","authors_text":"Eric Lewin Altschuler, Timothy J. Williams","submitted_at":"2014-02-03T23:59:34Z","abstract_excerpt":"Almost all public secure communication relies on the inability to factor large numbers. There is no known analytic or classical numeric method to rapidly factor large numbers. Shor[1] has shown that a quantum computer can factor numbers in polynomial time but there is no practical quantum computer that can yet do such computations. We show that a simulated annealing[2] approach can be adapted to find factors of large numbers."},"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":"1402.1201","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2014-02-03T23:59:34Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"80a091ad822202f9a1456f63a14bbf703b69a594b5b17926af42ba267f4aac10","abstract_canon_sha256":"e96bf4cb3b0d67084f11e2ad6e03fc4d66ae17908c5d115eb529bd9ade550788"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:59:05.719050Z","signature_b64":"zjXJlq0C46zK1Q8VqQ7XJcpBbpljK1fa4ib8EkgG7iGtZqedpPwoonGjSZ3un8YUeayK6koy+tF0+UwdVV9RBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fcb882e6a37596c1bddde66e0bd0ee4cf33e9275b81f9426d96c8632491e457f","last_reissued_at":"2026-05-18T02:59:05.718340Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:59:05.718340Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Using Simulated Annealing to Factor Numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"math.NT","authors_text":"Eric Lewin Altschuler, Timothy J. Williams","submitted_at":"2014-02-03T23:59:34Z","abstract_excerpt":"Almost all public secure communication relies on the inability to factor large numbers. There is no known analytic or classical numeric method to rapidly factor large numbers. Shor[1] has shown that a quantum computer can factor numbers in polynomial time but there is no practical quantum computer that can yet do such computations. We show that a simulated annealing[2] approach can be adapted to find factors of large numbers."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.1201","kind":"arxiv","version":2},"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":"1402.1201","created_at":"2026-05-18T02:59:05.718454+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.1201v2","created_at":"2026-05-18T02:59:05.718454+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.1201","created_at":"2026-05-18T02:59:05.718454+00:00"},{"alias_kind":"pith_short_12","alias_value":"7S4IFZVDOWLM","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"7S4IFZVDOWLMDPO5","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"7S4IFZVD","created_at":"2026-05-18T12:28:19.803747+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/7S4IFZVDOWLMDPO54ZXAXUHOJT","json":"https://pith.science/pith/7S4IFZVDOWLMDPO54ZXAXUHOJT.json","graph_json":"https://pith.science/api/pith-number/7S4IFZVDOWLMDPO54ZXAXUHOJT/graph.json","events_json":"https://pith.science/api/pith-number/7S4IFZVDOWLMDPO54ZXAXUHOJT/events.json","paper":"https://pith.science/paper/7S4IFZVD"},"agent_actions":{"view_html":"https://pith.science/pith/7S4IFZVDOWLMDPO54ZXAXUHOJT","download_json":"https://pith.science/pith/7S4IFZVDOWLMDPO54ZXAXUHOJT.json","view_paper":"https://pith.science/paper/7S4IFZVD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.1201&json=true","fetch_graph":"https://pith.science/api/pith-number/7S4IFZVDOWLMDPO54ZXAXUHOJT/graph.json","fetch_events":"https://pith.science/api/pith-number/7S4IFZVDOWLMDPO54ZXAXUHOJT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7S4IFZVDOWLMDPO54ZXAXUHOJT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7S4IFZVDOWLMDPO54ZXAXUHOJT/action/storage_attestation","attest_author":"https://pith.science/pith/7S4IFZVDOWLMDPO54ZXAXUHOJT/action/author_attestation","sign_citation":"https://pith.science/pith/7S4IFZVDOWLMDPO54ZXAXUHOJT/action/citation_signature","submit_replication":"https://pith.science/pith/7S4IFZVDOWLMDPO54ZXAXUHOJT/action/replication_record"}},"created_at":"2026-05-18T02:59:05.718454+00:00","updated_at":"2026-05-18T02:59:05.718454+00:00"}