{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:JEJPKBIRPHUBYTUCH3EMIORWAK","short_pith_number":"pith:JEJPKBIR","canonical_record":{"source":{"id":"1604.03072","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-11T19:11:02Z","cross_cats_sorted":["cs.CC","math.NT"],"title_canon_sha256":"a6a96caa4bd32cf5c8c47325b3e41a681f73479de033e7d0316664b4643488df","abstract_canon_sha256":"b52fd47ac9eb6dd169efa42cc8299ab9e3505a6c2ef201d4e79db9b34094b890"},"schema_version":"1.0"},"canonical_sha256":"4912f5051179e81c4e823ec8c43a360282cd6d2a10bdb0cd22aed72a06bf0f3c","source":{"kind":"arxiv","id":"1604.03072","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.03072","created_at":"2026-05-18T00:08:16Z"},{"alias_kind":"arxiv_version","alias_value":"1604.03072v3","created_at":"2026-05-18T00:08:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.03072","created_at":"2026-05-18T00:08:16Z"},{"alias_kind":"pith_short_12","alias_value":"JEJPKBIRPHUB","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JEJPKBIRPHUBYTUC","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JEJPKBIR","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:JEJPKBIRPHUBYTUCH3EMIORWAK","target":"record","payload":{"canonical_record":{"source":{"id":"1604.03072","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-11T19:11:02Z","cross_cats_sorted":["cs.CC","math.NT"],"title_canon_sha256":"a6a96caa4bd32cf5c8c47325b3e41a681f73479de033e7d0316664b4643488df","abstract_canon_sha256":"b52fd47ac9eb6dd169efa42cc8299ab9e3505a6c2ef201d4e79db9b34094b890"},"schema_version":"1.0"},"canonical_sha256":"4912f5051179e81c4e823ec8c43a360282cd6d2a10bdb0cd22aed72a06bf0f3c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:16.367895Z","signature_b64":"YDljZcXAN7eJZ6Rr3q76ACRSUcqe4zGURhNFV78I/MYu6GFHHQnyg9U8t/mvZXoZGHIUbnBGWMhQ86ZJgTsPCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4912f5051179e81c4e823ec8c43a360282cd6d2a10bdb0cd22aed72a06bf0f3c","last_reissued_at":"2026-05-18T00:08:16.367356Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:16.367356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.03072","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-18T00:08:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7pCTFO04U0AtvLAmL3nYFRvF4+ZWrUMNaeKxrBsKud2F2Ml1MH2MSqBcA5irZD7pr4SVIB/R8DGQUN4U6+/WAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:12:07.826512Z"},"content_sha256":"196f96dad31214ed351dffc3f840d784417cdccb8f34e0cf04e8365ea03334f5","schema_version":"1.0","event_id":"sha256:196f96dad31214ed351dffc3f840d784417cdccb8f34e0cf04e8365ea03334f5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:JEJPKBIRPHUBYTUCH3EMIORWAK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Computation of Isomorphisms Between Finite Fields Using Elliptic Curves","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.NT"],"primary_cat":"cs.DS","authors_text":"Anand Kumar Narayanan","submitted_at":"2016-04-11T19:11:02Z","abstract_excerpt":"We propose a randomized algorithm to compute isomorphisms between finite fields using elliptic curves. To compute an isomorphism between two fields of cardinality $q^n$, our algorithm takes $$n^{1+o(1)} \\log^{1+o(1)}q + \\max_{\\ell} \\left(\\ell^{n_\\ell + 1+o(1)} \\log^{2+o(1)} q + O(\\ell \\log^5q)\\right)$$ time, where $\\ell$ runs through primes dividing $n$ but not $q(q-1)$ and $n_\\ell$ denotes the highest power of $\\ell$ dividing $n$. Prior to this work, the best known run time dependence on $n$ was quadratic. Our run time dependence on $n$ is at worst quadratic but is subquadratic if $n$ has no "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.03072","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-18T00:08:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qxu0GqmWNV0CVGIs9sQqwPiaRZtQWoSQQXBh3ZJTDoxztq4FbzpzoIR+4as2Pfrv9GMdeAUvmt9Yk8Jqiz6PCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:12:07.827230Z"},"content_sha256":"bd4279de324a550b2ccd3c39076c1613fb732101aa0bd0100803982864ebacc6","schema_version":"1.0","event_id":"sha256:bd4279de324a550b2ccd3c39076c1613fb732101aa0bd0100803982864ebacc6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JEJPKBIRPHUBYTUCH3EMIORWAK/bundle.json","state_url":"https://pith.science/pith/JEJPKBIRPHUBYTUCH3EMIORWAK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JEJPKBIRPHUBYTUCH3EMIORWAK/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-05-31T21:12:07Z","links":{"resolver":"https://pith.science/pith/JEJPKBIRPHUBYTUCH3EMIORWAK","bundle":"https://pith.science/pith/JEJPKBIRPHUBYTUCH3EMIORWAK/bundle.json","state":"https://pith.science/pith/JEJPKBIRPHUBYTUCH3EMIORWAK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JEJPKBIRPHUBYTUCH3EMIORWAK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:JEJPKBIRPHUBYTUCH3EMIORWAK","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":"b52fd47ac9eb6dd169efa42cc8299ab9e3505a6c2ef201d4e79db9b34094b890","cross_cats_sorted":["cs.CC","math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-11T19:11:02Z","title_canon_sha256":"a6a96caa4bd32cf5c8c47325b3e41a681f73479de033e7d0316664b4643488df"},"schema_version":"1.0","source":{"id":"1604.03072","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.03072","created_at":"2026-05-18T00:08:16Z"},{"alias_kind":"arxiv_version","alias_value":"1604.03072v3","created_at":"2026-05-18T00:08:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.03072","created_at":"2026-05-18T00:08:16Z"},{"alias_kind":"pith_short_12","alias_value":"JEJPKBIRPHUB","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JEJPKBIRPHUBYTUC","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JEJPKBIR","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:bd4279de324a550b2ccd3c39076c1613fb732101aa0bd0100803982864ebacc6","target":"graph","created_at":"2026-05-18T00:08:16Z","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 propose a randomized algorithm to compute isomorphisms between finite fields using elliptic curves. To compute an isomorphism between two fields of cardinality $q^n$, our algorithm takes $$n^{1+o(1)} \\log^{1+o(1)}q + \\max_{\\ell} \\left(\\ell^{n_\\ell + 1+o(1)} \\log^{2+o(1)} q + O(\\ell \\log^5q)\\right)$$ time, where $\\ell$ runs through primes dividing $n$ but not $q(q-1)$ and $n_\\ell$ denotes the highest power of $\\ell$ dividing $n$. Prior to this work, the best known run time dependence on $n$ was quadratic. Our run time dependence on $n$ is at worst quadratic but is subquadratic if $n$ has no ","authors_text":"Anand Kumar Narayanan","cross_cats":["cs.CC","math.NT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-11T19:11:02Z","title":"Fast Computation of Isomorphisms Between Finite Fields Using Elliptic Curves"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.03072","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:196f96dad31214ed351dffc3f840d784417cdccb8f34e0cf04e8365ea03334f5","target":"record","created_at":"2026-05-18T00:08:16Z","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":"b52fd47ac9eb6dd169efa42cc8299ab9e3505a6c2ef201d4e79db9b34094b890","cross_cats_sorted":["cs.CC","math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-11T19:11:02Z","title_canon_sha256":"a6a96caa4bd32cf5c8c47325b3e41a681f73479de033e7d0316664b4643488df"},"schema_version":"1.0","source":{"id":"1604.03072","kind":"arxiv","version":3}},"canonical_sha256":"4912f5051179e81c4e823ec8c43a360282cd6d2a10bdb0cd22aed72a06bf0f3c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4912f5051179e81c4e823ec8c43a360282cd6d2a10bdb0cd22aed72a06bf0f3c","first_computed_at":"2026-05-18T00:08:16.367356Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:16.367356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YDljZcXAN7eJZ6Rr3q76ACRSUcqe4zGURhNFV78I/MYu6GFHHQnyg9U8t/mvZXoZGHIUbnBGWMhQ86ZJgTsPCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:16.367895Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.03072","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:196f96dad31214ed351dffc3f840d784417cdccb8f34e0cf04e8365ea03334f5","sha256:bd4279de324a550b2ccd3c39076c1613fb732101aa0bd0100803982864ebacc6"],"state_sha256":"3499081b8a8c3048b52e57bba865251dbb494b1dce9737e31aa2ae65c816d010"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iV9HWbUbJJdkgoX0UnygX5Zgj4xswffkbGb4nZy+YoE+XWpxK1AXdCCycSBK2VXPBssra9aLr9l8QVd1L0RQAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T21:12:07.831820Z","bundle_sha256":"00a01ac69c305dc2890d91ac486cd0d616c844ac33a12edd5323a27531b25ae5"}}