{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:7O5FSFYFIQVCW3M65CZGOBI2TV","short_pith_number":"pith:7O5FSFYF","canonical_record":{"source":{"id":"1510.06695","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-10-22T17:35:08Z","cross_cats_sorted":[],"title_canon_sha256":"e52eb40ed951336772e61c3ab3c434fa9e6ea54e6e10d8d85990feb20424035e","abstract_canon_sha256":"2ce9248f1e6a99267764fbad2ebcb8cf9e8187382bb1a1431dfd600684e79f60"},"schema_version":"1.0"},"canonical_sha256":"fbba591705442a2b6d9ee8b267051a9d703c0c8c28ef8047ebf0d2d24321da43","source":{"kind":"arxiv","id":"1510.06695","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.06695","created_at":"2026-05-18T01:04:37Z"},{"alias_kind":"arxiv_version","alias_value":"1510.06695v3","created_at":"2026-05-18T01:04:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.06695","created_at":"2026-05-18T01:04:37Z"},{"alias_kind":"pith_short_12","alias_value":"7O5FSFYFIQVC","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7O5FSFYFIQVCW3M6","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7O5FSFYF","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:7O5FSFYFIQVCW3M65CZGOBI2TV","target":"record","payload":{"canonical_record":{"source":{"id":"1510.06695","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-10-22T17:35:08Z","cross_cats_sorted":[],"title_canon_sha256":"e52eb40ed951336772e61c3ab3c434fa9e6ea54e6e10d8d85990feb20424035e","abstract_canon_sha256":"2ce9248f1e6a99267764fbad2ebcb8cf9e8187382bb1a1431dfd600684e79f60"},"schema_version":"1.0"},"canonical_sha256":"fbba591705442a2b6d9ee8b267051a9d703c0c8c28ef8047ebf0d2d24321da43","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:37.775243Z","signature_b64":"3B+hrlLYIsW0hO9fZlShVHV2qCoVCAMTrv/EK1OvalHQMQk4lDVPMdcO+PoDcoyVldl03P3nEPyutBUqegqEBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fbba591705442a2b6d9ee8b267051a9d703c0c8c28ef8047ebf0d2d24321da43","last_reissued_at":"2026-05-18T01:04:37.774535Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:37.774535Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.06695","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-05-18T01:04:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9ynp1UFCYJn7XkN7rc+mxCTMxo2nwOwlIQnUWCpUou2QAxOTsl2EObSu7rQVl7HFwVsE3WFof/cJgoO5mPnrBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T16:48:46.193076Z"},"content_sha256":"5214c339167d026d2f6aa3c48529db45ed78e8a03669821faed9964811261a9e","schema_version":"1.0","event_id":"sha256:5214c339167d026d2f6aa3c48529db45ed78e8a03669821faed9964811261a9e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:7O5FSFYFIQVCW3M65CZGOBI2TV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Bridge between Bilevel Programs and Nash Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Lorenzo Lampariello, Simone Sagratella","submitted_at":"2015-10-22T17:35:08Z","abstract_excerpt":"We study connections between optimistic bilevel programming problems and Generalized Nash Equilibrium Problems (GNEP)s. We remark that, when addressing bilevel problems, we consider the general case in which the lower level program is not assumed to have a unique solution. Inspired by the optimal value approach, we propose a new GNEP model that is closely related to the bilevel program. We provide a complete analysis of the relationship between the \"vertical\" bilevel problem and the corresponding \"horizontal\" (one-level) GNEP model. We define classes of problems for which solutions of the bile"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.06695","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":""},"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-05-18T01:04:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/yK7NDTFguHEsr+kYg/zEFs7xBNW2qm9I1N4KeVRdmA88pwBwE6tz4gCaiX24gmvjpOgqhEIy38kYIdGJ4MCCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T16:48:46.193448Z"},"content_sha256":"cc177c5be94b42c7555798ce7a83fa584d8fad2065c7914ab8008d1e69103fe7","schema_version":"1.0","event_id":"sha256:cc177c5be94b42c7555798ce7a83fa584d8fad2065c7914ab8008d1e69103fe7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7O5FSFYFIQVCW3M65CZGOBI2TV/bundle.json","state_url":"https://pith.science/pith/7O5FSFYFIQVCW3M65CZGOBI2TV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7O5FSFYFIQVCW3M65CZGOBI2TV/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-06-23T16:48:46Z","links":{"resolver":"https://pith.science/pith/7O5FSFYFIQVCW3M65CZGOBI2TV","bundle":"https://pith.science/pith/7O5FSFYFIQVCW3M65CZGOBI2TV/bundle.json","state":"https://pith.science/pith/7O5FSFYFIQVCW3M65CZGOBI2TV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7O5FSFYFIQVCW3M65CZGOBI2TV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:7O5FSFYFIQVCW3M65CZGOBI2TV","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":"2ce9248f1e6a99267764fbad2ebcb8cf9e8187382bb1a1431dfd600684e79f60","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-10-22T17:35:08Z","title_canon_sha256":"e52eb40ed951336772e61c3ab3c434fa9e6ea54e6e10d8d85990feb20424035e"},"schema_version":"1.0","source":{"id":"1510.06695","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.06695","created_at":"2026-05-18T01:04:37Z"},{"alias_kind":"arxiv_version","alias_value":"1510.06695v3","created_at":"2026-05-18T01:04:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.06695","created_at":"2026-05-18T01:04:37Z"},{"alias_kind":"pith_short_12","alias_value":"7O5FSFYFIQVC","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7O5FSFYFIQVCW3M6","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7O5FSFYF","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:cc177c5be94b42c7555798ce7a83fa584d8fad2065c7914ab8008d1e69103fe7","target":"graph","created_at":"2026-05-18T01:04:37Z","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"},"paper":{"abstract_excerpt":"We study connections between optimistic bilevel programming problems and Generalized Nash Equilibrium Problems (GNEP)s. We remark that, when addressing bilevel problems, we consider the general case in which the lower level program is not assumed to have a unique solution. Inspired by the optimal value approach, we propose a new GNEP model that is closely related to the bilevel program. We provide a complete analysis of the relationship between the \"vertical\" bilevel problem and the corresponding \"horizontal\" (one-level) GNEP model. We define classes of problems for which solutions of the bile","authors_text":"Lorenzo Lampariello, Simone Sagratella","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-10-22T17:35:08Z","title":"A Bridge between Bilevel Programs and Nash Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.06695","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:5214c339167d026d2f6aa3c48529db45ed78e8a03669821faed9964811261a9e","target":"record","created_at":"2026-05-18T01:04:37Z","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":"2ce9248f1e6a99267764fbad2ebcb8cf9e8187382bb1a1431dfd600684e79f60","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-10-22T17:35:08Z","title_canon_sha256":"e52eb40ed951336772e61c3ab3c434fa9e6ea54e6e10d8d85990feb20424035e"},"schema_version":"1.0","source":{"id":"1510.06695","kind":"arxiv","version":3}},"canonical_sha256":"fbba591705442a2b6d9ee8b267051a9d703c0c8c28ef8047ebf0d2d24321da43","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fbba591705442a2b6d9ee8b267051a9d703c0c8c28ef8047ebf0d2d24321da43","first_computed_at":"2026-05-18T01:04:37.774535Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:37.774535Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3B+hrlLYIsW0hO9fZlShVHV2qCoVCAMTrv/EK1OvalHQMQk4lDVPMdcO+PoDcoyVldl03P3nEPyutBUqegqEBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:37.775243Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.06695","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5214c339167d026d2f6aa3c48529db45ed78e8a03669821faed9964811261a9e","sha256:cc177c5be94b42c7555798ce7a83fa584d8fad2065c7914ab8008d1e69103fe7"],"state_sha256":"1d4376ea10e249aac7d9b4405d78905b952c6c66053e24e4bbdbdee5593abdfe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fWubJRiH5Brmu7jBCkF94tmZ3i+urnlpAW8BuZjJ74bWsi+NMvBxEHiPfMVBsY2Hs7SviQXzfO2zpduAq00WAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T16:48:46.195407Z","bundle_sha256":"57f66dcda2aa3407bb20b68e74560bd90b39c61e3f88dfffea7371f4993a16d7"}}