{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:S3FQUEUBBL5ZR4NQARAP6PHB6O","short_pith_number":"pith:S3FQUEUB","schema_version":"1.0","canonical_sha256":"96cb0a12810afb98f1b00440ff3ce1f381a6bcab268fcc6c59c57c41dcb98cb4","source":{"kind":"arxiv","id":"1302.2340","version":2},"attestation_state":"computed","paper":{"title":"On the extension complexity of combinatorial polytopes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.CO","authors_text":"David Avis, Hans Raj Tiwary","submitted_at":"2013-02-10T15:42:06Z","abstract_excerpt":"In this paper we extend recent results of Fiorini et al. on the extension complexity of the cut polytope and related polyhedra. We first describe a lifting argument to show exponential extension complexity for a number of NP-complete problems including subset-sum and three dimensional matching. We then obtain a relationship between the extension complexity of the cut polytope of a graph and that of its graph minors. Using this we are able to show exponential extension complexity for the cut polytope of a large number of graphs, including those used in quantum information and suspensions of cub"},"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":"1302.2340","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-10T15:42:06Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"b74514812553b16514155467fcefc0f5ea5996708d4cb6582ec21b06ebe32d73","abstract_canon_sha256":"9941db367b193124878a51bb190ea2f0209ce619288a0d9b82a093af4fe438a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:00.998201Z","signature_b64":"zX2yGC60mt+VQJLh5ccf6slfqxPxIA7SI0YFr1ktTa+d+D1PMw/LNIYzgjc5fslTg1tIN3/4qYqdy4nuhSW2Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96cb0a12810afb98f1b00440ff3ce1f381a6bcab268fcc6c59c57c41dcb98cb4","last_reissued_at":"2026-05-18T03:27:00.997430Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:00.997430Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the extension complexity of combinatorial polytopes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.CO","authors_text":"David Avis, Hans Raj Tiwary","submitted_at":"2013-02-10T15:42:06Z","abstract_excerpt":"In this paper we extend recent results of Fiorini et al. on the extension complexity of the cut polytope and related polyhedra. We first describe a lifting argument to show exponential extension complexity for a number of NP-complete problems including subset-sum and three dimensional matching. We then obtain a relationship between the extension complexity of the cut polytope of a graph and that of its graph minors. Using this we are able to show exponential extension complexity for the cut polytope of a large number of graphs, including those used in quantum information and suspensions of cub"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.2340","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1302.2340","created_at":"2026-05-18T03:27:00.997541+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.2340v2","created_at":"2026-05-18T03:27:00.997541+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.2340","created_at":"2026-05-18T03:27:00.997541+00:00"},{"alias_kind":"pith_short_12","alias_value":"S3FQUEUBBL5Z","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"S3FQUEUBBL5ZR4NQ","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"S3FQUEUB","created_at":"2026-05-18T12:27:59.945178+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/S3FQUEUBBL5ZR4NQARAP6PHB6O","json":"https://pith.science/pith/S3FQUEUBBL5ZR4NQARAP6PHB6O.json","graph_json":"https://pith.science/api/pith-number/S3FQUEUBBL5ZR4NQARAP6PHB6O/graph.json","events_json":"https://pith.science/api/pith-number/S3FQUEUBBL5ZR4NQARAP6PHB6O/events.json","paper":"https://pith.science/paper/S3FQUEUB"},"agent_actions":{"view_html":"https://pith.science/pith/S3FQUEUBBL5ZR4NQARAP6PHB6O","download_json":"https://pith.science/pith/S3FQUEUBBL5ZR4NQARAP6PHB6O.json","view_paper":"https://pith.science/paper/S3FQUEUB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.2340&json=true","fetch_graph":"https://pith.science/api/pith-number/S3FQUEUBBL5ZR4NQARAP6PHB6O/graph.json","fetch_events":"https://pith.science/api/pith-number/S3FQUEUBBL5ZR4NQARAP6PHB6O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S3FQUEUBBL5ZR4NQARAP6PHB6O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S3FQUEUBBL5ZR4NQARAP6PHB6O/action/storage_attestation","attest_author":"https://pith.science/pith/S3FQUEUBBL5ZR4NQARAP6PHB6O/action/author_attestation","sign_citation":"https://pith.science/pith/S3FQUEUBBL5ZR4NQARAP6PHB6O/action/citation_signature","submit_replication":"https://pith.science/pith/S3FQUEUBBL5ZR4NQARAP6PHB6O/action/replication_record"}},"created_at":"2026-05-18T03:27:00.997541+00:00","updated_at":"2026-05-18T03:27:00.997541+00:00"}