{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:57WDQS4B4RPL337PRZAM7F4Z3Q","short_pith_number":"pith:57WDQS4B","schema_version":"1.0","canonical_sha256":"efec384b81e45ebdefef8e40cf9799dc02bcab0fe9c3927c7225eb2f0017e289","source":{"kind":"arxiv","id":"1712.02176","version":1},"attestation_state":"computed","paper":{"title":"Lifting Linear Extension Complexity Bounds to the Mixed-Integer Setting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.OC"],"primary_cat":"cs.DM","authors_text":"Alfonso Cevallos, Rico Zenklusen, Stefan Weltge","submitted_at":"2017-12-06T13:15:32Z","abstract_excerpt":"Mixed-integer mathematical programs are among the most commonly used models for a wide set of problems in Operations Research and related fields. However, there is still very little known about what can be expressed by small mixed-integer programs. In particular, prior to this work, it was open whether some classical problems, like the minimum odd-cut problem, can be expressed by a compact mixed-integer program with few (even constantly many) integer variables. This is in stark contrast to linear formulations, where recent breakthroughs in the field of extended formulations have shown that man"},"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":"1712.02176","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-12-06T13:15:32Z","cross_cats_sorted":["cs.DS","math.OC"],"title_canon_sha256":"1dfa003980b3f2585d9b74fbf0160d3cd7b5dcae9b94adc3a17e9121de95d486","abstract_canon_sha256":"8976c25b4b8dc1bd0f9c0613953602a0d0498e226a311bf7130b0a6c76229d62"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:38.939111Z","signature_b64":"6R2XvHenJWhx63ckcAb/CGAjSnhiDUtnl+ZVg5pi543ln6bZuY0vXUG+Fa6n49JdF2b4JWUlxrnhYWMGHDVuCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"efec384b81e45ebdefef8e40cf9799dc02bcab0fe9c3927c7225eb2f0017e289","last_reissued_at":"2026-05-18T00:28:38.938487Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:38.938487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lifting Linear Extension Complexity Bounds to the Mixed-Integer Setting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.OC"],"primary_cat":"cs.DM","authors_text":"Alfonso Cevallos, Rico Zenklusen, Stefan Weltge","submitted_at":"2017-12-06T13:15:32Z","abstract_excerpt":"Mixed-integer mathematical programs are among the most commonly used models for a wide set of problems in Operations Research and related fields. However, there is still very little known about what can be expressed by small mixed-integer programs. In particular, prior to this work, it was open whether some classical problems, like the minimum odd-cut problem, can be expressed by a compact mixed-integer program with few (even constantly many) integer variables. This is in stark contrast to linear formulations, where recent breakthroughs in the field of extended formulations have shown that man"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.02176","kind":"arxiv","version":1},"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":"1712.02176","created_at":"2026-05-18T00:28:38.938577+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.02176v1","created_at":"2026-05-18T00:28:38.938577+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.02176","created_at":"2026-05-18T00:28:38.938577+00:00"},{"alias_kind":"pith_short_12","alias_value":"57WDQS4B4RPL","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"57WDQS4B4RPL337P","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"57WDQS4B","created_at":"2026-05-18T12:31:00.734936+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/57WDQS4B4RPL337PRZAM7F4Z3Q","json":"https://pith.science/pith/57WDQS4B4RPL337PRZAM7F4Z3Q.json","graph_json":"https://pith.science/api/pith-number/57WDQS4B4RPL337PRZAM7F4Z3Q/graph.json","events_json":"https://pith.science/api/pith-number/57WDQS4B4RPL337PRZAM7F4Z3Q/events.json","paper":"https://pith.science/paper/57WDQS4B"},"agent_actions":{"view_html":"https://pith.science/pith/57WDQS4B4RPL337PRZAM7F4Z3Q","download_json":"https://pith.science/pith/57WDQS4B4RPL337PRZAM7F4Z3Q.json","view_paper":"https://pith.science/paper/57WDQS4B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.02176&json=true","fetch_graph":"https://pith.science/api/pith-number/57WDQS4B4RPL337PRZAM7F4Z3Q/graph.json","fetch_events":"https://pith.science/api/pith-number/57WDQS4B4RPL337PRZAM7F4Z3Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/57WDQS4B4RPL337PRZAM7F4Z3Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/57WDQS4B4RPL337PRZAM7F4Z3Q/action/storage_attestation","attest_author":"https://pith.science/pith/57WDQS4B4RPL337PRZAM7F4Z3Q/action/author_attestation","sign_citation":"https://pith.science/pith/57WDQS4B4RPL337PRZAM7F4Z3Q/action/citation_signature","submit_replication":"https://pith.science/pith/57WDQS4B4RPL337PRZAM7F4Z3Q/action/replication_record"}},"created_at":"2026-05-18T00:28:38.938577+00:00","updated_at":"2026-05-18T00:28:38.938577+00:00"}