{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:2WGMS226EEQKW7YYTCIAOMHNT3","short_pith_number":"pith:2WGMS226","canonical_record":{"source":{"id":"1402.5950","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-02-23T18:34:38Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"f7941d88815593af819a5070315de5897c58ffd7e39bb89253660727eed7fd6d","abstract_canon_sha256":"0600f2cc3c931ade34c270a85aa38a4fb352ced1868de4d03712d33b81314b9f"},"schema_version":"1.0"},"canonical_sha256":"d58cc96b5e2120ab7f1898900730ed9efbc5c4b1b73a601a9c6716fa4f944832","source":{"kind":"arxiv","id":"1402.5950","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:2WGMS226EEQKW7YYTCIAOMHNT3","target":"record","payload":{"canonical_record":{"source":{"id":"1402.5950","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-02-23T18:34:38Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"f7941d88815593af819a5070315de5897c58ffd7e39bb89253660727eed7fd6d","abstract_canon_sha256":"0600f2cc3c931ade34c270a85aa38a4fb352ced1868de4d03712d33b81314b9f"},"schema_version":"1.0"},"canonical_sha256":"d58cc96b5e2120ab7f1898900730ed9efbc5c4b1b73a601a9c6716fa4f944832","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:22.261884Z","signature_b64":"mbrhsuwZ/MmXsLP4nsOsIo8VEX7to9hIDI7H0FieyUPqBmDM9eXCTv9psj1e/d+704VF9cGDqVodvhSmD3DRDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d58cc96b5e2120ab7f1898900730ed9efbc5c4b1b73a601a9c6716fa4f944832","last_reissued_at":"2026-05-18T02:54:22.261463Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:22.261463Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.5950","source_version":2,"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-18T02:54:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BcgLoeFd1dfjifr2wfMuUH0tZiip5Ail+dDIEwzoFvBv0KA0JHuTqNKsh8Yn3pgf2gABLx4+XYjXp2GzzGP+Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:42:43.166987Z"},"content_sha256":"eee79878a51836e94e17eb7745bca9f087f7b17752b785998158194c9337c645","schema_version":"1.0","event_id":"sha256:eee79878a51836e94e17eb7745bca9f087f7b17752b785998158194c9337c645"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:2WGMS226EEQKW7YYTCIAOMHNT3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A generalization of extension complexity that captures $P$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"David Avis, Hans Raj Tiwary","submitted_at":"2014-02-23T18:34:38Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.5950","kind":"arxiv","version":2},"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-18T02:54:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BnpCsv7cMKxDJpbD6+11OdGU3OiJTFCezz6P9ikF5pIpYOSfhYHu1CwmspqjTvZ9uRqumGP/g/5wTYaq3iKuCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:42:43.167349Z"},"content_sha256":"4e4fcb24b194c3411a651e1683363463ef76800def96d3d72b51699e8ad066ef","schema_version":"1.0","event_id":"sha256:4e4fcb24b194c3411a651e1683363463ef76800def96d3d72b51699e8ad066ef"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2WGMS226EEQKW7YYTCIAOMHNT3/bundle.json","state_url":"https://pith.science/pith/2WGMS226EEQKW7YYTCIAOMHNT3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2WGMS226EEQKW7YYTCIAOMHNT3/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-01T20:42:43Z","links":{"resolver":"https://pith.science/pith/2WGMS226EEQKW7YYTCIAOMHNT3","bundle":"https://pith.science/pith/2WGMS226EEQKW7YYTCIAOMHNT3/bundle.json","state":"https://pith.science/pith/2WGMS226EEQKW7YYTCIAOMHNT3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2WGMS226EEQKW7YYTCIAOMHNT3/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Blj2HZYV5jLmKV4DlaE0WoSth/80m+sDINTkp1aahkShN+/oHnTyS8OXXw+2jhNSTS9qSG59rZPEt3RFBp+bDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T20:42:43.169447Z","bundle_sha256":"cb5dadb53bd33f39111edcc85bb67578ef09149b279cf3912a5163a2af6fca3c"}}