{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ZFMBVGCIPMKHJJ64GNIB42GX3V","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":"6b7c7ccdb1d3fc76f64c1294eb2a7a2d381eef9f2aa0b451d108167c82631c6f","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2015-01-28T08:09:23Z","title_canon_sha256":"6c58bcb3fb68b4e94cccbae9e37b31c90f4fdd8d8415c733379a5bdc2def0e95"},"schema_version":"1.0","source":{"id":"1501.07019","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.07019","created_at":"2026-05-18T02:28:30Z"},{"alias_kind":"arxiv_version","alias_value":"1501.07019v1","created_at":"2026-05-18T02:28:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.07019","created_at":"2026-05-18T02:28:30Z"},{"alias_kind":"pith_short_12","alias_value":"ZFMBVGCIPMKH","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZFMBVGCIPMKHJJ64","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZFMBVGCI","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:65c058bf401e8d651006c3d5e8430c9ee1de5d83b2ef6fb18784dbaf48fab5e8","target":"graph","created_at":"2026-05-18T02:28:30Z","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":"The interval discrete logarithm problem is defined as follows: Given some $g,h$ in a group $G$, and some $N \\in \\mathbb{N}$ such that $g^z=h$ for some $z$ where $0 \\leq z < N$, find $z$.\nAt the moment, kangaroo methods are the best low memory algorithm to solve the interval discrete logarithm problem. The fastest non parallelised kangaroo methods to solve this problem are the three kangaroo method, and the four kangaroo method. These respectively have expected average running times of $\\big(1.818+o(1)\\big)\\sqrt{N}$, and $\\big(1.714 + o(1)\\big)\\sqrt{N}$ group operations.\nIt is currently an open","authors_text":"Alex Fowler, Steven Galbraith","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2015-01-28T08:09:23Z","title":"Kangaroo Methods for Solving the Interval Discrete Logarithm Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.07019","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:5f055a7a36daaa15cc51e45007100ac86bd06fb2bc5c59fcdbdb5aa48c41f2ef","target":"record","created_at":"2026-05-18T02:28:30Z","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":"6b7c7ccdb1d3fc76f64c1294eb2a7a2d381eef9f2aa0b451d108167c82631c6f","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2015-01-28T08:09:23Z","title_canon_sha256":"6c58bcb3fb68b4e94cccbae9e37b31c90f4fdd8d8415c733379a5bdc2def0e95"},"schema_version":"1.0","source":{"id":"1501.07019","kind":"arxiv","version":1}},"canonical_sha256":"c9581a98487b1474a7dc33501e68d7dd6494cd16321939335fde26efad4cfc66","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c9581a98487b1474a7dc33501e68d7dd6494cd16321939335fde26efad4cfc66","first_computed_at":"2026-05-18T02:28:30.508828Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:28:30.508828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h4aLUnz0mXH1a0nbl7RVEsfT3bXifGfhq92BDVuyB6YKOkF7l8vadFaTMemB6C8pUvg+wCFFFV4PNrtjUgk5CA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:28:30.509285Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.07019","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5f055a7a36daaa15cc51e45007100ac86bd06fb2bc5c59fcdbdb5aa48c41f2ef","sha256:65c058bf401e8d651006c3d5e8430c9ee1de5d83b2ef6fb18784dbaf48fab5e8"],"state_sha256":"f7c961488a0291d509bcc02712f154fc6b4f548b8b144180348a9e3c12ab7f4a"}