{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:GIVNTODVCZNAKG4IKBQFOP6VGS","short_pith_number":"pith:GIVNTODV","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"},"canonical_sha256":"322ad9b875165a051b885060573fd5348178fba654fec5339806e9e2b6a13b80","source":{"kind":"arxiv","id":"1608.05898","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.05898","created_at":"2026-05-18T00:44:24Z"},{"alias_kind":"arxiv_version","alias_value":"1608.05898v1","created_at":"2026-05-18T00:44:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.05898","created_at":"2026-05-18T00:44:24Z"},{"alias_kind":"pith_short_12","alias_value":"GIVNTODVCZNA","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GIVNTODVCZNAKG4I","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GIVNTODV","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:GIVNTODVCZNAKG4IKBQFOP6VGS","target":"record","payload":{"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"},"canonical_sha256":"322ad9b875165a051b885060573fd5348178fba654fec5339806e9e2b6a13b80","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"},"source_kind":"arxiv","source_id":"1608.05898","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-05-18T00:44:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9la6RkWuL6Thnqu6UR92XU+F6Ya2dwVMS4FVeTIorfGvetNdZGllIC1aj5qIKxphhBklOVjnc/cXwFn1jld0Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:53:09.431076Z"},"content_sha256":"2691f7aef85b063cde9c19933a159f9af32975422c3fe52a9a848f1c9d068b58","schema_version":"1.0","event_id":"sha256:2691f7aef85b063cde9c19933a159f9af32975422c3fe52a9a848f1c9d068b58"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:GIVNTODVCZNAKG4IKBQFOP6VGS","target":"graph","payload":{"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"},"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-05-18T00:44:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BsE4VyK9oF1dQ5CORCWkf6ofmzDaaplrqse8ahXtGl2hlUhsgNYzsiTb/1n23IZkS6ByN7Rem68VtclTlsUjAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:53:09.431486Z"},"content_sha256":"22bf4adb2423f1cb011709aef9fb910fb5c7df7bace22967e7456a0dea5f1de5","schema_version":"1.0","event_id":"sha256:22bf4adb2423f1cb011709aef9fb910fb5c7df7bace22967e7456a0dea5f1de5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GIVNTODVCZNAKG4IKBQFOP6VGS/bundle.json","state_url":"https://pith.science/pith/GIVNTODVCZNAKG4IKBQFOP6VGS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GIVNTODVCZNAKG4IKBQFOP6VGS/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-06-02T07:53:09Z","links":{"resolver":"https://pith.science/pith/GIVNTODVCZNAKG4IKBQFOP6VGS","bundle":"https://pith.science/pith/GIVNTODVCZNAKG4IKBQFOP6VGS/bundle.json","state":"https://pith.science/pith/GIVNTODVCZNAKG4IKBQFOP6VGS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GIVNTODVCZNAKG4IKBQFOP6VGS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:GIVNTODVCZNAKG4IKBQFOP6VGS","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":"e0dc3059e095c49478671f0fde8c75548d763167c31c7498da987c7c5b4d20b6","cross_cats_sorted":["math.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-08-21T04:58:06Z","title_canon_sha256":"fbb082d33107544bcdc0ddec68597b2115239b3a93307471af2078ba8e5dffd3"},"schema_version":"1.0","source":{"id":"1608.05898","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.05898","created_at":"2026-05-18T00:44:24Z"},{"alias_kind":"arxiv_version","alias_value":"1608.05898v1","created_at":"2026-05-18T00:44:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.05898","created_at":"2026-05-18T00:44:24Z"},{"alias_kind":"pith_short_12","alias_value":"GIVNTODVCZNA","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GIVNTODVCZNAKG4I","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GIVNTODV","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:22bf4adb2423f1cb011709aef9fb910fb5c7df7bace22967e7456a0dea5f1de5","target":"graph","created_at":"2026-05-18T00:44:24Z","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"},"paper":{"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","authors_text":"Nathan McNew","cross_cats":["math.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-08-21T04:58:06Z","title":"Random multiplicative walks on the residues modulo n"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.05898","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:2691f7aef85b063cde9c19933a159f9af32975422c3fe52a9a848f1c9d068b58","target":"record","created_at":"2026-05-18T00:44:24Z","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":"e0dc3059e095c49478671f0fde8c75548d763167c31c7498da987c7c5b4d20b6","cross_cats_sorted":["math.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-08-21T04:58:06Z","title_canon_sha256":"fbb082d33107544bcdc0ddec68597b2115239b3a93307471af2078ba8e5dffd3"},"schema_version":"1.0","source":{"id":"1608.05898","kind":"arxiv","version":1}},"canonical_sha256":"322ad9b875165a051b885060573fd5348178fba654fec5339806e9e2b6a13b80","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"322ad9b875165a051b885060573fd5348178fba654fec5339806e9e2b6a13b80","first_computed_at":"2026-05-18T00:44:24.479270Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:24.479270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XXjgDBB9MBIowPwFLBXijxh6+RtoEgd8R3yI4+YcYi3h54hqBIcemlxdQB3724tzxfLSkDTCRhWOn7aooEtOCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:24.479943Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.05898","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2691f7aef85b063cde9c19933a159f9af32975422c3fe52a9a848f1c9d068b58","sha256:22bf4adb2423f1cb011709aef9fb910fb5c7df7bace22967e7456a0dea5f1de5"],"state_sha256":"82bf7605100b981115d50e2f30ce78d3d33829d823cbad7cd2822a5569afe735"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"75ZTAxTDF59pR027ZKe32OjPi0GqqfqgDYs//NgSf300U29ObBbzisQ8o8qvW6m/DTe5Tdfqwg59pijoGBwKAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T07:53:09.433390Z","bundle_sha256":"fc53ae1fe67519a0da086efd4bc441c3801a4466ef2274d5b271e63760518502"}}