{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:S3FQUEUBBL5ZR4NQARAP6PHB6O","short_pith_number":"pith:S3FQUEUB","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"},"canonical_sha256":"96cb0a12810afb98f1b00440ff3ce1f381a6bcab268fcc6c59c57c41dcb98cb4","source":{"kind":"arxiv","id":"1302.2340","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.2340","created_at":"2026-05-18T03:27:00Z"},{"alias_kind":"arxiv_version","alias_value":"1302.2340v2","created_at":"2026-05-18T03:27:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.2340","created_at":"2026-05-18T03:27:00Z"},{"alias_kind":"pith_short_12","alias_value":"S3FQUEUBBL5Z","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"S3FQUEUBBL5ZR4NQ","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"S3FQUEUB","created_at":"2026-05-18T12:27:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:S3FQUEUBBL5ZR4NQARAP6PHB6O","target":"record","payload":{"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"},"canonical_sha256":"96cb0a12810afb98f1b00440ff3ce1f381a6bcab268fcc6c59c57c41dcb98cb4","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"},"source_kind":"arxiv","source_id":"1302.2340","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-18T03:27:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DB0CNJvkrqfMsKXKzhel9ulMJrLmiVnLLS/M5DesqacMlVFJIZKomJ6NcaZJkr/uYgVgBo/Z2bBeOS42HE3zBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:10:40.880653Z"},"content_sha256":"ccd8e74a7bd63de6bb43eba34cf637fe52186acfa4ba63e703fa944525380f87","schema_version":"1.0","event_id":"sha256:ccd8e74a7bd63de6bb43eba34cf637fe52186acfa4ba63e703fa944525380f87"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:S3FQUEUBBL5ZR4NQARAP6PHB6O","target":"graph","payload":{"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"},"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-18T03:27:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o0hqZwmfDnlSFoaWoEYInDFtWSznHKZVa8eWp4I8SDz3WiwkpIdvOHfdQkErY0DsQmQikTCkWYe+4ooBg27OCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:10:40.881004Z"},"content_sha256":"d67baa5f45f193f046e315faffc23ded8850ea1dcb28c108ebc9699e2784b4b9","schema_version":"1.0","event_id":"sha256:d67baa5f45f193f046e315faffc23ded8850ea1dcb28c108ebc9699e2784b4b9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S3FQUEUBBL5ZR4NQARAP6PHB6O/bundle.json","state_url":"https://pith.science/pith/S3FQUEUBBL5ZR4NQARAP6PHB6O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S3FQUEUBBL5ZR4NQARAP6PHB6O/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-01T19:10:40Z","links":{"resolver":"https://pith.science/pith/S3FQUEUBBL5ZR4NQARAP6PHB6O","bundle":"https://pith.science/pith/S3FQUEUBBL5ZR4NQARAP6PHB6O/bundle.json","state":"https://pith.science/pith/S3FQUEUBBL5ZR4NQARAP6PHB6O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S3FQUEUBBL5ZR4NQARAP6PHB6O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:S3FQUEUBBL5ZR4NQARAP6PHB6O","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":"9941db367b193124878a51bb190ea2f0209ce619288a0d9b82a093af4fe438a9","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-10T15:42:06Z","title_canon_sha256":"b74514812553b16514155467fcefc0f5ea5996708d4cb6582ec21b06ebe32d73"},"schema_version":"1.0","source":{"id":"1302.2340","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.2340","created_at":"2026-05-18T03:27:00Z"},{"alias_kind":"arxiv_version","alias_value":"1302.2340v2","created_at":"2026-05-18T03:27:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.2340","created_at":"2026-05-18T03:27:00Z"},{"alias_kind":"pith_short_12","alias_value":"S3FQUEUBBL5Z","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"S3FQUEUBBL5ZR4NQ","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"S3FQUEUB","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:d67baa5f45f193f046e315faffc23ded8850ea1dcb28c108ebc9699e2784b4b9","target":"graph","created_at":"2026-05-18T03:27:00Z","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 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","authors_text":"David Avis, Hans Raj Tiwary","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-10T15:42:06Z","title":"On the extension complexity of combinatorial polytopes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.2340","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:ccd8e74a7bd63de6bb43eba34cf637fe52186acfa4ba63e703fa944525380f87","target":"record","created_at":"2026-05-18T03:27:00Z","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":"9941db367b193124878a51bb190ea2f0209ce619288a0d9b82a093af4fe438a9","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-10T15:42:06Z","title_canon_sha256":"b74514812553b16514155467fcefc0f5ea5996708d4cb6582ec21b06ebe32d73"},"schema_version":"1.0","source":{"id":"1302.2340","kind":"arxiv","version":2}},"canonical_sha256":"96cb0a12810afb98f1b00440ff3ce1f381a6bcab268fcc6c59c57c41dcb98cb4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"96cb0a12810afb98f1b00440ff3ce1f381a6bcab268fcc6c59c57c41dcb98cb4","first_computed_at":"2026-05-18T03:27:00.997430Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:27:00.997430Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zX2yGC60mt+VQJLh5ccf6slfqxPxIA7SI0YFr1ktTa+d+D1PMw/LNIYzgjc5fslTg1tIN3/4qYqdy4nuhSW2Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:27:00.998201Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.2340","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ccd8e74a7bd63de6bb43eba34cf637fe52186acfa4ba63e703fa944525380f87","sha256:d67baa5f45f193f046e315faffc23ded8850ea1dcb28c108ebc9699e2784b4b9"],"state_sha256":"e70d3e1d60c911c008b52aa84f3c19557e189876dac13448f7e11674eccd3551"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j7PUHaEJb0/r5sMGDsTGMJiJ9LOmRlIIgFRdDPZFQxZ7ETQ/pXLOSMWWvV9MkOsi1GoiMemidQAEx97k7Y7CCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T19:10:40.882979Z","bundle_sha256":"df9a5a3f23bcb9d13bee22eab781c4c6048b553e902d61023755f2c6c7626d45"}}