{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:C7AUGLKAW7KR7QZLMK5TFY4IRS","short_pith_number":"pith:C7AUGLKA","schema_version":"1.0","canonical_sha256":"17c1432d40b7d51fc32b62bb32e3888cb54fc43da5a4428db8963bfac6d9b153","source":{"kind":"arxiv","id":"2606.12144","version":1},"attestation_state":"computed","paper":{"title":"Output-sensitive Sparse Polynomial GCD over Finite Fields is NP-hard","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.SC","authors_text":"Qiao-Long Huang, Ruichen Qiu, Ruyong Feng, Xiao-Shan Gao, Yichuan Cao","submitted_at":"2026-06-10T14:37:49Z","abstract_excerpt":"In this paper, we prove that output-sensitive sparse polynomial GCD computation over finite fields is NP-hard under BPP many-one reduction. More precisely, for two sparse univariate polynomials $f,g$ with finite field coefficients, there exists no randomized algorithm to compute $\\mathrm{gcd}(f,g)$, which is polynomial-time in the sizes of $f,g,\\gcd(f,g)$ under the standard complexity assumption $\\mathrm{NP}\\nsubseteq\\mathrm{BPP}$. This settles the open problem posed as Challenge 5 in The Sparsity Challenges in the finite field setting. Furthermore, we show that the Roots of Unity Detection pr"},"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":"2606.12144","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SC","submitted_at":"2026-06-10T14:37:49Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"3d3ef0ed9c90ad55e8eb11f7f5eb558d07425e9144cc6203f513a13fbc0068dd","abstract_canon_sha256":"4d5fb3ce065f5ee73f6bf627eefcb1ac48fd589ac19d87433cc68b828051f5c4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-11T01:10:50.713651Z","signature_b64":"GPT+c3Hb2+lvsPoaurJRkbsTg1Ka7B0BmrvitEmNTf5Ps2Q1z/bpFTMl4kur7FPJrz28dkOvXs77iDD/0z3lCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17c1432d40b7d51fc32b62bb32e3888cb54fc43da5a4428db8963bfac6d9b153","last_reissued_at":"2026-06-11T01:10:50.712791Z","signature_status":"signed_v1","first_computed_at":"2026-06-11T01:10:50.712791Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Output-sensitive Sparse Polynomial GCD over Finite Fields is NP-hard","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.SC","authors_text":"Qiao-Long Huang, Ruichen Qiu, Ruyong Feng, Xiao-Shan Gao, Yichuan Cao","submitted_at":"2026-06-10T14:37:49Z","abstract_excerpt":"In this paper, we prove that output-sensitive sparse polynomial GCD computation over finite fields is NP-hard under BPP many-one reduction. More precisely, for two sparse univariate polynomials $f,g$ with finite field coefficients, there exists no randomized algorithm to compute $\\mathrm{gcd}(f,g)$, which is polynomial-time in the sizes of $f,g,\\gcd(f,g)$ under the standard complexity assumption $\\mathrm{NP}\\nsubseteq\\mathrm{BPP}$. This settles the open problem posed as Challenge 5 in The Sparsity Challenges in the finite field setting. Furthermore, we show that the Roots of Unity Detection pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.12144","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.12144/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2606.12144","created_at":"2026-06-11T01:10:50.712919+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.12144v1","created_at":"2026-06-11T01:10:50.712919+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.12144","created_at":"2026-06-11T01:10:50.712919+00:00"},{"alias_kind":"pith_short_12","alias_value":"C7AUGLKAW7KR","created_at":"2026-06-11T01:10:50.712919+00:00"},{"alias_kind":"pith_short_16","alias_value":"C7AUGLKAW7KR7QZL","created_at":"2026-06-11T01:10:50.712919+00:00"},{"alias_kind":"pith_short_8","alias_value":"C7AUGLKA","created_at":"2026-06-11T01:10:50.712919+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/C7AUGLKAW7KR7QZLMK5TFY4IRS","json":"https://pith.science/pith/C7AUGLKAW7KR7QZLMK5TFY4IRS.json","graph_json":"https://pith.science/api/pith-number/C7AUGLKAW7KR7QZLMK5TFY4IRS/graph.json","events_json":"https://pith.science/api/pith-number/C7AUGLKAW7KR7QZLMK5TFY4IRS/events.json","paper":"https://pith.science/paper/C7AUGLKA"},"agent_actions":{"view_html":"https://pith.science/pith/C7AUGLKAW7KR7QZLMK5TFY4IRS","download_json":"https://pith.science/pith/C7AUGLKAW7KR7QZLMK5TFY4IRS.json","view_paper":"https://pith.science/paper/C7AUGLKA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.12144&json=true","fetch_graph":"https://pith.science/api/pith-number/C7AUGLKAW7KR7QZLMK5TFY4IRS/graph.json","fetch_events":"https://pith.science/api/pith-number/C7AUGLKAW7KR7QZLMK5TFY4IRS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C7AUGLKAW7KR7QZLMK5TFY4IRS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C7AUGLKAW7KR7QZLMK5TFY4IRS/action/storage_attestation","attest_author":"https://pith.science/pith/C7AUGLKAW7KR7QZLMK5TFY4IRS/action/author_attestation","sign_citation":"https://pith.science/pith/C7AUGLKAW7KR7QZLMK5TFY4IRS/action/citation_signature","submit_replication":"https://pith.science/pith/C7AUGLKAW7KR7QZLMK5TFY4IRS/action/replication_record"}},"created_at":"2026-06-11T01:10:50.712919+00:00","updated_at":"2026-06-11T01:10:50.712919+00:00"}