{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:VOINM5QWSGSDJWQYRINXKHLD6B","short_pith_number":"pith:VOINM5QW","schema_version":"1.0","canonical_sha256":"ab90d6761691a434da188a1b751d63f06c5093da4d7ea4f195da3d283ff293e1","source":{"kind":"arxiv","id":"1203.6664","version":2},"attestation_state":"computed","paper":{"title":"Constructing Carmichael numbers through improved subset-product algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Andrew Shallue, Jon Grantham, Steven Hayman, W.R. Alford","submitted_at":"2012-03-29T20:38:28Z","abstract_excerpt":"We have constructed a Carmichael number with 10,333,229,505 prime factors, and have also constructed Carmichael numbers with k prime factors for every k between 3 and 19,565,220. These computations are the product of implementations of two new algorithms for the subset product problem that exploit the non-uniform distribution of primes p with the property that p-1 divides a highly composite \\Lambda."},"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":"1203.6664","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2012-03-29T20:38:28Z","cross_cats_sorted":[],"title_canon_sha256":"c60f99fc0ac0ff57752c5f2d275a02424ebbcbc9d104c26cb2d76aa472f7b22c","abstract_canon_sha256":"6cee570500f5f08b134c34fbe6812582fee91a7c61d304c2f520d4b65d04a190"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:35.099692Z","signature_b64":"C2QuC7pPPiyprX2OMB7BedXY4Eai0La49mh6rBWmebeqb/5qKIe5tw/KBJRYlNzhjLZe7x6GtaS1yOKJ8L3eDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab90d6761691a434da188a1b751d63f06c5093da4d7ea4f195da3d283ff293e1","last_reissued_at":"2026-05-17T23:51:35.099020Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:35.099020Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constructing Carmichael numbers through improved subset-product algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Andrew Shallue, Jon Grantham, Steven Hayman, W.R. Alford","submitted_at":"2012-03-29T20:38:28Z","abstract_excerpt":"We have constructed a Carmichael number with 10,333,229,505 prime factors, and have also constructed Carmichael numbers with k prime factors for every k between 3 and 19,565,220. These computations are the product of implementations of two new algorithms for the subset product problem that exploit the non-uniform distribution of primes p with the property that p-1 divides a highly composite \\Lambda."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.6664","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":"1203.6664","created_at":"2026-05-17T23:51:35.099119+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.6664v2","created_at":"2026-05-17T23:51:35.099119+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.6664","created_at":"2026-05-17T23:51:35.099119+00:00"},{"alias_kind":"pith_short_12","alias_value":"VOINM5QWSGSD","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"VOINM5QWSGSDJWQY","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"VOINM5QW","created_at":"2026-05-18T12:27:25.539911+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/VOINM5QWSGSDJWQYRINXKHLD6B","json":"https://pith.science/pith/VOINM5QWSGSDJWQYRINXKHLD6B.json","graph_json":"https://pith.science/api/pith-number/VOINM5QWSGSDJWQYRINXKHLD6B/graph.json","events_json":"https://pith.science/api/pith-number/VOINM5QWSGSDJWQYRINXKHLD6B/events.json","paper":"https://pith.science/paper/VOINM5QW"},"agent_actions":{"view_html":"https://pith.science/pith/VOINM5QWSGSDJWQYRINXKHLD6B","download_json":"https://pith.science/pith/VOINM5QWSGSDJWQYRINXKHLD6B.json","view_paper":"https://pith.science/paper/VOINM5QW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.6664&json=true","fetch_graph":"https://pith.science/api/pith-number/VOINM5QWSGSDJWQYRINXKHLD6B/graph.json","fetch_events":"https://pith.science/api/pith-number/VOINM5QWSGSDJWQYRINXKHLD6B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VOINM5QWSGSDJWQYRINXKHLD6B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VOINM5QWSGSDJWQYRINXKHLD6B/action/storage_attestation","attest_author":"https://pith.science/pith/VOINM5QWSGSDJWQYRINXKHLD6B/action/author_attestation","sign_citation":"https://pith.science/pith/VOINM5QWSGSDJWQYRINXKHLD6B/action/citation_signature","submit_replication":"https://pith.science/pith/VOINM5QWSGSDJWQYRINXKHLD6B/action/replication_record"}},"created_at":"2026-05-17T23:51:35.099119+00:00","updated_at":"2026-05-17T23:51:35.099119+00:00"}