{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:H4MLNSZ64LCHL5EVAPYNZL6DIS","short_pith_number":"pith:H4MLNSZ6","schema_version":"1.0","canonical_sha256":"3f18b6cb3ee2c475f49503f0dcafc344b896fa99d32f22811e0a48539d0e3a22","source":{"kind":"arxiv","id":"1610.02704","version":4},"attestation_state":"computed","paper":{"title":"Approximating Rectangles by Juntas and Weakly-Exponential Lower Bounds for LP Relaxations of CSPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS","math.CO"],"primary_cat":"cs.CC","authors_text":"Prasad Raghavendra, Pravesh K. Kothari, Raghu Meka","submitted_at":"2016-10-09T18:11:58Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1610.02704","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-10-09T18:11:58Z","cross_cats_sorted":["cs.DM","cs.DS","math.CO"],"title_canon_sha256":"86cf392343d0d819abccd876f230c522dd0a3f414a68ad26c41bde098287b14b","abstract_canon_sha256":"e38aecdc33ce257725bcf2bbee121e895c4d000576716b87a7732ac163d8e9d3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:02.881642Z","signature_b64":"RYx1j+aIuOKzHOa5UjVJBf9tqbmi8vJKcf5sv9D512uFyB8AuRCCSGSH52SjjyOkUKRj9bjmzcPQdmY+BrQzBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f18b6cb3ee2c475f49503f0dcafc344b896fa99d32f22811e0a48539d0e3a22","last_reissued_at":"2026-05-18T00:27:02.880983Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:02.880983Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximating Rectangles by Juntas and Weakly-Exponential Lower Bounds for LP Relaxations of CSPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS","math.CO"],"primary_cat":"cs.CC","authors_text":"Prasad Raghavendra, Pravesh K. Kothari, Raghu Meka","submitted_at":"2016-10-09T18:11:58Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.02704","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1610.02704","created_at":"2026-05-18T00:27:02.881080+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.02704v4","created_at":"2026-05-18T00:27:02.881080+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.02704","created_at":"2026-05-18T00:27:02.881080+00:00"},{"alias_kind":"pith_short_12","alias_value":"H4MLNSZ64LCH","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"H4MLNSZ64LCHL5EV","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"H4MLNSZ6","created_at":"2026-05-18T12:30:19.053100+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/H4MLNSZ64LCHL5EVAPYNZL6DIS","json":"https://pith.science/pith/H4MLNSZ64LCHL5EVAPYNZL6DIS.json","graph_json":"https://pith.science/api/pith-number/H4MLNSZ64LCHL5EVAPYNZL6DIS/graph.json","events_json":"https://pith.science/api/pith-number/H4MLNSZ64LCHL5EVAPYNZL6DIS/events.json","paper":"https://pith.science/paper/H4MLNSZ6"},"agent_actions":{"view_html":"https://pith.science/pith/H4MLNSZ64LCHL5EVAPYNZL6DIS","download_json":"https://pith.science/pith/H4MLNSZ64LCHL5EVAPYNZL6DIS.json","view_paper":"https://pith.science/paper/H4MLNSZ6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.02704&json=true","fetch_graph":"https://pith.science/api/pith-number/H4MLNSZ64LCHL5EVAPYNZL6DIS/graph.json","fetch_events":"https://pith.science/api/pith-number/H4MLNSZ64LCHL5EVAPYNZL6DIS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H4MLNSZ64LCHL5EVAPYNZL6DIS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H4MLNSZ64LCHL5EVAPYNZL6DIS/action/storage_attestation","attest_author":"https://pith.science/pith/H4MLNSZ64LCHL5EVAPYNZL6DIS/action/author_attestation","sign_citation":"https://pith.science/pith/H4MLNSZ64LCHL5EVAPYNZL6DIS/action/citation_signature","submit_replication":"https://pith.science/pith/H4MLNSZ64LCHL5EVAPYNZL6DIS/action/replication_record"}},"created_at":"2026-05-18T00:27:02.881080+00:00","updated_at":"2026-05-18T00:27:02.881080+00:00"}