{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:6THBLUE2WJNMRLSPBJNTP3JM4M","short_pith_number":"pith:6THBLUE2","canonical_record":{"source":{"id":"2403.02548","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2024-03-04T23:58:03Z","cross_cats_sorted":[],"title_canon_sha256":"0f9b9eb308bef06d8b18d54cfcfcf196c62b30f638673c7e67811965a318befe","abstract_canon_sha256":"0fadfe1d1f1d12f108296be8e5eee84202191581c26efa120f1871e27a3548ef"},"schema_version":"1.0"},"canonical_sha256":"f4ce15d09ab25ac8ae4f0a5b37ed2ce335dd11d5eae05e2009e48ffb5c8f65e9","source":{"kind":"arxiv","id":"2403.02548","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.02548","created_at":"2026-07-05T07:52:18Z"},{"alias_kind":"arxiv_version","alias_value":"2403.02548v1","created_at":"2026-07-05T07:52:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.02548","created_at":"2026-07-05T07:52:18Z"},{"alias_kind":"pith_short_12","alias_value":"6THBLUE2WJNM","created_at":"2026-07-05T07:52:18Z"},{"alias_kind":"pith_short_16","alias_value":"6THBLUE2WJNMRLSP","created_at":"2026-07-05T07:52:18Z"},{"alias_kind":"pith_short_8","alias_value":"6THBLUE2","created_at":"2026-07-05T07:52:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:6THBLUE2WJNMRLSPBJNTP3JM4M","target":"record","payload":{"canonical_record":{"source":{"id":"2403.02548","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2024-03-04T23:58:03Z","cross_cats_sorted":[],"title_canon_sha256":"0f9b9eb308bef06d8b18d54cfcfcf196c62b30f638673c7e67811965a318befe","abstract_canon_sha256":"0fadfe1d1f1d12f108296be8e5eee84202191581c26efa120f1871e27a3548ef"},"schema_version":"1.0"},"canonical_sha256":"f4ce15d09ab25ac8ae4f0a5b37ed2ce335dd11d5eae05e2009e48ffb5c8f65e9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:52:18.968107Z","signature_b64":"/gO4MF8Dr8gdXeROeCLkEzkbkg7K91GvEPaoyXTfsBjBxNeTA6VFbAY8bWtjHO2q5kRLCipFrSBdKc5QwzOFDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4ce15d09ab25ac8ae4f0a5b37ed2ce335dd11d5eae05e2009e48ffb5c8f65e9","last_reissued_at":"2026-07-05T07:52:18.967629Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:52:18.967629Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2403.02548","source_version":1,"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-05T07:52:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xPBtCQFGLUpSARatXzx9jzAatIYEaKPCYnf/Pq2wZDZTMC2uDImGdcRaDqaglQbk768cnTEnG4kGcehDeIyMDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T20:56:18.428862Z"},"content_sha256":"f1529a9ed85abdaecc2a7379f39fc1bcc2256b1a623a31974054e1476e2edb2f","schema_version":"1.0","event_id":"sha256:f1529a9ed85abdaecc2a7379f39fc1bcc2256b1a623a31974054e1476e2edb2f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:6THBLUE2WJNMRLSPBJNTP3JM4M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The least primary factor of the multiplicative group","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Chau Nguyen, Greg Martin","submitted_at":"2024-03-04T23:58:03Z","abstract_excerpt":"Let $S(n)$ denote the least primary factor in the primary decomposition of the multiplicative group $M_n = (\\Bbb Z/n\\Bbb Z)^\\times$. We give an asymptotic formula, with order of magnitude $x/(\\log x)^{1/2}$, for the counting function of those integers $n$ for which $S(n) \\ne 2$. We also give an asymptotic formula, for any prime power $q$, for the counting function of those integers $n$ for which $S(n) = q$. This group-theoretic problem can be reduced to problems of counting integers with restrictions on their prime factors, allowing it to be addressed by classical techniques of analytic number"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.02548","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2403.02548/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-05T07:52:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cfig5/unJObvIjq33Wr9K/d1NIG0dV3iH+RIz+SZIVzZxbU7W0aI+ca2kRhlDS2p/OWRuEydUGJ6KvXC/3TMBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T20:56:18.429236Z"},"content_sha256":"4af00ebd0d3e8ed30aaa36c54156138daf3b3280d66819ceed4327cf64369e6b","schema_version":"1.0","event_id":"sha256:4af00ebd0d3e8ed30aaa36c54156138daf3b3280d66819ceed4327cf64369e6b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6THBLUE2WJNMRLSPBJNTP3JM4M/bundle.json","state_url":"https://pith.science/pith/6THBLUE2WJNMRLSPBJNTP3JM4M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6THBLUE2WJNMRLSPBJNTP3JM4M/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-07-06T20:56:18Z","links":{"resolver":"https://pith.science/pith/6THBLUE2WJNMRLSPBJNTP3JM4M","bundle":"https://pith.science/pith/6THBLUE2WJNMRLSPBJNTP3JM4M/bundle.json","state":"https://pith.science/pith/6THBLUE2WJNMRLSPBJNTP3JM4M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6THBLUE2WJNMRLSPBJNTP3JM4M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:6THBLUE2WJNMRLSPBJNTP3JM4M","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":"0fadfe1d1f1d12f108296be8e5eee84202191581c26efa120f1871e27a3548ef","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2024-03-04T23:58:03Z","title_canon_sha256":"0f9b9eb308bef06d8b18d54cfcfcf196c62b30f638673c7e67811965a318befe"},"schema_version":"1.0","source":{"id":"2403.02548","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.02548","created_at":"2026-07-05T07:52:18Z"},{"alias_kind":"arxiv_version","alias_value":"2403.02548v1","created_at":"2026-07-05T07:52:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.02548","created_at":"2026-07-05T07:52:18Z"},{"alias_kind":"pith_short_12","alias_value":"6THBLUE2WJNM","created_at":"2026-07-05T07:52:18Z"},{"alias_kind":"pith_short_16","alias_value":"6THBLUE2WJNMRLSP","created_at":"2026-07-05T07:52:18Z"},{"alias_kind":"pith_short_8","alias_value":"6THBLUE2","created_at":"2026-07-05T07:52:18Z"}],"graph_snapshots":[{"event_id":"sha256:4af00ebd0d3e8ed30aaa36c54156138daf3b3280d66819ceed4327cf64369e6b","target":"graph","created_at":"2026-07-05T07:52:18Z","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/2403.02548/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $S(n)$ denote the least primary factor in the primary decomposition of the multiplicative group $M_n = (\\Bbb Z/n\\Bbb Z)^\\times$. We give an asymptotic formula, with order of magnitude $x/(\\log x)^{1/2}$, for the counting function of those integers $n$ for which $S(n) \\ne 2$. We also give an asymptotic formula, for any prime power $q$, for the counting function of those integers $n$ for which $S(n) = q$. This group-theoretic problem can be reduced to problems of counting integers with restrictions on their prime factors, allowing it to be addressed by classical techniques of analytic number","authors_text":"Chau Nguyen, Greg Martin","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2024-03-04T23:58:03Z","title":"The least primary factor of the multiplicative group"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.02548","kind":"arxiv","version":1},"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:f1529a9ed85abdaecc2a7379f39fc1bcc2256b1a623a31974054e1476e2edb2f","target":"record","created_at":"2026-07-05T07:52:18Z","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":"0fadfe1d1f1d12f108296be8e5eee84202191581c26efa120f1871e27a3548ef","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2024-03-04T23:58:03Z","title_canon_sha256":"0f9b9eb308bef06d8b18d54cfcfcf196c62b30f638673c7e67811965a318befe"},"schema_version":"1.0","source":{"id":"2403.02548","kind":"arxiv","version":1}},"canonical_sha256":"f4ce15d09ab25ac8ae4f0a5b37ed2ce335dd11d5eae05e2009e48ffb5c8f65e9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f4ce15d09ab25ac8ae4f0a5b37ed2ce335dd11d5eae05e2009e48ffb5c8f65e9","first_computed_at":"2026-07-05T07:52:18.967629Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:52:18.967629Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/gO4MF8Dr8gdXeROeCLkEzkbkg7K91GvEPaoyXTfsBjBxNeTA6VFbAY8bWtjHO2q5kRLCipFrSBdKc5QwzOFDA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:52:18.968107Z","signed_message":"canonical_sha256_bytes"},"source_id":"2403.02548","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f1529a9ed85abdaecc2a7379f39fc1bcc2256b1a623a31974054e1476e2edb2f","sha256:4af00ebd0d3e8ed30aaa36c54156138daf3b3280d66819ceed4327cf64369e6b"],"state_sha256":"b7a20a38fe5fa1f4123488ee3d4fe0e28ff4db7ce33b6702e7a94e1c0e54ba22"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7exOtaRjPf80dzgWyXgt9H+Mwg+oryqSYC2bgw9x1ncYZ5ykTYaRhPUNYA7Q8Rkk2sP8Uy7qBayTfw40oVkiDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T20:56:18.431140Z","bundle_sha256":"1bb27b306c9b8e004173a82bd8a26daef44c90ea263649ab960fad1be757d1d2"}}