{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:DV56HILPEZH5WQY7GXPXDMSKGF","short_pith_number":"pith:DV56HILP","schema_version":"1.0","canonical_sha256":"1d7be3a16f264fdb431f35df71b24a316859d96fb3673a9ab27099ff5e230961","source":{"kind":"arxiv","id":"0712.0220","version":2},"attestation_state":"computed","paper":{"title":"A Birthday Paradox for Markov chains with an optimal bound for collision in the Pollard Rho algorithm for discrete logarithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Jeong Han Kim, Prasad Tetali, Ravi Montenegro, Yuval Peres","submitted_at":"2007-12-03T07:16:00Z","abstract_excerpt":"We show a Birthday Paradox for self-intersections of Markov chains with uniform stationary distribution. As an application, we analyze Pollard's Rho algorithm for finding the discrete logarithm in a cyclic group $G$ and find that if the partition in the algorithm is given by a random oracle, then with high probability a collision occurs in $\\Theta(\\sqrt{|G|})$ steps. Moreover, for the parallelized distinguished points algorithm on $J$ processors we find that $\\Theta(\\sqrt{|G|}/J)$ steps suffices. These are the first proofs of the correct order bounds which do not assume that every step of the "},"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":"0712.0220","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2007-12-03T07:16:00Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"05f0d8b03f2b22d0dba680fa8261eabfef7ca65e5822154a279d4262e750bb43","abstract_canon_sha256":"9648beebf7a37683fdc3e8e7c68053c65128ef23688c57d88cf91841916b6db3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:13.912924Z","signature_b64":"0qxUKLuVvCblJFUkVWwf9rvEeR8RprrPTI/rmTK9MrwXPYSGHZiFW1Ifpy9/RUXp9OE0xaLuo5cZOJZ9TtMxAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d7be3a16f264fdb431f35df71b24a316859d96fb3673a9ab27099ff5e230961","last_reissued_at":"2026-05-18T01:05:13.912370Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:13.912370Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Birthday Paradox for Markov chains with an optimal bound for collision in the Pollard Rho algorithm for discrete logarithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Jeong Han Kim, Prasad Tetali, Ravi Montenegro, Yuval Peres","submitted_at":"2007-12-03T07:16:00Z","abstract_excerpt":"We show a Birthday Paradox for self-intersections of Markov chains with uniform stationary distribution. As an application, we analyze Pollard's Rho algorithm for finding the discrete logarithm in a cyclic group $G$ and find that if the partition in the algorithm is given by a random oracle, then with high probability a collision occurs in $\\Theta(\\sqrt{|G|})$ steps. Moreover, for the parallelized distinguished points algorithm on $J$ processors we find that $\\Theta(\\sqrt{|G|}/J)$ steps suffices. These are the first proofs of the correct order bounds which do not assume that every step of the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0712.0220","kind":"arxiv","version":2},"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":"0712.0220","created_at":"2026-05-18T01:05:13.912452+00:00"},{"alias_kind":"arxiv_version","alias_value":"0712.0220v2","created_at":"2026-05-18T01:05:13.912452+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0712.0220","created_at":"2026-05-18T01:05:13.912452+00:00"},{"alias_kind":"pith_short_12","alias_value":"DV56HILPEZH5","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_16","alias_value":"DV56HILPEZH5WQY7","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_8","alias_value":"DV56HILP","created_at":"2026-05-18T12:25:55.427421+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/DV56HILPEZH5WQY7GXPXDMSKGF","json":"https://pith.science/pith/DV56HILPEZH5WQY7GXPXDMSKGF.json","graph_json":"https://pith.science/api/pith-number/DV56HILPEZH5WQY7GXPXDMSKGF/graph.json","events_json":"https://pith.science/api/pith-number/DV56HILPEZH5WQY7GXPXDMSKGF/events.json","paper":"https://pith.science/paper/DV56HILP"},"agent_actions":{"view_html":"https://pith.science/pith/DV56HILPEZH5WQY7GXPXDMSKGF","download_json":"https://pith.science/pith/DV56HILPEZH5WQY7GXPXDMSKGF.json","view_paper":"https://pith.science/paper/DV56HILP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0712.0220&json=true","fetch_graph":"https://pith.science/api/pith-number/DV56HILPEZH5WQY7GXPXDMSKGF/graph.json","fetch_events":"https://pith.science/api/pith-number/DV56HILPEZH5WQY7GXPXDMSKGF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DV56HILPEZH5WQY7GXPXDMSKGF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DV56HILPEZH5WQY7GXPXDMSKGF/action/storage_attestation","attest_author":"https://pith.science/pith/DV56HILPEZH5WQY7GXPXDMSKGF/action/author_attestation","sign_citation":"https://pith.science/pith/DV56HILPEZH5WQY7GXPXDMSKGF/action/citation_signature","submit_replication":"https://pith.science/pith/DV56HILPEZH5WQY7GXPXDMSKGF/action/replication_record"}},"created_at":"2026-05-18T01:05:13.912452+00:00","updated_at":"2026-05-18T01:05:13.912452+00:00"}