{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:OW4JZK4W2FA2XGDAHN7GCR3BQ2","short_pith_number":"pith:OW4JZK4W","canonical_record":{"source":{"id":"2606.12130","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SC","submitted_at":"2026-06-10T14:25:06Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"7e82e4bb34c5e41c02dc666f8ceb32ab9a329db5fcda2ad0e92d2ed043567033","abstract_canon_sha256":"5603308fe88ef157dbd76cbe7ecebe950f17d1e0b3816891b77cf2dabef44806"},"schema_version":"1.0"},"canonical_sha256":"75b89cab96d141ab98603b7e61476186b3591337fe820d196a67b88b0df0258b","source":{"kind":"arxiv","id":"2606.12130","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.12130","created_at":"2026-06-11T01:10:49Z"},{"alias_kind":"arxiv_version","alias_value":"2606.12130v1","created_at":"2026-06-11T01:10:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.12130","created_at":"2026-06-11T01:10:49Z"},{"alias_kind":"pith_short_12","alias_value":"OW4JZK4W2FA2","created_at":"2026-06-11T01:10:49Z"},{"alias_kind":"pith_short_16","alias_value":"OW4JZK4W2FA2XGDA","created_at":"2026-06-11T01:10:49Z"},{"alias_kind":"pith_short_8","alias_value":"OW4JZK4W","created_at":"2026-06-11T01:10:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:OW4JZK4W2FA2XGDAHN7GCR3BQ2","target":"record","payload":{"canonical_record":{"source":{"id":"2606.12130","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SC","submitted_at":"2026-06-10T14:25:06Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"7e82e4bb34c5e41c02dc666f8ceb32ab9a329db5fcda2ad0e92d2ed043567033","abstract_canon_sha256":"5603308fe88ef157dbd76cbe7ecebe950f17d1e0b3816891b77cf2dabef44806"},"schema_version":"1.0"},"canonical_sha256":"75b89cab96d141ab98603b7e61476186b3591337fe820d196a67b88b0df0258b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-11T01:10:49.953821Z","signature_b64":"zxogADKT4xNivIFU0gzXXawJiagjc+RiLWr//kbwWq44uS/5H1GwsPNrIEcspSenco3C73eoZXYe0+862B5cCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75b89cab96d141ab98603b7e61476186b3591337fe820d196a67b88b0df0258b","last_reissued_at":"2026-06-11T01:10:49.952792Z","signature_status":"signed_v1","first_computed_at":"2026-06-11T01:10:49.952792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.12130","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:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"26MIL89o9uPgzC+DeDjVsERUN0ROZllxAIMzcLjChjoX7VR7BannMTZ0zDmKcRdmGzYys1uzlf6cV8gDXpfACQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T17:11:25.677031Z"},"content_sha256":"96b505ed7a24da14c77e2e4736d67928a59f2db513198e7bd6373f0ef4e5d764","schema_version":"1.0","event_id":"sha256:96b505ed7a24da14c77e2e4736d67928a59f2db513198e7bd6373f0ef4e5d764"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:OW4JZK4W2FA2XGDAHN7GCR3BQ2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sparse Polynomial Divisibility Test over Finite Field is CoNP-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:25:06Z","abstract_excerpt":"In this paper, we show that deciding whether a sparse polynomial does not divide another sparse polynomial exactly over finite fields is NP-hard under BPP many-one reductions. Equivalently, the sparse polynomial divisibility test over finite fields is CoNP-hard. This resolves the long-standing open problem concerning the computational complexity of the divisibility test for sparse polynomials in the setting of finite fields."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.12130","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.12130/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:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qfGI7pMgzpuLKhmeFgoAjewxyqET52aakyHj99Ao3df2g2XIVcvabIOmLlnWQoiGpxngcAyG6uyM1q8WUbwwBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T17:11:25.677414Z"},"content_sha256":"73bc7d4e5a1b9771d8da0fd7921ac4097fb0b94fb993a093fed93bc69de2ccbb","schema_version":"1.0","event_id":"sha256:73bc7d4e5a1b9771d8da0fd7921ac4097fb0b94fb993a093fed93bc69de2ccbb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OW4JZK4W2FA2XGDAHN7GCR3BQ2/bundle.json","state_url":"https://pith.science/pith/OW4JZK4W2FA2XGDAHN7GCR3BQ2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OW4JZK4W2FA2XGDAHN7GCR3BQ2/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-28T17:11:25Z","links":{"resolver":"https://pith.science/pith/OW4JZK4W2FA2XGDAHN7GCR3BQ2","bundle":"https://pith.science/pith/OW4JZK4W2FA2XGDAHN7GCR3BQ2/bundle.json","state":"https://pith.science/pith/OW4JZK4W2FA2XGDAHN7GCR3BQ2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OW4JZK4W2FA2XGDAHN7GCR3BQ2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:OW4JZK4W2FA2XGDAHN7GCR3BQ2","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":"5603308fe88ef157dbd76cbe7ecebe950f17d1e0b3816891b77cf2dabef44806","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SC","submitted_at":"2026-06-10T14:25:06Z","title_canon_sha256":"7e82e4bb34c5e41c02dc666f8ceb32ab9a329db5fcda2ad0e92d2ed043567033"},"schema_version":"1.0","source":{"id":"2606.12130","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.12130","created_at":"2026-06-11T01:10:49Z"},{"alias_kind":"arxiv_version","alias_value":"2606.12130v1","created_at":"2026-06-11T01:10:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.12130","created_at":"2026-06-11T01:10:49Z"},{"alias_kind":"pith_short_12","alias_value":"OW4JZK4W2FA2","created_at":"2026-06-11T01:10:49Z"},{"alias_kind":"pith_short_16","alias_value":"OW4JZK4W2FA2XGDA","created_at":"2026-06-11T01:10:49Z"},{"alias_kind":"pith_short_8","alias_value":"OW4JZK4W","created_at":"2026-06-11T01:10:49Z"}],"graph_snapshots":[{"event_id":"sha256:73bc7d4e5a1b9771d8da0fd7921ac4097fb0b94fb993a093fed93bc69de2ccbb","target":"graph","created_at":"2026-06-11T01:10:49Z","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.12130/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we show that deciding whether a sparse polynomial does not divide another sparse polynomial exactly over finite fields is NP-hard under BPP many-one reductions. Equivalently, the sparse polynomial divisibility test over finite fields is CoNP-hard. This resolves the long-standing open problem concerning the computational complexity of the divisibility test for sparse polynomials in the setting of finite fields.","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:25:06Z","title":"Sparse Polynomial Divisibility Test over Finite Field is CoNP-hard"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.12130","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:96b505ed7a24da14c77e2e4736d67928a59f2db513198e7bd6373f0ef4e5d764","target":"record","created_at":"2026-06-11T01:10:49Z","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":"5603308fe88ef157dbd76cbe7ecebe950f17d1e0b3816891b77cf2dabef44806","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SC","submitted_at":"2026-06-10T14:25:06Z","title_canon_sha256":"7e82e4bb34c5e41c02dc666f8ceb32ab9a329db5fcda2ad0e92d2ed043567033"},"schema_version":"1.0","source":{"id":"2606.12130","kind":"arxiv","version":1}},"canonical_sha256":"75b89cab96d141ab98603b7e61476186b3591337fe820d196a67b88b0df0258b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"75b89cab96d141ab98603b7e61476186b3591337fe820d196a67b88b0df0258b","first_computed_at":"2026-06-11T01:10:49.952792Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-11T01:10:49.952792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zxogADKT4xNivIFU0gzXXawJiagjc+RiLWr//kbwWq44uS/5H1GwsPNrIEcspSenco3C73eoZXYe0+862B5cCA==","signature_status":"signed_v1","signed_at":"2026-06-11T01:10:49.953821Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.12130","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:96b505ed7a24da14c77e2e4736d67928a59f2db513198e7bd6373f0ef4e5d764","sha256:73bc7d4e5a1b9771d8da0fd7921ac4097fb0b94fb993a093fed93bc69de2ccbb"],"state_sha256":"e7e1786a825e7df044dd25a05b83ebf53d28e7dbb57f7844aad99d1f0d0d89bb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UG6AWgqpvHbSsaQGOpgcnRghO11Scj4SF/eaZUgIQNq+IUEtelqeyMB6rm5WadUvu4dca+gUSiW3W6VnlLsmDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T17:11:25.679290Z","bundle_sha256":"1d1a19304035e34c029bd77feab52d869f36194677bb2e9707e6e993af0a6880"}}