{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:MECVEQCRPAJRI5UQUO27T3KOVF","short_pith_number":"pith:MECVEQCR","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"},"canonical_sha256":"61055240517813147690a3b5f9ed4ea9409110354a71dbcbf80bf413ff2fde2b","source":{"kind":"arxiv","id":"1309.0563","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.0563","created_at":"2026-05-18T01:21:14Z"},{"alias_kind":"arxiv_version","alias_value":"1309.0563v3","created_at":"2026-05-18T01:21:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.0563","created_at":"2026-05-18T01:21:14Z"},{"alias_kind":"pith_short_12","alias_value":"MECVEQCRPAJR","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MECVEQCRPAJRI5UQ","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MECVEQCR","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:MECVEQCRPAJRI5UQUO27T3KOVF","target":"record","payload":{"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"},"canonical_sha256":"61055240517813147690a3b5f9ed4ea9409110354a71dbcbf80bf413ff2fde2b","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"},"source_kind":"arxiv","source_id":"1309.0563","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:21:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HLTgAJ8EHwV9oW1SpDZGPSxgaL7zABDRSiRPnqhESZnSm+9zKoG95xr5tqfnX7EomVPSqGIJiCWinPGbxCiUAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:58:39.500974Z"},"content_sha256":"47b368f909641fb2f9b87765c8bfaccc6e1085bb88a22a57af118ace5ab03084","schema_version":"1.0","event_id":"sha256:47b368f909641fb2f9b87765c8bfaccc6e1085bb88a22a57af118ace5ab03084"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:MECVEQCRPAJRI5UQUO27T3KOVF","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:21:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rCwa3Jh8oS74BArQvxkpTD4p8Qc1D0xgxAYDeUMTNYJEnz7NxH5smQOelf/lMtgTHLjeXomAHOQJ/z4OxsqzAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:58:39.501706Z"},"content_sha256":"0d8def00bec6b75256060bcb89e00d0b74c413908e90ba8901c1c1b80da08d40","schema_version":"1.0","event_id":"sha256:0d8def00bec6b75256060bcb89e00d0b74c413908e90ba8901c1c1b80da08d40"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MECVEQCRPAJRI5UQUO27T3KOVF/bundle.json","state_url":"https://pith.science/pith/MECVEQCRPAJRI5UQUO27T3KOVF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MECVEQCRPAJRI5UQUO27T3KOVF/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-09T06:58:39Z","links":{"resolver":"https://pith.science/pith/MECVEQCRPAJRI5UQUO27T3KOVF","bundle":"https://pith.science/pith/MECVEQCRPAJRI5UQUO27T3KOVF/bundle.json","state":"https://pith.science/pith/MECVEQCRPAJRI5UQUO27T3KOVF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MECVEQCRPAJRI5UQUO27T3KOVF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MECVEQCRPAJRI5UQUO27T3KOVF","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":"69045682301010c67b629fd5073884a25cdf4dfec62c7d0428244b8845e95164","cross_cats_sorted":["cs.DS","math.CO","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-09-03T00:30:03Z","title_canon_sha256":"f66532f7ca21d7db784b2af6b85cc20ba3bf187e5cccdfa7933c1f7a920a6f7c"},"schema_version":"1.0","source":{"id":"1309.0563","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.0563","created_at":"2026-05-18T01:21:14Z"},{"alias_kind":"arxiv_version","alias_value":"1309.0563v3","created_at":"2026-05-18T01:21:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.0563","created_at":"2026-05-18T01:21:14Z"},{"alias_kind":"pith_short_12","alias_value":"MECVEQCRPAJR","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MECVEQCRPAJRI5UQ","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MECVEQCR","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:0d8def00bec6b75256060bcb89e00d0b74c413908e90ba8901c1c1b80da08d40","target":"graph","created_at":"2026-05-18T01:21:14Z","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 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.","authors_text":"David Steurer, James R. Lee, Prasad Raghavendra, Siu On Chan","cross_cats":["cs.DS","math.CO","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-09-03T00:30:03Z","title":"Approximate Constraint Satisfaction Requires Large LP Relaxations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.0563","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:47b368f909641fb2f9b87765c8bfaccc6e1085bb88a22a57af118ace5ab03084","target":"record","created_at":"2026-05-18T01:21:14Z","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":"69045682301010c67b629fd5073884a25cdf4dfec62c7d0428244b8845e95164","cross_cats_sorted":["cs.DS","math.CO","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-09-03T00:30:03Z","title_canon_sha256":"f66532f7ca21d7db784b2af6b85cc20ba3bf187e5cccdfa7933c1f7a920a6f7c"},"schema_version":"1.0","source":{"id":"1309.0563","kind":"arxiv","version":3}},"canonical_sha256":"61055240517813147690a3b5f9ed4ea9409110354a71dbcbf80bf413ff2fde2b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"61055240517813147690a3b5f9ed4ea9409110354a71dbcbf80bf413ff2fde2b","first_computed_at":"2026-05-18T01:21:14.029443Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:14.029443Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"okkJGbHlpPZPuMOJJ6bK0FKPqq+SFGSuVZwjMho51hDq9q3hhbB62vd91x9NDo+bhEcA6ZlrsvgPOf9U8ihpDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:14.030082Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.0563","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:47b368f909641fb2f9b87765c8bfaccc6e1085bb88a22a57af118ace5ab03084","sha256:0d8def00bec6b75256060bcb89e00d0b74c413908e90ba8901c1c1b80da08d40"],"state_sha256":"b81ccd903545404e2cc06f17b221172a2104e9616b85a5cb6d5b08357fcc4e01"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eIknk/C0VEzoWRd+8AmdF2WBbUSN3EErHFccNNiz0oCIxadZuZiwOHjpsIyO5WRbvLtQiOL0cgTGwGH/vEf/Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T06:58:39.506251Z","bundle_sha256":"c70d676fc0ff46a1710bcb197ec05caf5128b2bb1295e99f5d717aa9a4d5975a"}}