{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:KKX6ASBOKCRFT5YTFSRPOHHDUV","short_pith_number":"pith:KKX6ASBO","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"},"canonical_sha256":"52afe0482e50a259f7132ca2f71ce3a562e43c6774f91c7b9e6fad901598fb86","source":{"kind":"arxiv","id":"2401.14495","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.14495","created_at":"2026-07-05T08:54:06Z"},{"alias_kind":"arxiv_version","alias_value":"2401.14495v3","created_at":"2026-07-05T08:54:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.14495","created_at":"2026-07-05T08:54:06Z"},{"alias_kind":"pith_short_12","alias_value":"KKX6ASBOKCRF","created_at":"2026-07-05T08:54:06Z"},{"alias_kind":"pith_short_16","alias_value":"KKX6ASBOKCRFT5YT","created_at":"2026-07-05T08:54:06Z"},{"alias_kind":"pith_short_8","alias_value":"KKX6ASBO","created_at":"2026-07-05T08:54:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:KKX6ASBOKCRFT5YTFSRPOHHDUV","target":"record","payload":{"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"},"canonical_sha256":"52afe0482e50a259f7132ca2f71ce3a562e43c6774f91c7b9e6fad901598fb86","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"},"source_kind":"arxiv","source_id":"2401.14495","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T08:54:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TKJf0bLb4WFsXAnr0G2KLKuR+4rkIHyAU4DYQuV2ZYzDwT92DQEhBGDraM1ccEAThA2m6XoWB1byFGduANGrBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T11:27:00.489753Z"},"content_sha256":"d64176fca846830b60aa92f732b61a9b085ee235b15d9c8c5d0d06e38a9cec21","schema_version":"1.0","event_id":"sha256:d64176fca846830b60aa92f732b61a9b085ee235b15d9c8c5d0d06e38a9cec21"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:KKX6ASBOKCRFT5YTFSRPOHHDUV","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T08:54:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m9U4zTGdNnLIY5AEO9J39T8zgcqkNAoxewIiOtUDD5r0W4AITrVRl6Ctb+FQFxcxkmoZfiaAGeRLbBAJazzCCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T11:27:00.490284Z"},"content_sha256":"bd4f4b0220441fef97f5f3a5d71f888a327c650a222806285c69c26ecf637957","schema_version":"1.0","event_id":"sha256:bd4f4b0220441fef97f5f3a5d71f888a327c650a222806285c69c26ecf637957"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KKX6ASBOKCRFT5YTFSRPOHHDUV/bundle.json","state_url":"https://pith.science/pith/KKX6ASBOKCRFT5YTFSRPOHHDUV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KKX6ASBOKCRFT5YTFSRPOHHDUV/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-09T11:27:00Z","links":{"resolver":"https://pith.science/pith/KKX6ASBOKCRFT5YTFSRPOHHDUV","bundle":"https://pith.science/pith/KKX6ASBOKCRFT5YTFSRPOHHDUV/bundle.json","state":"https://pith.science/pith/KKX6ASBOKCRFT5YTFSRPOHHDUV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KKX6ASBOKCRFT5YTFSRPOHHDUV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:KKX6ASBOKCRFT5YTFSRPOHHDUV","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"5e4d57bc4f51a474e7ef15a16e86ac662296606e4e7e19f9602a373176e20239","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2024-01-25T20:21:45Z","title_canon_sha256":"63d008d4a288229ef62e3747c94b18c7bdcea2e4baa53a73a351a60b1efa1f5d"},"schema_version":"1.0","source":{"id":"2401.14495","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.14495","created_at":"2026-07-05T08:54:06Z"},{"alias_kind":"arxiv_version","alias_value":"2401.14495v3","created_at":"2026-07-05T08:54:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.14495","created_at":"2026-07-05T08:54:06Z"},{"alias_kind":"pith_short_12","alias_value":"KKX6ASBOKCRF","created_at":"2026-07-05T08:54:06Z"},{"alias_kind":"pith_short_16","alias_value":"KKX6ASBOKCRFT5YT","created_at":"2026-07-05T08:54:06Z"},{"alias_kind":"pith_short_8","alias_value":"KKX6ASBO","created_at":"2026-07-05T08:54:06Z"}],"graph_snapshots":[{"event_id":"sha256:bd4f4b0220441fef97f5f3a5d71f888a327c650a222806285c69c26ecf637957","target":"graph","created_at":"2026-07-05T08:54:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2401.14495/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Andrew Shallue, Jonathan Webster","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2024-01-25T20:21:45Z","title":"Advances in Tabulating Carmichael Numbers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.14495","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d64176fca846830b60aa92f732b61a9b085ee235b15d9c8c5d0d06e38a9cec21","target":"record","created_at":"2026-07-05T08:54:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"5e4d57bc4f51a474e7ef15a16e86ac662296606e4e7e19f9602a373176e20239","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2024-01-25T20:21:45Z","title_canon_sha256":"63d008d4a288229ef62e3747c94b18c7bdcea2e4baa53a73a351a60b1efa1f5d"},"schema_version":"1.0","source":{"id":"2401.14495","kind":"arxiv","version":3}},"canonical_sha256":"52afe0482e50a259f7132ca2f71ce3a562e43c6774f91c7b9e6fad901598fb86","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"52afe0482e50a259f7132ca2f71ce3a562e43c6774f91c7b9e6fad901598fb86","first_computed_at":"2026-07-05T08:54:06.641760Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:54:06.641760Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s6zor9L/lMRFDet2ZL8wmwPYxkLPVFSrp4k0UVtdgUUOoB6gnU8c2p9RT1xiFfgyKqoDoKRqkX2x/hGu/tCMCA==","signature_status":"signed_v1","signed_at":"2026-07-05T08:54:06.642191Z","signed_message":"canonical_sha256_bytes"},"source_id":"2401.14495","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d64176fca846830b60aa92f732b61a9b085ee235b15d9c8c5d0d06e38a9cec21","sha256:bd4f4b0220441fef97f5f3a5d71f888a327c650a222806285c69c26ecf637957"],"state_sha256":"25256a5e1de0d990c41fdcd08b7a9e75b07cb828aa545097c2e0d20fb84dc096"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QvA/Fj0PD9Ig77KiEgKp3DKnnUBiWsVhn5MqLhAclqKjewZMMJKaC/JcFDYSpbPxVt1CIc/mssZLaVriKMYWDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T11:27:00.495260Z","bundle_sha256":"c5ef4b46faea428f21576a6fe6b6486a4e3f340f48d88f84f1fb6cf8832e8633"}}