{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:YCP45VHDF474E2BPR5JX2CJM4F","short_pith_number":"pith:YCP45VHD","schema_version":"1.0","canonical_sha256":"c09fced4e32f3fc2682f8f537d092ce168565e8569436b4ab650112ce142b011","source":{"kind":"arxiv","id":"2507.23155","version":1},"attestation_state":"computed","paper":{"title":"On the Complexity of Finding Stationary Points in Nonconvex Simple Bilevel Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Aryan Mokhtari, Erfan Yazdandoost Hamedani, Jincheng Cao, Ruichen Jiang","submitted_at":"2025-07-30T23:10:29Z","abstract_excerpt":"In this paper, we study the problem of solving a simple bilevel optimization problem, where the upper-level objective is minimized over the solution set of the lower-level problem. We focus on the general setting in which both the upper- and lower-level objectives are smooth but potentially nonconvex. Due to the absence of additional structural assumptions for the lower-level objective-such as convexity or the Polyak-{\\L}ojasiewicz (PL) condition-guaranteeing global optimality is generally intractable. Instead, we introduce a suitable notion of stationarity for this class of problems and aim t"},"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":"2507.23155","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-07-30T23:10:29Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"b1686bf4d57b0d2ccf70f7a98183e0a3d081e41a57e0d38a966cc2a1ec75a7fe","abstract_canon_sha256":"8bed73a0c69c1a0caa9a3bc4819d5ade460942f839df62bec690626934491637"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:46:06.649129Z","signature_b64":"eD8ndszVBLjmE1gwdZ9Ur5/58bW01uoIA9+QRCG4cWUQHpVjpFw/FoWmsiZZs9YdNbgrCinlMV1IkDUzagTuDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c09fced4e32f3fc2682f8f537d092ce168565e8569436b4ab650112ce142b011","last_reissued_at":"2026-07-05T11:46:06.648613Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:46:06.648613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Complexity of Finding Stationary Points in Nonconvex Simple Bilevel Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Aryan Mokhtari, Erfan Yazdandoost Hamedani, Jincheng Cao, Ruichen Jiang","submitted_at":"2025-07-30T23:10:29Z","abstract_excerpt":"In this paper, we study the problem of solving a simple bilevel optimization problem, where the upper-level objective is minimized over the solution set of the lower-level problem. We focus on the general setting in which both the upper- and lower-level objectives are smooth but potentially nonconvex. Due to the absence of additional structural assumptions for the lower-level objective-such as convexity or the Polyak-{\\L}ojasiewicz (PL) condition-guaranteeing global optimality is generally intractable. Instead, we introduce a suitable notion of stationarity for this class of problems and aim t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.23155","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/2507.23155/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":"2507.23155","created_at":"2026-07-05T11:46:06.648677+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.23155v1","created_at":"2026-07-05T11:46:06.648677+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.23155","created_at":"2026-07-05T11:46:06.648677+00:00"},{"alias_kind":"pith_short_12","alias_value":"YCP45VHDF474","created_at":"2026-07-05T11:46:06.648677+00:00"},{"alias_kind":"pith_short_16","alias_value":"YCP45VHDF474E2BP","created_at":"2026-07-05T11:46:06.648677+00:00"},{"alias_kind":"pith_short_8","alias_value":"YCP45VHD","created_at":"2026-07-05T11:46:06.648677+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.23378","citing_title":"Selective Ambulance Dispatch Under Contextual Travel-Time Uncertainty","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YCP45VHDF474E2BPR5JX2CJM4F","json":"https://pith.science/pith/YCP45VHDF474E2BPR5JX2CJM4F.json","graph_json":"https://pith.science/api/pith-number/YCP45VHDF474E2BPR5JX2CJM4F/graph.json","events_json":"https://pith.science/api/pith-number/YCP45VHDF474E2BPR5JX2CJM4F/events.json","paper":"https://pith.science/paper/YCP45VHD"},"agent_actions":{"view_html":"https://pith.science/pith/YCP45VHDF474E2BPR5JX2CJM4F","download_json":"https://pith.science/pith/YCP45VHDF474E2BPR5JX2CJM4F.json","view_paper":"https://pith.science/paper/YCP45VHD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.23155&json=true","fetch_graph":"https://pith.science/api/pith-number/YCP45VHDF474E2BPR5JX2CJM4F/graph.json","fetch_events":"https://pith.science/api/pith-number/YCP45VHDF474E2BPR5JX2CJM4F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YCP45VHDF474E2BPR5JX2CJM4F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YCP45VHDF474E2BPR5JX2CJM4F/action/storage_attestation","attest_author":"https://pith.science/pith/YCP45VHDF474E2BPR5JX2CJM4F/action/author_attestation","sign_citation":"https://pith.science/pith/YCP45VHDF474E2BPR5JX2CJM4F/action/citation_signature","submit_replication":"https://pith.science/pith/YCP45VHDF474E2BPR5JX2CJM4F/action/replication_record"}},"created_at":"2026-07-05T11:46:06.648677+00:00","updated_at":"2026-07-05T11:46:06.648677+00:00"}