{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:QJVQIP5XEESP7YGJTPVWRQP557","short_pith_number":"pith:QJVQIP5X","schema_version":"1.0","canonical_sha256":"826b043fb72124ffe0c99beb68c1fdefcf35d0e6fcda4a296d36e0a207f59d34","source":{"kind":"arxiv","id":"2402.07101","version":1},"attestation_state":"computed","paper":{"title":"On the Complexity of First-Order Methods in Stochastic Bilevel Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Dohyun Kwon, Hanbaek Lyu, Jeongyeol Kwon","submitted_at":"2024-02-11T04:26:35Z","abstract_excerpt":"We consider the problem of finding stationary points in Bilevel optimization when the lower-level problem is unconstrained and strongly convex. The problem has been extensively studied in recent years; the main technical challenge is to keep track of lower-level solutions $y^*(x)$ in response to the changes in the upper-level variables $x$. Subsequently, all existing approaches tie their analyses to a genie algorithm that knows lower-level solutions and, therefore, need not query any points far from them. We consider a dual question to such approaches: suppose we have an oracle, which we call "},"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":"2402.07101","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-02-11T04:26:35Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"4e97af52bc03dd84bdce6e13f7a1041dc42dafc1b3bb00ac334f87eaa209e798","abstract_canon_sha256":"faffd8fc35c6f87f21876f5147637c7011259b84b15f62c28a48e817b5c1f021"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:44:01.129827Z","signature_b64":"xBBJmJh6Fw526dD5GzZrm+m1DkcZgwNe6+RoFfxjH/vtt9ba9TjA1jFmNhJnYGLF1l1V1e8Q9SFYMnaoOixhCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"826b043fb72124ffe0c99beb68c1fdefcf35d0e6fcda4a296d36e0a207f59d34","last_reissued_at":"2026-07-05T07:44:01.129342Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:44:01.129342Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Complexity of First-Order Methods in Stochastic Bilevel Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Dohyun Kwon, Hanbaek Lyu, Jeongyeol Kwon","submitted_at":"2024-02-11T04:26:35Z","abstract_excerpt":"We consider the problem of finding stationary points in Bilevel optimization when the lower-level problem is unconstrained and strongly convex. The problem has been extensively studied in recent years; the main technical challenge is to keep track of lower-level solutions $y^*(x)$ in response to the changes in the upper-level variables $x$. Subsequently, all existing approaches tie their analyses to a genie algorithm that knows lower-level solutions and, therefore, need not query any points far from them. We consider a dual question to such approaches: suppose we have an oracle, which we call "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.07101","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/2402.07101/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":"2402.07101","created_at":"2026-07-05T07:44:01.129403+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.07101v1","created_at":"2026-07-05T07:44:01.129403+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.07101","created_at":"2026-07-05T07:44:01.129403+00:00"},{"alias_kind":"pith_short_12","alias_value":"QJVQIP5XEESP","created_at":"2026-07-05T07:44:01.129403+00:00"},{"alias_kind":"pith_short_16","alias_value":"QJVQIP5XEESP7YGJ","created_at":"2026-07-05T07:44:01.129403+00:00"},{"alias_kind":"pith_short_8","alias_value":"QJVQIP5X","created_at":"2026-07-05T07:44:01.129403+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/QJVQIP5XEESP7YGJTPVWRQP557","json":"https://pith.science/pith/QJVQIP5XEESP7YGJTPVWRQP557.json","graph_json":"https://pith.science/api/pith-number/QJVQIP5XEESP7YGJTPVWRQP557/graph.json","events_json":"https://pith.science/api/pith-number/QJVQIP5XEESP7YGJTPVWRQP557/events.json","paper":"https://pith.science/paper/QJVQIP5X"},"agent_actions":{"view_html":"https://pith.science/pith/QJVQIP5XEESP7YGJTPVWRQP557","download_json":"https://pith.science/pith/QJVQIP5XEESP7YGJTPVWRQP557.json","view_paper":"https://pith.science/paper/QJVQIP5X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.07101&json=true","fetch_graph":"https://pith.science/api/pith-number/QJVQIP5XEESP7YGJTPVWRQP557/graph.json","fetch_events":"https://pith.science/api/pith-number/QJVQIP5XEESP7YGJTPVWRQP557/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QJVQIP5XEESP7YGJTPVWRQP557/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QJVQIP5XEESP7YGJTPVWRQP557/action/storage_attestation","attest_author":"https://pith.science/pith/QJVQIP5XEESP7YGJTPVWRQP557/action/author_attestation","sign_citation":"https://pith.science/pith/QJVQIP5XEESP7YGJTPVWRQP557/action/citation_signature","submit_replication":"https://pith.science/pith/QJVQIP5XEESP7YGJTPVWRQP557/action/replication_record"}},"created_at":"2026-07-05T07:44:01.129403+00:00","updated_at":"2026-07-05T07:44:01.129403+00:00"}