{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:4JNGLSW3VTQDIJJEGUSDEOKNZA","short_pith_number":"pith:4JNGLSW3","schema_version":"1.0","canonical_sha256":"e25a65cadbace0342524352432394dc83d1dc35633f129e1311121cfbe261fc6","source":{"kind":"arxiv","id":"1608.04425","version":4},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1608.04425","created_at":"2026-05-18T00:28:41.303228+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.04425v4","created_at":"2026-05-18T00:28:41.303228+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.04425","created_at":"2026-05-18T00:28:41.303228+00:00"},{"alias_kind":"pith_short_12","alias_value":"4JNGLSW3VTQD","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"4JNGLSW3VTQDIJJE","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"4JNGLSW3","created_at":"2026-05-18T12:29:58.707656+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"1907.08756","citing_title":"Joint Fronthaul Multicast and Cooperative Beamforming for Cache-Enabled Cloud-Based Small Cell Networks: An MDS Codes-Aided Approach","ref_index":31,"is_internal_anchor":true},{"citing_arxiv_id":"2508.02590","citing_title":"Partitioned-Constraint QAOA (PC-QAOA): Structural State Preparation and Penalty Enforcement for Quantum Optimization","ref_index":30,"is_internal_anchor":true},{"citing_arxiv_id":"2605.19667","citing_title":"Convergence of Consensus-Based Particle Methods for Nonconvex Bi-Level Optimization","ref_index":87,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4JNGLSW3VTQDIJJEGUSDEOKNZA","json":"https://pith.science/pith/4JNGLSW3VTQDIJJEGUSDEOKNZA.json","graph_json":"https://pith.science/api/pith-number/4JNGLSW3VTQDIJJEGUSDEOKNZA/graph.json","events_json":"https://pith.science/api/pith-number/4JNGLSW3VTQDIJJEGUSDEOKNZA/events.json","paper":"https://pith.science/paper/4JNGLSW3"},"agent_actions":{"view_html":"https://pith.science/pith/4JNGLSW3VTQDIJJEGUSDEOKNZA","download_json":"https://pith.science/pith/4JNGLSW3VTQDIJJEGUSDEOKNZA.json","view_paper":"https://pith.science/paper/4JNGLSW3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.04425&json=true","fetch_graph":"https://pith.science/api/pith-number/4JNGLSW3VTQDIJJEGUSDEOKNZA/graph.json","fetch_events":"https://pith.science/api/pith-number/4JNGLSW3VTQDIJJEGUSDEOKNZA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4JNGLSW3VTQDIJJEGUSDEOKNZA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4JNGLSW3VTQDIJJEGUSDEOKNZA/action/storage_attestation","attest_author":"https://pith.science/pith/4JNGLSW3VTQDIJJEGUSDEOKNZA/action/author_attestation","sign_citation":"https://pith.science/pith/4JNGLSW3VTQDIJJEGUSDEOKNZA/action/citation_signature","submit_replication":"https://pith.science/pith/4JNGLSW3VTQDIJJEGUSDEOKNZA/action/replication_record"}},"created_at":"2026-05-18T00:28:41.303228+00:00","updated_at":"2026-05-18T00:28:41.303228+00:00"}