{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:4JNGLSW3VTQDIJJEGUSDEOKNZA","short_pith_number":"pith:4JNGLSW3","canonical_record":{"source":{"id":"1608.04425","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-15T22:27:21Z","cross_cats_sorted":[],"title_canon_sha256":"b1b6d095b25ebc36dccaee348b7a0617d881a725c0f6deb192afc60bd8fa3b6d","abstract_canon_sha256":"531e2e600ace2856c2e7ed7f6d7f75f1a8406da59b10d6c0836e7a2ea4f9b630"},"schema_version":"1.0"},"canonical_sha256":"e25a65cadbace0342524352432394dc83d1dc35633f129e1311121cfbe261fc6","source":{"kind":"arxiv","id":"1608.04425","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.04425","created_at":"2026-05-18T00:28:41Z"},{"alias_kind":"arxiv_version","alias_value":"1608.04425v4","created_at":"2026-05-18T00:28:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.04425","created_at":"2026-05-18T00:28:41Z"},{"alias_kind":"pith_short_12","alias_value":"4JNGLSW3VTQD","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4JNGLSW3VTQDIJJE","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4JNGLSW3","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:4JNGLSW3VTQDIJJEGUSDEOKNZA","target":"record","payload":{"canonical_record":{"source":{"id":"1608.04425","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-15T22:27:21Z","cross_cats_sorted":[],"title_canon_sha256":"b1b6d095b25ebc36dccaee348b7a0617d881a725c0f6deb192afc60bd8fa3b6d","abstract_canon_sha256":"531e2e600ace2856c2e7ed7f6d7f75f1a8406da59b10d6c0836e7a2ea4f9b630"},"schema_version":"1.0"},"canonical_sha256":"e25a65cadbace0342524352432394dc83d1dc35633f129e1311121cfbe261fc6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:41.303820Z","signature_b64":"Hat5m4kOFN7ghUDTT2Z7NBt7TnPc3Q6gngbt25qPZYoIEH3y6cV+2MU50rE1THIie9wCMJlW37XsixsCsqorDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e25a65cadbace0342524352432394dc83d1dc35633f129e1311121cfbe261fc6","last_reissued_at":"2026-05-18T00:28:41.303094Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:41.303094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.04425","source_version":4,"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-18T00:28:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fNT2W/WgRG8IePFeA2djgwNqjfjYFllBJxEbTBnCbS1zI1dL/Cbx1sxFHn7YPvHCDSqWDJia0oohrlUGBEzZDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T04:48:02.105819Z"},"content_sha256":"cf3e68afa51afde542da9210eda95b940d6479b977ab69029d2fbc624b3a7e5c","schema_version":"1.0","event_id":"sha256:cf3e68afa51afde542da9210eda95b940d6479b977ab69029d2fbc624b3a7e5c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:4JNGLSW3VTQDIJJEGUSDEOKNZA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Binary Optimization via Mathematical Programming with Equilibrium Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Bernard Ghanem, Ganzhao Yuan","submitted_at":"2016-08-15T22:27:21Z","abstract_excerpt":"Binary optimization is a central problem in mathematical optimization and its applications are abundant. To solve this problem, we propose a new class of continuous optimization techniques which is based on Mathematical Programming with Equilibrium Constraints (MPECs). We first reformulate the binary program as an equivalent augmented biconvex optimization problem with a bilinear equality constraint, then we propose two penalization/regularization methods (exact penalty and alternating direction) to solve it. The resulting algorithms seek desirable solutions to the original problem via solving"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.04425","kind":"arxiv","version":4},"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-18T00:28:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XFFvVLBKpJuHxKRXkDYOEjk/zXHhTC92ZT/GqBZyqV/lQp3anBR6a5nXlP2wzSr5T35Xw35h8poUYgoKzUDOCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T04:48:02.106491Z"},"content_sha256":"a0dd1aeffa6c278a25024007ad59f60e591ded6d713b4e2b249405f13277884e","schema_version":"1.0","event_id":"sha256:a0dd1aeffa6c278a25024007ad59f60e591ded6d713b4e2b249405f13277884e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4JNGLSW3VTQDIJJEGUSDEOKNZA/bundle.json","state_url":"https://pith.science/pith/4JNGLSW3VTQDIJJEGUSDEOKNZA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4JNGLSW3VTQDIJJEGUSDEOKNZA/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-05-27T04:48:02Z","links":{"resolver":"https://pith.science/pith/4JNGLSW3VTQDIJJEGUSDEOKNZA","bundle":"https://pith.science/pith/4JNGLSW3VTQDIJJEGUSDEOKNZA/bundle.json","state":"https://pith.science/pith/4JNGLSW3VTQDIJJEGUSDEOKNZA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4JNGLSW3VTQDIJJEGUSDEOKNZA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:4JNGLSW3VTQDIJJEGUSDEOKNZA","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":"531e2e600ace2856c2e7ed7f6d7f75f1a8406da59b10d6c0836e7a2ea4f9b630","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-15T22:27:21Z","title_canon_sha256":"b1b6d095b25ebc36dccaee348b7a0617d881a725c0f6deb192afc60bd8fa3b6d"},"schema_version":"1.0","source":{"id":"1608.04425","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.04425","created_at":"2026-05-18T00:28:41Z"},{"alias_kind":"arxiv_version","alias_value":"1608.04425v4","created_at":"2026-05-18T00:28:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.04425","created_at":"2026-05-18T00:28:41Z"},{"alias_kind":"pith_short_12","alias_value":"4JNGLSW3VTQD","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4JNGLSW3VTQDIJJE","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4JNGLSW3","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:a0dd1aeffa6c278a25024007ad59f60e591ded6d713b4e2b249405f13277884e","target":"graph","created_at":"2026-05-18T00:28:41Z","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":"Binary optimization is a central problem in mathematical optimization and its applications are abundant. To solve this problem, we propose a new class of continuous optimization techniques which is based on Mathematical Programming with Equilibrium Constraints (MPECs). We first reformulate the binary program as an equivalent augmented biconvex optimization problem with a bilinear equality constraint, then we propose two penalization/regularization methods (exact penalty and alternating direction) to solve it. The resulting algorithms seek desirable solutions to the original problem via solving","authors_text":"Bernard Ghanem, Ganzhao Yuan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-15T22:27:21Z","title":"Binary Optimization via Mathematical Programming with Equilibrium Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.04425","kind":"arxiv","version":4},"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:cf3e68afa51afde542da9210eda95b940d6479b977ab69029d2fbc624b3a7e5c","target":"record","created_at":"2026-05-18T00:28:41Z","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":"531e2e600ace2856c2e7ed7f6d7f75f1a8406da59b10d6c0836e7a2ea4f9b630","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-15T22:27:21Z","title_canon_sha256":"b1b6d095b25ebc36dccaee348b7a0617d881a725c0f6deb192afc60bd8fa3b6d"},"schema_version":"1.0","source":{"id":"1608.04425","kind":"arxiv","version":4}},"canonical_sha256":"e25a65cadbace0342524352432394dc83d1dc35633f129e1311121cfbe261fc6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e25a65cadbace0342524352432394dc83d1dc35633f129e1311121cfbe261fc6","first_computed_at":"2026-05-18T00:28:41.303094Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:41.303094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Hat5m4kOFN7ghUDTT2Z7NBt7TnPc3Q6gngbt25qPZYoIEH3y6cV+2MU50rE1THIie9wCMJlW37XsixsCsqorDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:41.303820Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.04425","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cf3e68afa51afde542da9210eda95b940d6479b977ab69029d2fbc624b3a7e5c","sha256:a0dd1aeffa6c278a25024007ad59f60e591ded6d713b4e2b249405f13277884e"],"state_sha256":"eaca67628282b0d0e363eaabf7de92be5beb1d55030473ad680e14ed6eea5b1e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H9jUdpHkoRwIyptF6Gk/ARL9B6/q6jjUcDMUPc06wkCxw/u1U0X+yWeNizUAPWFPsj6HEm/SLkZa/TZkKLO3Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T04:48:02.110068Z","bundle_sha256":"3d7ff8e86e214acf73a0cef4d03ca91752fa95390cfdf074e2d537b9f71d4c5d"}}