{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:7TMNMNOIUN4U6VIM5DSIGQYUIG","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":"d6b2fb4af156105c1131f9c302de317d1409dbaa9c9b289c3abc9a55b6cbb795","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-06-10T08:54:12Z","title_canon_sha256":"da900424197fd4332254b9d79b2544c81029cab84ce4a121dc795501d188b016"},"schema_version":"1.0","source":{"id":"1606.03233","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.03233","created_at":"2026-05-17T23:42:03Z"},{"alias_kind":"arxiv_version","alias_value":"1606.03233v3","created_at":"2026-05-17T23:42:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.03233","created_at":"2026-05-17T23:42:03Z"},{"alias_kind":"pith_short_12","alias_value":"7TMNMNOIUN4U","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7TMNMNOIUN4U6VIM","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7TMNMNOI","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:2da27666cb6624357702ec8404fd9aeba8136b343713adf79fb13c0f711a93aa","target":"graph","created_at":"2026-05-17T23:42:03Z","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"},"paper":{"abstract_excerpt":"This paper analyzes to what extent it is possible to efficiently reduce the number of clauses in NP-hard satisfiability problems, without changing the answer. Upper and lower bounds are established using the concept of kernelization. Existing results show that if NP is not contained in coNP/poly, no efficient preprocessing algorithm can reduce n-variable instances of CNF-SAT with d literals per clause, to equivalent instances with $O(n^{d-e})$ bits for any e > 0. For the Not-All-Equal SAT problem, a compression to size $\\~O(n^{d-1})$ exists. We put these results in a common framework by analyz","authors_text":"Astrid Pieterse, Bart M.P. Jansen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-06-10T08:54:12Z","title":"Optimal Sparsification for Some Binary CSPs Using Low-degree Polynomials"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.03233","kind":"arxiv","version":3},"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:ffab26265cd0bf8668b496a53c879d7e0119bae861ed3bd0ce571be23b744b72","target":"record","created_at":"2026-05-17T23:42:03Z","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":"d6b2fb4af156105c1131f9c302de317d1409dbaa9c9b289c3abc9a55b6cbb795","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-06-10T08:54:12Z","title_canon_sha256":"da900424197fd4332254b9d79b2544c81029cab84ce4a121dc795501d188b016"},"schema_version":"1.0","source":{"id":"1606.03233","kind":"arxiv","version":3}},"canonical_sha256":"fcd8d635c8a3794f550ce8e483431441becd559a2e89abb0e5627cc2cd9f0501","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fcd8d635c8a3794f550ce8e483431441becd559a2e89abb0e5627cc2cd9f0501","first_computed_at":"2026-05-17T23:42:03.517006Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:03.517006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KoAPNyDita4JNfo7UY9dqvKQowK7Da9VIs2C+G824RZE9nUygYnXs103SPwMpIcDbXfjHBVCGASl0C5PI3KMAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:03.517631Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.03233","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ffab26265cd0bf8668b496a53c879d7e0119bae861ed3bd0ce571be23b744b72","sha256:2da27666cb6624357702ec8404fd9aeba8136b343713adf79fb13c0f711a93aa"],"state_sha256":"8d70e4ddb9e1919126f618bc73ca7a315bb037526b373d0c2a3e7fd5e4a92f40"}