{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:H4MLNSZ64LCHL5EVAPYNZL6DIS","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":"e38aecdc33ce257725bcf2bbee121e895c4d000576716b87a7732ac163d8e9d3","cross_cats_sorted":["cs.DM","cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-10-09T18:11:58Z","title_canon_sha256":"86cf392343d0d819abccd876f230c522dd0a3f414a68ad26c41bde098287b14b"},"schema_version":"1.0","source":{"id":"1610.02704","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.02704","created_at":"2026-05-18T00:27:02Z"},{"alias_kind":"arxiv_version","alias_value":"1610.02704v4","created_at":"2026-05-18T00:27:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.02704","created_at":"2026-05-18T00:27:02Z"},{"alias_kind":"pith_short_12","alias_value":"H4MLNSZ64LCH","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"H4MLNSZ64LCHL5EV","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"H4MLNSZ6","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:5ae79cf3da996819587304425a4ce2a08263d55c1280e1dd38255314264673f6","target":"graph","created_at":"2026-05-18T00:27:02Z","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":"We show that for constraint satisfaction problems (CSPs), sub-exponential size linear programming relaxations are as powerful as $n^{\\Omega(1)}$-rounds of the Sherali-Adams linear programming hierarchy. As a corollary, we obtain sub-exponential size lower bounds for linear programming relaxations that beat random guessing for many CSPs such as MAX-CUT and MAX-3SAT. This is a nearly-exponential improvement over previous results, previously, it was only known that linear programs of size $n^{o(\\log n)}$ cannot beat random guessing for any CSP (Chan-Lee-Raghavendra-Steurer 2013).\n  Our bounds are","authors_text":"Prasad Raghavendra, Pravesh K. Kothari, Raghu Meka","cross_cats":["cs.DM","cs.DS","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-10-09T18:11:58Z","title":"Approximating Rectangles by Juntas and Weakly-Exponential Lower Bounds for LP Relaxations of CSPs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.02704","kind":"arxiv","version":4},"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:848e34f4e122e1e3568124ee844d807c9b82189a9b1d930a7ee282fefee9dbb4","target":"record","created_at":"2026-05-18T00:27:02Z","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":"e38aecdc33ce257725bcf2bbee121e895c4d000576716b87a7732ac163d8e9d3","cross_cats_sorted":["cs.DM","cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-10-09T18:11:58Z","title_canon_sha256":"86cf392343d0d819abccd876f230c522dd0a3f414a68ad26c41bde098287b14b"},"schema_version":"1.0","source":{"id":"1610.02704","kind":"arxiv","version":4}},"canonical_sha256":"3f18b6cb3ee2c475f49503f0dcafc344b896fa99d32f22811e0a48539d0e3a22","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3f18b6cb3ee2c475f49503f0dcafc344b896fa99d32f22811e0a48539d0e3a22","first_computed_at":"2026-05-18T00:27:02.880983Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:02.880983Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RYx1j+aIuOKzHOa5UjVJBf9tqbmi8vJKcf5sv9D512uFyB8AuRCCSGSH52SjjyOkUKRj9bjmzcPQdmY+BrQzBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:02.881642Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.02704","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:848e34f4e122e1e3568124ee844d807c9b82189a9b1d930a7ee282fefee9dbb4","sha256:5ae79cf3da996819587304425a4ce2a08263d55c1280e1dd38255314264673f6"],"state_sha256":"821f166e02de74d0c76ef1a118cac794d14729ca6f84bdedfe7090e286e2a2df"}