{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:7LQVFWU2ZLNRWIK56ESG7BO46K","short_pith_number":"pith:7LQVFWU2","canonical_record":{"source":{"id":"1410.1150","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-10-05T12:03:08Z","cross_cats_sorted":[],"title_canon_sha256":"570cc6cb03acb368fe75bcc66ecdf883ad119bc846dc793ffcbcd8cb92cea785","abstract_canon_sha256":"fdfb3db409cbeb7332f9b02dbb8a041b28699b20bf1494d5d41086d07c5c808d"},"schema_version":"1.0"},"canonical_sha256":"fae152da9acadb1b215df1246f85dcf29c23984151a9c838f33a62470acee29c","source":{"kind":"arxiv","id":"1410.1150","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.1150","created_at":"2026-05-18T02:30:17Z"},{"alias_kind":"arxiv_version","alias_value":"1410.1150v2","created_at":"2026-05-18T02:30:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.1150","created_at":"2026-05-18T02:30:17Z"},{"alias_kind":"pith_short_12","alias_value":"7LQVFWU2ZLNR","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"7LQVFWU2ZLNRWIK5","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"7LQVFWU2","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:7LQVFWU2ZLNRWIK56ESG7BO46K","target":"record","payload":{"canonical_record":{"source":{"id":"1410.1150","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-10-05T12:03:08Z","cross_cats_sorted":[],"title_canon_sha256":"570cc6cb03acb368fe75bcc66ecdf883ad119bc846dc793ffcbcd8cb92cea785","abstract_canon_sha256":"fdfb3db409cbeb7332f9b02dbb8a041b28699b20bf1494d5d41086d07c5c808d"},"schema_version":"1.0"},"canonical_sha256":"fae152da9acadb1b215df1246f85dcf29c23984151a9c838f33a62470acee29c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:17.596155Z","signature_b64":"2tPKWf47u08x2j07TfVuSiVOcnVln/zZNzTsSTnhZO2tZCg19LFfPYofVZukIjSNAUnLAC9iSdcZoTUO/l3iBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fae152da9acadb1b215df1246f85dcf29c23984151a9c838f33a62470acee29c","last_reissued_at":"2026-05-18T02:30:17.595636Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:17.595636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.1150","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:30:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GKwv/Z5ucUvFT+rYt8vEYYxXDj2rJ9yRzGcKw8fsEMj3YDmVOtA6qRabWFcH9s5T7hN4/XCwQ5DpcX29KsD1Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T03:56:58.717043Z"},"content_sha256":"6c890477ef30b11e2bb65f3c80ee1447bea0c9b9ce02953964ce334e6dbe1f60","schema_version":"1.0","event_id":"sha256:6c890477ef30b11e2bb65f3c80ee1447bea0c9b9ce02953964ce334e6dbe1f60"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:7LQVFWU2ZLNRWIK56ESG7BO46K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Extended Formulation Lower Bounds via Hypergraph Coloring?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Stavros G. Kolliopoulos, Yannis Moysoglou","submitted_at":"2014-10-05T12:03:08Z","abstract_excerpt":"Exploring the power of linear programming for combinatorial optimization problems has been recently receiving renewed attention after a series of breakthrough impossibility results. From an algorithmic perspective, the related questions concern whether there are compact formulations even for problems that are known to admit polynomial-time algorithms.\n  We propose a framework for proving lower bounds on the size of extended formulations. We do so by introducing a specific type of extended relaxations that we call product relaxations and is motivated by the study of the Sherali-Adams (SA) hiera"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.1150","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:30:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uo7PTMdDC5/9P4315rgC1I5Gj61pO4EVoIR7TA69qRX3PgOjHM3vQHiBLoeOh7jVTVBUIrPgIay9vcURpZ4+CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T03:56:58.717739Z"},"content_sha256":"f6f11402e56b2ec80eb3bab8016826411a02932d644f64014638e7341aea635a","schema_version":"1.0","event_id":"sha256:f6f11402e56b2ec80eb3bab8016826411a02932d644f64014638e7341aea635a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7LQVFWU2ZLNRWIK56ESG7BO46K/bundle.json","state_url":"https://pith.science/pith/7LQVFWU2ZLNRWIK56ESG7BO46K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7LQVFWU2ZLNRWIK56ESG7BO46K/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-05T03:56:58Z","links":{"resolver":"https://pith.science/pith/7LQVFWU2ZLNRWIK56ESG7BO46K","bundle":"https://pith.science/pith/7LQVFWU2ZLNRWIK56ESG7BO46K/bundle.json","state":"https://pith.science/pith/7LQVFWU2ZLNRWIK56ESG7BO46K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7LQVFWU2ZLNRWIK56ESG7BO46K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:7LQVFWU2ZLNRWIK56ESG7BO46K","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":"fdfb3db409cbeb7332f9b02dbb8a041b28699b20bf1494d5d41086d07c5c808d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-10-05T12:03:08Z","title_canon_sha256":"570cc6cb03acb368fe75bcc66ecdf883ad119bc846dc793ffcbcd8cb92cea785"},"schema_version":"1.0","source":{"id":"1410.1150","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.1150","created_at":"2026-05-18T02:30:17Z"},{"alias_kind":"arxiv_version","alias_value":"1410.1150v2","created_at":"2026-05-18T02:30:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.1150","created_at":"2026-05-18T02:30:17Z"},{"alias_kind":"pith_short_12","alias_value":"7LQVFWU2ZLNR","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"7LQVFWU2ZLNRWIK5","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"7LQVFWU2","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:f6f11402e56b2ec80eb3bab8016826411a02932d644f64014638e7341aea635a","target":"graph","created_at":"2026-05-18T02:30:17Z","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":"Exploring the power of linear programming for combinatorial optimization problems has been recently receiving renewed attention after a series of breakthrough impossibility results. From an algorithmic perspective, the related questions concern whether there are compact formulations even for problems that are known to admit polynomial-time algorithms.\n  We propose a framework for proving lower bounds on the size of extended formulations. We do so by introducing a specific type of extended relaxations that we call product relaxations and is motivated by the study of the Sherali-Adams (SA) hiera","authors_text":"Stavros G. Kolliopoulos, Yannis Moysoglou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-10-05T12:03:08Z","title":"Extended Formulation Lower Bounds via Hypergraph Coloring?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.1150","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:6c890477ef30b11e2bb65f3c80ee1447bea0c9b9ce02953964ce334e6dbe1f60","target":"record","created_at":"2026-05-18T02:30:17Z","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":"fdfb3db409cbeb7332f9b02dbb8a041b28699b20bf1494d5d41086d07c5c808d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-10-05T12:03:08Z","title_canon_sha256":"570cc6cb03acb368fe75bcc66ecdf883ad119bc846dc793ffcbcd8cb92cea785"},"schema_version":"1.0","source":{"id":"1410.1150","kind":"arxiv","version":2}},"canonical_sha256":"fae152da9acadb1b215df1246f85dcf29c23984151a9c838f33a62470acee29c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fae152da9acadb1b215df1246f85dcf29c23984151a9c838f33a62470acee29c","first_computed_at":"2026-05-18T02:30:17.595636Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:30:17.595636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2tPKWf47u08x2j07TfVuSiVOcnVln/zZNzTsSTnhZO2tZCg19LFfPYofVZukIjSNAUnLAC9iSdcZoTUO/l3iBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:30:17.596155Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.1150","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6c890477ef30b11e2bb65f3c80ee1447bea0c9b9ce02953964ce334e6dbe1f60","sha256:f6f11402e56b2ec80eb3bab8016826411a02932d644f64014638e7341aea635a"],"state_sha256":"6d25be53185a2237bf7b862562e780e0d876eaa0298d463145507548741a8e81"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t0egCmQNOYZ82Q+C3TUkckWiw/HHkDTyKz60Gk2dN0PR30dJ6fd+uAMdV9LSecTYrqaLlg4JplIKyQNGyVRJBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T03:56:58.722189Z","bundle_sha256":"4e032794be1bfd5a8509bdcdef56a06d4131ee0e93e83c6033a3a0ef56a360af"}}