{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2006:SL7GJAGFXPMQYBC75VIUDP66PT","short_pith_number":"pith:SL7GJAGF","canonical_record":{"source":{"id":"math/0611586","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"math.NT","submitted_at":"2006-11-19T22:02:06Z","cross_cats_sorted":["math.CO","math.PR"],"title_canon_sha256":"a8c3125ffadc1c4350e29c3902387955aeec309f7036c23a7c8890429554d720","abstract_canon_sha256":"c2af3b59d7ce61ff339fc4c0cb270db2ec03857eae3a0f4e4597a4fc1b8a2f86"},"schema_version":"1.0"},"canonical_sha256":"92fe6480c5bbd90c045fed5141bfde7ccf5bba63df30ddee4b3572b1fa72c5d9","source":{"kind":"arxiv","id":"math/0611586","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0611586","created_at":"2026-05-18T00:57:44Z"},{"alias_kind":"arxiv_version","alias_value":"math/0611586v3","created_at":"2026-05-18T00:57:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0611586","created_at":"2026-05-18T00:57:44Z"},{"alias_kind":"pith_short_12","alias_value":"SL7GJAGFXPMQ","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_16","alias_value":"SL7GJAGFXPMQYBC7","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_8","alias_value":"SL7GJAGF","created_at":"2026-05-18T12:25:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2006:SL7GJAGFXPMQYBC75VIUDP66PT","target":"record","payload":{"canonical_record":{"source":{"id":"math/0611586","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"math.NT","submitted_at":"2006-11-19T22:02:06Z","cross_cats_sorted":["math.CO","math.PR"],"title_canon_sha256":"a8c3125ffadc1c4350e29c3902387955aeec309f7036c23a7c8890429554d720","abstract_canon_sha256":"c2af3b59d7ce61ff339fc4c0cb270db2ec03857eae3a0f4e4597a4fc1b8a2f86"},"schema_version":"1.0"},"canonical_sha256":"92fe6480c5bbd90c045fed5141bfde7ccf5bba63df30ddee4b3572b1fa72c5d9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:44.876251Z","signature_b64":"tE8eq+eFQCSQAKT3Pnt7rgg+rPgnyyfQ0H/vsJhqOBOw5kRRANq6mdIAEXiiPGvzxG53AMDMfZ0ldgo+xvIbCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92fe6480c5bbd90c045fed5141bfde7ccf5bba63df30ddee4b3572b1fa72c5d9","last_reissued_at":"2026-05-18T00:57:44.875571Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:44.875571Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"math/0611586","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-05-18T00:57:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0Th8IWRo7TvZsvz/yENGXezv6y/ydgwancxEPK8h2eN1M0jCu74GiLLfigjyI8tOBn1Fswma3LVjQhCqeCH2DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T14:35:38.027223Z"},"content_sha256":"56360fd6e19f68f66ea1bbc71d6805dae425158714270c05eb8c3bd03bee53dc","schema_version":"1.0","event_id":"sha256:56360fd6e19f68f66ea1bbc71d6805dae425158714270c05eb8c3bd03bee53dc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2006:SL7GJAGFXPMQYBC75VIUDP66PT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Near Optimal Bounds for Collision in Pollard Rho for Discrete Log","license":"","headline":"","cross_cats":["math.CO","math.PR"],"primary_cat":"math.NT","authors_text":"Jeong Han Kim, Prasad Tetali, Ravi Montenegro","submitted_at":"2006-11-19T22:02:06Z","abstract_excerpt":"We analyze a fairly standard idealization of Pollard's Rho algorithm for finding the discrete logarithm in a cyclic group G. It is found that, with high probability, a collision occurs in $O(\\sqrt{|G|\\log |G| \\log \\log |G|})$ steps, not far from the widely conjectured value of $\\Theta(\\sqrt{|G|})$. This improves upon a recent result of Miller--Venkatesan which showed an upper bound of $O(\\sqrt{|G|}\\log^3 |G|)$. Our proof is based on analyzing an appropriate nonreversible, non-lazy random walk on a discrete cycle of (odd) length |G|, and showing that the mixing time of the corresponding walk is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0611586","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":""},"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:57:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V9pN5tgBBbS1AHoXooLqan9r8JzBPXV0wVjvUlqEr0GfZd1RTy1q1MxaP5xlTfnIT+Lo9S5HljV/P+iE1VZrDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T14:35:38.027606Z"},"content_sha256":"81902e917334733824577f5766bdb733fa99d54179154cd52f30f7ca27ba12ae","schema_version":"1.0","event_id":"sha256:81902e917334733824577f5766bdb733fa99d54179154cd52f30f7ca27ba12ae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SL7GJAGFXPMQYBC75VIUDP66PT/bundle.json","state_url":"https://pith.science/pith/SL7GJAGFXPMQYBC75VIUDP66PT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SL7GJAGFXPMQYBC75VIUDP66PT/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-09T14:35:38Z","links":{"resolver":"https://pith.science/pith/SL7GJAGFXPMQYBC75VIUDP66PT","bundle":"https://pith.science/pith/SL7GJAGFXPMQYBC75VIUDP66PT/bundle.json","state":"https://pith.science/pith/SL7GJAGFXPMQYBC75VIUDP66PT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SL7GJAGFXPMQYBC75VIUDP66PT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:SL7GJAGFXPMQYBC75VIUDP66PT","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":"c2af3b59d7ce61ff339fc4c0cb270db2ec03857eae3a0f4e4597a4fc1b8a2f86","cross_cats_sorted":["math.CO","math.PR"],"license":"","primary_cat":"math.NT","submitted_at":"2006-11-19T22:02:06Z","title_canon_sha256":"a8c3125ffadc1c4350e29c3902387955aeec309f7036c23a7c8890429554d720"},"schema_version":"1.0","source":{"id":"math/0611586","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0611586","created_at":"2026-05-18T00:57:44Z"},{"alias_kind":"arxiv_version","alias_value":"math/0611586v3","created_at":"2026-05-18T00:57:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0611586","created_at":"2026-05-18T00:57:44Z"},{"alias_kind":"pith_short_12","alias_value":"SL7GJAGFXPMQ","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_16","alias_value":"SL7GJAGFXPMQYBC7","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_8","alias_value":"SL7GJAGF","created_at":"2026-05-18T12:25:54Z"}],"graph_snapshots":[{"event_id":"sha256:81902e917334733824577f5766bdb733fa99d54179154cd52f30f7ca27ba12ae","target":"graph","created_at":"2026-05-18T00:57:44Z","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 analyze a fairly standard idealization of Pollard's Rho algorithm for finding the discrete logarithm in a cyclic group G. It is found that, with high probability, a collision occurs in $O(\\sqrt{|G|\\log |G| \\log \\log |G|})$ steps, not far from the widely conjectured value of $\\Theta(\\sqrt{|G|})$. This improves upon a recent result of Miller--Venkatesan which showed an upper bound of $O(\\sqrt{|G|}\\log^3 |G|)$. Our proof is based on analyzing an appropriate nonreversible, non-lazy random walk on a discrete cycle of (odd) length |G|, and showing that the mixing time of the corresponding walk is","authors_text":"Jeong Han Kim, Prasad Tetali, Ravi Montenegro","cross_cats":["math.CO","math.PR"],"headline":"","license":"","primary_cat":"math.NT","submitted_at":"2006-11-19T22:02:06Z","title":"Near Optimal Bounds for Collision in Pollard Rho for Discrete Log"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0611586","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:56360fd6e19f68f66ea1bbc71d6805dae425158714270c05eb8c3bd03bee53dc","target":"record","created_at":"2026-05-18T00:57:44Z","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":"c2af3b59d7ce61ff339fc4c0cb270db2ec03857eae3a0f4e4597a4fc1b8a2f86","cross_cats_sorted":["math.CO","math.PR"],"license":"","primary_cat":"math.NT","submitted_at":"2006-11-19T22:02:06Z","title_canon_sha256":"a8c3125ffadc1c4350e29c3902387955aeec309f7036c23a7c8890429554d720"},"schema_version":"1.0","source":{"id":"math/0611586","kind":"arxiv","version":3}},"canonical_sha256":"92fe6480c5bbd90c045fed5141bfde7ccf5bba63df30ddee4b3572b1fa72c5d9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"92fe6480c5bbd90c045fed5141bfde7ccf5bba63df30ddee4b3572b1fa72c5d9","first_computed_at":"2026-05-18T00:57:44.875571Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:44.875571Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tE8eq+eFQCSQAKT3Pnt7rgg+rPgnyyfQ0H/vsJhqOBOw5kRRANq6mdIAEXiiPGvzxG53AMDMfZ0ldgo+xvIbCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:44.876251Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0611586","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:56360fd6e19f68f66ea1bbc71d6805dae425158714270c05eb8c3bd03bee53dc","sha256:81902e917334733824577f5766bdb733fa99d54179154cd52f30f7ca27ba12ae"],"state_sha256":"7cee3677364852f2b15d3325572367a9d9b16bdd0911736e1568a5572991d19f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YUDc6Qk1V7wQr71Eviq+fcWhhNY+08UprTzTUPNLqOP8vKWn9636dX/fuSsT7VoiREem/RXTkv1FIG0rkZ0ADw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T14:35:38.030010Z","bundle_sha256":"5c3992aec78d87d7bcb95bef267aeab72b01767463744e49f797973ff6037c06"}}