{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:EWGPDZGOTWCHNSLMV34K55AQDO","short_pith_number":"pith:EWGPDZGO","schema_version":"1.0","canonical_sha256":"258cf1e4ce9d8476c96caef8aef4101b8ac069214b518de2415aaf48aa981284","source":{"kind":"arxiv","id":"1110.4350","version":1},"attestation_state":"computed","paper":{"title":"Taking Roots over High Extensions of Finite Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Eric Schost, Javad Doliskani","submitted_at":"2011-10-19T18:33:28Z","abstract_excerpt":"We present a new algorithm for computing $m$-th roots over the finite field $\\F_q$, where $q = p^n$, with $p$ a prime, and $m$ any positive integer. In the particular case $m=2$, the cost of the new algorithm is an expected $O(\\M(n)\\log (p) + \\CC(n)\\log(n))$ operations in $\\F_p$, where $\\M(n)$ and $\\CC(n)$ are bounds for the cost of polynomial multiplication and modular polynomial composition. Known results give $\\M(n) = O(n\\log (n) \\log\\log (n))$ and $\\CC(n) = O(n^{1.67})$, so our algorithm is subquadratic in $n$."},"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":"1110.4350","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-19T18:33:28Z","cross_cats_sorted":[],"title_canon_sha256":"cb90d8cb048be29e159d3845f20a2cda777919a03d6ab66666702837f7438924","abstract_canon_sha256":"9bf7735c72b622905110c0f04b3fc9a188b5f87ae6e8ac160da0ed54b87935b2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:10:37.537659Z","signature_b64":"jsmiNex1DczaqUnqyI8vJqXnLBZQ3rp7sioBTV4+uI2+VMu5i9JeFH5VJs0aA3l9Ljum7eWT2Z5Cspr62SdUDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"258cf1e4ce9d8476c96caef8aef4101b8ac069214b518de2415aaf48aa981284","last_reissued_at":"2026-05-18T04:10:37.536990Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:10:37.536990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Taking Roots over High Extensions of Finite Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Eric Schost, Javad Doliskani","submitted_at":"2011-10-19T18:33:28Z","abstract_excerpt":"We present a new algorithm for computing $m$-th roots over the finite field $\\F_q$, where $q = p^n$, with $p$ a prime, and $m$ any positive integer. In the particular case $m=2$, the cost of the new algorithm is an expected $O(\\M(n)\\log (p) + \\CC(n)\\log(n))$ operations in $\\F_p$, where $\\M(n)$ and $\\CC(n)$ are bounds for the cost of polynomial multiplication and modular polynomial composition. Known results give $\\M(n) = O(n\\log (n) \\log\\log (n))$ and $\\CC(n) = O(n^{1.67})$, so our algorithm is subquadratic in $n$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.4350","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":"1110.4350","created_at":"2026-05-18T04:10:37.537085+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.4350v1","created_at":"2026-05-18T04:10:37.537085+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.4350","created_at":"2026-05-18T04:10:37.537085+00:00"},{"alias_kind":"pith_short_12","alias_value":"EWGPDZGOTWCH","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_16","alias_value":"EWGPDZGOTWCHNSLM","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_8","alias_value":"EWGPDZGO","created_at":"2026-05-18T12:26:28.662955+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/EWGPDZGOTWCHNSLMV34K55AQDO","json":"https://pith.science/pith/EWGPDZGOTWCHNSLMV34K55AQDO.json","graph_json":"https://pith.science/api/pith-number/EWGPDZGOTWCHNSLMV34K55AQDO/graph.json","events_json":"https://pith.science/api/pith-number/EWGPDZGOTWCHNSLMV34K55AQDO/events.json","paper":"https://pith.science/paper/EWGPDZGO"},"agent_actions":{"view_html":"https://pith.science/pith/EWGPDZGOTWCHNSLMV34K55AQDO","download_json":"https://pith.science/pith/EWGPDZGOTWCHNSLMV34K55AQDO.json","view_paper":"https://pith.science/paper/EWGPDZGO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.4350&json=true","fetch_graph":"https://pith.science/api/pith-number/EWGPDZGOTWCHNSLMV34K55AQDO/graph.json","fetch_events":"https://pith.science/api/pith-number/EWGPDZGOTWCHNSLMV34K55AQDO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EWGPDZGOTWCHNSLMV34K55AQDO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EWGPDZGOTWCHNSLMV34K55AQDO/action/storage_attestation","attest_author":"https://pith.science/pith/EWGPDZGOTWCHNSLMV34K55AQDO/action/author_attestation","sign_citation":"https://pith.science/pith/EWGPDZGOTWCHNSLMV34K55AQDO/action/citation_signature","submit_replication":"https://pith.science/pith/EWGPDZGOTWCHNSLMV34K55AQDO/action/replication_record"}},"created_at":"2026-05-18T04:10:37.537085+00:00","updated_at":"2026-05-18T04:10:37.537085+00:00"}