{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:C7AUGLKAW7KR7QZLMK5TFY4IRS","short_pith_number":"pith:C7AUGLKA","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"},"canonical_sha256":"17c1432d40b7d51fc32b62bb32e3888cb54fc43da5a4428db8963bfac6d9b153","source":{"kind":"arxiv","id":"2606.12144","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.12144","created_at":"2026-06-11T01:10:50Z"},{"alias_kind":"arxiv_version","alias_value":"2606.12144v1","created_at":"2026-06-11T01:10:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.12144","created_at":"2026-06-11T01:10:50Z"},{"alias_kind":"pith_short_12","alias_value":"C7AUGLKAW7KR","created_at":"2026-06-11T01:10:50Z"},{"alias_kind":"pith_short_16","alias_value":"C7AUGLKAW7KR7QZL","created_at":"2026-06-11T01:10:50Z"},{"alias_kind":"pith_short_8","alias_value":"C7AUGLKA","created_at":"2026-06-11T01:10:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:C7AUGLKAW7KR7QZLMK5TFY4IRS","target":"record","payload":{"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"},"canonical_sha256":"17c1432d40b7d51fc32b62bb32e3888cb54fc43da5a4428db8963bfac6d9b153","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"},"source_kind":"arxiv","source_id":"2606.12144","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-11T01:10:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XjCm1hJEJlt+0iN3CeF6sr+xIwnjuKdjPItwpMHhMAiGWq40Gr+tAgzernEpkN4j+pymhyma78iKyAEodKTACw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T20:27:09.730090Z"},"content_sha256":"e0aebfb8347e37b0806edc909780f283ef594eeb1bf7f0b242103db578894210","schema_version":"1.0","event_id":"sha256:e0aebfb8347e37b0806edc909780f283ef594eeb1bf7f0b242103db578894210"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:C7AUGLKAW7KR7QZLMK5TFY4IRS","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-11T01:10:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rTLQSWbaPZhHSbsYNML42Ebxg2ocoKG+qXGgAWSVLfYkjC+luWe9wihfrT8iginLiaZ6owdJlbm9XstdBgAlCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T20:27:09.730465Z"},"content_sha256":"b7059d04b3715c45cbda0a5583971b6dd803a46a51ad9260e43ee148ed329ea0","schema_version":"1.0","event_id":"sha256:b7059d04b3715c45cbda0a5583971b6dd803a46a51ad9260e43ee148ed329ea0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C7AUGLKAW7KR7QZLMK5TFY4IRS/bundle.json","state_url":"https://pith.science/pith/C7AUGLKAW7KR7QZLMK5TFY4IRS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C7AUGLKAW7KR7QZLMK5TFY4IRS/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-28T20:27:09Z","links":{"resolver":"https://pith.science/pith/C7AUGLKAW7KR7QZLMK5TFY4IRS","bundle":"https://pith.science/pith/C7AUGLKAW7KR7QZLMK5TFY4IRS/bundle.json","state":"https://pith.science/pith/C7AUGLKAW7KR7QZLMK5TFY4IRS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C7AUGLKAW7KR7QZLMK5TFY4IRS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:C7AUGLKAW7KR7QZLMK5TFY4IRS","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"4d5fb3ce065f5ee73f6bf627eefcb1ac48fd589ac19d87433cc68b828051f5c4","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SC","submitted_at":"2026-06-10T14:37:49Z","title_canon_sha256":"3d3ef0ed9c90ad55e8eb11f7f5eb558d07425e9144cc6203f513a13fbc0068dd"},"schema_version":"1.0","source":{"id":"2606.12144","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.12144","created_at":"2026-06-11T01:10:50Z"},{"alias_kind":"arxiv_version","alias_value":"2606.12144v1","created_at":"2026-06-11T01:10:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.12144","created_at":"2026-06-11T01:10:50Z"},{"alias_kind":"pith_short_12","alias_value":"C7AUGLKAW7KR","created_at":"2026-06-11T01:10:50Z"},{"alias_kind":"pith_short_16","alias_value":"C7AUGLKAW7KR7QZL","created_at":"2026-06-11T01:10:50Z"},{"alias_kind":"pith_short_8","alias_value":"C7AUGLKA","created_at":"2026-06-11T01:10:50Z"}],"graph_snapshots":[{"event_id":"sha256:b7059d04b3715c45cbda0a5583971b6dd803a46a51ad9260e43ee148ed329ea0","target":"graph","created_at":"2026-06-11T01:10:50Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.12144/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Qiao-Long Huang, Ruichen Qiu, Ruyong Feng, Xiao-Shan Gao, Yichuan Cao","cross_cats":["cs.CC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SC","submitted_at":"2026-06-10T14:37:49Z","title":"Output-sensitive Sparse Polynomial GCD over Finite Fields is NP-hard"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.12144","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e0aebfb8347e37b0806edc909780f283ef594eeb1bf7f0b242103db578894210","target":"record","created_at":"2026-06-11T01:10:50Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"4d5fb3ce065f5ee73f6bf627eefcb1ac48fd589ac19d87433cc68b828051f5c4","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SC","submitted_at":"2026-06-10T14:37:49Z","title_canon_sha256":"3d3ef0ed9c90ad55e8eb11f7f5eb558d07425e9144cc6203f513a13fbc0068dd"},"schema_version":"1.0","source":{"id":"2606.12144","kind":"arxiv","version":1}},"canonical_sha256":"17c1432d40b7d51fc32b62bb32e3888cb54fc43da5a4428db8963bfac6d9b153","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"17c1432d40b7d51fc32b62bb32e3888cb54fc43da5a4428db8963bfac6d9b153","first_computed_at":"2026-06-11T01:10:50.712791Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-11T01:10:50.712791Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GPT+c3Hb2+lvsPoaurJRkbsTg1Ka7B0BmrvitEmNTf5Ps2Q1z/bpFTMl4kur7FPJrz28dkOvXs77iDD/0z3lCA==","signature_status":"signed_v1","signed_at":"2026-06-11T01:10:50.713651Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.12144","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e0aebfb8347e37b0806edc909780f283ef594eeb1bf7f0b242103db578894210","sha256:b7059d04b3715c45cbda0a5583971b6dd803a46a51ad9260e43ee148ed329ea0"],"state_sha256":"6d3a53d2bd82c398fa83e5f2c2f65c455a244b422f37764e26d7c91343abfd12"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FzyvHSCWfH0NGQ1jfIexcDBEzeKGsw87P6MDKAhpp1l6ExeZz38pOODIOauMVZDBwtdpiwjJXytl95GYUqE8DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T20:27:09.732350Z","bundle_sha256":"e15d6382a0fc6eadd1ab2173b954d59f84e7cae6c25225a3c1336f4d55f7c805"}}