{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:723LBGTQLUNFG2K6MTLGTQVS3X","short_pith_number":"pith:723LBGTQ","schema_version":"1.0","canonical_sha256":"feb6b09a705d1a53695e64d669c2b2dde1768bc5346a2292033dda16abd7c01a","source":{"kind":"arxiv","id":"1606.04592","version":1},"attestation_state":"computed","paper":{"title":"Algebraic Problems Equivalent to Beating Exponent 3/2 for Polynomial Factorization over Finite Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.SC"],"primary_cat":"cs.CC","authors_text":"Anand Kumar Narayanan, Chris Umans, Zeyu Guo","submitted_at":"2016-06-14T23:32:48Z","abstract_excerpt":"The fastest known algorithm for factoring univariate polynomials over finite fields is the Kedlaya-Umans (fast modular composition) implementation of the Kaltofen-Shoup algorithm. It is randomized and takes $\\widetilde{O}(n^{3/2}\\log q + n \\log^2 q)$ time to factor polynomials of degree $n$ over the finite field $\\mathbb{F}_q$ with $q$ elements. A significant open problem is if the $3/2$ exponent can be improved. We study a collection of algebraic problems and establish a web of reductions between them. A consequence is that an algorithm for any one of these problems with exponent better than "},"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":"1606.04592","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-06-14T23:32:48Z","cross_cats_sorted":["cs.DS","cs.SC"],"title_canon_sha256":"e2fa77a29403857d4d8869aab546c77f478e91a4cdf298469feed3afcb9c4ddf","abstract_canon_sha256":"d3d90c6a900fe699bfde959fc2acf4cef5175ff1bdb5767b05dee252f8b595c1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:24.730464Z","signature_b64":"tMlccpxVWBI3kEC+X9JeDgWDzV/plxZANSsiP4htAJ4CegwHvPnxfbkrZH5VJkgHLdlDPn9+WhHPd63tPYMABw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"feb6b09a705d1a53695e64d669c2b2dde1768bc5346a2292033dda16abd7c01a","last_reissued_at":"2026-05-18T01:12:24.730116Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:24.730116Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algebraic Problems Equivalent to Beating Exponent 3/2 for Polynomial Factorization over Finite Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.SC"],"primary_cat":"cs.CC","authors_text":"Anand Kumar Narayanan, Chris Umans, Zeyu Guo","submitted_at":"2016-06-14T23:32:48Z","abstract_excerpt":"The fastest known algorithm for factoring univariate polynomials over finite fields is the Kedlaya-Umans (fast modular composition) implementation of the Kaltofen-Shoup algorithm. It is randomized and takes $\\widetilde{O}(n^{3/2}\\log q + n \\log^2 q)$ time to factor polynomials of degree $n$ over the finite field $\\mathbb{F}_q$ with $q$ elements. A significant open problem is if the $3/2$ exponent can be improved. We study a collection of algebraic problems and establish a web of reductions between them. A consequence is that an algorithm for any one of these problems with exponent better than "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.04592","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":"1606.04592","created_at":"2026-05-18T01:12:24.730169+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.04592v1","created_at":"2026-05-18T01:12:24.730169+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.04592","created_at":"2026-05-18T01:12:24.730169+00:00"},{"alias_kind":"pith_short_12","alias_value":"723LBGTQLUNF","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"723LBGTQLUNFG2K6","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"723LBGTQ","created_at":"2026-05-18T12:30:04.600751+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/723LBGTQLUNFG2K6MTLGTQVS3X","json":"https://pith.science/pith/723LBGTQLUNFG2K6MTLGTQVS3X.json","graph_json":"https://pith.science/api/pith-number/723LBGTQLUNFG2K6MTLGTQVS3X/graph.json","events_json":"https://pith.science/api/pith-number/723LBGTQLUNFG2K6MTLGTQVS3X/events.json","paper":"https://pith.science/paper/723LBGTQ"},"agent_actions":{"view_html":"https://pith.science/pith/723LBGTQLUNFG2K6MTLGTQVS3X","download_json":"https://pith.science/pith/723LBGTQLUNFG2K6MTLGTQVS3X.json","view_paper":"https://pith.science/paper/723LBGTQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.04592&json=true","fetch_graph":"https://pith.science/api/pith-number/723LBGTQLUNFG2K6MTLGTQVS3X/graph.json","fetch_events":"https://pith.science/api/pith-number/723LBGTQLUNFG2K6MTLGTQVS3X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/723LBGTQLUNFG2K6MTLGTQVS3X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/723LBGTQLUNFG2K6MTLGTQVS3X/action/storage_attestation","attest_author":"https://pith.science/pith/723LBGTQLUNFG2K6MTLGTQVS3X/action/author_attestation","sign_citation":"https://pith.science/pith/723LBGTQLUNFG2K6MTLGTQVS3X/action/citation_signature","submit_replication":"https://pith.science/pith/723LBGTQLUNFG2K6MTLGTQVS3X/action/replication_record"}},"created_at":"2026-05-18T01:12:24.730169+00:00","updated_at":"2026-05-18T01:12:24.730169+00:00"}