{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:VSFAZR6HH33WFI6RPWLVDUYU2X","short_pith_number":"pith:VSFAZR6H","canonical_record":{"source":{"id":"1206.2968","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-06-13T23:26:54Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"05728748ffad4615457f0f7de980c31699216ea1a190cfa1e8dbe78e1cf69e45","abstract_canon_sha256":"98d85fb85a7899fd43d648572720e29d6f2a03ae982392fe58a2e0157a0e1b9a"},"schema_version":"1.0"},"canonical_sha256":"ac8a0cc7c73ef762a3d17d9751d314d5c00df6bc7a15d0a63171d71e4481c1b4","source":{"kind":"arxiv","id":"1206.2968","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.2968","created_at":"2026-05-18T02:44:23Z"},{"alias_kind":"arxiv_version","alias_value":"1206.2968v3","created_at":"2026-05-18T02:44:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.2968","created_at":"2026-05-18T02:44:23Z"},{"alias_kind":"pith_short_12","alias_value":"VSFAZR6HH33W","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VSFAZR6HH33WFI6R","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VSFAZR6H","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:VSFAZR6HH33WFI6RPWLVDUYU2X","target":"record","payload":{"canonical_record":{"source":{"id":"1206.2968","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-06-13T23:26:54Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"05728748ffad4615457f0f7de980c31699216ea1a190cfa1e8dbe78e1cf69e45","abstract_canon_sha256":"98d85fb85a7899fd43d648572720e29d6f2a03ae982392fe58a2e0157a0e1b9a"},"schema_version":"1.0"},"canonical_sha256":"ac8a0cc7c73ef762a3d17d9751d314d5c00df6bc7a15d0a63171d71e4481c1b4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:23.682938Z","signature_b64":"Ft7K75L2m3r95wnvkeT7ybxGJxF4s2h9azUqN8pqqYqhjN8yuKLZ46AR7WKPZQY4K/wsHcbhzbjwpIdkeVKpBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac8a0cc7c73ef762a3d17d9751d314d5c00df6bc7a15d0a63171d71e4481c1b4","last_reissued_at":"2026-05-18T02:44:23.682437Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:23.682437Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.2968","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-18T02:44:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MrJj+ou9UWh8F5H7E8j0OFjCuA6ga5G/tgCnU6xF9pHO+2V8cZ7KQukQbWq7MmG3oHCFTXITuwwAs+xjyfNADA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T04:53:51.446088Z"},"content_sha256":"e9c9b4372062aa1cf30453bfa2dda4c13293ab9dab2a91807cf201bdd910ed4e","schema_version":"1.0","event_id":"sha256:e9c9b4372062aa1cf30453bfa2dda4c13293ab9dab2a91807cf201bdd910ed4e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:VSFAZR6HH33WFI6RPWLVDUYU2X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Shared-Constraint Approach to Multi-leader Multi-follower Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"math.OC","authors_text":"Ankur A. Kulkarni, Uday V. Shanbhag","submitted_at":"2012-06-13T23:26:54Z","abstract_excerpt":"Multi-leader multi-follower games are a class of hierarchical games in which a collection of leaders compete in a Nash game constrained by the equilibrium conditions of another Nash game amongst the followers. The resulting equilibrium problem with equilibrium constraints is complicated by nonconvex agent problems and therefore providing tractable conditions for existence of global or even local equilibria for it has proved challenging. Consequently, much of the extant research on this topic is either model specific or relies on weaker notions of equilibria. We consider a modified formulation "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.2968","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-18T02:44:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g5bPrK7B1ENXJ0sfiyPyMX9K+4pjaCFHQs9xI6+1r0KZZfaY1IVZ+9XIp+fRqfMRrVyZPNhN1ZYVb70bUpwJCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T04:53:51.446447Z"},"content_sha256":"209d367b9ad1a04008f1da517c8a15130c2690510d48b0bc5b902a517fa454d9","schema_version":"1.0","event_id":"sha256:209d367b9ad1a04008f1da517c8a15130c2690510d48b0bc5b902a517fa454d9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VSFAZR6HH33WFI6RPWLVDUYU2X/bundle.json","state_url":"https://pith.science/pith/VSFAZR6HH33WFI6RPWLVDUYU2X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VSFAZR6HH33WFI6RPWLVDUYU2X/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-22T04:53:51Z","links":{"resolver":"https://pith.science/pith/VSFAZR6HH33WFI6RPWLVDUYU2X","bundle":"https://pith.science/pith/VSFAZR6HH33WFI6RPWLVDUYU2X/bundle.json","state":"https://pith.science/pith/VSFAZR6HH33WFI6RPWLVDUYU2X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VSFAZR6HH33WFI6RPWLVDUYU2X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:VSFAZR6HH33WFI6RPWLVDUYU2X","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":"98d85fb85a7899fd43d648572720e29d6f2a03ae982392fe58a2e0157a0e1b9a","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-06-13T23:26:54Z","title_canon_sha256":"05728748ffad4615457f0f7de980c31699216ea1a190cfa1e8dbe78e1cf69e45"},"schema_version":"1.0","source":{"id":"1206.2968","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.2968","created_at":"2026-05-18T02:44:23Z"},{"alias_kind":"arxiv_version","alias_value":"1206.2968v3","created_at":"2026-05-18T02:44:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.2968","created_at":"2026-05-18T02:44:23Z"},{"alias_kind":"pith_short_12","alias_value":"VSFAZR6HH33W","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VSFAZR6HH33WFI6R","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VSFAZR6H","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:209d367b9ad1a04008f1da517c8a15130c2690510d48b0bc5b902a517fa454d9","target":"graph","created_at":"2026-05-18T02:44:23Z","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":"Multi-leader multi-follower games are a class of hierarchical games in which a collection of leaders compete in a Nash game constrained by the equilibrium conditions of another Nash game amongst the followers. The resulting equilibrium problem with equilibrium constraints is complicated by nonconvex agent problems and therefore providing tractable conditions for existence of global or even local equilibria for it has proved challenging. Consequently, much of the extant research on this topic is either model specific or relies on weaker notions of equilibria. We consider a modified formulation ","authors_text":"Ankur A. Kulkarni, Uday V. Shanbhag","cross_cats":["cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-06-13T23:26:54Z","title":"A Shared-Constraint Approach to Multi-leader Multi-follower Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.2968","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:e9c9b4372062aa1cf30453bfa2dda4c13293ab9dab2a91807cf201bdd910ed4e","target":"record","created_at":"2026-05-18T02:44:23Z","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":"98d85fb85a7899fd43d648572720e29d6f2a03ae982392fe58a2e0157a0e1b9a","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-06-13T23:26:54Z","title_canon_sha256":"05728748ffad4615457f0f7de980c31699216ea1a190cfa1e8dbe78e1cf69e45"},"schema_version":"1.0","source":{"id":"1206.2968","kind":"arxiv","version":3}},"canonical_sha256":"ac8a0cc7c73ef762a3d17d9751d314d5c00df6bc7a15d0a63171d71e4481c1b4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ac8a0cc7c73ef762a3d17d9751d314d5c00df6bc7a15d0a63171d71e4481c1b4","first_computed_at":"2026-05-18T02:44:23.682437Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:23.682437Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ft7K75L2m3r95wnvkeT7ybxGJxF4s2h9azUqN8pqqYqhjN8yuKLZ46AR7WKPZQY4K/wsHcbhzbjwpIdkeVKpBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:23.682938Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.2968","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e9c9b4372062aa1cf30453bfa2dda4c13293ab9dab2a91807cf201bdd910ed4e","sha256:209d367b9ad1a04008f1da517c8a15130c2690510d48b0bc5b902a517fa454d9"],"state_sha256":"25440968ebaccf8389ccc2cfea58a1b68780a676e3c7fccc8dd826f2a2d7dab7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9zyNTVFVxF67vw1ahxsKXw4mcooWF60lw9B+yArV4pvx5b6bnPI4AB+E1Bvu63p+Hh7BeGAqCJMd2vEubremDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T04:53:51.448625Z","bundle_sha256":"d6722ed154e87ae49d0e42670cdc393ec85a90a3762122d6fa84a6eef6d71132"}}