{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:PSOQFUJOA2MMF3B3QYL6Q2SG37","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":"8560d0a4eeadc4e6c4fb0cd29bcdfbd33f45b0248f360b45f4a7644faadac4a4","cross_cats_sorted":["math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2015-05-28T06:12:59Z","title_canon_sha256":"3678188ad974ec502d5c4228cbd0790c24a1498e1fb5e8e495bd8f50d850489b"},"schema_version":"1.0","source":{"id":"1505.07553","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.07553","created_at":"2026-05-18T01:13:30Z"},{"alias_kind":"arxiv_version","alias_value":"1505.07553v3","created_at":"2026-05-18T01:13:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.07553","created_at":"2026-05-18T01:13:30Z"},{"alias_kind":"pith_short_12","alias_value":"PSOQFUJOA2MM","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PSOQFUJOA2MMF3B3","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PSOQFUJO","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:6209808b82ad2e6458f8800ce31323fdc78a180ec71723ff85888497ce0dcb01","target":"graph","created_at":"2026-05-18T01:13: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 Number Field Sieve (NFS) algorithm is the best known method to compute discrete logarithms (DL) in finite fields $\\mathbb{F}\\_{p^n}$, with $p$ medium to large and $n \\geq 1$ small. This algorithm comprises four steps: polynomial selection, relation collection, linear algebra and finally, individual logarithm computation. The first step outputs two polynomials defining two number fields, and a map from the polynomial ring over the integers modulo each of these polynomials to $\\mathbb{F}\\_{p^n}$. After the relation collection and linear algebra phases, the (virtual) logarithm of a subset of ","authors_text":"Aurore Guillevic (GRACE, LIX)","cross_cats":["math.NT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2015-05-28T06:12:59Z","title":"Computing Individual Discrete Logarithms Faster in GF$(p^n)$ with the NFS-DL Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.07553","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:1ea43bc60c486e7af90a26758333ec628ce5be732725e40302ffdf4a78a8dc04","target":"record","created_at":"2026-05-18T01:13: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":"8560d0a4eeadc4e6c4fb0cd29bcdfbd33f45b0248f360b45f4a7644faadac4a4","cross_cats_sorted":["math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2015-05-28T06:12:59Z","title_canon_sha256":"3678188ad974ec502d5c4228cbd0790c24a1498e1fb5e8e495bd8f50d850489b"},"schema_version":"1.0","source":{"id":"1505.07553","kind":"arxiv","version":3}},"canonical_sha256":"7c9d02d12e0698c2ec3b8617e86a46dfe3628dc026612760cc645960dddafc77","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7c9d02d12e0698c2ec3b8617e86a46dfe3628dc026612760cc645960dddafc77","first_computed_at":"2026-05-18T01:13:30.970029Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:30.970029Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z7iLjp9GZwTaGk8oORbEgkdVegJ3dCrK3jZZBhd0dbx4wF71hGrn5jTVz59yABx9XyVj7ddj1XOzm/YfgQDRAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:30.970703Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.07553","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1ea43bc60c486e7af90a26758333ec628ce5be732725e40302ffdf4a78a8dc04","sha256:6209808b82ad2e6458f8800ce31323fdc78a180ec71723ff85888497ce0dcb01"],"state_sha256":"7396aa83846b324181dc69d2d529187a584ef062b09a52ebf4a29ead094578b0"}