{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:M2H7QM54GYV2ZV4HXNXSCWKMBO","short_pith_number":"pith:M2H7QM54","schema_version":"1.0","canonical_sha256":"668ff833bc362bacd787bb6f21594c0bb8310750331b751b54c6fccc0b3df675","source":{"kind":"arxiv","id":"2606.29344","version":1},"attestation_state":"computed","paper":{"title":"An Exact Algorithm for Mixed-Integer Bilevel Stochastic Problem","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Dmytro Matsypura, Tom\\'as Lagos","submitted_at":"2026-06-28T11:21:13Z","abstract_excerpt":"We study a class of mixed-integer bilevel stochastic programs where the leader commits to a first-stage decision before uncertainty is realized, and the follower solves a subsequent mixed-integer optimization problem for each revealed scenario. Due to the hierarchical structure and the presence of discrete variables at both levels, these problems are inherently $\\Sigma_2^p$-hard, making standard single-level reformulations computationally intractable. To address this significant computational challenge, we develop an exact algorithm that combines deterministic value-function reformulations wit"},"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":"2606.29344","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.OC","submitted_at":"2026-06-28T11:21:13Z","cross_cats_sorted":[],"title_canon_sha256":"fdfd33e6eff2979c256810afb1b03150e54324897473317ebaeadb46a13065d1","abstract_canon_sha256":"eabba074c0ae870dc3c37987e5fe77d446aecad637cd986485fde68834a6916a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-30T01:18:02.220727Z","signature_b64":"uB01ztDs5KXKVpubi7KfgJfI/liZ7YY/Vo3d4oxhGilcMXoZ5l0KBo3yrZpdDmqxHwVW82fCUEDTu388nKQ4Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"668ff833bc362bacd787bb6f21594c0bb8310750331b751b54c6fccc0b3df675","last_reissued_at":"2026-06-30T01:18:02.220048Z","signature_status":"signed_v1","first_computed_at":"2026-06-30T01:18:02.220048Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Exact Algorithm for Mixed-Integer Bilevel Stochastic Problem","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Dmytro Matsypura, Tom\\'as Lagos","submitted_at":"2026-06-28T11:21:13Z","abstract_excerpt":"We study a class of mixed-integer bilevel stochastic programs where the leader commits to a first-stage decision before uncertainty is realized, and the follower solves a subsequent mixed-integer optimization problem for each revealed scenario. Due to the hierarchical structure and the presence of discrete variables at both levels, these problems are inherently $\\Sigma_2^p$-hard, making standard single-level reformulations computationally intractable. To address this significant computational challenge, we develop an exact algorithm that combines deterministic value-function reformulations wit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.29344","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.29344/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":"2606.29344","created_at":"2026-06-30T01:18:02.220143+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.29344v1","created_at":"2026-06-30T01:18:02.220143+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.29344","created_at":"2026-06-30T01:18:02.220143+00:00"},{"alias_kind":"pith_short_12","alias_value":"M2H7QM54GYV2","created_at":"2026-06-30T01:18:02.220143+00:00"},{"alias_kind":"pith_short_16","alias_value":"M2H7QM54GYV2ZV4H","created_at":"2026-06-30T01:18:02.220143+00:00"},{"alias_kind":"pith_short_8","alias_value":"M2H7QM54","created_at":"2026-06-30T01:18:02.220143+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/M2H7QM54GYV2ZV4HXNXSCWKMBO","json":"https://pith.science/pith/M2H7QM54GYV2ZV4HXNXSCWKMBO.json","graph_json":"https://pith.science/api/pith-number/M2H7QM54GYV2ZV4HXNXSCWKMBO/graph.json","events_json":"https://pith.science/api/pith-number/M2H7QM54GYV2ZV4HXNXSCWKMBO/events.json","paper":"https://pith.science/paper/M2H7QM54"},"agent_actions":{"view_html":"https://pith.science/pith/M2H7QM54GYV2ZV4HXNXSCWKMBO","download_json":"https://pith.science/pith/M2H7QM54GYV2ZV4HXNXSCWKMBO.json","view_paper":"https://pith.science/paper/M2H7QM54","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.29344&json=true","fetch_graph":"https://pith.science/api/pith-number/M2H7QM54GYV2ZV4HXNXSCWKMBO/graph.json","fetch_events":"https://pith.science/api/pith-number/M2H7QM54GYV2ZV4HXNXSCWKMBO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M2H7QM54GYV2ZV4HXNXSCWKMBO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M2H7QM54GYV2ZV4HXNXSCWKMBO/action/storage_attestation","attest_author":"https://pith.science/pith/M2H7QM54GYV2ZV4HXNXSCWKMBO/action/author_attestation","sign_citation":"https://pith.science/pith/M2H7QM54GYV2ZV4HXNXSCWKMBO/action/citation_signature","submit_replication":"https://pith.science/pith/M2H7QM54GYV2ZV4HXNXSCWKMBO/action/replication_record"}},"created_at":"2026-06-30T01:18:02.220143+00:00","updated_at":"2026-06-30T01:18:02.220143+00:00"}