{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:35J52URGGBQX4S6B4DMIRUDU7J","short_pith_number":"pith:35J52URG","canonical_record":{"source":{"id":"2412.00659","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-12-01T03:42:17Z","cross_cats_sorted":[],"title_canon_sha256":"3a59223546ba607b6f61f3c8acb81a2c415e51a63028a05bb8715160244006f6","abstract_canon_sha256":"c7e43f32686dc411f9022fdd2c41fdb9c4837c1d8208339e358f170ff2ccd8bd"},"schema_version":"1.0"},"canonical_sha256":"df53dd522630617e4bc1e0d888d074fa4256bb9f902ae488c356dee4552344e9","source":{"kind":"arxiv","id":"2412.00659","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.00659","created_at":"2026-07-05T09:42:44Z"},{"alias_kind":"arxiv_version","alias_value":"2412.00659v1","created_at":"2026-07-05T09:42:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.00659","created_at":"2026-07-05T09:42:44Z"},{"alias_kind":"pith_short_12","alias_value":"35J52URGGBQX","created_at":"2026-07-05T09:42:44Z"},{"alias_kind":"pith_short_16","alias_value":"35J52URGGBQX4S6B","created_at":"2026-07-05T09:42:44Z"},{"alias_kind":"pith_short_8","alias_value":"35J52URG","created_at":"2026-07-05T09:42:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:35J52URGGBQX4S6B4DMIRUDU7J","target":"record","payload":{"canonical_record":{"source":{"id":"2412.00659","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-12-01T03:42:17Z","cross_cats_sorted":[],"title_canon_sha256":"3a59223546ba607b6f61f3c8acb81a2c415e51a63028a05bb8715160244006f6","abstract_canon_sha256":"c7e43f32686dc411f9022fdd2c41fdb9c4837c1d8208339e358f170ff2ccd8bd"},"schema_version":"1.0"},"canonical_sha256":"df53dd522630617e4bc1e0d888d074fa4256bb9f902ae488c356dee4552344e9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:42:44.863474Z","signature_b64":"6gkwf34PxLjLSlta4JjO9H//u0f4wW1gL6bRxy36v6KwTaCoqPO8BnJAACEXQr7NGnkjGzZOTqO9wp+V5t9tBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df53dd522630617e4bc1e0d888d074fa4256bb9f902ae488c356dee4552344e9","last_reissued_at":"2026-07-05T09:42:44.863049Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:42:44.863049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2412.00659","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-07-05T09:42:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DW2orK/0Tcy+BnI/DgxLDMpEJ8o7gY7hzkRopvR+L4Pn1mEh47Ia1oyqaVw+WnhTUMzHsLhVVqGMdF+W0cM8CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T18:41:11.879475Z"},"content_sha256":"0f4ad945fe5c70da42daaa317831738d6e6bb7abe6d8169845ad09f44a8a4ce9","schema_version":"1.0","event_id":"sha256:0f4ad945fe5c70da42daaa317831738d6e6bb7abe6d8169845ad09f44a8a4ce9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:35J52URGGBQX4S6B4DMIRUDU7J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Linear Convergence Analysis of Single-loop Algorithm for Bilevel Optimization via Small-gain Theorem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jianhui Li, Jianqi Chen, Junfeng Wu, Shi Pu","submitted_at":"2024-12-01T03:42:17Z","abstract_excerpt":"Bilevel optimization has gained considerable attention due to its broad applicability across various fields. While several studies have investigated the convergence rates in the strongly-convex-strongly-convex (SC-SC) setting, no prior work has proven that a single-loop algorithm can achieve linear convergence. This paper employs a small-gain theorem in {robust control theory} to demonstrate that a single-loop algorithm based on the implicit function theorem attains a linear convergence rate of $\\mathcal{O}(\\rho^{k})$, where $\\rho\\in(0,1)$ is specified in Theorem 3. Specifically, We model the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.00659","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/2412.00659/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"},"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-07-05T09:42:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2dGr2FEBAqyV9c2P9X6LLOgw6fIAOFaPzh7gTTbTXxmt1sO9ZOiXaQ0nU5SnH0/1wOHjv5p+YkxC1pzUDFoeBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T18:41:11.880688Z"},"content_sha256":"2e684d99e375365037ed63dfb371bffb0c27c34db880ed4422b3073d178c2dff","schema_version":"1.0","event_id":"sha256:2e684d99e375365037ed63dfb371bffb0c27c34db880ed4422b3073d178c2dff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/35J52URGGBQX4S6B4DMIRUDU7J/bundle.json","state_url":"https://pith.science/pith/35J52URGGBQX4S6B4DMIRUDU7J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/35J52URGGBQX4S6B4DMIRUDU7J/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-08-14T18:41:11Z","links":{"resolver":"https://pith.science/pith/35J52URGGBQX4S6B4DMIRUDU7J","bundle":"https://pith.science/pith/35J52URGGBQX4S6B4DMIRUDU7J/bundle.json","state":"https://pith.science/pith/35J52URGGBQX4S6B4DMIRUDU7J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/35J52URGGBQX4S6B4DMIRUDU7J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:35J52URGGBQX4S6B4DMIRUDU7J","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":"c7e43f32686dc411f9022fdd2c41fdb9c4837c1d8208339e358f170ff2ccd8bd","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-12-01T03:42:17Z","title_canon_sha256":"3a59223546ba607b6f61f3c8acb81a2c415e51a63028a05bb8715160244006f6"},"schema_version":"1.0","source":{"id":"2412.00659","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.00659","created_at":"2026-07-05T09:42:44Z"},{"alias_kind":"arxiv_version","alias_value":"2412.00659v1","created_at":"2026-07-05T09:42:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.00659","created_at":"2026-07-05T09:42:44Z"},{"alias_kind":"pith_short_12","alias_value":"35J52URGGBQX","created_at":"2026-07-05T09:42:44Z"},{"alias_kind":"pith_short_16","alias_value":"35J52URGGBQX4S6B","created_at":"2026-07-05T09:42:44Z"},{"alias_kind":"pith_short_8","alias_value":"35J52URG","created_at":"2026-07-05T09:42:44Z"}],"graph_snapshots":[{"event_id":"sha256:2e684d99e375365037ed63dfb371bffb0c27c34db880ed4422b3073d178c2dff","target":"graph","created_at":"2026-07-05T09:42:44Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2412.00659/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Bilevel optimization has gained considerable attention due to its broad applicability across various fields. While several studies have investigated the convergence rates in the strongly-convex-strongly-convex (SC-SC) setting, no prior work has proven that a single-loop algorithm can achieve linear convergence. This paper employs a small-gain theorem in {robust control theory} to demonstrate that a single-loop algorithm based on the implicit function theorem attains a linear convergence rate of $\\mathcal{O}(\\rho^{k})$, where $\\rho\\in(0,1)$ is specified in Theorem 3. Specifically, We model the ","authors_text":"Jianhui Li, Jianqi Chen, Junfeng Wu, Shi Pu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-12-01T03:42:17Z","title":"Linear Convergence Analysis of Single-loop Algorithm for Bilevel Optimization via Small-gain Theorem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.00659","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:0f4ad945fe5c70da42daaa317831738d6e6bb7abe6d8169845ad09f44a8a4ce9","target":"record","created_at":"2026-07-05T09:42:44Z","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":"c7e43f32686dc411f9022fdd2c41fdb9c4837c1d8208339e358f170ff2ccd8bd","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-12-01T03:42:17Z","title_canon_sha256":"3a59223546ba607b6f61f3c8acb81a2c415e51a63028a05bb8715160244006f6"},"schema_version":"1.0","source":{"id":"2412.00659","kind":"arxiv","version":1}},"canonical_sha256":"df53dd522630617e4bc1e0d888d074fa4256bb9f902ae488c356dee4552344e9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"df53dd522630617e4bc1e0d888d074fa4256bb9f902ae488c356dee4552344e9","first_computed_at":"2026-07-05T09:42:44.863049Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:42:44.863049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6gkwf34PxLjLSlta4JjO9H//u0f4wW1gL6bRxy36v6KwTaCoqPO8BnJAACEXQr7NGnkjGzZOTqO9wp+V5t9tBw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:42:44.863474Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.00659","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0f4ad945fe5c70da42daaa317831738d6e6bb7abe6d8169845ad09f44a8a4ce9","sha256:2e684d99e375365037ed63dfb371bffb0c27c34db880ed4422b3073d178c2dff"],"state_sha256":"319f73a614ed86dfa5982dc3e3bea2e40229d4e5871f9fc8d83f79d7e42228a8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TQ0HVU9ElFQPCO8kBDNVyT0QuLt4oQLHMu4Gtw80FX65I1J/Mp4Z+pjubY0tHiVXB0uFIkRntFOdz4lxqsHOAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T18:41:11.888472Z","bundle_sha256":"e1c34e19f8044b82b25355f01e6111e6ef34c96eaf7a1bead715dc0a2cdd41ab"}}