{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:XF2EDCLSY2SJOMQQBJPSAUQLRD","short_pith_number":"pith:XF2EDCLS","canonical_record":{"source":{"id":"2507.20400","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-07-27T19:49:15Z","cross_cats_sorted":[],"title_canon_sha256":"705ca40cd5367150d0035448f24dcfe3646af6999184f503018b2c9580c89bf1","abstract_canon_sha256":"68b904501c895ca889cd0fc40724fa5448a31ba0f679a9117d5feac654f58a2f"},"schema_version":"1.0"},"canonical_sha256":"b974418972c6a49732100a5f20520b88cb3a4882131e256c7766c7ae4d3f1982","source":{"kind":"arxiv","id":"2507.20400","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.20400","created_at":"2026-07-05T11:44:18Z"},{"alias_kind":"arxiv_version","alias_value":"2507.20400v1","created_at":"2026-07-05T11:44:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.20400","created_at":"2026-07-05T11:44:18Z"},{"alias_kind":"pith_short_12","alias_value":"XF2EDCLSY2SJ","created_at":"2026-07-05T11:44:18Z"},{"alias_kind":"pith_short_16","alias_value":"XF2EDCLSY2SJOMQQ","created_at":"2026-07-05T11:44:18Z"},{"alias_kind":"pith_short_8","alias_value":"XF2EDCLS","created_at":"2026-07-05T11:44:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:XF2EDCLSY2SJOMQQBJPSAUQLRD","target":"record","payload":{"canonical_record":{"source":{"id":"2507.20400","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-07-27T19:49:15Z","cross_cats_sorted":[],"title_canon_sha256":"705ca40cd5367150d0035448f24dcfe3646af6999184f503018b2c9580c89bf1","abstract_canon_sha256":"68b904501c895ca889cd0fc40724fa5448a31ba0f679a9117d5feac654f58a2f"},"schema_version":"1.0"},"canonical_sha256":"b974418972c6a49732100a5f20520b88cb3a4882131e256c7766c7ae4d3f1982","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:44:18.668771Z","signature_b64":"zVM+ysWonpzVOBTBflVe+wFNcg18WdSXYE+WyvG9CEgQG9xuJi1vgwSpk+tHrMjEqvw6TxNu91Uj+lkPz28ADQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b974418972c6a49732100a5f20520b88cb3a4882131e256c7766c7ae4d3f1982","last_reissued_at":"2026-07-05T11:44:18.668303Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:44:18.668303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.20400","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:44:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nMRnNjRqikRcdguk4TsBKFay47vontfgYW7SjeVwd89VwHdByxRdOUNbFolvX8qJ6YQiXk/fvic1O9FqHtRTCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T12:23:59.652469Z"},"content_sha256":"44fc072f0f5a00d942552d8bb3dfe36481810bbef2c11fe0307e2ada1a84981c","schema_version":"1.0","event_id":"sha256:44fc072f0f5a00d942552d8bb3dfe36481810bbef2c11fe0307e2ada1a84981c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:XF2EDCLSY2SJOMQQBJPSAUQLRD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Lisha Chen, Liuyuan Jiang, Quan Xiao, Tianyi Chen","submitted_at":"2025-07-27T19:49:15Z","abstract_excerpt":"Bilevel optimization, a hierarchical optimization paradigm, has gained significant attention in a wide range of practical applications, notably in the fine-tuning of generative models. However, due to the nested problem structure, most existing algorithms require either the Hessian vector calculation or the nested loop updates, which are computationally inefficient in large language model (LLM) fine-tuning. In this paper, building upon the fully first-order penalty-based approach, we propose an efficient value function-free (PBGD-Free) algorithm that eliminates the loop of solving the lower-le"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.20400","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.20400/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:44:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k84mQMkM+1128L0xIe0RlKhrYQ6RkQLF3mFwa5WYzet1rXM/5BA2XN6bE0U1iIMfRaUsi8q7rEaknw5+ynxjBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T12:23:59.652973Z"},"content_sha256":"4cbd02628cca46b06e3c393b7d0d62e79856964ff5203b39124e697ddf7ac110","schema_version":"1.0","event_id":"sha256:4cbd02628cca46b06e3c393b7d0d62e79856964ff5203b39124e697ddf7ac110"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XF2EDCLSY2SJOMQQBJPSAUQLRD/bundle.json","state_url":"https://pith.science/pith/XF2EDCLSY2SJOMQQBJPSAUQLRD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XF2EDCLSY2SJOMQQBJPSAUQLRD/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-17T12:23:59Z","links":{"resolver":"https://pith.science/pith/XF2EDCLSY2SJOMQQBJPSAUQLRD","bundle":"https://pith.science/pith/XF2EDCLSY2SJOMQQBJPSAUQLRD/bundle.json","state":"https://pith.science/pith/XF2EDCLSY2SJOMQQBJPSAUQLRD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XF2EDCLSY2SJOMQQBJPSAUQLRD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:XF2EDCLSY2SJOMQQBJPSAUQLRD","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":"68b904501c895ca889cd0fc40724fa5448a31ba0f679a9117d5feac654f58a2f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-07-27T19:49:15Z","title_canon_sha256":"705ca40cd5367150d0035448f24dcfe3646af6999184f503018b2c9580c89bf1"},"schema_version":"1.0","source":{"id":"2507.20400","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.20400","created_at":"2026-07-05T11:44:18Z"},{"alias_kind":"arxiv_version","alias_value":"2507.20400v1","created_at":"2026-07-05T11:44:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.20400","created_at":"2026-07-05T11:44:18Z"},{"alias_kind":"pith_short_12","alias_value":"XF2EDCLSY2SJ","created_at":"2026-07-05T11:44:18Z"},{"alias_kind":"pith_short_16","alias_value":"XF2EDCLSY2SJOMQQ","created_at":"2026-07-05T11:44:18Z"},{"alias_kind":"pith_short_8","alias_value":"XF2EDCLS","created_at":"2026-07-05T11:44:18Z"}],"graph_snapshots":[{"event_id":"sha256:4cbd02628cca46b06e3c393b7d0d62e79856964ff5203b39124e697ddf7ac110","target":"graph","created_at":"2026-07-05T11:44:18Z","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/2507.20400/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Bilevel optimization, a hierarchical optimization paradigm, has gained significant attention in a wide range of practical applications, notably in the fine-tuning of generative models. However, due to the nested problem structure, most existing algorithms require either the Hessian vector calculation or the nested loop updates, which are computationally inefficient in large language model (LLM) fine-tuning. In this paper, building upon the fully first-order penalty-based approach, we propose an efficient value function-free (PBGD-Free) algorithm that eliminates the loop of solving the lower-le","authors_text":"Lisha Chen, Liuyuan Jiang, Quan Xiao, Tianyi Chen","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.20400","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:44fc072f0f5a00d942552d8bb3dfe36481810bbef2c11fe0307e2ada1a84981c","target":"record","created_at":"2026-07-05T11:44:18Z","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":"68b904501c895ca889cd0fc40724fa5448a31ba0f679a9117d5feac654f58a2f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-07-27T19:49:15Z","title_canon_sha256":"705ca40cd5367150d0035448f24dcfe3646af6999184f503018b2c9580c89bf1"},"schema_version":"1.0","source":{"id":"2507.20400","kind":"arxiv","version":1}},"canonical_sha256":"b974418972c6a49732100a5f20520b88cb3a4882131e256c7766c7ae4d3f1982","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b974418972c6a49732100a5f20520b88cb3a4882131e256c7766c7ae4d3f1982","first_computed_at":"2026-07-05T11:44:18.668303Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:44:18.668303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zVM+ysWonpzVOBTBflVe+wFNcg18WdSXYE+WyvG9CEgQG9xuJi1vgwSpk+tHrMjEqvw6TxNu91Uj+lkPz28ADQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:44:18.668771Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.20400","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:44fc072f0f5a00d942552d8bb3dfe36481810bbef2c11fe0307e2ada1a84981c","sha256:4cbd02628cca46b06e3c393b7d0d62e79856964ff5203b39124e697ddf7ac110"],"state_sha256":"b4342723d8ac96c205bd9d3fc7e4b768a41ee1d255805e98d1cc9ac670d2a8bf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aRgZ/GjdSdM4b1ZmrKTM3sDYXzQeD+TH3Fu12Hdt2ZGyZ1xHH25ubpHE492ilrr1Eg5Vb3ei+7RYYEK4OtQdAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T12:23:59.661826Z","bundle_sha256":"00926846316563f6148d3892536edf363ae4e09bd6ad5e8c2a76bee4c3e9e5d3"}}