{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:7FLGF3BHTWVFAFGR3T6AFZDNY3","short_pith_number":"pith:7FLGF3BH","schema_version":"1.0","canonical_sha256":"f95662ec279daa5014d1dcfc02e46dc6cd75bfcfe20b5d878108085142010d54","source":{"kind":"arxiv","id":"1907.02109","version":3},"attestation_state":"computed","paper":{"title":"A unified approach to mixed-integer optimization problems with logical constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Dimitris Bertsimas, Jean Pauphilet, Ryan Cory-Wright","submitted_at":"2019-07-03T19:02:28Z","abstract_excerpt":"We propose a unified framework to address a family of classical mixed-integer optimization problems with logically constrained decision variables, including network design, facility location, unit commitment, sparse portfolio selection, binary quadratic optimization, sparse principal analysis and sparse learning problems. These problems exhibit logical relationships between continuous and discrete variables, which are usually reformulated linearly using a big-M formulation. In this work, we challenge this longstanding modeling practice and express the logical constraints in a non-linear way. B"},"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":"1907.02109","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-03T19:02:28Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"77002cdeeb725782faceb1c24c4bd826061e12edc69a5d13731900d71287c70f","abstract_canon_sha256":"03a9cc624ebdf06d69a6b654b57866044696566beb44c316db38e59e4616808e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:23:03.312932Z","signature_b64":"odbLFHZ7mNHKpUoCaSgIp33UzSsDYLoOIUC884QPfshvTpLsjdXm0f316f5XEGITpeZgpI2bqXwijMKTwFYgBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f95662ec279daa5014d1dcfc02e46dc6cd75bfcfe20b5d878108085142010d54","last_reissued_at":"2026-07-05T03:23:03.312488Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:23:03.312488Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A unified approach to mixed-integer optimization problems with logical constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Dimitris Bertsimas, Jean Pauphilet, Ryan Cory-Wright","submitted_at":"2019-07-03T19:02:28Z","abstract_excerpt":"We propose a unified framework to address a family of classical mixed-integer optimization problems with logically constrained decision variables, including network design, facility location, unit commitment, sparse portfolio selection, binary quadratic optimization, sparse principal analysis and sparse learning problems. These problems exhibit logical relationships between continuous and discrete variables, which are usually reformulated linearly using a big-M formulation. In this work, we challenge this longstanding modeling practice and express the logical constraints in a non-linear way. B"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.02109","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1907.02109/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1907.02109","created_at":"2026-07-05T03:23:03.312548+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.02109v3","created_at":"2026-07-05T03:23:03.312548+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.02109","created_at":"2026-07-05T03:23:03.312548+00:00"},{"alias_kind":"pith_short_12","alias_value":"7FLGF3BHTWVF","created_at":"2026-07-05T03:23:03.312548+00:00"},{"alias_kind":"pith_short_16","alias_value":"7FLGF3BHTWVFAFGR","created_at":"2026-07-05T03:23:03.312548+00:00"},{"alias_kind":"pith_short_8","alias_value":"7FLGF3BH","created_at":"2026-07-05T03:23:03.312548+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.20141","citing_title":"DASH: A Dimensionality Reduction Method for Large-scale Convex MIQP with Applications in Subset Portfolio Selection","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7FLGF3BHTWVFAFGR3T6AFZDNY3","json":"https://pith.science/pith/7FLGF3BHTWVFAFGR3T6AFZDNY3.json","graph_json":"https://pith.science/api/pith-number/7FLGF3BHTWVFAFGR3T6AFZDNY3/graph.json","events_json":"https://pith.science/api/pith-number/7FLGF3BHTWVFAFGR3T6AFZDNY3/events.json","paper":"https://pith.science/paper/7FLGF3BH"},"agent_actions":{"view_html":"https://pith.science/pith/7FLGF3BHTWVFAFGR3T6AFZDNY3","download_json":"https://pith.science/pith/7FLGF3BHTWVFAFGR3T6AFZDNY3.json","view_paper":"https://pith.science/paper/7FLGF3BH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.02109&json=true","fetch_graph":"https://pith.science/api/pith-number/7FLGF3BHTWVFAFGR3T6AFZDNY3/graph.json","fetch_events":"https://pith.science/api/pith-number/7FLGF3BHTWVFAFGR3T6AFZDNY3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7FLGF3BHTWVFAFGR3T6AFZDNY3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7FLGF3BHTWVFAFGR3T6AFZDNY3/action/storage_attestation","attest_author":"https://pith.science/pith/7FLGF3BHTWVFAFGR3T6AFZDNY3/action/author_attestation","sign_citation":"https://pith.science/pith/7FLGF3BHTWVFAFGR3T6AFZDNY3/action/citation_signature","submit_replication":"https://pith.science/pith/7FLGF3BHTWVFAFGR3T6AFZDNY3/action/replication_record"}},"created_at":"2026-07-05T03:23:03.312548+00:00","updated_at":"2026-07-05T03:23:03.312548+00:00"}