{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:YTMMJPC3CW3NAL4IZLEXOVWVSL","short_pith_number":"pith:YTMMJPC3","schema_version":"1.0","canonical_sha256":"c4d8c4bc5b15b6d02f88cac97756d592fb909299a3fd3bfd1c2a9ba4d3242b45","source":{"kind":"arxiv","id":"1207.7291","version":1},"attestation_state":"computed","paper":{"title":"A 60,000 digit prime number of the form $x^{2} + x + 41$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Jeremy Rouse, Justin DeBenedetto","submitted_at":"2012-07-31T15:37:20Z","abstract_excerpt":"Motivated by Euler's observation that the polynomial $x^{2} + x + 41$ takes on prime values for $0 \\leq x \\leq 39$, we search for large values of $x$ for which $N = x^{2} + x + 41$ is prime. To apply classical primality proving results based on the factorization of $N-1$, we choose $x$ to have the form $g(y)$, chosen so that $g(y)^{2} + g(y) + 40$ is reducible. Our main result is an explicit, 60,000 digit prime number of the form $x^{2} + x + 41$."},"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":"1207.7291","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2012-07-31T15:37:20Z","cross_cats_sorted":[],"title_canon_sha256":"25c6c0798316b5c2eab4fb074fc1427f69b5c496f7c6302197d530235f029a1c","abstract_canon_sha256":"ee46e4132e1d768b7bc1a7cf2babe7c3926d9a197e14a8ff0b928d4bb85b90e9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:46.260544Z","signature_b64":"WliPeOaPZ+ulqPM286k4XS4ImbP5am/bKuexDrHrQynHgioiyoLX+pIzsQIQhtsoS82XZZh7QznNvE+yKcdbCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c4d8c4bc5b15b6d02f88cac97756d592fb909299a3fd3bfd1c2a9ba4d3242b45","last_reissued_at":"2026-05-18T03:49:46.259784Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:46.259784Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A 60,000 digit prime number of the form $x^{2} + x + 41$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Jeremy Rouse, Justin DeBenedetto","submitted_at":"2012-07-31T15:37:20Z","abstract_excerpt":"Motivated by Euler's observation that the polynomial $x^{2} + x + 41$ takes on prime values for $0 \\leq x \\leq 39$, we search for large values of $x$ for which $N = x^{2} + x + 41$ is prime. To apply classical primality proving results based on the factorization of $N-1$, we choose $x$ to have the form $g(y)$, chosen so that $g(y)^{2} + g(y) + 40$ is reducible. Our main result is an explicit, 60,000 digit prime number of the form $x^{2} + x + 41$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.7291","kind":"arxiv","version":1},"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":"1207.7291","created_at":"2026-05-18T03:49:46.259901+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.7291v1","created_at":"2026-05-18T03:49:46.259901+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.7291","created_at":"2026-05-18T03:49:46.259901+00:00"},{"alias_kind":"pith_short_12","alias_value":"YTMMJPC3CW3N","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"YTMMJPC3CW3NAL4I","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"YTMMJPC3","created_at":"2026-05-18T12:27:30.460161+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/YTMMJPC3CW3NAL4IZLEXOVWVSL","json":"https://pith.science/pith/YTMMJPC3CW3NAL4IZLEXOVWVSL.json","graph_json":"https://pith.science/api/pith-number/YTMMJPC3CW3NAL4IZLEXOVWVSL/graph.json","events_json":"https://pith.science/api/pith-number/YTMMJPC3CW3NAL4IZLEXOVWVSL/events.json","paper":"https://pith.science/paper/YTMMJPC3"},"agent_actions":{"view_html":"https://pith.science/pith/YTMMJPC3CW3NAL4IZLEXOVWVSL","download_json":"https://pith.science/pith/YTMMJPC3CW3NAL4IZLEXOVWVSL.json","view_paper":"https://pith.science/paper/YTMMJPC3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.7291&json=true","fetch_graph":"https://pith.science/api/pith-number/YTMMJPC3CW3NAL4IZLEXOVWVSL/graph.json","fetch_events":"https://pith.science/api/pith-number/YTMMJPC3CW3NAL4IZLEXOVWVSL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YTMMJPC3CW3NAL4IZLEXOVWVSL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YTMMJPC3CW3NAL4IZLEXOVWVSL/action/storage_attestation","attest_author":"https://pith.science/pith/YTMMJPC3CW3NAL4IZLEXOVWVSL/action/author_attestation","sign_citation":"https://pith.science/pith/YTMMJPC3CW3NAL4IZLEXOVWVSL/action/citation_signature","submit_replication":"https://pith.science/pith/YTMMJPC3CW3NAL4IZLEXOVWVSL/action/replication_record"}},"created_at":"2026-05-18T03:49:46.259901+00:00","updated_at":"2026-05-18T03:49:46.259901+00:00"}