{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:NOUAXQVBAHDVSW457562GEFV7W","short_pith_number":"pith:NOUAXQVB","schema_version":"1.0","canonical_sha256":"6ba80bc2a101c7595b9dff7da310b5fdb6174a934118169afce5fa21b5333b27","source":{"kind":"arxiv","id":"1702.03999","version":1},"attestation_state":"computed","paper":{"title":"A First Order Method for Solving Convex Bi-Level Optimization Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Shimrit Shtern, Shoham Sabach","submitted_at":"2017-02-13T22:20:35Z","abstract_excerpt":"In this paper we study convex bi-level optimization problems for which the inner level consists of minimization of the sum of smooth and nonsmooth functions. The outer level aims at minimizing a smooth and strongly convex function over the optimal solutions set of the inner problem. We analyze a first order method which is based on an existing fixed-point algorithm. Global sublinear rate of convergence of the method is established in terms of the inner objective function values."},"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":"1702.03999","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-13T22:20:35Z","cross_cats_sorted":[],"title_canon_sha256":"e5d8f4134ca15e097aa204ed93b884815cbf33f2ffb339fbcff0a1efd65f29bf","abstract_canon_sha256":"d85e2444d55d08af04bb316664917f752daa7d53a08a01c58762eb1f71588eb5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:49.332211Z","signature_b64":"Jw+7x2l4jlW48v5IujDt3mQIelXa8I4KhFmh2Uat0lPejualVss0gfVDPAOkA/sO+CPe8Mi5duq4ChC9Bf8HDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ba80bc2a101c7595b9dff7da310b5fdb6174a934118169afce5fa21b5333b27","last_reissued_at":"2026-05-18T00:50:49.331657Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:49.331657Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A First Order Method for Solving Convex Bi-Level Optimization Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Shimrit Shtern, Shoham Sabach","submitted_at":"2017-02-13T22:20:35Z","abstract_excerpt":"In this paper we study convex bi-level optimization problems for which the inner level consists of minimization of the sum of smooth and nonsmooth functions. The outer level aims at minimizing a smooth and strongly convex function over the optimal solutions set of the inner problem. We analyze a first order method which is based on an existing fixed-point algorithm. Global sublinear rate of convergence of the method is established in terms of the inner objective function values."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.03999","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":""},"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":"1702.03999","created_at":"2026-05-18T00:50:49.331744+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.03999v1","created_at":"2026-05-18T00:50:49.331744+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.03999","created_at":"2026-05-18T00:50:49.331744+00:00"},{"alias_kind":"pith_short_12","alias_value":"NOUAXQVBAHDV","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"NOUAXQVBAHDVSW45","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"NOUAXQVB","created_at":"2026-05-18T12:31:34.259226+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/NOUAXQVBAHDVSW457562GEFV7W","json":"https://pith.science/pith/NOUAXQVBAHDVSW457562GEFV7W.json","graph_json":"https://pith.science/api/pith-number/NOUAXQVBAHDVSW457562GEFV7W/graph.json","events_json":"https://pith.science/api/pith-number/NOUAXQVBAHDVSW457562GEFV7W/events.json","paper":"https://pith.science/paper/NOUAXQVB"},"agent_actions":{"view_html":"https://pith.science/pith/NOUAXQVBAHDVSW457562GEFV7W","download_json":"https://pith.science/pith/NOUAXQVBAHDVSW457562GEFV7W.json","view_paper":"https://pith.science/paper/NOUAXQVB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.03999&json=true","fetch_graph":"https://pith.science/api/pith-number/NOUAXQVBAHDVSW457562GEFV7W/graph.json","fetch_events":"https://pith.science/api/pith-number/NOUAXQVBAHDVSW457562GEFV7W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NOUAXQVBAHDVSW457562GEFV7W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NOUAXQVBAHDVSW457562GEFV7W/action/storage_attestation","attest_author":"https://pith.science/pith/NOUAXQVBAHDVSW457562GEFV7W/action/author_attestation","sign_citation":"https://pith.science/pith/NOUAXQVBAHDVSW457562GEFV7W/action/citation_signature","submit_replication":"https://pith.science/pith/NOUAXQVBAHDVSW457562GEFV7W/action/replication_record"}},"created_at":"2026-05-18T00:50:49.331744+00:00","updated_at":"2026-05-18T00:50:49.331744+00:00"}