{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:GIVNTODVCZNAKG4IKBQFOP6VGS","short_pith_number":"pith:GIVNTODV","schema_version":"1.0","canonical_sha256":"322ad9b875165a051b885060573fd5348178fba654fec5339806e9e2b6a13b80","source":{"kind":"arxiv","id":"1608.05898","version":1},"attestation_state":"computed","paper":{"title":"Random multiplicative walks on the residues modulo n","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DS"],"primary_cat":"math.NT","authors_text":"Nathan McNew","submitted_at":"2016-08-21T04:58:06Z","abstract_excerpt":"We introduce a new arithmetic function $a(n)$ defined to be the number of random multiplications by residues modulo $n$ before the running product is congruent to 0 modulo $n$. We give several formulas for computing the values of this function and analyze its asymptotic behavior. We find that it is closely related to $P_1(n)$, the largest prime divisor of $n$. In particular, $a(n)$ and $P_1(n)$ have the same average order asymptotically. Furthermore, the difference between the functions $a(n)$ and $P_1(n)$ is $o(1)$ as $n$ tends to infinity on a set with density approximately $0.623$. On the o"},"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":"1608.05898","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-08-21T04:58:06Z","cross_cats_sorted":["math.DS"],"title_canon_sha256":"fbb082d33107544bcdc0ddec68597b2115239b3a93307471af2078ba8e5dffd3","abstract_canon_sha256":"e0dc3059e095c49478671f0fde8c75548d763167c31c7498da987c7c5b4d20b6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:24.479943Z","signature_b64":"XXjgDBB9MBIowPwFLBXijxh6+RtoEgd8R3yI4+YcYi3h54hqBIcemlxdQB3724tzxfLSkDTCRhWOn7aooEtOCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"322ad9b875165a051b885060573fd5348178fba654fec5339806e9e2b6a13b80","last_reissued_at":"2026-05-18T00:44:24.479270Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:24.479270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Random multiplicative walks on the residues modulo n","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DS"],"primary_cat":"math.NT","authors_text":"Nathan McNew","submitted_at":"2016-08-21T04:58:06Z","abstract_excerpt":"We introduce a new arithmetic function $a(n)$ defined to be the number of random multiplications by residues modulo $n$ before the running product is congruent to 0 modulo $n$. We give several formulas for computing the values of this function and analyze its asymptotic behavior. We find that it is closely related to $P_1(n)$, the largest prime divisor of $n$. In particular, $a(n)$ and $P_1(n)$ have the same average order asymptotically. Furthermore, the difference between the functions $a(n)$ and $P_1(n)$ is $o(1)$ as $n$ tends to infinity on a set with density approximately $0.623$. On the o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.05898","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":""},"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":"1608.05898","created_at":"2026-05-18T00:44:24.479414+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.05898v1","created_at":"2026-05-18T00:44:24.479414+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.05898","created_at":"2026-05-18T00:44:24.479414+00:00"},{"alias_kind":"pith_short_12","alias_value":"GIVNTODVCZNA","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"GIVNTODVCZNAKG4I","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"GIVNTODV","created_at":"2026-05-18T12:30:19.053100+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/GIVNTODVCZNAKG4IKBQFOP6VGS","json":"https://pith.science/pith/GIVNTODVCZNAKG4IKBQFOP6VGS.json","graph_json":"https://pith.science/api/pith-number/GIVNTODVCZNAKG4IKBQFOP6VGS/graph.json","events_json":"https://pith.science/api/pith-number/GIVNTODVCZNAKG4IKBQFOP6VGS/events.json","paper":"https://pith.science/paper/GIVNTODV"},"agent_actions":{"view_html":"https://pith.science/pith/GIVNTODVCZNAKG4IKBQFOP6VGS","download_json":"https://pith.science/pith/GIVNTODVCZNAKG4IKBQFOP6VGS.json","view_paper":"https://pith.science/paper/GIVNTODV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.05898&json=true","fetch_graph":"https://pith.science/api/pith-number/GIVNTODVCZNAKG4IKBQFOP6VGS/graph.json","fetch_events":"https://pith.science/api/pith-number/GIVNTODVCZNAKG4IKBQFOP6VGS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GIVNTODVCZNAKG4IKBQFOP6VGS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GIVNTODVCZNAKG4IKBQFOP6VGS/action/storage_attestation","attest_author":"https://pith.science/pith/GIVNTODVCZNAKG4IKBQFOP6VGS/action/author_attestation","sign_citation":"https://pith.science/pith/GIVNTODVCZNAKG4IKBQFOP6VGS/action/citation_signature","submit_replication":"https://pith.science/pith/GIVNTODVCZNAKG4IKBQFOP6VGS/action/replication_record"}},"created_at":"2026-05-18T00:44:24.479414+00:00","updated_at":"2026-05-18T00:44:24.479414+00:00"}