{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2004:DOHWGYTVIAZ4KOFL36GAO6H2RQ","short_pith_number":"pith:DOHWGYTV","canonical_record":{"source":{"id":"math/0411378","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"math.NT","submitted_at":"2004-11-17T17:50:05Z","cross_cats_sorted":["cs.CC","cs.CR","math.AG","math.CO"],"title_canon_sha256":"714ff3e3a1af04cad4c3a4cb9abdf96eae062e442e888ef7e32ec753f436fe74","abstract_canon_sha256":"b876353d13e3b10d5c75c3793c362ec01eab9f3e6b74d78cc632b0bf9c34e834"},"schema_version":"1.0"},"canonical_sha256":"1b8f6362754033c538abdf8c0778fa8c34fd088988bc599db33d315142bffa5a","source":{"kind":"arxiv","id":"math/0411378","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0411378","created_at":"2026-05-18T01:05:25Z"},{"alias_kind":"arxiv_version","alias_value":"math/0411378v3","created_at":"2026-05-18T01:05:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0411378","created_at":"2026-05-18T01:05:25Z"},{"alias_kind":"pith_short_12","alias_value":"DOHWGYTVIAZ4","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_16","alias_value":"DOHWGYTVIAZ4KOFL","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_8","alias_value":"DOHWGYTV","created_at":"2026-05-18T12:25:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2004:DOHWGYTVIAZ4KOFL36GAO6H2RQ","target":"record","payload":{"canonical_record":{"source":{"id":"math/0411378","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"math.NT","submitted_at":"2004-11-17T17:50:05Z","cross_cats_sorted":["cs.CC","cs.CR","math.AG","math.CO"],"title_canon_sha256":"714ff3e3a1af04cad4c3a4cb9abdf96eae062e442e888ef7e32ec753f436fe74","abstract_canon_sha256":"b876353d13e3b10d5c75c3793c362ec01eab9f3e6b74d78cc632b0bf9c34e834"},"schema_version":"1.0"},"canonical_sha256":"1b8f6362754033c538abdf8c0778fa8c34fd088988bc599db33d315142bffa5a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:25.629908Z","signature_b64":"jZ1rDB8GE8NxrkRc8x+JMhIAwC+V6T62xqxM0bwvrXnk1T/O6LgtMEnvmCsTZPvZcATpvZLQIKvFsUo1yU6zDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b8f6362754033c538abdf8c0778fa8c34fd088988bc599db33d315142bffa5a","last_reissued_at":"2026-05-18T01:05:25.629353Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:25.629353Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"math/0411378","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-18T01:05:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yPojJs0mnzBs1I+dwmTMRTY/WM1/uAR9mzrH0QWE/bZs9IqAk8KmeQ5lRC5UevxkVE/JcmW/XbMtcf9Hk7LPAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T18:06:07.962576Z"},"content_sha256":"3a437f3ae5bd625fd864f4ac93f5e715f3f97a8fef0bd737bb4849e59804f9a6","schema_version":"1.0","event_id":"sha256:3a437f3ae5bd625fd864f4ac93f5e715f3f97a8fef0bd737bb4849e59804f9a6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2004:DOHWGYTVIAZ4KOFL36GAO6H2RQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Do All Elliptic Curves of the Same Order Have the Same Difficulty of Discrete Log?","license":"","headline":"","cross_cats":["cs.CC","cs.CR","math.AG","math.CO"],"primary_cat":"math.NT","authors_text":"David Jao, Ramarathnam Venkatesan, Stephen D. Miller","submitted_at":"2004-11-17T17:50:05Z","abstract_excerpt":"The aim of this paper is to justify the common cryptographic practice of selecting elliptic curves using their order as the primary criterion. We can formalize this issue by asking whether the discrete log problem (DLOG) has the same difficulty for all curves over a given finite field with the same order. We prove that this is essentially true by showing polynomial time random reducibility of DLOG among such curves, assuming the Generalized Riemann Hypothesis (GRH). We do so by constructing certain expander graphs, similar to Ramanujan graphs, with elliptic curves as nodes and low degree isoge"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0411378","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-18T01:05:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QRjfaM8XSgBd/Nvw0Pogl4ZFrqyZNW9wimSt4mHYOq6EQzcpfSYa3HZudrT4xhG5CzIX/O1QlyTugCuihCioCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T18:06:07.962924Z"},"content_sha256":"dc85c959e0b8c13d704394373194ba8860eda18c37ff29167a6c34d3a571d674","schema_version":"1.0","event_id":"sha256:dc85c959e0b8c13d704394373194ba8860eda18c37ff29167a6c34d3a571d674"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DOHWGYTVIAZ4KOFL36GAO6H2RQ/bundle.json","state_url":"https://pith.science/pith/DOHWGYTVIAZ4KOFL36GAO6H2RQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DOHWGYTVIAZ4KOFL36GAO6H2RQ/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-03T18:06:07Z","links":{"resolver":"https://pith.science/pith/DOHWGYTVIAZ4KOFL36GAO6H2RQ","bundle":"https://pith.science/pith/DOHWGYTVIAZ4KOFL36GAO6H2RQ/bundle.json","state":"https://pith.science/pith/DOHWGYTVIAZ4KOFL36GAO6H2RQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DOHWGYTVIAZ4KOFL36GAO6H2RQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2004:DOHWGYTVIAZ4KOFL36GAO6H2RQ","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":"b876353d13e3b10d5c75c3793c362ec01eab9f3e6b74d78cc632b0bf9c34e834","cross_cats_sorted":["cs.CC","cs.CR","math.AG","math.CO"],"license":"","primary_cat":"math.NT","submitted_at":"2004-11-17T17:50:05Z","title_canon_sha256":"714ff3e3a1af04cad4c3a4cb9abdf96eae062e442e888ef7e32ec753f436fe74"},"schema_version":"1.0","source":{"id":"math/0411378","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0411378","created_at":"2026-05-18T01:05:25Z"},{"alias_kind":"arxiv_version","alias_value":"math/0411378v3","created_at":"2026-05-18T01:05:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0411378","created_at":"2026-05-18T01:05:25Z"},{"alias_kind":"pith_short_12","alias_value":"DOHWGYTVIAZ4","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_16","alias_value":"DOHWGYTVIAZ4KOFL","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_8","alias_value":"DOHWGYTV","created_at":"2026-05-18T12:25:52Z"}],"graph_snapshots":[{"event_id":"sha256:dc85c959e0b8c13d704394373194ba8860eda18c37ff29167a6c34d3a571d674","target":"graph","created_at":"2026-05-18T01:05:25Z","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 aim of this paper is to justify the common cryptographic practice of selecting elliptic curves using their order as the primary criterion. We can formalize this issue by asking whether the discrete log problem (DLOG) has the same difficulty for all curves over a given finite field with the same order. We prove that this is essentially true by showing polynomial time random reducibility of DLOG among such curves, assuming the Generalized Riemann Hypothesis (GRH). We do so by constructing certain expander graphs, similar to Ramanujan graphs, with elliptic curves as nodes and low degree isoge","authors_text":"David Jao, Ramarathnam Venkatesan, Stephen D. Miller","cross_cats":["cs.CC","cs.CR","math.AG","math.CO"],"headline":"","license":"","primary_cat":"math.NT","submitted_at":"2004-11-17T17:50:05Z","title":"Do All Elliptic Curves of the Same Order Have the Same Difficulty of Discrete Log?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0411378","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:3a437f3ae5bd625fd864f4ac93f5e715f3f97a8fef0bd737bb4849e59804f9a6","target":"record","created_at":"2026-05-18T01:05:25Z","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":"b876353d13e3b10d5c75c3793c362ec01eab9f3e6b74d78cc632b0bf9c34e834","cross_cats_sorted":["cs.CC","cs.CR","math.AG","math.CO"],"license":"","primary_cat":"math.NT","submitted_at":"2004-11-17T17:50:05Z","title_canon_sha256":"714ff3e3a1af04cad4c3a4cb9abdf96eae062e442e888ef7e32ec753f436fe74"},"schema_version":"1.0","source":{"id":"math/0411378","kind":"arxiv","version":3}},"canonical_sha256":"1b8f6362754033c538abdf8c0778fa8c34fd088988bc599db33d315142bffa5a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b8f6362754033c538abdf8c0778fa8c34fd088988bc599db33d315142bffa5a","first_computed_at":"2026-05-18T01:05:25.629353Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:05:25.629353Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jZ1rDB8GE8NxrkRc8x+JMhIAwC+V6T62xqxM0bwvrXnk1T/O6LgtMEnvmCsTZPvZcATpvZLQIKvFsUo1yU6zDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:05:25.629908Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0411378","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3a437f3ae5bd625fd864f4ac93f5e715f3f97a8fef0bd737bb4849e59804f9a6","sha256:dc85c959e0b8c13d704394373194ba8860eda18c37ff29167a6c34d3a571d674"],"state_sha256":"45eeee673225292d0ac9b461a626761c4383dde8e6de592692a0fe885785c8bc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hk2ZaUJdyjAmtXETAeAXwuBYk4dB2cLbQrPc9R9slPgm4a+wckKkzboFjJ6E2BGNCiFaSxvEOVhnDrdNo7CwAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T18:06:07.964992Z","bundle_sha256":"4355b1ef77ec72d02bd5afdc4d8a802ad7f9cf3bead7fe558078b59ad1a084fd"}}