{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:QC5L34NBVVT5TW4YLMSFQB75ZT","short_pith_number":"pith:QC5L34NB","schema_version":"1.0","canonical_sha256":"80babdf1a1ad67d9db985b245807fdcce6c3cfb0c54229320adc42e4a5ce9213","source":{"kind":"arxiv","id":"2212.09843","version":1},"attestation_state":"computed","paper":{"title":"Methodology and first-order algorithms for solving nonsmooth and non-strongly convex bilevel optimization problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Lior Doron, Shimrit Shtern","submitted_at":"2022-12-19T20:40:58Z","abstract_excerpt":"Simple bilevel problems are optimization problems in which we want to find an optimal solution to an inner problem that minimizes an outer objective function. Such problems appear in many machine learning and signal processing applications as a way to eliminate undesirable solutions. %However, since these problems do not satisfy regularity conditions, they are often hard to solve exactly and are usually solved via iterative regularization. In the past few years, several algorithms were proposed to solve these bilevel problems directly and provide a rate for obtaining feasibility, assuming that"},"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":"2212.09843","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-12-19T20:40:58Z","cross_cats_sorted":[],"title_canon_sha256":"d074bd20df8dda44cbe4e017d5cc836dbbd5e7e06f405cf5b23fa6cf5c73221b","abstract_canon_sha256":"2bd9d5e64624670d8a8350229481414b1f9b5c5bc3befe854581705503893980"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:27:00.467053Z","signature_b64":"xZiIUKRzTNQcmS/yoJhRksMkTvdvI4cbK/ziS/8xobkhwIdNHTA8tg6cE7fUbJgMdm+VJ92vMOvvfxkiLn4JDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80babdf1a1ad67d9db985b245807fdcce6c3cfb0c54229320adc42e4a5ce9213","last_reissued_at":"2026-07-05T05:27:00.466728Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:27:00.466728Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Methodology and first-order algorithms for solving nonsmooth and non-strongly convex bilevel optimization problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Lior Doron, Shimrit Shtern","submitted_at":"2022-12-19T20:40:58Z","abstract_excerpt":"Simple bilevel problems are optimization problems in which we want to find an optimal solution to an inner problem that minimizes an outer objective function. Such problems appear in many machine learning and signal processing applications as a way to eliminate undesirable solutions. %However, since these problems do not satisfy regularity conditions, they are often hard to solve exactly and are usually solved via iterative regularization. In the past few years, several algorithms were proposed to solve these bilevel problems directly and provide a rate for obtaining feasibility, assuming that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.09843","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/2212.09843/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":"2212.09843","created_at":"2026-07-05T05:27:00.466782+00:00"},{"alias_kind":"arxiv_version","alias_value":"2212.09843v1","created_at":"2026-07-05T05:27:00.466782+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.09843","created_at":"2026-07-05T05:27:00.466782+00:00"},{"alias_kind":"pith_short_12","alias_value":"QC5L34NBVVT5","created_at":"2026-07-05T05:27:00.466782+00:00"},{"alias_kind":"pith_short_16","alias_value":"QC5L34NBVVT5TW4Y","created_at":"2026-07-05T05:27:00.466782+00:00"},{"alias_kind":"pith_short_8","alias_value":"QC5L34NB","created_at":"2026-07-05T05:27:00.466782+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/QC5L34NBVVT5TW4YLMSFQB75ZT","json":"https://pith.science/pith/QC5L34NBVVT5TW4YLMSFQB75ZT.json","graph_json":"https://pith.science/api/pith-number/QC5L34NBVVT5TW4YLMSFQB75ZT/graph.json","events_json":"https://pith.science/api/pith-number/QC5L34NBVVT5TW4YLMSFQB75ZT/events.json","paper":"https://pith.science/paper/QC5L34NB"},"agent_actions":{"view_html":"https://pith.science/pith/QC5L34NBVVT5TW4YLMSFQB75ZT","download_json":"https://pith.science/pith/QC5L34NBVVT5TW4YLMSFQB75ZT.json","view_paper":"https://pith.science/paper/QC5L34NB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2212.09843&json=true","fetch_graph":"https://pith.science/api/pith-number/QC5L34NBVVT5TW4YLMSFQB75ZT/graph.json","fetch_events":"https://pith.science/api/pith-number/QC5L34NBVVT5TW4YLMSFQB75ZT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QC5L34NBVVT5TW4YLMSFQB75ZT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QC5L34NBVVT5TW4YLMSFQB75ZT/action/storage_attestation","attest_author":"https://pith.science/pith/QC5L34NBVVT5TW4YLMSFQB75ZT/action/author_attestation","sign_citation":"https://pith.science/pith/QC5L34NBVVT5TW4YLMSFQB75ZT/action/citation_signature","submit_replication":"https://pith.science/pith/QC5L34NBVVT5TW4YLMSFQB75ZT/action/replication_record"}},"created_at":"2026-07-05T05:27:00.466782+00:00","updated_at":"2026-07-05T05:27:00.466782+00:00"}