{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:K62BZML67FS2RU43L6SYHRK4HY","short_pith_number":"pith:K62BZML6","canonical_record":{"source":{"id":"2511.22331","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.OC","submitted_at":"2025-11-27T11:03:24Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"f047e47160744b7083641e132620487a92154a5c212c7a988abb4bf96f60f91a","abstract_canon_sha256":"23c1b61d79c508f4380cde32a525bd1cf26f2e4b4acbc15bcc6f7b6f3e9279a3"},"schema_version":"1.0"},"canonical_sha256":"57b41cb17ef965a8d39b5fa583c55c3e12feb031cf03c6a7e1f99e24b10727ac","source":{"kind":"arxiv","id":"2511.22331","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2511.22331","created_at":"2026-06-10T01:09:47Z"},{"alias_kind":"arxiv_version","alias_value":"2511.22331v2","created_at":"2026-06-10T01:09:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.22331","created_at":"2026-06-10T01:09:47Z"},{"alias_kind":"pith_short_12","alias_value":"K62BZML67FS2","created_at":"2026-06-10T01:09:47Z"},{"alias_kind":"pith_short_16","alias_value":"K62BZML67FS2RU43","created_at":"2026-06-10T01:09:47Z"},{"alias_kind":"pith_short_8","alias_value":"K62BZML6","created_at":"2026-06-10T01:09:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:K62BZML67FS2RU43L6SYHRK4HY","target":"record","payload":{"canonical_record":{"source":{"id":"2511.22331","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.OC","submitted_at":"2025-11-27T11:03:24Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"f047e47160744b7083641e132620487a92154a5c212c7a988abb4bf96f60f91a","abstract_canon_sha256":"23c1b61d79c508f4380cde32a525bd1cf26f2e4b4acbc15bcc6f7b6f3e9279a3"},"schema_version":"1.0"},"canonical_sha256":"57b41cb17ef965a8d39b5fa583c55c3e12feb031cf03c6a7e1f99e24b10727ac","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-10T01:09:47.466440Z","signature_b64":"tcwgSbY1kpt2PZ4sW91s9mtXORs3CZiVQCBhJaeNSkWLIPpDMxDoHbVoiK9pl5G4C4yEnAKuB0Y0ymQzvjVxBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57b41cb17ef965a8d39b5fa583c55c3e12feb031cf03c6a7e1f99e24b10727ac","last_reissued_at":"2026-06-10T01:09:47.465923Z","signature_status":"signed_v1","first_computed_at":"2026-06-10T01:09:47.465923Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2511.22331","source_version":2,"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-06-10T01:09:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o3dFgrTYeA+d9MGLgFJu2Ku2PgRH3GqyziyeVEWeCZhVoHix7Ra5I0luiOqxBvz1uSGZv/Bi3t6HxzX3bmaOAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T10:32:29.729993Z"},"content_sha256":"50c2fd0e20016d522b5077fd8bf444bc3672e30aa1df8a3a7b170d97d90ea8ae","schema_version":"1.0","event_id":"sha256:50c2fd0e20016d522b5077fd8bf444bc3672e30aa1df8a3a7b170d97d90ea8ae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:K62BZML67FS2RU43L6SYHRK4HY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Condition Number Dependency in Bilevel Optimization","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"math.OC","authors_text":"Jingzhao Zhang, Lesi Chen","submitted_at":"2025-11-27T11:03:24Z","abstract_excerpt":"Bilevel optimization minimizes an objective function, defined by an upper-level problem whose feasible region is the solution of a lower-level problem. We study the oracle complexity of finding an $\\epsilon$-stationary point with first-order methods when the upper-level problem is nonconvex, and the lower-level problem is strongly convex. Recent works (Ji et al., ICML 2021; Arbel and Mairal, ICLR 2022; Chen et al., JMLR 2025) achieve a $\\tilde{\\mathcal{O}}(\\bar \\kappa_y^4 \\epsilon^{-2})$ upper bound that is near-optimal in $\\epsilon$, which can be reduced to $\\tilde{\\mathcal{O}}(\\bar \\kappa_y^"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.22331","kind":"arxiv","version":2},"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/2511.22331/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-06-10T01:09:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JEkOAU2P5E/4Z4ozmsAHd47jwNh32yWaC+ngMVK8sQcYHCwO/lzrQmmoNS8OiEcFo6FhHHp2YX9y8AY/gzgNBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T10:32:29.730469Z"},"content_sha256":"74054605bc288bab5861d5abcf1816e37fd9981874883280eb81f2fe4e73ec8c","schema_version":"1.0","event_id":"sha256:74054605bc288bab5861d5abcf1816e37fd9981874883280eb81f2fe4e73ec8c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K62BZML67FS2RU43L6SYHRK4HY/bundle.json","state_url":"https://pith.science/pith/K62BZML67FS2RU43L6SYHRK4HY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K62BZML67FS2RU43L6SYHRK4HY/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-05T10:32:29Z","links":{"resolver":"https://pith.science/pith/K62BZML67FS2RU43L6SYHRK4HY","bundle":"https://pith.science/pith/K62BZML67FS2RU43L6SYHRK4HY/bundle.json","state":"https://pith.science/pith/K62BZML67FS2RU43L6SYHRK4HY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K62BZML67FS2RU43L6SYHRK4HY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:K62BZML67FS2RU43L6SYHRK4HY","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":"23c1b61d79c508f4380cde32a525bd1cf26f2e4b4acbc15bcc6f7b6f3e9279a3","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.OC","submitted_at":"2025-11-27T11:03:24Z","title_canon_sha256":"f047e47160744b7083641e132620487a92154a5c212c7a988abb4bf96f60f91a"},"schema_version":"1.0","source":{"id":"2511.22331","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2511.22331","created_at":"2026-06-10T01:09:47Z"},{"alias_kind":"arxiv_version","alias_value":"2511.22331v2","created_at":"2026-06-10T01:09:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.22331","created_at":"2026-06-10T01:09:47Z"},{"alias_kind":"pith_short_12","alias_value":"K62BZML67FS2","created_at":"2026-06-10T01:09:47Z"},{"alias_kind":"pith_short_16","alias_value":"K62BZML67FS2RU43","created_at":"2026-06-10T01:09:47Z"},{"alias_kind":"pith_short_8","alias_value":"K62BZML6","created_at":"2026-06-10T01:09:47Z"}],"graph_snapshots":[{"event_id":"sha256:74054605bc288bab5861d5abcf1816e37fd9981874883280eb81f2fe4e73ec8c","target":"graph","created_at":"2026-06-10T01:09:47Z","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/2511.22331/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Bilevel optimization minimizes an objective function, defined by an upper-level problem whose feasible region is the solution of a lower-level problem. We study the oracle complexity of finding an $\\epsilon$-stationary point with first-order methods when the upper-level problem is nonconvex, and the lower-level problem is strongly convex. Recent works (Ji et al., ICML 2021; Arbel and Mairal, ICLR 2022; Chen et al., JMLR 2025) achieve a $\\tilde{\\mathcal{O}}(\\bar \\kappa_y^4 \\epsilon^{-2})$ upper bound that is near-optimal in $\\epsilon$, which can be reduced to $\\tilde{\\mathcal{O}}(\\bar \\kappa_y^","authors_text":"Jingzhao Zhang, Lesi Chen","cross_cats":["cs.AI","cs.LG"],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.OC","submitted_at":"2025-11-27T11:03:24Z","title":"On the Condition Number Dependency in Bilevel Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.22331","kind":"arxiv","version":2},"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:50c2fd0e20016d522b5077fd8bf444bc3672e30aa1df8a3a7b170d97d90ea8ae","target":"record","created_at":"2026-06-10T01:09:47Z","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":"23c1b61d79c508f4380cde32a525bd1cf26f2e4b4acbc15bcc6f7b6f3e9279a3","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.OC","submitted_at":"2025-11-27T11:03:24Z","title_canon_sha256":"f047e47160744b7083641e132620487a92154a5c212c7a988abb4bf96f60f91a"},"schema_version":"1.0","source":{"id":"2511.22331","kind":"arxiv","version":2}},"canonical_sha256":"57b41cb17ef965a8d39b5fa583c55c3e12feb031cf03c6a7e1f99e24b10727ac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"57b41cb17ef965a8d39b5fa583c55c3e12feb031cf03c6a7e1f99e24b10727ac","first_computed_at":"2026-06-10T01:09:47.465923Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-10T01:09:47.465923Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tcwgSbY1kpt2PZ4sW91s9mtXORs3CZiVQCBhJaeNSkWLIPpDMxDoHbVoiK9pl5G4C4yEnAKuB0Y0ymQzvjVxBA==","signature_status":"signed_v1","signed_at":"2026-06-10T01:09:47.466440Z","signed_message":"canonical_sha256_bytes"},"source_id":"2511.22331","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:50c2fd0e20016d522b5077fd8bf444bc3672e30aa1df8a3a7b170d97d90ea8ae","sha256:74054605bc288bab5861d5abcf1816e37fd9981874883280eb81f2fe4e73ec8c"],"state_sha256":"cc8b4c8629b5a73a76872c9f929c19cea6f128315b20cfe3dd0ff8293080780a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q6tgIx7S2DQ1ODnLKOuTwt8u9WC9L8+JclndsZzot4M19gJd3DBPzXldnPe6ZuBlylEvC2lyXU0Frtk2X0u+Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T10:32:29.733688Z","bundle_sha256":"0d2331539d9b952858be58f4ab5b1fb59849e6656b915e20b879c898f30fe2a4"}}