{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:KKX6ASBOKCRFT5YTFSRPOHHDUV","short_pith_number":"pith:KKX6ASBO","schema_version":"1.0","canonical_sha256":"52afe0482e50a259f7132ca2f71ce3a562e43c6774f91c7b9e6fad901598fb86","source":{"kind":"arxiv","id":"2401.14495","version":3},"attestation_state":"computed","paper":{"title":"Advances in Tabulating Carmichael Numbers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Andrew Shallue, Jonathan Webster","submitted_at":"2024-01-25T20:21:45Z","abstract_excerpt":"We report that there are $49679870$ Carmichael numbers less than $10^{22}$ which is an order of magnitude improvement on Richard Pinch's prior work. We find Carmichael numbers of the form $n = Pqr$ using an algorithm bifurcated by the size of $P$ with respect to the tabulation bound $B$. For $P < 7 \\cdot 10^7$, we found $35985331$ Carmichael numbers and $1202914$ of them were less than $10^{22}$. When $P > 7 \\cdot 10^7$, we found $48476956$ Carmichael numbers less than $10^{22}$. We provide a comprehensive overview of both cases of the algorithm. For the large case, we show and implement asymp"},"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":"2401.14495","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2024-01-25T20:21:45Z","cross_cats_sorted":[],"title_canon_sha256":"63d008d4a288229ef62e3747c94b18c7bdcea2e4baa53a73a351a60b1efa1f5d","abstract_canon_sha256":"5e4d57bc4f51a474e7ef15a16e86ac662296606e4e7e19f9602a373176e20239"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:54:06.642191Z","signature_b64":"s6zor9L/lMRFDet2ZL8wmwPYxkLPVFSrp4k0UVtdgUUOoB6gnU8c2p9RT1xiFfgyKqoDoKRqkX2x/hGu/tCMCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52afe0482e50a259f7132ca2f71ce3a562e43c6774f91c7b9e6fad901598fb86","last_reissued_at":"2026-07-05T08:54:06.641760Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:54:06.641760Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Advances in Tabulating Carmichael Numbers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Andrew Shallue, Jonathan Webster","submitted_at":"2024-01-25T20:21:45Z","abstract_excerpt":"We report that there are $49679870$ Carmichael numbers less than $10^{22}$ which is an order of magnitude improvement on Richard Pinch's prior work. We find Carmichael numbers of the form $n = Pqr$ using an algorithm bifurcated by the size of $P$ with respect to the tabulation bound $B$. For $P < 7 \\cdot 10^7$, we found $35985331$ Carmichael numbers and $1202914$ of them were less than $10^{22}$. When $P > 7 \\cdot 10^7$, we found $48476956$ Carmichael numbers less than $10^{22}$. We provide a comprehensive overview of both cases of the algorithm. For the large case, we show and implement asymp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.14495","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2401.14495/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2401.14495","created_at":"2026-07-05T08:54:06.641816+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.14495v3","created_at":"2026-07-05T08:54:06.641816+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.14495","created_at":"2026-07-05T08:54:06.641816+00:00"},{"alias_kind":"pith_short_12","alias_value":"KKX6ASBOKCRF","created_at":"2026-07-05T08:54:06.641816+00:00"},{"alias_kind":"pith_short_16","alias_value":"KKX6ASBOKCRFT5YT","created_at":"2026-07-05T08:54:06.641816+00:00"},{"alias_kind":"pith_short_8","alias_value":"KKX6ASBO","created_at":"2026-07-05T08:54:06.641816+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.09406","citing_title":"Adversarial Activation Patching: A Framework for Detecting and Mitigating Emergent Deception in Safety-Aligned Transformers","ref_index":4,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KKX6ASBOKCRFT5YTFSRPOHHDUV","json":"https://pith.science/pith/KKX6ASBOKCRFT5YTFSRPOHHDUV.json","graph_json":"https://pith.science/api/pith-number/KKX6ASBOKCRFT5YTFSRPOHHDUV/graph.json","events_json":"https://pith.science/api/pith-number/KKX6ASBOKCRFT5YTFSRPOHHDUV/events.json","paper":"https://pith.science/paper/KKX6ASBO"},"agent_actions":{"view_html":"https://pith.science/pith/KKX6ASBOKCRFT5YTFSRPOHHDUV","download_json":"https://pith.science/pith/KKX6ASBOKCRFT5YTFSRPOHHDUV.json","view_paper":"https://pith.science/paper/KKX6ASBO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.14495&json=true","fetch_graph":"https://pith.science/api/pith-number/KKX6ASBOKCRFT5YTFSRPOHHDUV/graph.json","fetch_events":"https://pith.science/api/pith-number/KKX6ASBOKCRFT5YTFSRPOHHDUV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KKX6ASBOKCRFT5YTFSRPOHHDUV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KKX6ASBOKCRFT5YTFSRPOHHDUV/action/storage_attestation","attest_author":"https://pith.science/pith/KKX6ASBOKCRFT5YTFSRPOHHDUV/action/author_attestation","sign_citation":"https://pith.science/pith/KKX6ASBOKCRFT5YTFSRPOHHDUV/action/citation_signature","submit_replication":"https://pith.science/pith/KKX6ASBOKCRFT5YTFSRPOHHDUV/action/replication_record"}},"created_at":"2026-07-05T08:54:06.641816+00:00","updated_at":"2026-07-05T08:54:06.641816+00:00"}