{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:Z5QBDNQ6LKW4GAW7ID5R22HPWM","short_pith_number":"pith:Z5QBDNQ6","schema_version":"1.0","canonical_sha256":"cf6011b61e5aadc302df40fb1d68efb3043bbd4a3cb15b8b8c4c87006d7539ae","source":{"kind":"arxiv","id":"2510.01487","version":2},"attestation_state":"computed","paper":{"title":"A sensitivity-based method for bilevel optimization problems: Theoretical analysis and computational performance","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Eduardo Nolasco, Ross D. King, Vassilios S. Vassiliadis","submitted_at":"2025-10-01T22:00:51Z","abstract_excerpt":"Bilevel optimization provides a powerful framework for modelling hierarchical decision-making systems. This work presents a sensitivity-based algorithm that addresses the bilevel structure directly by treating the lower-level optimal solution as an implicit, locally differentiable function of the upper-level variables, thereby avoiding classical single-level reformulations. Under standard regularity assumptions on the lower level, an adjoint-based representation of the reduced upper-level gradient is derived, replacing explicit construction of the sensitivity Jacobian with a single linear adjo"},"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":"2510.01487","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2025-10-01T22:00:51Z","cross_cats_sorted":[],"title_canon_sha256":"e7013036403169d53ec474faee53ce1f127d0ec6cff3fb0990f8c9ec3fe14756","abstract_canon_sha256":"e62af284ec37c8c4d7531c30d5454bc4349ada3abb076983c8eb6dd766a3ee2a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-28T02:04:43.207488Z","signature_b64":"ZkQAcOIo8iZQQZIzfresv21K2bQqgE+m6uBvQabBR1gbOsJAlWI+GOmdVQH08b3Dehvhh9dAJpuReiexF1kwDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf6011b61e5aadc302df40fb1d68efb3043bbd4a3cb15b8b8c4c87006d7539ae","last_reissued_at":"2026-05-28T02:04:43.206383Z","signature_status":"signed_v1","first_computed_at":"2026-05-28T02:04:43.206383Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A sensitivity-based method for bilevel optimization problems: Theoretical analysis and computational performance","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Eduardo Nolasco, Ross D. King, Vassilios S. Vassiliadis","submitted_at":"2025-10-01T22:00:51Z","abstract_excerpt":"Bilevel optimization provides a powerful framework for modelling hierarchical decision-making systems. This work presents a sensitivity-based algorithm that addresses the bilevel structure directly by treating the lower-level optimal solution as an implicit, locally differentiable function of the upper-level variables, thereby avoiding classical single-level reformulations. Under standard regularity assumptions on the lower level, an adjoint-based representation of the reduced upper-level gradient is derived, replacing explicit construction of the sensitivity Jacobian with a single linear adjo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.01487","kind":"arxiv","version":2},"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/2510.01487/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":"2510.01487","created_at":"2026-05-28T02:04:43.206493+00:00"},{"alias_kind":"arxiv_version","alias_value":"2510.01487v2","created_at":"2026-05-28T02:04:43.206493+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.01487","created_at":"2026-05-28T02:04:43.206493+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z5QBDNQ6LKW4","created_at":"2026-05-28T02:04:43.206493+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z5QBDNQ6LKW4GAW7","created_at":"2026-05-28T02:04:43.206493+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z5QBDNQ6","created_at":"2026-05-28T02:04:43.206493+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.14409","citing_title":"On the Nature of Regularity Assumptions in Bilevel Optimization with Constrained Lower-level Problem","ref_index":70,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Z5QBDNQ6LKW4GAW7ID5R22HPWM","json":"https://pith.science/pith/Z5QBDNQ6LKW4GAW7ID5R22HPWM.json","graph_json":"https://pith.science/api/pith-number/Z5QBDNQ6LKW4GAW7ID5R22HPWM/graph.json","events_json":"https://pith.science/api/pith-number/Z5QBDNQ6LKW4GAW7ID5R22HPWM/events.json","paper":"https://pith.science/paper/Z5QBDNQ6"},"agent_actions":{"view_html":"https://pith.science/pith/Z5QBDNQ6LKW4GAW7ID5R22HPWM","download_json":"https://pith.science/pith/Z5QBDNQ6LKW4GAW7ID5R22HPWM.json","view_paper":"https://pith.science/paper/Z5QBDNQ6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2510.01487&json=true","fetch_graph":"https://pith.science/api/pith-number/Z5QBDNQ6LKW4GAW7ID5R22HPWM/graph.json","fetch_events":"https://pith.science/api/pith-number/Z5QBDNQ6LKW4GAW7ID5R22HPWM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z5QBDNQ6LKW4GAW7ID5R22HPWM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z5QBDNQ6LKW4GAW7ID5R22HPWM/action/storage_attestation","attest_author":"https://pith.science/pith/Z5QBDNQ6LKW4GAW7ID5R22HPWM/action/author_attestation","sign_citation":"https://pith.science/pith/Z5QBDNQ6LKW4GAW7ID5R22HPWM/action/citation_signature","submit_replication":"https://pith.science/pith/Z5QBDNQ6LKW4GAW7ID5R22HPWM/action/replication_record"}},"created_at":"2026-05-28T02:04:43.206493+00:00","updated_at":"2026-05-28T02:04:43.206493+00:00"}