{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:GT2UAMHEP547O4PY5QE2S3WYFE","short_pith_number":"pith:GT2UAMHE","schema_version":"1.0","canonical_sha256":"34f54030e47f79f771f8ec09a96ed8291ab050eaa0e30a3987ad044c86bf45bf","source":{"kind":"arxiv","id":"1204.0957","version":3},"attestation_state":"computed","paper":{"title":"Approximation Limits of Linear Programs (Beyond Hierarchies)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"David Steurer, G\\'abor Braun, Samuel Fiorini, Sebastian Pokutta","submitted_at":"2012-04-04T14:14:34Z","abstract_excerpt":"We develop a framework for approximation limits of polynomial-size linear programs from lower bounds on the nonnegative ranks of suitably defined matrices. This framework yields unconditional impossibility results that are applicable to any linear program as opposed to only programs generated by hierarchies. Using our framework, we prove that O(n^{1/2-eps})-approximations for CLIQUE require linear programs of size 2^{n^\\Omega(eps)}. (This lower bound applies to linear programs using a certain encoding of CLIQUE as a linear optimization problem.) Moreover, we establish a similar result for appr"},"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":"1204.0957","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-04-04T14:14:34Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"d8309603c4a6083dbf882e51c4d452d39a9c4c9e22993c25c4d3099161de8116","abstract_canon_sha256":"2355d787e32b6d7847a4b548f5315d9fef18523c33120e8329c6d7137a9d3ad7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:42.605601Z","signature_b64":"u+7wvmMKeCpDyFxHPhJQYZVDHHvvLWfQGtLLcm0ORa4YvZe7nvv2KJsmGoRsb3p6H0jMUBqg11O2SpEDThXnBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34f54030e47f79f771f8ec09a96ed8291ab050eaa0e30a3987ad044c86bf45bf","last_reissued_at":"2026-05-18T02:51:42.605096Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:42.605096Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximation Limits of Linear Programs (Beyond Hierarchies)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"David Steurer, G\\'abor Braun, Samuel Fiorini, Sebastian Pokutta","submitted_at":"2012-04-04T14:14:34Z","abstract_excerpt":"We develop a framework for approximation limits of polynomial-size linear programs from lower bounds on the nonnegative ranks of suitably defined matrices. This framework yields unconditional impossibility results that are applicable to any linear program as opposed to only programs generated by hierarchies. Using our framework, we prove that O(n^{1/2-eps})-approximations for CLIQUE require linear programs of size 2^{n^\\Omega(eps)}. (This lower bound applies to linear programs using a certain encoding of CLIQUE as a linear optimization problem.) Moreover, we establish a similar result for appr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.0957","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":"1204.0957","created_at":"2026-05-18T02:51:42.605173+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.0957v3","created_at":"2026-05-18T02:51:42.605173+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.0957","created_at":"2026-05-18T02:51:42.605173+00:00"},{"alias_kind":"pith_short_12","alias_value":"GT2UAMHEP547","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_16","alias_value":"GT2UAMHEP547O4PY","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_8","alias_value":"GT2UAMHE","created_at":"2026-05-18T12:27:06.952714+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/GT2UAMHEP547O4PY5QE2S3WYFE","json":"https://pith.science/pith/GT2UAMHEP547O4PY5QE2S3WYFE.json","graph_json":"https://pith.science/api/pith-number/GT2UAMHEP547O4PY5QE2S3WYFE/graph.json","events_json":"https://pith.science/api/pith-number/GT2UAMHEP547O4PY5QE2S3WYFE/events.json","paper":"https://pith.science/paper/GT2UAMHE"},"agent_actions":{"view_html":"https://pith.science/pith/GT2UAMHEP547O4PY5QE2S3WYFE","download_json":"https://pith.science/pith/GT2UAMHEP547O4PY5QE2S3WYFE.json","view_paper":"https://pith.science/paper/GT2UAMHE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.0957&json=true","fetch_graph":"https://pith.science/api/pith-number/GT2UAMHEP547O4PY5QE2S3WYFE/graph.json","fetch_events":"https://pith.science/api/pith-number/GT2UAMHEP547O4PY5QE2S3WYFE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GT2UAMHEP547O4PY5QE2S3WYFE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GT2UAMHEP547O4PY5QE2S3WYFE/action/storage_attestation","attest_author":"https://pith.science/pith/GT2UAMHEP547O4PY5QE2S3WYFE/action/author_attestation","sign_citation":"https://pith.science/pith/GT2UAMHEP547O4PY5QE2S3WYFE/action/citation_signature","submit_replication":"https://pith.science/pith/GT2UAMHEP547O4PY5QE2S3WYFE/action/replication_record"}},"created_at":"2026-05-18T02:51:42.605173+00:00","updated_at":"2026-05-18T02:51:42.605173+00:00"}