{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:IXI3FBQ66HESKY42FNBGLNVNAP","short_pith_number":"pith:IXI3FBQ6","canonical_record":{"source":{"id":"1312.1674","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-12-05T20:31:28Z","cross_cats_sorted":["cs.CR","math.NT"],"title_canon_sha256":"95d2a04672103c32f8bccf9a638eaae0f2327b32daa1f8d5769c4e1902b3e72a","abstract_canon_sha256":"eee5b962ca2d6b6b21a201b2afcb167c74979585da663fc3b51b90a2118b6e79"},"schema_version":"1.0"},"canonical_sha256":"45d1b2861ef1c925639a2b4265b6ad03ff62d292bd0cf5ea8e499ffba8954b2f","source":{"kind":"arxiv","id":"1312.1674","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.1674","created_at":"2026-05-18T03:03:57Z"},{"alias_kind":"arxiv_version","alias_value":"1312.1674v2","created_at":"2026-05-18T03:03:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1674","created_at":"2026-05-18T03:03:57Z"},{"alias_kind":"pith_short_12","alias_value":"IXI3FBQ66HES","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"IXI3FBQ66HESKY42","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"IXI3FBQ6","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:IXI3FBQ66HESKY42FNBGLNVNAP","target":"record","payload":{"canonical_record":{"source":{"id":"1312.1674","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-12-05T20:31:28Z","cross_cats_sorted":["cs.CR","math.NT"],"title_canon_sha256":"95d2a04672103c32f8bccf9a638eaae0f2327b32daa1f8d5769c4e1902b3e72a","abstract_canon_sha256":"eee5b962ca2d6b6b21a201b2afcb167c74979585da663fc3b51b90a2118b6e79"},"schema_version":"1.0"},"canonical_sha256":"45d1b2861ef1c925639a2b4265b6ad03ff62d292bd0cf5ea8e499ffba8954b2f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:57.477223Z","signature_b64":"Is9kSb/aGEt0l3B20x7HPJoZcK9xPurWn7pMlnirDx7HcXuV1f2ZFXkhXqpMtbpUg6WEn95tom77XzZ6YejqBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45d1b2861ef1c925639a2b4265b6ad03ff62d292bd0cf5ea8e499ffba8954b2f","last_reissued_at":"2026-05-18T03:03:57.476357Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:57.476357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.1674","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-18T03:03:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cp+45p/g2haFDKa4V9piNi9gShln3bxQ9ZU9eq5V2l3am+MQsxecGxdCT0Tn3EaiPXYLQqCHHTsGmXI2o4Y0AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:38:31.104900Z"},"content_sha256":"ad084aa3b705b9e211c99da21bc8c57dbe444803826ecf880b09cc80141f145a","schema_version":"1.0","event_id":"sha256:ad084aa3b705b9e211c99da21bc8c57dbe444803826ecf880b09cc80141f145a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:IXI3FBQ66HESKY42FNBGLNVNAP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the relation generation method of Joux for computing discrete logarithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.NT"],"primary_cat":"cs.CC","authors_text":"Anand Kumar Narayanan, Ming-Deh Huang","submitted_at":"2013-12-05T20:31:28Z","abstract_excerpt":"In \\cite{joux}, Joux devised an algorithm to compute discrete logarithms between elements in a certain subset of the multiplicative group of an extension of the finite field $\\mathbb{F}_{p^n}$ in time polynomial in $p$ and $n$. Shortly after, Barbulescu, Gaudry, Joux and Thome \\cite{bgjt} proposed a descent algorithm that in $(p n)^{\\mathcal{O}(\\log n)}$ time projects an arbitrary element in $\\mathbb{F}_{p^n}^\\times$ as a product of powers of elements in the aforementioned subset. Together, these two algorithms yield a quasi-polynomial time algorithm for computing discrete logarithms in finite"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.1674","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-18T03:03:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yqpfGwzv7yTtHZ16btxX4oln6uQypkS+thplnhWMarrKl9Pes3Gz7FnaFbUHiUr0Ia7jTU4lXya1jfZfeHjoAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:38:31.105245Z"},"content_sha256":"8e87a9e319dfb895b3c21ab5a8e3f47f5bf991c6fe6d7e2441f90d814daaffc1","schema_version":"1.0","event_id":"sha256:8e87a9e319dfb895b3c21ab5a8e3f47f5bf991c6fe6d7e2441f90d814daaffc1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IXI3FBQ66HESKY42FNBGLNVNAP/bundle.json","state_url":"https://pith.science/pith/IXI3FBQ66HESKY42FNBGLNVNAP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IXI3FBQ66HESKY42FNBGLNVNAP/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-31T05:38:31Z","links":{"resolver":"https://pith.science/pith/IXI3FBQ66HESKY42FNBGLNVNAP","bundle":"https://pith.science/pith/IXI3FBQ66HESKY42FNBGLNVNAP/bundle.json","state":"https://pith.science/pith/IXI3FBQ66HESKY42FNBGLNVNAP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IXI3FBQ66HESKY42FNBGLNVNAP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:IXI3FBQ66HESKY42FNBGLNVNAP","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":"eee5b962ca2d6b6b21a201b2afcb167c74979585da663fc3b51b90a2118b6e79","cross_cats_sorted":["cs.CR","math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-12-05T20:31:28Z","title_canon_sha256":"95d2a04672103c32f8bccf9a638eaae0f2327b32daa1f8d5769c4e1902b3e72a"},"schema_version":"1.0","source":{"id":"1312.1674","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.1674","created_at":"2026-05-18T03:03:57Z"},{"alias_kind":"arxiv_version","alias_value":"1312.1674v2","created_at":"2026-05-18T03:03:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1674","created_at":"2026-05-18T03:03:57Z"},{"alias_kind":"pith_short_12","alias_value":"IXI3FBQ66HES","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"IXI3FBQ66HESKY42","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"IXI3FBQ6","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:8e87a9e319dfb895b3c21ab5a8e3f47f5bf991c6fe6d7e2441f90d814daaffc1","target":"graph","created_at":"2026-05-18T03:03:57Z","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":"In \\cite{joux}, Joux devised an algorithm to compute discrete logarithms between elements in a certain subset of the multiplicative group of an extension of the finite field $\\mathbb{F}_{p^n}$ in time polynomial in $p$ and $n$. Shortly after, Barbulescu, Gaudry, Joux and Thome \\cite{bgjt} proposed a descent algorithm that in $(p n)^{\\mathcal{O}(\\log n)}$ time projects an arbitrary element in $\\mathbb{F}_{p^n}^\\times$ as a product of powers of elements in the aforementioned subset. Together, these two algorithms yield a quasi-polynomial time algorithm for computing discrete logarithms in finite","authors_text":"Anand Kumar Narayanan, Ming-Deh Huang","cross_cats":["cs.CR","math.NT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-12-05T20:31:28Z","title":"On the relation generation method of Joux for computing discrete logarithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.1674","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:ad084aa3b705b9e211c99da21bc8c57dbe444803826ecf880b09cc80141f145a","target":"record","created_at":"2026-05-18T03:03:57Z","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":"eee5b962ca2d6b6b21a201b2afcb167c74979585da663fc3b51b90a2118b6e79","cross_cats_sorted":["cs.CR","math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-12-05T20:31:28Z","title_canon_sha256":"95d2a04672103c32f8bccf9a638eaae0f2327b32daa1f8d5769c4e1902b3e72a"},"schema_version":"1.0","source":{"id":"1312.1674","kind":"arxiv","version":2}},"canonical_sha256":"45d1b2861ef1c925639a2b4265b6ad03ff62d292bd0cf5ea8e499ffba8954b2f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"45d1b2861ef1c925639a2b4265b6ad03ff62d292bd0cf5ea8e499ffba8954b2f","first_computed_at":"2026-05-18T03:03:57.476357Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:03:57.476357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Is9kSb/aGEt0l3B20x7HPJoZcK9xPurWn7pMlnirDx7HcXuV1f2ZFXkhXqpMtbpUg6WEn95tom77XzZ6YejqBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:03:57.477223Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.1674","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad084aa3b705b9e211c99da21bc8c57dbe444803826ecf880b09cc80141f145a","sha256:8e87a9e319dfb895b3c21ab5a8e3f47f5bf991c6fe6d7e2441f90d814daaffc1"],"state_sha256":"472a643c0ba910a4f0cdea4cc2f316fd2e5f47670fe751cf8981c039e82742e2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o4YZ7kxZ8KmK/JwKtoAsdBXJ6WFSeHajoZ4qN95cDPXqnaO6gbT2zr7gNbznymkvVgIRB80vZrT1NEmfu4drBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T05:38:31.107219Z","bundle_sha256":"1253522f39070285d22b611c7361f0336cc2965667deacff1931ef28c3dd6d3c"}}