{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:7LQVFWU2ZLNRWIK56ESG7BO46K","short_pith_number":"pith:7LQVFWU2","schema_version":"1.0","canonical_sha256":"fae152da9acadb1b215df1246f85dcf29c23984151a9c838f33a62470acee29c","source":{"kind":"arxiv","id":"1410.1150","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1410.1150","created_at":"2026-05-18T02:30:17.595701+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.1150v2","created_at":"2026-05-18T02:30:17.595701+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.1150","created_at":"2026-05-18T02:30:17.595701+00:00"},{"alias_kind":"pith_short_12","alias_value":"7LQVFWU2ZLNR","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"7LQVFWU2ZLNRWIK5","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"7LQVFWU2","created_at":"2026-05-18T12:28:19.803747+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/7LQVFWU2ZLNRWIK56ESG7BO46K","json":"https://pith.science/pith/7LQVFWU2ZLNRWIK56ESG7BO46K.json","graph_json":"https://pith.science/api/pith-number/7LQVFWU2ZLNRWIK56ESG7BO46K/graph.json","events_json":"https://pith.science/api/pith-number/7LQVFWU2ZLNRWIK56ESG7BO46K/events.json","paper":"https://pith.science/paper/7LQVFWU2"},"agent_actions":{"view_html":"https://pith.science/pith/7LQVFWU2ZLNRWIK56ESG7BO46K","download_json":"https://pith.science/pith/7LQVFWU2ZLNRWIK56ESG7BO46K.json","view_paper":"https://pith.science/paper/7LQVFWU2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.1150&json=true","fetch_graph":"https://pith.science/api/pith-number/7LQVFWU2ZLNRWIK56ESG7BO46K/graph.json","fetch_events":"https://pith.science/api/pith-number/7LQVFWU2ZLNRWIK56ESG7BO46K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7LQVFWU2ZLNRWIK56ESG7BO46K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7LQVFWU2ZLNRWIK56ESG7BO46K/action/storage_attestation","attest_author":"https://pith.science/pith/7LQVFWU2ZLNRWIK56ESG7BO46K/action/author_attestation","sign_citation":"https://pith.science/pith/7LQVFWU2ZLNRWIK56ESG7BO46K/action/citation_signature","submit_replication":"https://pith.science/pith/7LQVFWU2ZLNRWIK56ESG7BO46K/action/replication_record"}},"created_at":"2026-05-18T02:30:17.595701+00:00","updated_at":"2026-05-18T02:30:17.595701+00:00"}