{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ZFMBVGCIPMKHJJ64GNIB42GX3V","short_pith_number":"pith:ZFMBVGCI","schema_version":"1.0","canonical_sha256":"c9581a98487b1474a7dc33501e68d7dd6494cd16321939335fde26efad4cfc66","source":{"kind":"arxiv","id":"1501.07019","version":1},"attestation_state":"computed","paper":{"title":"Kangaroo Methods for Solving the Interval Discrete Logarithm Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.NT","authors_text":"Alex Fowler, Steven Galbraith","submitted_at":"2015-01-28T08:09:23Z","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"},"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":"1501.07019","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2015-01-28T08:09:23Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"6c58bcb3fb68b4e94cccbae9e37b31c90f4fdd8d8415c733379a5bdc2def0e95","abstract_canon_sha256":"6b7c7ccdb1d3fc76f64c1294eb2a7a2d381eef9f2aa0b451d108167c82631c6f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:30.509285Z","signature_b64":"h4aLUnz0mXH1a0nbl7RVEsfT3bXifGfhq92BDVuyB6YKOkF7l8vadFaTMemB6C8pUvg+wCFFFV4PNrtjUgk5CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c9581a98487b1474a7dc33501e68d7dd6494cd16321939335fde26efad4cfc66","last_reissued_at":"2026-05-18T02:28:30.508828Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:30.508828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Kangaroo Methods for Solving the Interval Discrete Logarithm Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.NT","authors_text":"Alex Fowler, Steven Galbraith","submitted_at":"2015-01-28T08:09:23Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.07019","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1501.07019","created_at":"2026-05-18T02:28:30.508897+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.07019v1","created_at":"2026-05-18T02:28:30.508897+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.07019","created_at":"2026-05-18T02:28:30.508897+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZFMBVGCIPMKH","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZFMBVGCIPMKHJJ64","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZFMBVGCI","created_at":"2026-05-18T12:29:52.810259+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/ZFMBVGCIPMKHJJ64GNIB42GX3V","json":"https://pith.science/pith/ZFMBVGCIPMKHJJ64GNIB42GX3V.json","graph_json":"https://pith.science/api/pith-number/ZFMBVGCIPMKHJJ64GNIB42GX3V/graph.json","events_json":"https://pith.science/api/pith-number/ZFMBVGCIPMKHJJ64GNIB42GX3V/events.json","paper":"https://pith.science/paper/ZFMBVGCI"},"agent_actions":{"view_html":"https://pith.science/pith/ZFMBVGCIPMKHJJ64GNIB42GX3V","download_json":"https://pith.science/pith/ZFMBVGCIPMKHJJ64GNIB42GX3V.json","view_paper":"https://pith.science/paper/ZFMBVGCI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.07019&json=true","fetch_graph":"https://pith.science/api/pith-number/ZFMBVGCIPMKHJJ64GNIB42GX3V/graph.json","fetch_events":"https://pith.science/api/pith-number/ZFMBVGCIPMKHJJ64GNIB42GX3V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZFMBVGCIPMKHJJ64GNIB42GX3V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZFMBVGCIPMKHJJ64GNIB42GX3V/action/storage_attestation","attest_author":"https://pith.science/pith/ZFMBVGCIPMKHJJ64GNIB42GX3V/action/author_attestation","sign_citation":"https://pith.science/pith/ZFMBVGCIPMKHJJ64GNIB42GX3V/action/citation_signature","submit_replication":"https://pith.science/pith/ZFMBVGCIPMKHJJ64GNIB42GX3V/action/replication_record"}},"created_at":"2026-05-18T02:28:30.508897+00:00","updated_at":"2026-05-18T02:28:30.508897+00:00"}