{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:6THBLUE2WJNMRLSPBJNTP3JM4M","short_pith_number":"pith:6THBLUE2","schema_version":"1.0","canonical_sha256":"f4ce15d09ab25ac8ae4f0a5b37ed2ce335dd11d5eae05e2009e48ffb5c8f65e9","source":{"kind":"arxiv","id":"2403.02548","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2403.02548","created_at":"2026-07-05T07:52:18.967687+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.02548v1","created_at":"2026-07-05T07:52:18.967687+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.02548","created_at":"2026-07-05T07:52:18.967687+00:00"},{"alias_kind":"pith_short_12","alias_value":"6THBLUE2WJNM","created_at":"2026-07-05T07:52:18.967687+00:00"},{"alias_kind":"pith_short_16","alias_value":"6THBLUE2WJNMRLSP","created_at":"2026-07-05T07:52:18.967687+00:00"},{"alias_kind":"pith_short_8","alias_value":"6THBLUE2","created_at":"2026-07-05T07:52:18.967687+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/6THBLUE2WJNMRLSPBJNTP3JM4M","json":"https://pith.science/pith/6THBLUE2WJNMRLSPBJNTP3JM4M.json","graph_json":"https://pith.science/api/pith-number/6THBLUE2WJNMRLSPBJNTP3JM4M/graph.json","events_json":"https://pith.science/api/pith-number/6THBLUE2WJNMRLSPBJNTP3JM4M/events.json","paper":"https://pith.science/paper/6THBLUE2"},"agent_actions":{"view_html":"https://pith.science/pith/6THBLUE2WJNMRLSPBJNTP3JM4M","download_json":"https://pith.science/pith/6THBLUE2WJNMRLSPBJNTP3JM4M.json","view_paper":"https://pith.science/paper/6THBLUE2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.02548&json=true","fetch_graph":"https://pith.science/api/pith-number/6THBLUE2WJNMRLSPBJNTP3JM4M/graph.json","fetch_events":"https://pith.science/api/pith-number/6THBLUE2WJNMRLSPBJNTP3JM4M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6THBLUE2WJNMRLSPBJNTP3JM4M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6THBLUE2WJNMRLSPBJNTP3JM4M/action/storage_attestation","attest_author":"https://pith.science/pith/6THBLUE2WJNMRLSPBJNTP3JM4M/action/author_attestation","sign_citation":"https://pith.science/pith/6THBLUE2WJNMRLSPBJNTP3JM4M/action/citation_signature","submit_replication":"https://pith.science/pith/6THBLUE2WJNMRLSPBJNTP3JM4M/action/replication_record"}},"created_at":"2026-07-05T07:52:18.967687+00:00","updated_at":"2026-07-05T07:52:18.967687+00:00"}