{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:KDSHZ3WVZPD7ZUMGL4KGU67K32","short_pith_number":"pith:KDSHZ3WV","schema_version":"1.0","canonical_sha256":"50e47ceed5cbc7fcd1865f146a7beadea9375b41f572c17c943523afd1f58bcd","source":{"kind":"arxiv","id":"1303.1998","version":1},"attestation_state":"computed","paper":{"title":"Selecting polynomials for the Function Field Sieve","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"cs.CR","authors_text":"Razvan Barbulescu (INRIA Nancy - Grand Est / LORIA)","submitted_at":"2013-03-08T14:10:21Z","abstract_excerpt":"The Function Field Sieve algorithm is dedicated to computing discrete logarithms in a finite field GF(q^n), where q is small an prime power. The scope of this article is to select good polynomials for this algorithm by defining and measuring the size property and the so-called root and cancellation properties. In particular we present an algorithm for rapidly testing a large set of polynomials. Our study also explains the behaviour of inseparable polynomials, in particular we give an easy way to see that the algorithm encompass the Coppersmith algorithm as a particular case."},"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":"1303.1998","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-03-08T14:10:21Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"b7aaadaff4643755a9be9deb5cc1852313232dbce76a8676f5e0949c4ece6f03","abstract_canon_sha256":"0b2088f256edd8cd8ba849acd36e85d4b4f378fa955426df6b395780190b71a3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:31:31.738161Z","signature_b64":"cPgXXJnYPQSBM+GGjluEdyT5iGyKYsUoOodoARErxQ1M9J4dv1rZYw8cddLUEpUfHScZU8wCer4yNa5l470mCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50e47ceed5cbc7fcd1865f146a7beadea9375b41f572c17c943523afd1f58bcd","last_reissued_at":"2026-05-18T03:31:31.737284Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:31:31.737284Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Selecting polynomials for the Function Field Sieve","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"cs.CR","authors_text":"Razvan Barbulescu (INRIA Nancy - Grand Est / LORIA)","submitted_at":"2013-03-08T14:10:21Z","abstract_excerpt":"The Function Field Sieve algorithm is dedicated to computing discrete logarithms in a finite field GF(q^n), where q is small an prime power. The scope of this article is to select good polynomials for this algorithm by defining and measuring the size property and the so-called root and cancellation properties. In particular we present an algorithm for rapidly testing a large set of polynomials. Our study also explains the behaviour of inseparable polynomials, in particular we give an easy way to see that the algorithm encompass the Coppersmith algorithm as a particular case."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.1998","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":"1303.1998","created_at":"2026-05-18T03:31:31.737443+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.1998v1","created_at":"2026-05-18T03:31:31.737443+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.1998","created_at":"2026-05-18T03:31:31.737443+00:00"},{"alias_kind":"pith_short_12","alias_value":"KDSHZ3WVZPD7","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"KDSHZ3WVZPD7ZUMG","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"KDSHZ3WV","created_at":"2026-05-18T12:27:49.015174+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/KDSHZ3WVZPD7ZUMGL4KGU67K32","json":"https://pith.science/pith/KDSHZ3WVZPD7ZUMGL4KGU67K32.json","graph_json":"https://pith.science/api/pith-number/KDSHZ3WVZPD7ZUMGL4KGU67K32/graph.json","events_json":"https://pith.science/api/pith-number/KDSHZ3WVZPD7ZUMGL4KGU67K32/events.json","paper":"https://pith.science/paper/KDSHZ3WV"},"agent_actions":{"view_html":"https://pith.science/pith/KDSHZ3WVZPD7ZUMGL4KGU67K32","download_json":"https://pith.science/pith/KDSHZ3WVZPD7ZUMGL4KGU67K32.json","view_paper":"https://pith.science/paper/KDSHZ3WV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.1998&json=true","fetch_graph":"https://pith.science/api/pith-number/KDSHZ3WVZPD7ZUMGL4KGU67K32/graph.json","fetch_events":"https://pith.science/api/pith-number/KDSHZ3WVZPD7ZUMGL4KGU67K32/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KDSHZ3WVZPD7ZUMGL4KGU67K32/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KDSHZ3WVZPD7ZUMGL4KGU67K32/action/storage_attestation","attest_author":"https://pith.science/pith/KDSHZ3WVZPD7ZUMGL4KGU67K32/action/author_attestation","sign_citation":"https://pith.science/pith/KDSHZ3WVZPD7ZUMGL4KGU67K32/action/citation_signature","submit_replication":"https://pith.science/pith/KDSHZ3WVZPD7ZUMGL4KGU67K32/action/replication_record"}},"created_at":"2026-05-18T03:31:31.737443+00:00","updated_at":"2026-05-18T03:31:31.737443+00:00"}