{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:MECVEQCRPAJRI5UQUO27T3KOVF","short_pith_number":"pith:MECVEQCR","schema_version":"1.0","canonical_sha256":"61055240517813147690a3b5f9ed4ea9409110354a71dbcbf80bf413ff2fde2b","source":{"kind":"arxiv","id":"1309.0563","version":3},"attestation_state":"computed","paper":{"title":"Approximate Constraint Satisfaction Requires Large LP Relaxations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO","math.OC"],"primary_cat":"cs.CC","authors_text":"David Steurer, James R. Lee, Prasad Raghavendra, Siu On Chan","submitted_at":"2013-09-03T00:30:03Z","abstract_excerpt":"We prove super-polynomial lower bounds on the size of linear programming relaxations for approximation versions of constraint satisfaction problems. We show that for these problems, polynomial-sized linear programs are exactly as powerful as programs arising from a constant number of rounds of the Sherali-Adams hierarchy.\n  In particular, any polynomial-sized linear program for Max Cut has an integrality gap of 1/2 and any such linear program for Max 3-Sat has an integrality gap of 7/8."},"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":"1309.0563","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-09-03T00:30:03Z","cross_cats_sorted":["cs.DS","math.CO","math.OC"],"title_canon_sha256":"f66532f7ca21d7db784b2af6b85cc20ba3bf187e5cccdfa7933c1f7a920a6f7c","abstract_canon_sha256":"69045682301010c67b629fd5073884a25cdf4dfec62c7d0428244b8845e95164"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:14.030082Z","signature_b64":"okkJGbHlpPZPuMOJJ6bK0FKPqq+SFGSuVZwjMho51hDq9q3hhbB62vd91x9NDo+bhEcA6ZlrsvgPOf9U8ihpDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61055240517813147690a3b5f9ed4ea9409110354a71dbcbf80bf413ff2fde2b","last_reissued_at":"2026-05-18T01:21:14.029443Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:14.029443Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate Constraint Satisfaction Requires Large LP Relaxations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO","math.OC"],"primary_cat":"cs.CC","authors_text":"David Steurer, James R. Lee, Prasad Raghavendra, Siu On Chan","submitted_at":"2013-09-03T00:30:03Z","abstract_excerpt":"We prove super-polynomial lower bounds on the size of linear programming relaxations for approximation versions of constraint satisfaction problems. We show that for these problems, polynomial-sized linear programs are exactly as powerful as programs arising from a constant number of rounds of the Sherali-Adams hierarchy.\n  In particular, any polynomial-sized linear program for Max Cut has an integrality gap of 1/2 and any such linear program for Max 3-Sat has an integrality gap of 7/8."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.0563","kind":"arxiv","version":3},"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":"1309.0563","created_at":"2026-05-18T01:21:14.029531+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.0563v3","created_at":"2026-05-18T01:21:14.029531+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.0563","created_at":"2026-05-18T01:21:14.029531+00:00"},{"alias_kind":"pith_short_12","alias_value":"MECVEQCRPAJR","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"MECVEQCRPAJRI5UQ","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"MECVEQCR","created_at":"2026-05-18T12:27:52.871228+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/MECVEQCRPAJRI5UQUO27T3KOVF","json":"https://pith.science/pith/MECVEQCRPAJRI5UQUO27T3KOVF.json","graph_json":"https://pith.science/api/pith-number/MECVEQCRPAJRI5UQUO27T3KOVF/graph.json","events_json":"https://pith.science/api/pith-number/MECVEQCRPAJRI5UQUO27T3KOVF/events.json","paper":"https://pith.science/paper/MECVEQCR"},"agent_actions":{"view_html":"https://pith.science/pith/MECVEQCRPAJRI5UQUO27T3KOVF","download_json":"https://pith.science/pith/MECVEQCRPAJRI5UQUO27T3KOVF.json","view_paper":"https://pith.science/paper/MECVEQCR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.0563&json=true","fetch_graph":"https://pith.science/api/pith-number/MECVEQCRPAJRI5UQUO27T3KOVF/graph.json","fetch_events":"https://pith.science/api/pith-number/MECVEQCRPAJRI5UQUO27T3KOVF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MECVEQCRPAJRI5UQUO27T3KOVF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MECVEQCRPAJRI5UQUO27T3KOVF/action/storage_attestation","attest_author":"https://pith.science/pith/MECVEQCRPAJRI5UQUO27T3KOVF/action/author_attestation","sign_citation":"https://pith.science/pith/MECVEQCRPAJRI5UQUO27T3KOVF/action/citation_signature","submit_replication":"https://pith.science/pith/MECVEQCRPAJRI5UQUO27T3KOVF/action/replication_record"}},"created_at":"2026-05-18T01:21:14.029531+00:00","updated_at":"2026-05-18T01:21:14.029531+00:00"}