{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:OSM6H7KHHMVCKRDXCQSNBXHV5X","short_pith_number":"pith:OSM6H7KH","canonical_record":{"source":{"id":"2410.10670","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-10-14T16:14:32Z","cross_cats_sorted":[],"title_canon_sha256":"977ddc9a590f43b3f3034da35145be8863ac611cd7aac243f350d6163772aa7a","abstract_canon_sha256":"f325e5e5ba246f2dd781a5d3a8a78b7f1dc98310a20ae00e2acdfb95a213e03e"},"schema_version":"1.0"},"canonical_sha256":"7499e3fd473b2a2544771424d0dcf5edc6fbd1ed53c43773da6d989f298005f4","source":{"kind":"arxiv","id":"2410.10670","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.10670","created_at":"2026-07-05T10:30:24Z"},{"alias_kind":"arxiv_version","alias_value":"2410.10670v5","created_at":"2026-07-05T10:30:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.10670","created_at":"2026-07-05T10:30:24Z"},{"alias_kind":"pith_short_12","alias_value":"OSM6H7KHHMVC","created_at":"2026-07-05T10:30:24Z"},{"alias_kind":"pith_short_16","alias_value":"OSM6H7KHHMVCKRDX","created_at":"2026-07-05T10:30:24Z"},{"alias_kind":"pith_short_8","alias_value":"OSM6H7KH","created_at":"2026-07-05T10:30:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:OSM6H7KHHMVCKRDXCQSNBXHV5X","target":"record","payload":{"canonical_record":{"source":{"id":"2410.10670","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-10-14T16:14:32Z","cross_cats_sorted":[],"title_canon_sha256":"977ddc9a590f43b3f3034da35145be8863ac611cd7aac243f350d6163772aa7a","abstract_canon_sha256":"f325e5e5ba246f2dd781a5d3a8a78b7f1dc98310a20ae00e2acdfb95a213e03e"},"schema_version":"1.0"},"canonical_sha256":"7499e3fd473b2a2544771424d0dcf5edc6fbd1ed53c43773da6d989f298005f4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:30:24.730564Z","signature_b64":"LutjGfTg5H1DsUpvjWiUg2TlNOJVV3ddEt2hRIovG4Dwaq7zdD57t/hW3Uw0KIL7Gd9UhIWq0fezEkkHRsIMDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7499e3fd473b2a2544771424d0dcf5edc6fbd1ed53c43773da6d989f298005f4","last_reissued_at":"2026-07-05T10:30:24.729671Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:30:24.729671Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2410.10670","source_version":5,"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:30:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+kGW/Z+43y38wLKGzG8KxGxhujnEoAJ3vo+NUcBkVx9rUZbUs78Y7YajHt/aUs7AbSeFQxiY5zBQjWwDiafhCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T18:02:13.133000Z"},"content_sha256":"34f3297cc079005b1fd6cf05d65427fd0003cfa96c8ca2b625acc3a549a65b59","schema_version":"1.0","event_id":"sha256:34f3297cc079005b1fd6cf05d65427fd0003cfa96c8ca2b625acc3a549a65b59"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:OSM6H7KHHMVCKRDXCQSNBXHV5X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Barrier Function Approach for Bilevel Optimization with Coupled Lower-Level Constraints: Formulation, Approximation and Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jiaxiang Li, Mingyi Hong, Shuzhong Zhang, Xiaotian Jiang","submitted_at":"2024-10-14T16:14:32Z","abstract_excerpt":"In this paper, we consider bilevel optimization problem where the lower-level has coupled constraints, i.e. the constraints depend both on the upper- and lower-level variables. In particular, we consider two settings for the lower-level problem. The first is when the objective is strongly convex and the constraints are convex with respect to the lower-level variable; The second is when the lower-level is a linear program. We propose to utilize a barrier function reformulation to translate the problem into an unconstrained problem. By developing a series of new techniques, we proved that both t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.10670","kind":"arxiv","version":5},"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/2410.10670/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:30:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hq8oWoCPk5CF8sR5CmdzYnTJLkCwQP1QdSpJEyfMp+1VKhIjU3ozOYX+UQzznhk2wreIQ7e/OwOP9SOApf+SDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T18:02:13.133384Z"},"content_sha256":"f44629bc376b76a5710ff05ad912398911cab0057e695db9656e4e3932af8e7f","schema_version":"1.0","event_id":"sha256:f44629bc376b76a5710ff05ad912398911cab0057e695db9656e4e3932af8e7f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OSM6H7KHHMVCKRDXCQSNBXHV5X/bundle.json","state_url":"https://pith.science/pith/OSM6H7KHHMVCKRDXCQSNBXHV5X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OSM6H7KHHMVCKRDXCQSNBXHV5X/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-05T18:02:13Z","links":{"resolver":"https://pith.science/pith/OSM6H7KHHMVCKRDXCQSNBXHV5X","bundle":"https://pith.science/pith/OSM6H7KHHMVCKRDXCQSNBXHV5X/bundle.json","state":"https://pith.science/pith/OSM6H7KHHMVCKRDXCQSNBXHV5X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OSM6H7KHHMVCKRDXCQSNBXHV5X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:OSM6H7KHHMVCKRDXCQSNBXHV5X","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":"f325e5e5ba246f2dd781a5d3a8a78b7f1dc98310a20ae00e2acdfb95a213e03e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-10-14T16:14:32Z","title_canon_sha256":"977ddc9a590f43b3f3034da35145be8863ac611cd7aac243f350d6163772aa7a"},"schema_version":"1.0","source":{"id":"2410.10670","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.10670","created_at":"2026-07-05T10:30:24Z"},{"alias_kind":"arxiv_version","alias_value":"2410.10670v5","created_at":"2026-07-05T10:30:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.10670","created_at":"2026-07-05T10:30:24Z"},{"alias_kind":"pith_short_12","alias_value":"OSM6H7KHHMVC","created_at":"2026-07-05T10:30:24Z"},{"alias_kind":"pith_short_16","alias_value":"OSM6H7KHHMVCKRDX","created_at":"2026-07-05T10:30:24Z"},{"alias_kind":"pith_short_8","alias_value":"OSM6H7KH","created_at":"2026-07-05T10:30:24Z"}],"graph_snapshots":[{"event_id":"sha256:f44629bc376b76a5710ff05ad912398911cab0057e695db9656e4e3932af8e7f","target":"graph","created_at":"2026-07-05T10:30:24Z","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/2410.10670/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we consider bilevel optimization problem where the lower-level has coupled constraints, i.e. the constraints depend both on the upper- and lower-level variables. In particular, we consider two settings for the lower-level problem. The first is when the objective is strongly convex and the constraints are convex with respect to the lower-level variable; The second is when the lower-level is a linear program. We propose to utilize a barrier function reformulation to translate the problem into an unconstrained problem. By developing a series of new techniques, we proved that both t","authors_text":"Jiaxiang Li, Mingyi Hong, Shuzhong Zhang, Xiaotian Jiang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-10-14T16:14:32Z","title":"A Barrier Function Approach for Bilevel Optimization with Coupled Lower-Level Constraints: Formulation, Approximation and Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.10670","kind":"arxiv","version":5},"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:34f3297cc079005b1fd6cf05d65427fd0003cfa96c8ca2b625acc3a549a65b59","target":"record","created_at":"2026-07-05T10:30:24Z","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":"f325e5e5ba246f2dd781a5d3a8a78b7f1dc98310a20ae00e2acdfb95a213e03e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-10-14T16:14:32Z","title_canon_sha256":"977ddc9a590f43b3f3034da35145be8863ac611cd7aac243f350d6163772aa7a"},"schema_version":"1.0","source":{"id":"2410.10670","kind":"arxiv","version":5}},"canonical_sha256":"7499e3fd473b2a2544771424d0dcf5edc6fbd1ed53c43773da6d989f298005f4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7499e3fd473b2a2544771424d0dcf5edc6fbd1ed53c43773da6d989f298005f4","first_computed_at":"2026-07-05T10:30:24.729671Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:30:24.729671Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LutjGfTg5H1DsUpvjWiUg2TlNOJVV3ddEt2hRIovG4Dwaq7zdD57t/hW3Uw0KIL7Gd9UhIWq0fezEkkHRsIMDw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:30:24.730564Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.10670","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:34f3297cc079005b1fd6cf05d65427fd0003cfa96c8ca2b625acc3a549a65b59","sha256:f44629bc376b76a5710ff05ad912398911cab0057e695db9656e4e3932af8e7f"],"state_sha256":"90d34e399290eecf0a714e0970080b6b9074d26dffd60fd92b879009431d0569"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0scC4QYezujFUsZvMDiBUMpdgH72jPa3pA+zK0cHC+zxJ6kd1aiJ/NInDJh/J1OW/usIXDQFkHkPGN30jkXXBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T18:02:13.140731Z","bundle_sha256":"5d6e7aea22546ffb01b33a074ed666516684bbc76574b88989a3c0ff035102ff"}}