{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:SXJ27PIPARAPTOCRMIBA4RECTK","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":"956b48a6cd273fa1081b2df4dc871782e10f03ff1afc85ad7447faebaebfe09c","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-05-18T08:48:39Z","title_canon_sha256":"c13b34aab18199c419299686d567583405b4af711e0621b8c90e793f2679b29a"},"schema_version":"1.0","source":{"id":"1405.4472","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.4472","created_at":"2026-05-18T00:17:55Z"},{"alias_kind":"arxiv_version","alias_value":"1405.4472v2","created_at":"2026-05-18T00:17:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.4472","created_at":"2026-05-18T00:17:55Z"},{"alias_kind":"pith_short_12","alias_value":"SXJ27PIPARAP","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SXJ27PIPARAPTOCR","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SXJ27PIP","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:f9d6c3c793a9e7c8a5935426241affdc6fe5108c598e73db4948b3aacc77422d","target":"graph","created_at":"2026-05-18T00:17:55Z","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":"Drucker (2012) proved the following result: Unless the unlikely complexity-theoretic collapse coNP is in NP/poly occurs, there is no AND-compression for SAT. The result has implications for the compressibility and kernelizability of a whole range of NP-complete parameterized problems. We present a streamlined proof of Drucker's theorem.\n  An AND-compression is a deterministic polynomial-time algorithm that maps a set of SAT-instances $x_1,\\dots,x_t$ to a single SAT-instance $y$ of size poly(max $|x_i|$) such that $y$ is satisfiable if and only if all $x_i$ are satisfiable. The \"AND\" in the nam","authors_text":"Holger Dell","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-05-18T08:48:39Z","title":"AND-compression of NP-complete problems: Streamlined proof and minor observations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.4472","kind":"arxiv","version":2},"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:e14c13c76ff6e5496a94ec6aaa4c93fb0531db05d1aee16c615d725a331b6908","target":"record","created_at":"2026-05-18T00:17:55Z","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":"956b48a6cd273fa1081b2df4dc871782e10f03ff1afc85ad7447faebaebfe09c","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-05-18T08:48:39Z","title_canon_sha256":"c13b34aab18199c419299686d567583405b4af711e0621b8c90e793f2679b29a"},"schema_version":"1.0","source":{"id":"1405.4472","kind":"arxiv","version":2}},"canonical_sha256":"95d3afbd0f0440f9b85162020e44829a86adc256fc281db4f533ace5dc10b140","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"95d3afbd0f0440f9b85162020e44829a86adc256fc281db4f533ace5dc10b140","first_computed_at":"2026-05-18T00:17:55.606632Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:55.606632Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F+RfGE22OFLPMMyY+IBmLw52pb1pqdHAQiAJUZz+C4FPCE/r29Pc6c8RN/4LhWF6dly184LCZsKS+KMGmCnoAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:55.607111Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.4472","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e14c13c76ff6e5496a94ec6aaa4c93fb0531db05d1aee16c615d725a331b6908","sha256:f9d6c3c793a9e7c8a5935426241affdc6fe5108c598e73db4948b3aacc77422d"],"state_sha256":"994d1e1c5587068f1f66eac8ba446b937cf4ee3542aa5796deba7f79ba3bf477"}