{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:7FLGF3BHTWVFAFGR3T6AFZDNY3","short_pith_number":"pith:7FLGF3BH","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"},"canonical_sha256":"f95662ec279daa5014d1dcfc02e46dc6cd75bfcfe20b5d878108085142010d54","source":{"kind":"arxiv","id":"1907.02109","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.02109","created_at":"2026-07-05T03:23:03Z"},{"alias_kind":"arxiv_version","alias_value":"1907.02109v3","created_at":"2026-07-05T03:23:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.02109","created_at":"2026-07-05T03:23:03Z"},{"alias_kind":"pith_short_12","alias_value":"7FLGF3BHTWVF","created_at":"2026-07-05T03:23:03Z"},{"alias_kind":"pith_short_16","alias_value":"7FLGF3BHTWVFAFGR","created_at":"2026-07-05T03:23:03Z"},{"alias_kind":"pith_short_8","alias_value":"7FLGF3BH","created_at":"2026-07-05T03:23:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:7FLGF3BHTWVFAFGR3T6AFZDNY3","target":"record","payload":{"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"},"canonical_sha256":"f95662ec279daa5014d1dcfc02e46dc6cd75bfcfe20b5d878108085142010d54","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"},"source_kind":"arxiv","source_id":"1907.02109","source_version":3,"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-07-05T03:23:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fcfu3+7QeoVXcBn0Da+jXHaDpLixCu87VcSK8CzG2PCptP8nbzzgqeQ1KuSd7IAMEK5nuiqyXhQ7Jjqeqcy2AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T07:03:27.699526Z"},"content_sha256":"0992128a5d187d2ef9a5afc3f4d64fda2cc8a4eebb30f5120c82294e7d7e0d89","schema_version":"1.0","event_id":"sha256:0992128a5d187d2ef9a5afc3f4d64fda2cc8a4eebb30f5120c82294e7d7e0d89"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:7FLGF3BHTWVFAFGR3T6AFZDNY3","target":"graph","payload":{"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"},"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-07-05T03:23:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4MIjbTRBtCAxb8JKYGbgSzlSnwephhsWrbMbTuJmlVKGPj++PWPyhlxLnD9KJJupdiv6b+6IpjgThLvh5Yw0DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T07:03:27.700037Z"},"content_sha256":"9c4fa6b5e78f69dd9bb068d6fcbce9cd2fa06d6066024a48c6d42f7f7210e1a8","schema_version":"1.0","event_id":"sha256:9c4fa6b5e78f69dd9bb068d6fcbce9cd2fa06d6066024a48c6d42f7f7210e1a8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7FLGF3BHTWVFAFGR3T6AFZDNY3/bundle.json","state_url":"https://pith.science/pith/7FLGF3BHTWVFAFGR3T6AFZDNY3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7FLGF3BHTWVFAFGR3T6AFZDNY3/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-08-05T07:03:27Z","links":{"resolver":"https://pith.science/pith/7FLGF3BHTWVFAFGR3T6AFZDNY3","bundle":"https://pith.science/pith/7FLGF3BHTWVFAFGR3T6AFZDNY3/bundle.json","state":"https://pith.science/pith/7FLGF3BHTWVFAFGR3T6AFZDNY3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7FLGF3BHTWVFAFGR3T6AFZDNY3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:7FLGF3BHTWVFAFGR3T6AFZDNY3","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":"03a9cc624ebdf06d69a6b654b57866044696566beb44c316db38e59e4616808e","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-03T19:02:28Z","title_canon_sha256":"77002cdeeb725782faceb1c24c4bd826061e12edc69a5d13731900d71287c70f"},"schema_version":"1.0","source":{"id":"1907.02109","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.02109","created_at":"2026-07-05T03:23:03Z"},{"alias_kind":"arxiv_version","alias_value":"1907.02109v3","created_at":"2026-07-05T03:23:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.02109","created_at":"2026-07-05T03:23:03Z"},{"alias_kind":"pith_short_12","alias_value":"7FLGF3BHTWVF","created_at":"2026-07-05T03:23:03Z"},{"alias_kind":"pith_short_16","alias_value":"7FLGF3BHTWVFAFGR","created_at":"2026-07-05T03:23:03Z"},{"alias_kind":"pith_short_8","alias_value":"7FLGF3BH","created_at":"2026-07-05T03:23:03Z"}],"graph_snapshots":[{"event_id":"sha256:9c4fa6b5e78f69dd9bb068d6fcbce9cd2fa06d6066024a48c6d42f7f7210e1a8","target":"graph","created_at":"2026-07-05T03:23:03Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1907.02109/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Dimitris Bertsimas, Jean Pauphilet, Ryan Cory-Wright","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-03T19:02:28Z","title":"A unified approach to mixed-integer optimization problems with logical constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.02109","kind":"arxiv","version":3},"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:0992128a5d187d2ef9a5afc3f4d64fda2cc8a4eebb30f5120c82294e7d7e0d89","target":"record","created_at":"2026-07-05T03:23:03Z","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":"03a9cc624ebdf06d69a6b654b57866044696566beb44c316db38e59e4616808e","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-03T19:02:28Z","title_canon_sha256":"77002cdeeb725782faceb1c24c4bd826061e12edc69a5d13731900d71287c70f"},"schema_version":"1.0","source":{"id":"1907.02109","kind":"arxiv","version":3}},"canonical_sha256":"f95662ec279daa5014d1dcfc02e46dc6cd75bfcfe20b5d878108085142010d54","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f95662ec279daa5014d1dcfc02e46dc6cd75bfcfe20b5d878108085142010d54","first_computed_at":"2026-07-05T03:23:03.312488Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:23:03.312488Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"odbLFHZ7mNHKpUoCaSgIp33UzSsDYLoOIUC884QPfshvTpLsjdXm0f316f5XEGITpeZgpI2bqXwijMKTwFYgBw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:23:03.312932Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.02109","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0992128a5d187d2ef9a5afc3f4d64fda2cc8a4eebb30f5120c82294e7d7e0d89","sha256:9c4fa6b5e78f69dd9bb068d6fcbce9cd2fa06d6066024a48c6d42f7f7210e1a8"],"state_sha256":"795b7e5aaf1d83aa625667a069a9b75d4119f02f9228fc39e11a12a97bc4934e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uWc9rkuivguM5ju3T3IotSZtvGsFHuT/NqbmXXtAlpA6TU5HPlSuXk2A8aMLd2aXlhWJsaJq/Ew/QkKnUlrxCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T07:03:27.704429Z","bundle_sha256":"db3b0058332c92b581c09a23677b0567f476ccc378016980788d961d683bbd5f"}}