{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:IIKSXR4RORC47OL5664VJPM7EY","short_pith_number":"pith:IIKSXR4R","schema_version":"1.0","canonical_sha256":"42152bc7917445cfb97df7b954bd9f2606dafb4ed8a8099aa9ad6cedecebb869","source":{"kind":"arxiv","id":"1902.04375","version":3},"attestation_state":"computed","paper":{"title":"Benders Subproblem Decomposition for Bilevel Problems with Convex Follower","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Geunyeong Byeon, Pascal Van Hentenryck","submitted_at":"2019-02-12T13:19:54Z","abstract_excerpt":"Bilevel optimization formulates hierarchical decision-making processes that arise in many real-world applications such as in pricing, network design, and infrastructure defense planning. In this paper, we consider a class of bilevel optimization problems where the upper-level problem features some integer variables while the lower-level problem enjoys strong duality. We propose a dedicated Benders decomposition method for solving this class of bilevel problems, which decomposes the Benders subproblem into two more tractable, sequentially solvable problems that can be interpreted as the upper a"},"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":"1902.04375","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-12T13:19:54Z","cross_cats_sorted":[],"title_canon_sha256":"5ac131f489074dcb03e35c41e2075b5d142c0317336e74f456bfe66749224fd0","abstract_canon_sha256":"7b7fc8a7212b3b0a4c868fe6d8c47eb5e3cc786c8331df6e4ec8819fa081674a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:32:43.476278Z","signature_b64":"EGGa2DEob18pd0Y68N3lrzCdh0bJ0Yj8hLGOX8AccnhasXrxb+wLF0bTOtvPI/HSzg9e1mifkYXmSCsV86ZKAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"42152bc7917445cfb97df7b954bd9f2606dafb4ed8a8099aa9ad6cedecebb869","last_reissued_at":"2026-07-05T02:32:43.475856Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:32:43.475856Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Benders Subproblem Decomposition for Bilevel Problems with Convex Follower","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Geunyeong Byeon, Pascal Van Hentenryck","submitted_at":"2019-02-12T13:19:54Z","abstract_excerpt":"Bilevel optimization formulates hierarchical decision-making processes that arise in many real-world applications such as in pricing, network design, and infrastructure defense planning. In this paper, we consider a class of bilevel optimization problems where the upper-level problem features some integer variables while the lower-level problem enjoys strong duality. We propose a dedicated Benders decomposition method for solving this class of bilevel problems, which decomposes the Benders subproblem into two more tractable, sequentially solvable problems that can be interpreted as the upper a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.04375","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/1902.04375/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":"1902.04375","created_at":"2026-07-05T02:32:43.475916+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.04375v3","created_at":"2026-07-05T02:32:43.475916+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.04375","created_at":"2026-07-05T02:32:43.475916+00:00"},{"alias_kind":"pith_short_12","alias_value":"IIKSXR4RORC4","created_at":"2026-07-05T02:32:43.475916+00:00"},{"alias_kind":"pith_short_16","alias_value":"IIKSXR4RORC47OL5","created_at":"2026-07-05T02:32:43.475916+00:00"},{"alias_kind":"pith_short_8","alias_value":"IIKSXR4R","created_at":"2026-07-05T02:32:43.475916+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/IIKSXR4RORC47OL5664VJPM7EY","json":"https://pith.science/pith/IIKSXR4RORC47OL5664VJPM7EY.json","graph_json":"https://pith.science/api/pith-number/IIKSXR4RORC47OL5664VJPM7EY/graph.json","events_json":"https://pith.science/api/pith-number/IIKSXR4RORC47OL5664VJPM7EY/events.json","paper":"https://pith.science/paper/IIKSXR4R"},"agent_actions":{"view_html":"https://pith.science/pith/IIKSXR4RORC47OL5664VJPM7EY","download_json":"https://pith.science/pith/IIKSXR4RORC47OL5664VJPM7EY.json","view_paper":"https://pith.science/paper/IIKSXR4R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.04375&json=true","fetch_graph":"https://pith.science/api/pith-number/IIKSXR4RORC47OL5664VJPM7EY/graph.json","fetch_events":"https://pith.science/api/pith-number/IIKSXR4RORC47OL5664VJPM7EY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IIKSXR4RORC47OL5664VJPM7EY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IIKSXR4RORC47OL5664VJPM7EY/action/storage_attestation","attest_author":"https://pith.science/pith/IIKSXR4RORC47OL5664VJPM7EY/action/author_attestation","sign_citation":"https://pith.science/pith/IIKSXR4RORC47OL5664VJPM7EY/action/citation_signature","submit_replication":"https://pith.science/pith/IIKSXR4RORC47OL5664VJPM7EY/action/replication_record"}},"created_at":"2026-07-05T02:32:43.475916+00:00","updated_at":"2026-07-05T02:32:43.475916+00:00"}