{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:RUFWL4Z2KJT6T33KPRVTV7JUCQ","short_pith_number":"pith:RUFWL4Z2","schema_version":"1.0","canonical_sha256":"8d0b65f33a5267e9ef6a7c6b3afd341421499c6daff3ece161b68a0f5448dc33","source":{"kind":"arxiv","id":"1105.3343","version":1},"attestation_state":"computed","paper":{"title":"Decomposition algorithms for globally solving mathematical programs with affine equilibrium constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Le Dung Muu, Le Thi Hoai An, Pham Dinh Tao, Tran Dinh Quoc","submitted_at":"2011-05-17T11:27:48Z","abstract_excerpt":"A mathematical programming problem with affine equilibrium constraints (AMPEC) is a bilevel programming problem where the lower one is a parametric affine variational inequality. We formulate some classes of bilevel programming in forms of MPEC. Then we use a regularization technique to formulate the resulting problem as a mathematical program with an additional constraint defined by the difference of two convex functions (DC function). A main feature of this DC decomposition is that the second component depends upon only the parameter in the lower problem. This property allows us to develop 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":"1105.3343","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-05-17T11:27:48Z","cross_cats_sorted":[],"title_canon_sha256":"8f0ba548d624b941ff30af24abda31f45e4dd37c65516736656c28d85f8a6752","abstract_canon_sha256":"d607f418dbdec4f15c7894419500de0412d858e9798fa5f2fae35c6766d71267"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:22:00.218850Z","signature_b64":"HK3qEcQQ9keJQrXxN7oU7uoFQ8Iby/VVy2O7uGF0+uetK8Pr2YyQsUgYtAkZeroehD0ncSrjxq7ig7bqo6yYBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d0b65f33a5267e9ef6a7c6b3afd341421499c6daff3ece161b68a0f5448dc33","last_reissued_at":"2026-05-18T04:22:00.218350Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:22:00.218350Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decomposition algorithms for globally solving mathematical programs with affine equilibrium constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Le Dung Muu, Le Thi Hoai An, Pham Dinh Tao, Tran Dinh Quoc","submitted_at":"2011-05-17T11:27:48Z","abstract_excerpt":"A mathematical programming problem with affine equilibrium constraints (AMPEC) is a bilevel programming problem where the lower one is a parametric affine variational inequality. We formulate some classes of bilevel programming in forms of MPEC. Then we use a regularization technique to formulate the resulting problem as a mathematical program with an additional constraint defined by the difference of two convex functions (DC function). A main feature of this DC decomposition is that the second component depends upon only the parameter in the lower problem. This property allows us to develop b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.3343","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":"1105.3343","created_at":"2026-05-18T04:22:00.218428+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.3343v1","created_at":"2026-05-18T04:22:00.218428+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.3343","created_at":"2026-05-18T04:22:00.218428+00:00"},{"alias_kind":"pith_short_12","alias_value":"RUFWL4Z2KJT6","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"RUFWL4Z2KJT6T33K","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"RUFWL4Z2","created_at":"2026-05-18T12:26:41.206345+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/RUFWL4Z2KJT6T33KPRVTV7JUCQ","json":"https://pith.science/pith/RUFWL4Z2KJT6T33KPRVTV7JUCQ.json","graph_json":"https://pith.science/api/pith-number/RUFWL4Z2KJT6T33KPRVTV7JUCQ/graph.json","events_json":"https://pith.science/api/pith-number/RUFWL4Z2KJT6T33KPRVTV7JUCQ/events.json","paper":"https://pith.science/paper/RUFWL4Z2"},"agent_actions":{"view_html":"https://pith.science/pith/RUFWL4Z2KJT6T33KPRVTV7JUCQ","download_json":"https://pith.science/pith/RUFWL4Z2KJT6T33KPRVTV7JUCQ.json","view_paper":"https://pith.science/paper/RUFWL4Z2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.3343&json=true","fetch_graph":"https://pith.science/api/pith-number/RUFWL4Z2KJT6T33KPRVTV7JUCQ/graph.json","fetch_events":"https://pith.science/api/pith-number/RUFWL4Z2KJT6T33KPRVTV7JUCQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RUFWL4Z2KJT6T33KPRVTV7JUCQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RUFWL4Z2KJT6T33KPRVTV7JUCQ/action/storage_attestation","attest_author":"https://pith.science/pith/RUFWL4Z2KJT6T33KPRVTV7JUCQ/action/author_attestation","sign_citation":"https://pith.science/pith/RUFWL4Z2KJT6T33KPRVTV7JUCQ/action/citation_signature","submit_replication":"https://pith.science/pith/RUFWL4Z2KJT6T33KPRVTV7JUCQ/action/replication_record"}},"created_at":"2026-05-18T04:22:00.218428+00:00","updated_at":"2026-05-18T04:22:00.218428+00:00"}