{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:6KS5WOOR3TBZB7WDOMTYVCGEHV","short_pith_number":"pith:6KS5WOOR","schema_version":"1.0","canonical_sha256":"f2a5db39d1dcc390fec373278a88c43d4f2c5064e548c1e3fee7c1b3594446ce","source":{"kind":"arxiv","id":"2205.02329","version":1},"attestation_state":"computed","paper":{"title":"Second-Order Sensitivity Analysis for Bilevel Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Edward Schmerling, Marco Pavone, Nikos Arechiga, Robert Dyro","submitted_at":"2022-05-04T21:16:05Z","abstract_excerpt":"In this work we derive a second-order approach to bilevel optimization, a type of mathematical programming in which the solution to a parameterized optimization problem (the \"lower\" problem) is itself to be optimized (in the \"upper\" problem) as a function of the parameters. Many existing approaches to bilevel optimization employ first-order sensitivity analysis, based on the implicit function theorem (IFT), for the lower problem to derive a gradient of the lower problem solution with respect to its parameters; this IFT gradient is then used in a first-order optimization method for the upper pr"},"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":"2205.02329","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2022-05-04T21:16:05Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"e9d2443660931f866b2a499cd3def08355af9049cd6f01f7f7dc0ff4db4ddb47","abstract_canon_sha256":"e741505a80baf67f8979dc74cb21f5f0480c2ab0322b686e18aa0695045bb411"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:20:36.133897Z","signature_b64":"ufZ8TEd56UDGZ1TgKYX+AfDsTVLFBg0xY8iBvNo6IdJNDv1yNsJ7ZnL4q+tSQHj8kFs8Kz/naDFbTZE8kpKsCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2a5db39d1dcc390fec373278a88c43d4f2c5064e548c1e3fee7c1b3594446ce","last_reissued_at":"2026-07-05T04:20:36.133484Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:20:36.133484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Second-Order Sensitivity Analysis for Bilevel Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Edward Schmerling, Marco Pavone, Nikos Arechiga, Robert Dyro","submitted_at":"2022-05-04T21:16:05Z","abstract_excerpt":"In this work we derive a second-order approach to bilevel optimization, a type of mathematical programming in which the solution to a parameterized optimization problem (the \"lower\" problem) is itself to be optimized (in the \"upper\" problem) as a function of the parameters. Many existing approaches to bilevel optimization employ first-order sensitivity analysis, based on the implicit function theorem (IFT), for the lower problem to derive a gradient of the lower problem solution with respect to its parameters; this IFT gradient is then used in a first-order optimization method for the upper pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.02329","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/2205.02329/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":"2205.02329","created_at":"2026-07-05T04:20:36.133541+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.02329v1","created_at":"2026-07-05T04:20:36.133541+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.02329","created_at":"2026-07-05T04:20:36.133541+00:00"},{"alias_kind":"pith_short_12","alias_value":"6KS5WOOR3TBZ","created_at":"2026-07-05T04:20:36.133541+00:00"},{"alias_kind":"pith_short_16","alias_value":"6KS5WOOR3TBZB7WD","created_at":"2026-07-05T04:20:36.133541+00:00"},{"alias_kind":"pith_short_8","alias_value":"6KS5WOOR","created_at":"2026-07-05T04:20:36.133541+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/6KS5WOOR3TBZB7WDOMTYVCGEHV","json":"https://pith.science/pith/6KS5WOOR3TBZB7WDOMTYVCGEHV.json","graph_json":"https://pith.science/api/pith-number/6KS5WOOR3TBZB7WDOMTYVCGEHV/graph.json","events_json":"https://pith.science/api/pith-number/6KS5WOOR3TBZB7WDOMTYVCGEHV/events.json","paper":"https://pith.science/paper/6KS5WOOR"},"agent_actions":{"view_html":"https://pith.science/pith/6KS5WOOR3TBZB7WDOMTYVCGEHV","download_json":"https://pith.science/pith/6KS5WOOR3TBZB7WDOMTYVCGEHV.json","view_paper":"https://pith.science/paper/6KS5WOOR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.02329&json=true","fetch_graph":"https://pith.science/api/pith-number/6KS5WOOR3TBZB7WDOMTYVCGEHV/graph.json","fetch_events":"https://pith.science/api/pith-number/6KS5WOOR3TBZB7WDOMTYVCGEHV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6KS5WOOR3TBZB7WDOMTYVCGEHV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6KS5WOOR3TBZB7WDOMTYVCGEHV/action/storage_attestation","attest_author":"https://pith.science/pith/6KS5WOOR3TBZB7WDOMTYVCGEHV/action/author_attestation","sign_citation":"https://pith.science/pith/6KS5WOOR3TBZB7WDOMTYVCGEHV/action/citation_signature","submit_replication":"https://pith.science/pith/6KS5WOOR3TBZB7WDOMTYVCGEHV/action/replication_record"}},"created_at":"2026-07-05T04:20:36.133541+00:00","updated_at":"2026-07-05T04:20:36.133541+00:00"}