{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:M7FVLAV2I6QZCPCSA6EDUMLXHB","short_pith_number":"pith:M7FVLAV2","schema_version":"1.0","canonical_sha256":"67cb5582ba47a1913c5207883a31773840e11a9699fa97bdcc64a115f7702a69","source":{"kind":"arxiv","id":"1009.3956","version":4},"attestation_state":"computed","paper":{"title":"Deterministic methods to find primes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"D.H.J. Polymath","submitted_at":"2010-09-20T21:35:05Z","abstract_excerpt":"Given a large positive integer $N$, how quickly can one construct a prime number larger than $N$ (or between $N$ and 2N)? Using probabilistic methods, one can obtain a prime number in time at most $\\log^{O(1)} N$ with high probability by selecting numbers between $N$ and 2N at random and testing each one in turn for primality until a prime is discovered. However, if one seeks a deterministic method, then the problem is much more difficult, unless one assumes some unproven conjectures in number theory; brute force methods give a $O(N^{1+o(1)})$ algorithm, and the best unconditional algorithm, d"},"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":"1009.3956","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2010-09-20T21:35:05Z","cross_cats_sorted":[],"title_canon_sha256":"c0898ed8291a2d12c95d204cea3125e854c56a08edb723901d8c8e10f3a9cd75","abstract_canon_sha256":"e0f709f82f06beeafc20eaac367a9cc2e5c6aece301461f56beb852402080e48"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:54:50.225432Z","signature_b64":"ZqmAdtMPgWF/wYSxpNQaRpgjqqme3St8Dw1EuPdYqr6dRuxLc+ydJONVttpVbhbgJP7Gv+mKY2H3twIz5RDeAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67cb5582ba47a1913c5207883a31773840e11a9699fa97bdcc64a115f7702a69","last_reissued_at":"2026-05-18T03:54:50.224874Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:54:50.224874Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deterministic methods to find primes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"D.H.J. Polymath","submitted_at":"2010-09-20T21:35:05Z","abstract_excerpt":"Given a large positive integer $N$, how quickly can one construct a prime number larger than $N$ (or between $N$ and 2N)? Using probabilistic methods, one can obtain a prime number in time at most $\\log^{O(1)} N$ with high probability by selecting numbers between $N$ and 2N at random and testing each one in turn for primality until a prime is discovered. However, if one seeks a deterministic method, then the problem is much more difficult, unless one assumes some unproven conjectures in number theory; brute force methods give a $O(N^{1+o(1)})$ algorithm, and the best unconditional algorithm, d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.3956","kind":"arxiv","version":4},"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":"1009.3956","created_at":"2026-05-18T03:54:50.224967+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.3956v4","created_at":"2026-05-18T03:54:50.224967+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.3956","created_at":"2026-05-18T03:54:50.224967+00:00"},{"alias_kind":"pith_short_12","alias_value":"M7FVLAV2I6QZ","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_16","alias_value":"M7FVLAV2I6QZCPCS","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_8","alias_value":"M7FVLAV2","created_at":"2026-05-18T12:26:10.704358+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/M7FVLAV2I6QZCPCSA6EDUMLXHB","json":"https://pith.science/pith/M7FVLAV2I6QZCPCSA6EDUMLXHB.json","graph_json":"https://pith.science/api/pith-number/M7FVLAV2I6QZCPCSA6EDUMLXHB/graph.json","events_json":"https://pith.science/api/pith-number/M7FVLAV2I6QZCPCSA6EDUMLXHB/events.json","paper":"https://pith.science/paper/M7FVLAV2"},"agent_actions":{"view_html":"https://pith.science/pith/M7FVLAV2I6QZCPCSA6EDUMLXHB","download_json":"https://pith.science/pith/M7FVLAV2I6QZCPCSA6EDUMLXHB.json","view_paper":"https://pith.science/paper/M7FVLAV2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.3956&json=true","fetch_graph":"https://pith.science/api/pith-number/M7FVLAV2I6QZCPCSA6EDUMLXHB/graph.json","fetch_events":"https://pith.science/api/pith-number/M7FVLAV2I6QZCPCSA6EDUMLXHB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M7FVLAV2I6QZCPCSA6EDUMLXHB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M7FVLAV2I6QZCPCSA6EDUMLXHB/action/storage_attestation","attest_author":"https://pith.science/pith/M7FVLAV2I6QZCPCSA6EDUMLXHB/action/author_attestation","sign_citation":"https://pith.science/pith/M7FVLAV2I6QZCPCSA6EDUMLXHB/action/citation_signature","submit_replication":"https://pith.science/pith/M7FVLAV2I6QZCPCSA6EDUMLXHB/action/replication_record"}},"created_at":"2026-05-18T03:54:50.224967+00:00","updated_at":"2026-05-18T03:54:50.224967+00:00"}