{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:N6VYFUWTCZ44P4P5ACUPIIOKM5","short_pith_number":"pith:N6VYFUWT","schema_version":"1.0","canonical_sha256":"6fab82d2d31679c7f1fd00a8f421ca675ac9794f3d6bf55f8f041b8cfe3b3ecb","source":{"kind":"arxiv","id":"2503.01559","version":4},"attestation_state":"computed","paper":{"title":"A Computational Study for Solving Decision-Dependent Robust Problems as Bilevel Optimization Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Henri Lefebvre, Johannes Th\\\"urauf, Martin Schmidt, Simon Stevens","submitted_at":"2025-03-03T14:02:45Z","abstract_excerpt":"Both bilevel and robust optimization are established fields of mathematical optimization and operations research. However, only until recently, the similarities in their mathematical structure has neither been studied theoretically nor exploited computationally. Based on the recent results by Goerigk et al. (2025), this paper is the first one that provides an extensive computational study for solving strictly robust optimization problems with decision-dependent uncertainty sets as equivalent bilevel optimization problems. If the uncertainty set can be dualized, the respective bilevel technique"},"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":"2503.01559","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-03-03T14:02:45Z","cross_cats_sorted":[],"title_canon_sha256":"0b5e76db4acfc7cad1a5408e7be365c9e7a841a37740b441dae51094b78db59a","abstract_canon_sha256":"c8d73d6a980edb3492397e0f32311df13930861466aa235daff184e22382f10f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-07T02:19:37.456654Z","signature_b64":"zneD3Kxi9SDsmq6IFAsZQr/mXnw44u7I8Q1WnuM0vx/fKZM88JxfUAudNxKdgV3bRY1zZkXve7mddQuUCsLTCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6fab82d2d31679c7f1fd00a8f421ca675ac9794f3d6bf55f8f041b8cfe3b3ecb","last_reissued_at":"2026-07-07T02:19:37.455759Z","signature_status":"signed_v1","first_computed_at":"2026-07-07T02:19:37.455759Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Computational Study for Solving Decision-Dependent Robust Problems as Bilevel Optimization Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Henri Lefebvre, Johannes Th\\\"urauf, Martin Schmidt, Simon Stevens","submitted_at":"2025-03-03T14:02:45Z","abstract_excerpt":"Both bilevel and robust optimization are established fields of mathematical optimization and operations research. However, only until recently, the similarities in their mathematical structure has neither been studied theoretically nor exploited computationally. Based on the recent results by Goerigk et al. (2025), this paper is the first one that provides an extensive computational study for solving strictly robust optimization problems with decision-dependent uncertainty sets as equivalent bilevel optimization problems. If the uncertainty set can be dualized, the respective bilevel technique"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.01559","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2503.01559/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":"2503.01559","created_at":"2026-07-07T02:19:37.455890+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.01559v4","created_at":"2026-07-07T02:19:37.455890+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.01559","created_at":"2026-07-07T02:19:37.455890+00:00"},{"alias_kind":"pith_short_12","alias_value":"N6VYFUWTCZ44","created_at":"2026-07-07T02:19:37.455890+00:00"},{"alias_kind":"pith_short_16","alias_value":"N6VYFUWTCZ44P4P5","created_at":"2026-07-07T02:19:37.455890+00:00"},{"alias_kind":"pith_short_8","alias_value":"N6VYFUWT","created_at":"2026-07-07T02:19:37.455890+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2606.18475","citing_title":"Intermediate Bilevel Optimization: Modeling Endogenous Follower Tie-Breaking Behavior","ref_index":35,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/N6VYFUWTCZ44P4P5ACUPIIOKM5","json":"https://pith.science/pith/N6VYFUWTCZ44P4P5ACUPIIOKM5.json","graph_json":"https://pith.science/api/pith-number/N6VYFUWTCZ44P4P5ACUPIIOKM5/graph.json","events_json":"https://pith.science/api/pith-number/N6VYFUWTCZ44P4P5ACUPIIOKM5/events.json","paper":"https://pith.science/paper/N6VYFUWT"},"agent_actions":{"view_html":"https://pith.science/pith/N6VYFUWTCZ44P4P5ACUPIIOKM5","download_json":"https://pith.science/pith/N6VYFUWTCZ44P4P5ACUPIIOKM5.json","view_paper":"https://pith.science/paper/N6VYFUWT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.01559&json=true","fetch_graph":"https://pith.science/api/pith-number/N6VYFUWTCZ44P4P5ACUPIIOKM5/graph.json","fetch_events":"https://pith.science/api/pith-number/N6VYFUWTCZ44P4P5ACUPIIOKM5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N6VYFUWTCZ44P4P5ACUPIIOKM5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N6VYFUWTCZ44P4P5ACUPIIOKM5/action/storage_attestation","attest_author":"https://pith.science/pith/N6VYFUWTCZ44P4P5ACUPIIOKM5/action/author_attestation","sign_citation":"https://pith.science/pith/N6VYFUWTCZ44P4P5ACUPIIOKM5/action/citation_signature","submit_replication":"https://pith.science/pith/N6VYFUWTCZ44P4P5ACUPIIOKM5/action/replication_record"}},"created_at":"2026-07-07T02:19:37.455890+00:00","updated_at":"2026-07-07T02:19:37.455890+00:00"}