{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:RDJ5QUTJYMO2UNTCCBVERHZD4E","short_pith_number":"pith:RDJ5QUTJ","canonical_record":{"source":{"id":"2505.10830","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-05-16T04:00:31Z","cross_cats_sorted":[],"title_canon_sha256":"ec1745bf812099fbe4a4b5e3de0830d61120fa1e59296d020ef20e706ff09689","abstract_canon_sha256":"0809aa376b836f3224c1eb905f31ff77737de58c64107c7e4ffc16b6b0df6dd8"},"schema_version":"1.0"},"canonical_sha256":"88d3d85269c31daa3662106a489f23e10103a6af9c0048ed04801de7aa2eb09c","source":{"kind":"arxiv","id":"2505.10830","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.10830","created_at":"2026-07-05T11:04:06Z"},{"alias_kind":"arxiv_version","alias_value":"2505.10830v1","created_at":"2026-07-05T11:04:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.10830","created_at":"2026-07-05T11:04:06Z"},{"alias_kind":"pith_short_12","alias_value":"RDJ5QUTJYMO2","created_at":"2026-07-05T11:04:06Z"},{"alias_kind":"pith_short_16","alias_value":"RDJ5QUTJYMO2UNTC","created_at":"2026-07-05T11:04:06Z"},{"alias_kind":"pith_short_8","alias_value":"RDJ5QUTJ","created_at":"2026-07-05T11:04:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:RDJ5QUTJYMO2UNTCCBVERHZD4E","target":"record","payload":{"canonical_record":{"source":{"id":"2505.10830","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-05-16T04:00:31Z","cross_cats_sorted":[],"title_canon_sha256":"ec1745bf812099fbe4a4b5e3de0830d61120fa1e59296d020ef20e706ff09689","abstract_canon_sha256":"0809aa376b836f3224c1eb905f31ff77737de58c64107c7e4ffc16b6b0df6dd8"},"schema_version":"1.0"},"canonical_sha256":"88d3d85269c31daa3662106a489f23e10103a6af9c0048ed04801de7aa2eb09c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:04:06.742489Z","signature_b64":"9tbl//0VTlW/e7NmowU6SdI+/o3f+tTn0iWoLVSyJva66vFOiPF6Lj7CcWfUQUja4LyKiqY4ZtuEOsmewMmjDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88d3d85269c31daa3662106a489f23e10103a6af9c0048ed04801de7aa2eb09c","last_reissued_at":"2026-07-05T11:04:06.742097Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:04:06.742097Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.10830","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-05T11:04:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jhs43NZNEjHbsCnsV0ZMgY1I92mn6J21slITeKhWOfA/sdlJay0zcThze1b8vMVQS2agn1TlCi5ywYG58Mo+BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T03:46:49.520556Z"},"content_sha256":"3795261a9bcf214f51e4a38c1c5b69ee1fb10c5cc46b5c339f884f4a79eb66f7","schema_version":"1.0","event_id":"sha256:3795261a9bcf214f51e4a38c1c5b69ee1fb10c5cc46b5c339f884f4a79eb66f7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:RDJ5QUTJYMO2UNTCCBVERHZD4E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Discretization Approach for Bilevel Optimization with Low-Dimensional and Non-Convex Lower-Level","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ioannis Tsaknakis, Mingyi Hong, Prashant Khanduri, Xiaotian Jiang","submitted_at":"2025-05-16T04:00:31Z","abstract_excerpt":"Bilevel optimization (BLO) problem, where two optimization problems (referred to as upper- and lower-level problems) are coupled hierarchically, has wide applications in areas such as machine learning and operations research. Recently, many first-order algorithms have been developed for solving bilevel problems with strongly convex and/or unconstrained lower-level problems; this special structure of the lower-level problem is needed to ensure the tractability of gradient computation (among other reasons). In this work, we deal with a class of more challenging BLO problems where the lower-level"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.10830","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/2505.10830/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-05T11:04:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wZXaVyzqj2jHm0ImXPkREOFi0DuUNXfaoDX205ajxxm+bk7KvHmu/WQ21ZFfmpVBnN+shfBVEJDygs04Nlc/Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T03:46:49.522060Z"},"content_sha256":"043a147e328cfb3237e58a9a1b73e34c7a55927ae383e87a2fa2fae38cd5d447","schema_version":"1.0","event_id":"sha256:043a147e328cfb3237e58a9a1b73e34c7a55927ae383e87a2fa2fae38cd5d447"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RDJ5QUTJYMO2UNTCCBVERHZD4E/bundle.json","state_url":"https://pith.science/pith/RDJ5QUTJYMO2UNTCCBVERHZD4E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RDJ5QUTJYMO2UNTCCBVERHZD4E/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-17T03:46:49Z","links":{"resolver":"https://pith.science/pith/RDJ5QUTJYMO2UNTCCBVERHZD4E","bundle":"https://pith.science/pith/RDJ5QUTJYMO2UNTCCBVERHZD4E/bundle.json","state":"https://pith.science/pith/RDJ5QUTJYMO2UNTCCBVERHZD4E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RDJ5QUTJYMO2UNTCCBVERHZD4E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:RDJ5QUTJYMO2UNTCCBVERHZD4E","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":"0809aa376b836f3224c1eb905f31ff77737de58c64107c7e4ffc16b6b0df6dd8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-05-16T04:00:31Z","title_canon_sha256":"ec1745bf812099fbe4a4b5e3de0830d61120fa1e59296d020ef20e706ff09689"},"schema_version":"1.0","source":{"id":"2505.10830","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.10830","created_at":"2026-07-05T11:04:06Z"},{"alias_kind":"arxiv_version","alias_value":"2505.10830v1","created_at":"2026-07-05T11:04:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.10830","created_at":"2026-07-05T11:04:06Z"},{"alias_kind":"pith_short_12","alias_value":"RDJ5QUTJYMO2","created_at":"2026-07-05T11:04:06Z"},{"alias_kind":"pith_short_16","alias_value":"RDJ5QUTJYMO2UNTC","created_at":"2026-07-05T11:04:06Z"},{"alias_kind":"pith_short_8","alias_value":"RDJ5QUTJ","created_at":"2026-07-05T11:04:06Z"}],"graph_snapshots":[{"event_id":"sha256:043a147e328cfb3237e58a9a1b73e34c7a55927ae383e87a2fa2fae38cd5d447","target":"graph","created_at":"2026-07-05T11:04:06Z","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/2505.10830/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Bilevel optimization (BLO) problem, where two optimization problems (referred to as upper- and lower-level problems) are coupled hierarchically, has wide applications in areas such as machine learning and operations research. Recently, many first-order algorithms have been developed for solving bilevel problems with strongly convex and/or unconstrained lower-level problems; this special structure of the lower-level problem is needed to ensure the tractability of gradient computation (among other reasons). In this work, we deal with a class of more challenging BLO problems where the lower-level","authors_text":"Ioannis Tsaknakis, Mingyi Hong, Prashant Khanduri, Xiaotian Jiang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-05-16T04:00:31Z","title":"A Discretization Approach for Bilevel Optimization with Low-Dimensional and Non-Convex Lower-Level"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.10830","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:3795261a9bcf214f51e4a38c1c5b69ee1fb10c5cc46b5c339f884f4a79eb66f7","target":"record","created_at":"2026-07-05T11:04:06Z","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":"0809aa376b836f3224c1eb905f31ff77737de58c64107c7e4ffc16b6b0df6dd8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-05-16T04:00:31Z","title_canon_sha256":"ec1745bf812099fbe4a4b5e3de0830d61120fa1e59296d020ef20e706ff09689"},"schema_version":"1.0","source":{"id":"2505.10830","kind":"arxiv","version":1}},"canonical_sha256":"88d3d85269c31daa3662106a489f23e10103a6af9c0048ed04801de7aa2eb09c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"88d3d85269c31daa3662106a489f23e10103a6af9c0048ed04801de7aa2eb09c","first_computed_at":"2026-07-05T11:04:06.742097Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:04:06.742097Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9tbl//0VTlW/e7NmowU6SdI+/o3f+tTn0iWoLVSyJva66vFOiPF6Lj7CcWfUQUja4LyKiqY4ZtuEOsmewMmjDg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:04:06.742489Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.10830","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3795261a9bcf214f51e4a38c1c5b69ee1fb10c5cc46b5c339f884f4a79eb66f7","sha256:043a147e328cfb3237e58a9a1b73e34c7a55927ae383e87a2fa2fae38cd5d447"],"state_sha256":"5c56ee5cb697794e3cd856caf1ea96d59e96d812137509ff7803d9c2a6d54b77"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VQ4/fTcCSs77W6ldd2heDwe8lzolqii80B6QpoalT3EAGveTCbH50nWiPcZejBIygXavgTqdaPZNX4x1ACAjCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T03:46:49.529165Z","bundle_sha256":"c940c661f3f1345d51da34b336ab1bddc6b6c88d099ec0914dff718df1f02e69"}}