{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:ZEAITSI73FLQVDEAEH6D33I3VX","short_pith_number":"pith:ZEAITSI7","canonical_record":{"source":{"id":"2409.06530","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-09-10T14:05:12Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"5339d618758416e911c17b64807dc272bb79a69d83413f64f7c33c56dec3f78e","abstract_canon_sha256":"f746ed7a4aa89f87f6e171217c72421d62156a187229430e8f91080cc3f1b522"},"schema_version":"1.0"},"canonical_sha256":"c90089c91fd9570a8c8021fc3ded1badd25654e912e36e5a85add94807c313a3","source":{"kind":"arxiv","id":"2409.06530","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.06530","created_at":"2026-07-05T10:05:44Z"},{"alias_kind":"arxiv_version","alias_value":"2409.06530v3","created_at":"2026-07-05T10:05:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.06530","created_at":"2026-07-05T10:05:44Z"},{"alias_kind":"pith_short_12","alias_value":"ZEAITSI73FLQ","created_at":"2026-07-05T10:05:44Z"},{"alias_kind":"pith_short_16","alias_value":"ZEAITSI73FLQVDEA","created_at":"2026-07-05T10:05:44Z"},{"alias_kind":"pith_short_8","alias_value":"ZEAITSI7","created_at":"2026-07-05T10:05:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:ZEAITSI73FLQVDEAEH6D33I3VX","target":"record","payload":{"canonical_record":{"source":{"id":"2409.06530","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-09-10T14:05:12Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"5339d618758416e911c17b64807dc272bb79a69d83413f64f7c33c56dec3f78e","abstract_canon_sha256":"f746ed7a4aa89f87f6e171217c72421d62156a187229430e8f91080cc3f1b522"},"schema_version":"1.0"},"canonical_sha256":"c90089c91fd9570a8c8021fc3ded1badd25654e912e36e5a85add94807c313a3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:05:44.818571Z","signature_b64":"j0K6ayL1A9rlDQCdrqYMfluVnA7bh0BEhh23ON2qy81TLuCaoELM+n69KQWcA+SyBiy+mDSqJPTCqt4SzhF2DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c90089c91fd9570a8c8021fc3ded1badd25654e912e36e5a85add94807c313a3","last_reissued_at":"2026-07-05T10:05:44.818097Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:05:44.818097Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2409.06530","source_version":3,"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-05T10:05:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OvqZXYsaZf1RfcC1cIzdJ865VZmd3URSOnesrnie+ZUHZMZP72bJZKaSZ1BOf/e+Dx1eo4/xg9PJdTlX3hVKAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T13:34:30.559042Z"},"content_sha256":"ce6a08bddd0360f8b377ce3223aa8ef581a34a893bbda375454303e0f4c7fac5","schema_version":"1.0","event_id":"sha256:ce6a08bddd0360f8b377ce3223aa8ef581a34a893bbda375454303e0f4c7fac5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:ZEAITSI73FLQVDEAEH6D33I3VX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Functionally Constrained Algorithm Solves Convex Simple Bilevel Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Huaqing Zhang, Jing Xu, Jingzhao Zhang, Lesi Chen","submitted_at":"2024-09-10T14:05:12Z","abstract_excerpt":"This paper studies simple bilevel problems, where a convex upper-level function is minimized over the optimal solutions of a convex lower-level problem. We first show the fundamental difficulty of simple bilevel problems, that the approximate optimal value of such problems is not obtainable by first-order zero-respecting algorithms. Then we follow recent works to pursue the weak approximate solutions. For this goal, we propose a novel method by reformulating them into functionally constrained problems. Our method achieves near-optimal rates for both smooth and nonsmooth problems. To the best o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.06530","kind":"arxiv","version":3},"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/2409.06530/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-05T10:05:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"88UoESqhQCPX4Xz6eeEBMFTd3Fqq65y1d0mj7RjA/OSHsjGImc5XF4s7VFiBu9XnrF1Jl2THbWGBCuU6FuG4Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T13:34:30.559544Z"},"content_sha256":"516d18d82610d78f60c6c2b9280d630d31fadc3cf4cdae84cbd632c41c90f49a","schema_version":"1.0","event_id":"sha256:516d18d82610d78f60c6c2b9280d630d31fadc3cf4cdae84cbd632c41c90f49a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZEAITSI73FLQVDEAEH6D33I3VX/bundle.json","state_url":"https://pith.science/pith/ZEAITSI73FLQVDEAEH6D33I3VX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZEAITSI73FLQVDEAEH6D33I3VX/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-14T13:34:30Z","links":{"resolver":"https://pith.science/pith/ZEAITSI73FLQVDEAEH6D33I3VX","bundle":"https://pith.science/pith/ZEAITSI73FLQVDEAEH6D33I3VX/bundle.json","state":"https://pith.science/pith/ZEAITSI73FLQVDEAEH6D33I3VX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZEAITSI73FLQVDEAEH6D33I3VX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:ZEAITSI73FLQVDEAEH6D33I3VX","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":"f746ed7a4aa89f87f6e171217c72421d62156a187229430e8f91080cc3f1b522","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-09-10T14:05:12Z","title_canon_sha256":"5339d618758416e911c17b64807dc272bb79a69d83413f64f7c33c56dec3f78e"},"schema_version":"1.0","source":{"id":"2409.06530","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.06530","created_at":"2026-07-05T10:05:44Z"},{"alias_kind":"arxiv_version","alias_value":"2409.06530v3","created_at":"2026-07-05T10:05:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.06530","created_at":"2026-07-05T10:05:44Z"},{"alias_kind":"pith_short_12","alias_value":"ZEAITSI73FLQ","created_at":"2026-07-05T10:05:44Z"},{"alias_kind":"pith_short_16","alias_value":"ZEAITSI73FLQVDEA","created_at":"2026-07-05T10:05:44Z"},{"alias_kind":"pith_short_8","alias_value":"ZEAITSI7","created_at":"2026-07-05T10:05:44Z"}],"graph_snapshots":[{"event_id":"sha256:516d18d82610d78f60c6c2b9280d630d31fadc3cf4cdae84cbd632c41c90f49a","target":"graph","created_at":"2026-07-05T10:05:44Z","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/2409.06530/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper studies simple bilevel problems, where a convex upper-level function is minimized over the optimal solutions of a convex lower-level problem. We first show the fundamental difficulty of simple bilevel problems, that the approximate optimal value of such problems is not obtainable by first-order zero-respecting algorithms. Then we follow recent works to pursue the weak approximate solutions. For this goal, we propose a novel method by reformulating them into functionally constrained problems. Our method achieves near-optimal rates for both smooth and nonsmooth problems. To the best o","authors_text":"Huaqing Zhang, Jing Xu, Jingzhao Zhang, Lesi Chen","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-09-10T14:05:12Z","title":"Functionally Constrained Algorithm Solves Convex Simple Bilevel Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.06530","kind":"arxiv","version":3},"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:ce6a08bddd0360f8b377ce3223aa8ef581a34a893bbda375454303e0f4c7fac5","target":"record","created_at":"2026-07-05T10:05:44Z","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":"f746ed7a4aa89f87f6e171217c72421d62156a187229430e8f91080cc3f1b522","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-09-10T14:05:12Z","title_canon_sha256":"5339d618758416e911c17b64807dc272bb79a69d83413f64f7c33c56dec3f78e"},"schema_version":"1.0","source":{"id":"2409.06530","kind":"arxiv","version":3}},"canonical_sha256":"c90089c91fd9570a8c8021fc3ded1badd25654e912e36e5a85add94807c313a3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c90089c91fd9570a8c8021fc3ded1badd25654e912e36e5a85add94807c313a3","first_computed_at":"2026-07-05T10:05:44.818097Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:05:44.818097Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"j0K6ayL1A9rlDQCdrqYMfluVnA7bh0BEhh23ON2qy81TLuCaoELM+n69KQWcA+SyBiy+mDSqJPTCqt4SzhF2DQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:05:44.818571Z","signed_message":"canonical_sha256_bytes"},"source_id":"2409.06530","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ce6a08bddd0360f8b377ce3223aa8ef581a34a893bbda375454303e0f4c7fac5","sha256:516d18d82610d78f60c6c2b9280d630d31fadc3cf4cdae84cbd632c41c90f49a"],"state_sha256":"fa91e8b342614387a4c55bfacba19ef51232e4072c6d4e69314e5d457fc40a10"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5MoF62NhD4v4gVDkhSjooZ4dA8s5ao6cwZirjIk0QpUD9PPSrgqmXRZL6ONsRgijP6ODitQTRZhQh0qL32hlBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T13:34:30.563365Z","bundle_sha256":"e279e3e866fba637eca3f8b91925f788f12b8287716f563048b379cdc7916a26"}}