{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:YZWK47PBU6QIV5YG656DPNJP4Q","short_pith_number":"pith:YZWK47PB","schema_version":"1.0","canonical_sha256":"c66cae7de1a7a08af706f77c37b52fe4389be5836cfd748390fe605fe4b5de27","source":{"kind":"arxiv","id":"1602.07080","version":2},"attestation_state":"computed","paper":{"title":"Techniques for Gradient Based Bilevel Optimization with Nonsmooth Lower Level Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Peter Ochs, Ren\\'e Ranftl, Thomas Brox, Thomas Pock","submitted_at":"2016-02-23T08:20:18Z","abstract_excerpt":"We propose techniques for approximating bilevel optimization problems with non-smooth lower level problems that can have a non-unique solution. To this end, we substitute the expression of a minimizer of the lower level minimization problem with an iterative algorithm that is guaranteed to converge to a minimizer of the problem. Using suitable non-linear proximal distance functions, the update mappings of such an iterative algorithm can be differentiable, notwithstanding the fact that the minimization problem is non-smooth."},"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":"1602.07080","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-02-23T08:20:18Z","cross_cats_sorted":[],"title_canon_sha256":"dc153a61d8d670653402d5ca412529b4598dd9f156ac5403d9e5e754c0ee3baf","abstract_canon_sha256":"858e2682bddf4deca3dad4e258a8dabc9daee76b46b6b4a10dfd766b48fe624e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:13.941377Z","signature_b64":"Xcs7q9QGVa18alMdx5nIMfcDCHT7MCZkMCHdcgcBSJ2PZBpUU7A4TLmMyS/y061oPQVYi+DfHQP3YX6CM1OJAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c66cae7de1a7a08af706f77c37b52fe4389be5836cfd748390fe605fe4b5de27","last_reissued_at":"2026-05-18T01:16:13.940877Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:13.940877Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Techniques for Gradient Based Bilevel Optimization with Nonsmooth Lower Level Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Peter Ochs, Ren\\'e Ranftl, Thomas Brox, Thomas Pock","submitted_at":"2016-02-23T08:20:18Z","abstract_excerpt":"We propose techniques for approximating bilevel optimization problems with non-smooth lower level problems that can have a non-unique solution. To this end, we substitute the expression of a minimizer of the lower level minimization problem with an iterative algorithm that is guaranteed to converge to a minimizer of the problem. Using suitable non-linear proximal distance functions, the update mappings of such an iterative algorithm can be differentiable, notwithstanding the fact that the minimization problem is non-smooth."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.07080","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":""},"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":"1602.07080","created_at":"2026-05-18T01:16:13.940954+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.07080v2","created_at":"2026-05-18T01:16:13.940954+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07080","created_at":"2026-05-18T01:16:13.940954+00:00"},{"alias_kind":"pith_short_12","alias_value":"YZWK47PBU6QI","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"YZWK47PBU6QIV5YG","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"YZWK47PB","created_at":"2026-05-18T12:30:53.716459+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/YZWK47PBU6QIV5YG656DPNJP4Q","json":"https://pith.science/pith/YZWK47PBU6QIV5YG656DPNJP4Q.json","graph_json":"https://pith.science/api/pith-number/YZWK47PBU6QIV5YG656DPNJP4Q/graph.json","events_json":"https://pith.science/api/pith-number/YZWK47PBU6QIV5YG656DPNJP4Q/events.json","paper":"https://pith.science/paper/YZWK47PB"},"agent_actions":{"view_html":"https://pith.science/pith/YZWK47PBU6QIV5YG656DPNJP4Q","download_json":"https://pith.science/pith/YZWK47PBU6QIV5YG656DPNJP4Q.json","view_paper":"https://pith.science/paper/YZWK47PB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.07080&json=true","fetch_graph":"https://pith.science/api/pith-number/YZWK47PBU6QIV5YG656DPNJP4Q/graph.json","fetch_events":"https://pith.science/api/pith-number/YZWK47PBU6QIV5YG656DPNJP4Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YZWK47PBU6QIV5YG656DPNJP4Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YZWK47PBU6QIV5YG656DPNJP4Q/action/storage_attestation","attest_author":"https://pith.science/pith/YZWK47PBU6QIV5YG656DPNJP4Q/action/author_attestation","sign_citation":"https://pith.science/pith/YZWK47PBU6QIV5YG656DPNJP4Q/action/citation_signature","submit_replication":"https://pith.science/pith/YZWK47PBU6QIV5YG656DPNJP4Q/action/replication_record"}},"created_at":"2026-05-18T01:16:13.940954+00:00","updated_at":"2026-05-18T01:16:13.940954+00:00"}