{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:SIVJHHMO2YMJHCX32RPHYCJZZ7","short_pith_number":"pith:SIVJHHMO","schema_version":"1.0","canonical_sha256":"922a939d8ed618938afbd45e7c0939cfc585c34a1bf0c27c7afc4a8b7e8e0cd1","source":{"kind":"arxiv","id":"0905.1642","version":3},"attestation_state":"computed","paper":{"title":"Fast construction of irreducible polynomials over finite fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG"],"primary_cat":"math.NT","authors_text":"Jean-Marc Couveignes, Reynald Lercier","submitted_at":"2009-05-11T15:44:25Z","abstract_excerpt":"We present a randomized algorithm that on input a finite field $K$ with $q$ elements and a positive integer $d$ outputs a degree $d$ irreducible polynomial in $K[x]$. The running time is $d^{1+\\epsilon(d)} \\times (\\log q)^{5+\\epsilon(q)}$ elementary operations. The function $\\epsilon$ in this expression is a real positive function belonging to the class $o(1)$, especially, the complexity is quasi-linear in the degree $d$.\n  Once given such an irreducible polynomial of degree $d$, we can compute random irreducible polynomials of degree $d$ at the expense of $d^{1+\\epsilon(d)} \\times (\\log q)^{1"},"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":"0905.1642","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2009-05-11T15:44:25Z","cross_cats_sorted":["math.AG"],"title_canon_sha256":"aa13a1b07fc34ca9cc6b8109ad81900d94c24b7eb9dea7d43993515737c7ebea","abstract_canon_sha256":"a877150e0c74be8e6a196e9d31b6a96636cace64b2b1f23cc6313d0aa9ade7d7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:08:04.175499Z","signature_b64":"Q/N+xqRVHntey9hVDGPDc+Nji+bKsQs9zYwhka8VkwcVympgsimYaTofIH6b0eGwXj9ptGhFCpU/xd7dEDhuBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"922a939d8ed618938afbd45e7c0939cfc585c34a1bf0c27c7afc4a8b7e8e0cd1","last_reissued_at":"2026-05-18T04:08:04.174646Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:08:04.174646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast construction of irreducible polynomials over finite fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG"],"primary_cat":"math.NT","authors_text":"Jean-Marc Couveignes, Reynald Lercier","submitted_at":"2009-05-11T15:44:25Z","abstract_excerpt":"We present a randomized algorithm that on input a finite field $K$ with $q$ elements and a positive integer $d$ outputs a degree $d$ irreducible polynomial in $K[x]$. The running time is $d^{1+\\epsilon(d)} \\times (\\log q)^{5+\\epsilon(q)}$ elementary operations. The function $\\epsilon$ in this expression is a real positive function belonging to the class $o(1)$, especially, the complexity is quasi-linear in the degree $d$.\n  Once given such an irreducible polynomial of degree $d$, we can compute random irreducible polynomials of degree $d$ at the expense of $d^{1+\\epsilon(d)} \\times (\\log q)^{1"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0905.1642","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0905.1642","created_at":"2026-05-18T04:08:04.174797+00:00"},{"alias_kind":"arxiv_version","alias_value":"0905.1642v3","created_at":"2026-05-18T04:08:04.174797+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0905.1642","created_at":"2026-05-18T04:08:04.174797+00:00"},{"alias_kind":"pith_short_12","alias_value":"SIVJHHMO2YMJ","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_16","alias_value":"SIVJHHMO2YMJHCX3","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_8","alias_value":"SIVJHHMO","created_at":"2026-05-18T12:26:01.383474+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/SIVJHHMO2YMJHCX32RPHYCJZZ7","json":"https://pith.science/pith/SIVJHHMO2YMJHCX32RPHYCJZZ7.json","graph_json":"https://pith.science/api/pith-number/SIVJHHMO2YMJHCX32RPHYCJZZ7/graph.json","events_json":"https://pith.science/api/pith-number/SIVJHHMO2YMJHCX32RPHYCJZZ7/events.json","paper":"https://pith.science/paper/SIVJHHMO"},"agent_actions":{"view_html":"https://pith.science/pith/SIVJHHMO2YMJHCX32RPHYCJZZ7","download_json":"https://pith.science/pith/SIVJHHMO2YMJHCX32RPHYCJZZ7.json","view_paper":"https://pith.science/paper/SIVJHHMO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0905.1642&json=true","fetch_graph":"https://pith.science/api/pith-number/SIVJHHMO2YMJHCX32RPHYCJZZ7/graph.json","fetch_events":"https://pith.science/api/pith-number/SIVJHHMO2YMJHCX32RPHYCJZZ7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SIVJHHMO2YMJHCX32RPHYCJZZ7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SIVJHHMO2YMJHCX32RPHYCJZZ7/action/storage_attestation","attest_author":"https://pith.science/pith/SIVJHHMO2YMJHCX32RPHYCJZZ7/action/author_attestation","sign_citation":"https://pith.science/pith/SIVJHHMO2YMJHCX32RPHYCJZZ7/action/citation_signature","submit_replication":"https://pith.science/pith/SIVJHHMO2YMJHCX32RPHYCJZZ7/action/replication_record"}},"created_at":"2026-05-18T04:08:04.174797+00:00","updated_at":"2026-05-18T04:08:04.174797+00:00"}