{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:YZWK47PBU6QIV5YG656DPNJP4Q","short_pith_number":"pith:YZWK47PB","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"},"canonical_sha256":"c66cae7de1a7a08af706f77c37b52fe4389be5836cfd748390fe605fe4b5de27","source":{"kind":"arxiv","id":"1602.07080","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.07080","created_at":"2026-05-18T01:16:13Z"},{"alias_kind":"arxiv_version","alias_value":"1602.07080v2","created_at":"2026-05-18T01:16:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07080","created_at":"2026-05-18T01:16:13Z"},{"alias_kind":"pith_short_12","alias_value":"YZWK47PBU6QI","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YZWK47PBU6QIV5YG","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YZWK47PB","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:YZWK47PBU6QIV5YG656DPNJP4Q","target":"record","payload":{"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"},"canonical_sha256":"c66cae7de1a7a08af706f77c37b52fe4389be5836cfd748390fe605fe4b5de27","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"},"source_kind":"arxiv","source_id":"1602.07080","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:16:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qg5v727oyBlb8t9c0oPhNFwn54ZOjBW0O/QIJaqFoj+bP+p7apT1auzRlrx0jQIuCkJJRvz9MKFoGEOdc7hhAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T05:16:28.286306Z"},"content_sha256":"943b841e644925983171f143cfb82be50d9cb1d468c36297a4504e7536379a22","schema_version":"1.0","event_id":"sha256:943b841e644925983171f143cfb82be50d9cb1d468c36297a4504e7536379a22"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:YZWK47PBU6QIV5YG656DPNJP4Q","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:16:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mnaQW/i2bJcUB+BAY3+i2cBNn+voQvQxVZqoWIZdg192cMFY/T+A+kwu0YMdT43AA4qDdjWmJbfhhEPfcNGVCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T05:16:28.286962Z"},"content_sha256":"cc40755afe530cc8bd4d35d984ea9be3e8521305906be687e3688a8501132524","schema_version":"1.0","event_id":"sha256:cc40755afe530cc8bd4d35d984ea9be3e8521305906be687e3688a8501132524"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YZWK47PBU6QIV5YG656DPNJP4Q/bundle.json","state_url":"https://pith.science/pith/YZWK47PBU6QIV5YG656DPNJP4Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YZWK47PBU6QIV5YG656DPNJP4Q/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-11T05:16:28Z","links":{"resolver":"https://pith.science/pith/YZWK47PBU6QIV5YG656DPNJP4Q","bundle":"https://pith.science/pith/YZWK47PBU6QIV5YG656DPNJP4Q/bundle.json","state":"https://pith.science/pith/YZWK47PBU6QIV5YG656DPNJP4Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YZWK47PBU6QIV5YG656DPNJP4Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:YZWK47PBU6QIV5YG656DPNJP4Q","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"858e2682bddf4deca3dad4e258a8dabc9daee76b46b6b4a10dfd766b48fe624e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-02-23T08:20:18Z","title_canon_sha256":"dc153a61d8d670653402d5ca412529b4598dd9f156ac5403d9e5e754c0ee3baf"},"schema_version":"1.0","source":{"id":"1602.07080","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.07080","created_at":"2026-05-18T01:16:13Z"},{"alias_kind":"arxiv_version","alias_value":"1602.07080v2","created_at":"2026-05-18T01:16:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07080","created_at":"2026-05-18T01:16:13Z"},{"alias_kind":"pith_short_12","alias_value":"YZWK47PBU6QI","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YZWK47PBU6QIV5YG","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YZWK47PB","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:cc40755afe530cc8bd4d35d984ea9be3e8521305906be687e3688a8501132524","target":"graph","created_at":"2026-05-18T01:16:13Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Peter Ochs, Ren\\'e Ranftl, Thomas Brox, Thomas Pock","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-02-23T08:20:18Z","title":"Techniques for Gradient Based Bilevel Optimization with Nonsmooth Lower Level Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.07080","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:943b841e644925983171f143cfb82be50d9cb1d468c36297a4504e7536379a22","target":"record","created_at":"2026-05-18T01:16:13Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"858e2682bddf4deca3dad4e258a8dabc9daee76b46b6b4a10dfd766b48fe624e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-02-23T08:20:18Z","title_canon_sha256":"dc153a61d8d670653402d5ca412529b4598dd9f156ac5403d9e5e754c0ee3baf"},"schema_version":"1.0","source":{"id":"1602.07080","kind":"arxiv","version":2}},"canonical_sha256":"c66cae7de1a7a08af706f77c37b52fe4389be5836cfd748390fe605fe4b5de27","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c66cae7de1a7a08af706f77c37b52fe4389be5836cfd748390fe605fe4b5de27","first_computed_at":"2026-05-18T01:16:13.940877Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:13.940877Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Xcs7q9QGVa18alMdx5nIMfcDCHT7MCZkMCHdcgcBSJ2PZBpUU7A4TLmMyS/y061oPQVYi+DfHQP3YX6CM1OJAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:13.941377Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.07080","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:943b841e644925983171f143cfb82be50d9cb1d468c36297a4504e7536379a22","sha256:cc40755afe530cc8bd4d35d984ea9be3e8521305906be687e3688a8501132524"],"state_sha256":"5223354fc33f56097b884df07eb2052746e838db7d0a74da1f2e98cfb9a87c3c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P7FU+35DmT4lLNd4Uxv7HjfYbYj+6QtEdEsThPEukn4ZqFSNoxNlC6pXh6Boy9mUhAbTHiblV6c6i4L3RKDOBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T05:16:28.290648Z","bundle_sha256":"b681c8fae084a031b7ab598dbaea279a5c1a4dc3ce1d235cb7a9973a2ccfeb5c"}}