{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:2WGMS226EEQKW7YYTCIAOMHNT3","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":"0600f2cc3c931ade34c270a85aa38a4fb352ced1868de4d03712d33b81314b9f","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-02-23T18:34:38Z","title_canon_sha256":"f7941d88815593af819a5070315de5897c58ffd7e39bb89253660727eed7fd6d"},"schema_version":"1.0","source":{"id":"1402.5950","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.5950","created_at":"2026-05-18T02:54:22Z"},{"alias_kind":"arxiv_version","alias_value":"1402.5950v2","created_at":"2026-05-18T02:54:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.5950","created_at":"2026-05-18T02:54:22Z"},{"alias_kind":"pith_short_12","alias_value":"2WGMS226EEQK","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2WGMS226EEQKW7YY","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2WGMS226","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:4e4fcb24b194c3411a651e1683363463ef76800def96d3d72b51699e8ad066ef","target":"graph","created_at":"2026-05-18T02:54:22Z","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":"In this paper we propose a generalization of the extension complexity of a polyhedron $Q$. On the one hand it is general enough so that all problems in $P$ can be formulated as linear programs with polynomial size extension complexity. On the other hand it still allows non-polynomial lower bounds to be proved for $NP$-hard problems independently of whether or not $P=NP$. The generalization, called $H$-free extension complexity, allows for a set of valid inequalities $H$ to be excluded in computing the extension complexity of $Q$. We give results on the $H$-free extension complexity of hard mat","authors_text":"David Avis, Hans Raj Tiwary","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-02-23T18:34:38Z","title":"A generalization of extension complexity that captures $P$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.5950","kind":"arxiv","version":2},"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:eee79878a51836e94e17eb7745bca9f087f7b17752b785998158194c9337c645","target":"record","created_at":"2026-05-18T02:54:22Z","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":"0600f2cc3c931ade34c270a85aa38a4fb352ced1868de4d03712d33b81314b9f","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-02-23T18:34:38Z","title_canon_sha256":"f7941d88815593af819a5070315de5897c58ffd7e39bb89253660727eed7fd6d"},"schema_version":"1.0","source":{"id":"1402.5950","kind":"arxiv","version":2}},"canonical_sha256":"d58cc96b5e2120ab7f1898900730ed9efbc5c4b1b73a601a9c6716fa4f944832","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d58cc96b5e2120ab7f1898900730ed9efbc5c4b1b73a601a9c6716fa4f944832","first_computed_at":"2026-05-18T02:54:22.261463Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:54:22.261463Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mbrhsuwZ/MmXsLP4nsOsIo8VEX7to9hIDI7H0FieyUPqBmDM9eXCTv9psj1e/d+704VF9cGDqVodvhSmD3DRDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:54:22.261884Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.5950","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eee79878a51836e94e17eb7745bca9f087f7b17752b785998158194c9337c645","sha256:4e4fcb24b194c3411a651e1683363463ef76800def96d3d72b51699e8ad066ef"],"state_sha256":"f0a1ab3d20f83f4cbe4aa005aea66a9766535c8557ff5bed2da21027aa57efab"}