{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:S3GSYPBWX3RVQ2CNM3JWJUIMW6","short_pith_number":"pith:S3GSYPBW","schema_version":"1.0","canonical_sha256":"96cd2c3c36bee358684d66d364d10cb7ac9cde7b487903831e6bc2c6e19e0f18","source":{"kind":"arxiv","id":"1712.00669","version":2},"attestation_state":"computed","paper":{"title":"Drinfeld Modules with Complex Multiplication, Hasse Invariants and Factoring Polynomials over Finite Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SC","math.NT"],"primary_cat":"cs.CG","authors_text":"Anand Kumar Narayanan, \\'Eric Schost, Javad Doliskani","submitted_at":"2017-12-02T21:35:13Z","abstract_excerpt":"We present a novel randomized algorithm to factor polynomials over a finite field $\\F_q$ of odd characteristic using rank $2$ Drinfeld modules with complex multiplication. The main idea is to compute a lift of the Hasse invariant (modulo the polynomial $f \\in \\F_q[x]$ to be factored) with respect to a random Drinfeld module $\\phi$ with complex multiplication. Factors of $f$ supported on prime ideals with supersingular reduction at $\\phi$ have vanishing Hasse invariant and can be separated from the rest. Incorporating a Drinfeld module analogue of Deligne's congruence, we devise an algorithm to"},"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":"1712.00669","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-12-02T21:35:13Z","cross_cats_sorted":["cs.SC","math.NT"],"title_canon_sha256":"2ce430940b5d657afa390f7b0b67198a53f87aec14fd8d9de54ff8e501b85e36","abstract_canon_sha256":"575cf0e018f3b5f37be4f6a44695d35afee8aa6da753daed1c113693ec520550"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:18.182825Z","signature_b64":"3PltZ6t2/2hdKhLMprZJiV6PspdrY0wLNwWYYbAoHWSx0XHDouu0bVQ7Q7o1plSV3P7damVfsN8YEpmulEgHCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96cd2c3c36bee358684d66d364d10cb7ac9cde7b487903831e6bc2c6e19e0f18","last_reissued_at":"2026-05-18T00:07:18.182078Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:18.182078Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Drinfeld Modules with Complex Multiplication, Hasse Invariants and Factoring Polynomials over Finite Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SC","math.NT"],"primary_cat":"cs.CG","authors_text":"Anand Kumar Narayanan, \\'Eric Schost, Javad Doliskani","submitted_at":"2017-12-02T21:35:13Z","abstract_excerpt":"We present a novel randomized algorithm to factor polynomials over a finite field $\\F_q$ of odd characteristic using rank $2$ Drinfeld modules with complex multiplication. The main idea is to compute a lift of the Hasse invariant (modulo the polynomial $f \\in \\F_q[x]$ to be factored) with respect to a random Drinfeld module $\\phi$ with complex multiplication. Factors of $f$ supported on prime ideals with supersingular reduction at $\\phi$ have vanishing Hasse invariant and can be separated from the rest. Incorporating a Drinfeld module analogue of Deligne's congruence, we devise an algorithm to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.00669","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1712.00669","created_at":"2026-05-18T00:07:18.182199+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.00669v2","created_at":"2026-05-18T00:07:18.182199+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.00669","created_at":"2026-05-18T00:07:18.182199+00:00"},{"alias_kind":"pith_short_12","alias_value":"S3GSYPBWX3RV","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"S3GSYPBWX3RVQ2CN","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"S3GSYPBW","created_at":"2026-05-18T12:31:43.269735+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/S3GSYPBWX3RVQ2CNM3JWJUIMW6","json":"https://pith.science/pith/S3GSYPBWX3RVQ2CNM3JWJUIMW6.json","graph_json":"https://pith.science/api/pith-number/S3GSYPBWX3RVQ2CNM3JWJUIMW6/graph.json","events_json":"https://pith.science/api/pith-number/S3GSYPBWX3RVQ2CNM3JWJUIMW6/events.json","paper":"https://pith.science/paper/S3GSYPBW"},"agent_actions":{"view_html":"https://pith.science/pith/S3GSYPBWX3RVQ2CNM3JWJUIMW6","download_json":"https://pith.science/pith/S3GSYPBWX3RVQ2CNM3JWJUIMW6.json","view_paper":"https://pith.science/paper/S3GSYPBW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.00669&json=true","fetch_graph":"https://pith.science/api/pith-number/S3GSYPBWX3RVQ2CNM3JWJUIMW6/graph.json","fetch_events":"https://pith.science/api/pith-number/S3GSYPBWX3RVQ2CNM3JWJUIMW6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S3GSYPBWX3RVQ2CNM3JWJUIMW6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S3GSYPBWX3RVQ2CNM3JWJUIMW6/action/storage_attestation","attest_author":"https://pith.science/pith/S3GSYPBWX3RVQ2CNM3JWJUIMW6/action/author_attestation","sign_citation":"https://pith.science/pith/S3GSYPBWX3RVQ2CNM3JWJUIMW6/action/citation_signature","submit_replication":"https://pith.science/pith/S3GSYPBWX3RVQ2CNM3JWJUIMW6/action/replication_record"}},"created_at":"2026-05-18T00:07:18.182199+00:00","updated_at":"2026-05-18T00:07:18.182199+00:00"}