{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:YIBTHBP2R4N33SBUSOOOITRWNM","short_pith_number":"pith:YIBTHBP2","canonical_record":{"source":{"id":"1809.06250","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-17T14:39:38Z","cross_cats_sorted":[],"title_canon_sha256":"a1051c4f313d9065927586456c182b4896601a0714c0d4aacec448fc5b3b9f49","abstract_canon_sha256":"fe62710cc49ea514bcfaecc240859dad0dedc21134a59e4485fe096891d12532"},"schema_version":"1.0"},"canonical_sha256":"c2033385fa8f1bbdc834939ce44e366b1db2a05888867eac9a5396a46bb3e524","source":{"kind":"arxiv","id":"1809.06250","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.06250","created_at":"2026-05-18T00:05:35Z"},{"alias_kind":"arxiv_version","alias_value":"1809.06250v1","created_at":"2026-05-18T00:05:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.06250","created_at":"2026-05-18T00:05:35Z"},{"alias_kind":"pith_short_12","alias_value":"YIBTHBP2R4N3","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YIBTHBP2R4N33SBU","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YIBTHBP2","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:YIBTHBP2R4N33SBUSOOOITRWNM","target":"record","payload":{"canonical_record":{"source":{"id":"1809.06250","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-17T14:39:38Z","cross_cats_sorted":[],"title_canon_sha256":"a1051c4f313d9065927586456c182b4896601a0714c0d4aacec448fc5b3b9f49","abstract_canon_sha256":"fe62710cc49ea514bcfaecc240859dad0dedc21134a59e4485fe096891d12532"},"schema_version":"1.0"},"canonical_sha256":"c2033385fa8f1bbdc834939ce44e366b1db2a05888867eac9a5396a46bb3e524","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:35.207344Z","signature_b64":"rQ1Ig2PJwIpfiFwSziC4K5aXSlr+ex7JxlNzFO+X8awa6dKkD33Gvx0lGBRtAhGHlK4PIPPiBP4v3QGPpCCtAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2033385fa8f1bbdc834939ce44e366b1db2a05888867eac9a5396a46bb3e524","last_reissued_at":"2026-05-18T00:05:35.206832Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:35.206832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.06250","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:05:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d2VLNyy1OJqH1M/+CiHmbIrUHx2D4BrO5LMTaykx/KxgF0keMQPlcGSQLitmctwu+maMEZT1vtHlK6DUgTbrAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T11:21:26.974738Z"},"content_sha256":"f7bd1a96ea7588d0c03216aec8c0e8c21915424e667b02ad15db78957c230a44","schema_version":"1.0","event_id":"sha256:f7bd1a96ea7588d0c03216aec8c0e8c21915424e667b02ad15db78957c230a44"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:YIBTHBP2R4N33SBUSOOOITRWNM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An inertial extrapolation method for convex simple bilevel optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alain Zemkoho, Phan Tu Vuong, Yekini Shehu","submitted_at":"2018-09-17T14:39:38Z","abstract_excerpt":"We consider a scalar objective minimization problem over the solution set of another optimization problem. This problem is known as simple bilevel optimization problem and has drawn a significant attention in the last few years. Our inner problem consists of minimizing the sum of smooth and nonsmooth functions while the outer one is the minimization of a smooth convex function. We propose and establish the convergence of a fixed-point iterative method with inertial extrapolation to solve the problem. Our numerical experiments show that the method proposed in this paper outperforms the currentl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.06250","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:05:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z69wHn6eOAHFfLXttug/3qwznEk5cf3+r6QQpW8JFTbkVWIo5gIUfNMWq2nsIhkwDhUWlEHq3dpjiSWUBCfsDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T11:21:26.975086Z"},"content_sha256":"c88819f7bb109c31c56543f765918cbc3377515ca0a58031900d802e9760d4a3","schema_version":"1.0","event_id":"sha256:c88819f7bb109c31c56543f765918cbc3377515ca0a58031900d802e9760d4a3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YIBTHBP2R4N33SBUSOOOITRWNM/bundle.json","state_url":"https://pith.science/pith/YIBTHBP2R4N33SBUSOOOITRWNM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YIBTHBP2R4N33SBUSOOOITRWNM/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-21T11:21:26Z","links":{"resolver":"https://pith.science/pith/YIBTHBP2R4N33SBUSOOOITRWNM","bundle":"https://pith.science/pith/YIBTHBP2R4N33SBUSOOOITRWNM/bundle.json","state":"https://pith.science/pith/YIBTHBP2R4N33SBUSOOOITRWNM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YIBTHBP2R4N33SBUSOOOITRWNM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:YIBTHBP2R4N33SBUSOOOITRWNM","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":"fe62710cc49ea514bcfaecc240859dad0dedc21134a59e4485fe096891d12532","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-17T14:39:38Z","title_canon_sha256":"a1051c4f313d9065927586456c182b4896601a0714c0d4aacec448fc5b3b9f49"},"schema_version":"1.0","source":{"id":"1809.06250","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.06250","created_at":"2026-05-18T00:05:35Z"},{"alias_kind":"arxiv_version","alias_value":"1809.06250v1","created_at":"2026-05-18T00:05:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.06250","created_at":"2026-05-18T00:05:35Z"},{"alias_kind":"pith_short_12","alias_value":"YIBTHBP2R4N3","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YIBTHBP2R4N33SBU","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YIBTHBP2","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:c88819f7bb109c31c56543f765918cbc3377515ca0a58031900d802e9760d4a3","target":"graph","created_at":"2026-05-18T00:05:35Z","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 consider a scalar objective minimization problem over the solution set of another optimization problem. This problem is known as simple bilevel optimization problem and has drawn a significant attention in the last few years. Our inner problem consists of minimizing the sum of smooth and nonsmooth functions while the outer one is the minimization of a smooth convex function. We propose and establish the convergence of a fixed-point iterative method with inertial extrapolation to solve the problem. Our numerical experiments show that the method proposed in this paper outperforms the currentl","authors_text":"Alain Zemkoho, Phan Tu Vuong, Yekini Shehu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-17T14:39:38Z","title":"An inertial extrapolation method for convex simple bilevel optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.06250","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:f7bd1a96ea7588d0c03216aec8c0e8c21915424e667b02ad15db78957c230a44","target":"record","created_at":"2026-05-18T00:05:35Z","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":"fe62710cc49ea514bcfaecc240859dad0dedc21134a59e4485fe096891d12532","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-17T14:39:38Z","title_canon_sha256":"a1051c4f313d9065927586456c182b4896601a0714c0d4aacec448fc5b3b9f49"},"schema_version":"1.0","source":{"id":"1809.06250","kind":"arxiv","version":1}},"canonical_sha256":"c2033385fa8f1bbdc834939ce44e366b1db2a05888867eac9a5396a46bb3e524","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c2033385fa8f1bbdc834939ce44e366b1db2a05888867eac9a5396a46bb3e524","first_computed_at":"2026-05-18T00:05:35.206832Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:35.206832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rQ1Ig2PJwIpfiFwSziC4K5aXSlr+ex7JxlNzFO+X8awa6dKkD33Gvx0lGBRtAhGHlK4PIPPiBP4v3QGPpCCtAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:35.207344Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.06250","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f7bd1a96ea7588d0c03216aec8c0e8c21915424e667b02ad15db78957c230a44","sha256:c88819f7bb109c31c56543f765918cbc3377515ca0a58031900d802e9760d4a3"],"state_sha256":"c0f3bb122d21803dea0a091531e8c2dec5d4f0cfa7c4e683ad8ac780e3fdc167"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jShZdLW8h+OGrwgChtdOpfs1PDUx7rSZax5hmY0EX57FtXMWPxX88DV5sUEGyNQO3iHlW7S1OpaphShx7gDJDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T11:21:26.977113Z","bundle_sha256":"aeb7acb62d493e1b8f95db1cf2d2eb257db94f0aa4fc2ffcadfc2ec1d930b533"}}