{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:NOUAXQVBAHDVSW457562GEFV7W","short_pith_number":"pith:NOUAXQVB","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"},"canonical_sha256":"6ba80bc2a101c7595b9dff7da310b5fdb6174a934118169afce5fa21b5333b27","source":{"kind":"arxiv","id":"1702.03999","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.03999","created_at":"2026-05-18T00:50:49Z"},{"alias_kind":"arxiv_version","alias_value":"1702.03999v1","created_at":"2026-05-18T00:50:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.03999","created_at":"2026-05-18T00:50:49Z"},{"alias_kind":"pith_short_12","alias_value":"NOUAXQVBAHDV","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"NOUAXQVBAHDVSW45","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"NOUAXQVB","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:NOUAXQVBAHDVSW457562GEFV7W","target":"record","payload":{"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"},"canonical_sha256":"6ba80bc2a101c7595b9dff7da310b5fdb6174a934118169afce5fa21b5333b27","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"},"source_kind":"arxiv","source_id":"1702.03999","source_version":1,"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-18T00:50:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FIuMPPvXmWDlcPKkxRTnz5wjnr8Kk/NexEURA1rmoMCTaCn/WHoTu9240DWqkmw8dSBWbVq14wy9EQGoDGZBCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T13:55:51.196841Z"},"content_sha256":"f041c44534b19e6fdb0d48b21c234df5370af7337f9001f7e69fb0d2d573808e","schema_version":"1.0","event_id":"sha256:f041c44534b19e6fdb0d48b21c234df5370af7337f9001f7e69fb0d2d573808e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:NOUAXQVBAHDVSW457562GEFV7W","target":"graph","payload":{"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"},"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-18T00:50:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5cvHJ+8WLV7AvSXAX8UzeSZHTQxVWXgexolceKGhHTrivB89BoVFdYCjAb1qAjus7xlyt9a47KhWMQjtQQY5Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T13:55:51.197208Z"},"content_sha256":"733e17ba6f7c0f6dd2e52b6f9c4892e235d1d72bf877a63e0a4e1232299337b4","schema_version":"1.0","event_id":"sha256:733e17ba6f7c0f6dd2e52b6f9c4892e235d1d72bf877a63e0a4e1232299337b4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NOUAXQVBAHDVSW457562GEFV7W/bundle.json","state_url":"https://pith.science/pith/NOUAXQVBAHDVSW457562GEFV7W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NOUAXQVBAHDVSW457562GEFV7W/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-07-08T13:55:51Z","links":{"resolver":"https://pith.science/pith/NOUAXQVBAHDVSW457562GEFV7W","bundle":"https://pith.science/pith/NOUAXQVBAHDVSW457562GEFV7W/bundle.json","state":"https://pith.science/pith/NOUAXQVBAHDVSW457562GEFV7W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NOUAXQVBAHDVSW457562GEFV7W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:NOUAXQVBAHDVSW457562GEFV7W","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":"d85e2444d55d08af04bb316664917f752daa7d53a08a01c58762eb1f71588eb5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-13T22:20:35Z","title_canon_sha256":"e5d8f4134ca15e097aa204ed93b884815cbf33f2ffb339fbcff0a1efd65f29bf"},"schema_version":"1.0","source":{"id":"1702.03999","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.03999","created_at":"2026-05-18T00:50:49Z"},{"alias_kind":"arxiv_version","alias_value":"1702.03999v1","created_at":"2026-05-18T00:50:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.03999","created_at":"2026-05-18T00:50:49Z"},{"alias_kind":"pith_short_12","alias_value":"NOUAXQVBAHDV","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"NOUAXQVBAHDVSW45","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"NOUAXQVB","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:733e17ba6f7c0f6dd2e52b6f9c4892e235d1d72bf877a63e0a4e1232299337b4","target":"graph","created_at":"2026-05-18T00:50:49Z","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":"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.","authors_text":"Shimrit Shtern, Shoham Sabach","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-13T22:20:35Z","title":"A First Order Method for Solving Convex Bi-Level Optimization Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.03999","kind":"arxiv","version":1},"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:f041c44534b19e6fdb0d48b21c234df5370af7337f9001f7e69fb0d2d573808e","target":"record","created_at":"2026-05-18T00:50:49Z","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":"d85e2444d55d08af04bb316664917f752daa7d53a08a01c58762eb1f71588eb5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-13T22:20:35Z","title_canon_sha256":"e5d8f4134ca15e097aa204ed93b884815cbf33f2ffb339fbcff0a1efd65f29bf"},"schema_version":"1.0","source":{"id":"1702.03999","kind":"arxiv","version":1}},"canonical_sha256":"6ba80bc2a101c7595b9dff7da310b5fdb6174a934118169afce5fa21b5333b27","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6ba80bc2a101c7595b9dff7da310b5fdb6174a934118169afce5fa21b5333b27","first_computed_at":"2026-05-18T00:50:49.331657Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:49.331657Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Jw+7x2l4jlW48v5IujDt3mQIelXa8I4KhFmh2Uat0lPejualVss0gfVDPAOkA/sO+CPe8Mi5duq4ChC9Bf8HDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:49.332211Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.03999","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f041c44534b19e6fdb0d48b21c234df5370af7337f9001f7e69fb0d2d573808e","sha256:733e17ba6f7c0f6dd2e52b6f9c4892e235d1d72bf877a63e0a4e1232299337b4"],"state_sha256":"0e3ba555488e01b0cbe4a8cd1f07c6c8b4f8430f5a107b611051b628dbf6bab4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/WB1ykXSjtTQNsJoq87NqFrkulwpVOQj34Fc15rIZJQ748m8H95zJTnhFVg64hnWiHRY7Xya2/LDB74D7efQAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-08T13:55:51.199472Z","bundle_sha256":"ace54aa5ba97039986e2aabed6d2ca9bbe22c7144f5e428aa01bbb1c7d3bd3dc"}}