{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:DV56HILPEZH5WQY7GXPXDMSKGF","short_pith_number":"pith:DV56HILP","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"},"canonical_sha256":"1d7be3a16f264fdb431f35df71b24a316859d96fb3673a9ab27099ff5e230961","source":{"kind":"arxiv","id":"0712.0220","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0712.0220","created_at":"2026-05-18T01:05:13Z"},{"alias_kind":"arxiv_version","alias_value":"0712.0220v2","created_at":"2026-05-18T01:05:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0712.0220","created_at":"2026-05-18T01:05:13Z"},{"alias_kind":"pith_short_12","alias_value":"DV56HILPEZH5","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"DV56HILPEZH5WQY7","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"DV56HILP","created_at":"2026-05-18T12:25:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:DV56HILPEZH5WQY7GXPXDMSKGF","target":"record","payload":{"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"},"canonical_sha256":"1d7be3a16f264fdb431f35df71b24a316859d96fb3673a9ab27099ff5e230961","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"},"source_kind":"arxiv","source_id":"0712.0220","source_version":2,"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-18T01:05:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dgCKVyjrNJdgBQoZiZcDHzH2ZIz7Zbs6eI7GhiGotIf6xd2Qj6Qcr+wIduHpcKJ+w3HrIOsR5aYvd4Z2dZDSAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T18:09:31.105135Z"},"content_sha256":"76036d0c92a73ce8b2bad8dc918248bd560c481b200a1891c1dd194e7ae4de53","schema_version":"1.0","event_id":"sha256:76036d0c92a73ce8b2bad8dc918248bd560c481b200a1891c1dd194e7ae4de53"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:DV56HILPEZH5WQY7GXPXDMSKGF","target":"graph","payload":{"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"},"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-18T01:05:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FDc79Fghc1tpMsQ6ILsJEeYp9W6hhGVjJ/guebDC+BwvCb3uuDF+XpVNY6r7qFEyC7Ourfs46aTZ+E1dBe5YBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T18:09:31.105843Z"},"content_sha256":"174af137803a7944f1602702f9120c07fa7912c18dbebd77f06abc7bb47e836f","schema_version":"1.0","event_id":"sha256:174af137803a7944f1602702f9120c07fa7912c18dbebd77f06abc7bb47e836f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DV56HILPEZH5WQY7GXPXDMSKGF/bundle.json","state_url":"https://pith.science/pith/DV56HILPEZH5WQY7GXPXDMSKGF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DV56HILPEZH5WQY7GXPXDMSKGF/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-09T18:09:31Z","links":{"resolver":"https://pith.science/pith/DV56HILPEZH5WQY7GXPXDMSKGF","bundle":"https://pith.science/pith/DV56HILPEZH5WQY7GXPXDMSKGF/bundle.json","state":"https://pith.science/pith/DV56HILPEZH5WQY7GXPXDMSKGF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DV56HILPEZH5WQY7GXPXDMSKGF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:DV56HILPEZH5WQY7GXPXDMSKGF","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":"9648beebf7a37683fdc3e8e7c68053c65128ef23688c57d88cf91841916b6db3","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2007-12-03T07:16:00Z","title_canon_sha256":"05f0d8b03f2b22d0dba680fa8261eabfef7ca65e5822154a279d4262e750bb43"},"schema_version":"1.0","source":{"id":"0712.0220","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0712.0220","created_at":"2026-05-18T01:05:13Z"},{"alias_kind":"arxiv_version","alias_value":"0712.0220v2","created_at":"2026-05-18T01:05:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0712.0220","created_at":"2026-05-18T01:05:13Z"},{"alias_kind":"pith_short_12","alias_value":"DV56HILPEZH5","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"DV56HILPEZH5WQY7","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"DV56HILP","created_at":"2026-05-18T12:25:55Z"}],"graph_snapshots":[{"event_id":"sha256:174af137803a7944f1602702f9120c07fa7912c18dbebd77f06abc7bb47e836f","target":"graph","created_at":"2026-05-18T01:05:13Z","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 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 ","authors_text":"Jeong Han Kim, Prasad Tetali, Ravi Montenegro, Yuval Peres","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2007-12-03T07:16:00Z","title":"A Birthday Paradox for Markov chains with an optimal bound for collision in the Pollard Rho algorithm for discrete logarithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0712.0220","kind":"arxiv","version":2},"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:76036d0c92a73ce8b2bad8dc918248bd560c481b200a1891c1dd194e7ae4de53","target":"record","created_at":"2026-05-18T01:05:13Z","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":"9648beebf7a37683fdc3e8e7c68053c65128ef23688c57d88cf91841916b6db3","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2007-12-03T07:16:00Z","title_canon_sha256":"05f0d8b03f2b22d0dba680fa8261eabfef7ca65e5822154a279d4262e750bb43"},"schema_version":"1.0","source":{"id":"0712.0220","kind":"arxiv","version":2}},"canonical_sha256":"1d7be3a16f264fdb431f35df71b24a316859d96fb3673a9ab27099ff5e230961","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1d7be3a16f264fdb431f35df71b24a316859d96fb3673a9ab27099ff5e230961","first_computed_at":"2026-05-18T01:05:13.912370Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:05:13.912370Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0qxUKLuVvCblJFUkVWwf9rvEeR8RprrPTI/rmTK9MrwXPYSGHZiFW1Ifpy9/RUXp9OE0xaLuo5cZOJZ9TtMxAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:05:13.912924Z","signed_message":"canonical_sha256_bytes"},"source_id":"0712.0220","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:76036d0c92a73ce8b2bad8dc918248bd560c481b200a1891c1dd194e7ae4de53","sha256:174af137803a7944f1602702f9120c07fa7912c18dbebd77f06abc7bb47e836f"],"state_sha256":"08f9e4a79a520c0f98740ca279e37bb1cca4ded834885a6d427e6fbcbf0636d4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lCnHS5h6j69AOKRS/+aAGdet+KXlxeai/74O5T16TGbwfHVOXAnOc4r2JC3JY2DhvDjeLI7LK9wfXmtMBHl3Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T18:09:31.109894Z","bundle_sha256":"d53cbf9067d641f35aec365886c94f5937c789c91ec7d96f4ecb39c8a0b3b6f8"}}