{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:Y3MXT2O6MCGO2P3HSUOAMJT3FG","short_pith_number":"pith:Y3MXT2O6","canonical_record":{"source":{"id":"1808.01438","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-08-04T07:05:49Z","cross_cats_sorted":[],"title_canon_sha256":"ad7749077b3baaaf8d9ac522abf0109e55d89441d3cf47639029a4e033ee85cb","abstract_canon_sha256":"f5372b4ae1b9d9d8caa30963dfb3e5a011a976d5d2fb6db62e804c5d97cfe939"},"schema_version":"1.0"},"canonical_sha256":"c6d979e9de608ced3f67951c06267b2993e0c069a34f30dd868c5772ee6eca87","source":{"kind":"arxiv","id":"1808.01438","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.01438","created_at":"2026-05-18T00:08:52Z"},{"alias_kind":"arxiv_version","alias_value":"1808.01438v1","created_at":"2026-05-18T00:08:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.01438","created_at":"2026-05-18T00:08:52Z"},{"alias_kind":"pith_short_12","alias_value":"Y3MXT2O6MCGO","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"Y3MXT2O6MCGO2P3H","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"Y3MXT2O6","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:Y3MXT2O6MCGO2P3HSUOAMJT3FG","target":"record","payload":{"canonical_record":{"source":{"id":"1808.01438","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-08-04T07:05:49Z","cross_cats_sorted":[],"title_canon_sha256":"ad7749077b3baaaf8d9ac522abf0109e55d89441d3cf47639029a4e033ee85cb","abstract_canon_sha256":"f5372b4ae1b9d9d8caa30963dfb3e5a011a976d5d2fb6db62e804c5d97cfe939"},"schema_version":"1.0"},"canonical_sha256":"c6d979e9de608ced3f67951c06267b2993e0c069a34f30dd868c5772ee6eca87","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:52.980898Z","signature_b64":"65zhS3LlDi5HSBoKSR2+FfBgVmS08m2Wyzs7B4C3gHI+3qbc0+2RX6p2e9+WsAJATYgqjd2JnBw19V+u9Y6DBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6d979e9de608ced3f67951c06267b2993e0c069a34f30dd868c5772ee6eca87","last_reissued_at":"2026-05-18T00:08:52.980227Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:52.980227Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.01438","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-05-18T00:08:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NyHWruvx3Ty3J0l8vGlf/JOi8FGMx9sSg1xVwMfUhMqZt1qHq72BNHyMdb5SNix7RMIxfUonogRa+cdghC0eAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T07:30:58.097360Z"},"content_sha256":"73836545e881ec217b610ab7895b8cce6b3033c195978a8caf32dabbe31f8bd7","schema_version":"1.0","event_id":"sha256:73836545e881ec217b610ab7895b8cce6b3033c195978a8caf32dabbe31f8bd7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:Y3MXT2O6MCGO2P3HSUOAMJT3FG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computing a Pessimistic Leader-Follower Equilibrium with Multiple Followers: the Mixed-Pure Case","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Alberto Marchesi, Nicola Gatti, Stefano Coniglio","submitted_at":"2018-08-04T07:05:49Z","abstract_excerpt":"The search problem of computing a \\textit{leader-follower equilibrium} has been widely investigated in the scientific literature in, almost exclusively, the single-follower setting. Although the \\textit{optimistic} and \\ textit{pessimistic} versions of the problem are solved with different methodologies, both cases allow for efficient, polynomial-time algorithms based on linear programming. The situation is different with multiple followers, where results are only sporadic and depend strictly on the nature of the followers' game. In this paper, we investigate the setting of a normal-form game "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.01438","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":""},"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-18T00:08:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4pTmDr3jjsPmOv07QMwYDsbDOQkPsdOGj+8/W7CsoU29yX4wVuD1rsRoJ/h4hZGTsK4CO6Rr3VnC8aQQ7vKCBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T07:30:58.098187Z"},"content_sha256":"b3f8ee971b11d200847001d37bc5f171209efa988a2b43435e06f8f2220099c1","schema_version":"1.0","event_id":"sha256:b3f8ee971b11d200847001d37bc5f171209efa988a2b43435e06f8f2220099c1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y3MXT2O6MCGO2P3HSUOAMJT3FG/bundle.json","state_url":"https://pith.science/pith/Y3MXT2O6MCGO2P3HSUOAMJT3FG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y3MXT2O6MCGO2P3HSUOAMJT3FG/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-05-23T07:30:58Z","links":{"resolver":"https://pith.science/pith/Y3MXT2O6MCGO2P3HSUOAMJT3FG","bundle":"https://pith.science/pith/Y3MXT2O6MCGO2P3HSUOAMJT3FG/bundle.json","state":"https://pith.science/pith/Y3MXT2O6MCGO2P3HSUOAMJT3FG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y3MXT2O6MCGO2P3HSUOAMJT3FG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:Y3MXT2O6MCGO2P3HSUOAMJT3FG","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":"f5372b4ae1b9d9d8caa30963dfb3e5a011a976d5d2fb6db62e804c5d97cfe939","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-08-04T07:05:49Z","title_canon_sha256":"ad7749077b3baaaf8d9ac522abf0109e55d89441d3cf47639029a4e033ee85cb"},"schema_version":"1.0","source":{"id":"1808.01438","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.01438","created_at":"2026-05-18T00:08:52Z"},{"alias_kind":"arxiv_version","alias_value":"1808.01438v1","created_at":"2026-05-18T00:08:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.01438","created_at":"2026-05-18T00:08:52Z"},{"alias_kind":"pith_short_12","alias_value":"Y3MXT2O6MCGO","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"Y3MXT2O6MCGO2P3H","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"Y3MXT2O6","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:b3f8ee971b11d200847001d37bc5f171209efa988a2b43435e06f8f2220099c1","target":"graph","created_at":"2026-05-18T00:08:52Z","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":"The search problem of computing a \\textit{leader-follower equilibrium} has been widely investigated in the scientific literature in, almost exclusively, the single-follower setting. Although the \\textit{optimistic} and \\ textit{pessimistic} versions of the problem are solved with different methodologies, both cases allow for efficient, polynomial-time algorithms based on linear programming. The situation is different with multiple followers, where results are only sporadic and depend strictly on the nature of the followers' game. In this paper, we investigate the setting of a normal-form game ","authors_text":"Alberto Marchesi, Nicola Gatti, Stefano Coniglio","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-08-04T07:05:49Z","title":"Computing a Pessimistic Leader-Follower Equilibrium with Multiple Followers: the Mixed-Pure Case"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.01438","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:73836545e881ec217b610ab7895b8cce6b3033c195978a8caf32dabbe31f8bd7","target":"record","created_at":"2026-05-18T00:08:52Z","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":"f5372b4ae1b9d9d8caa30963dfb3e5a011a976d5d2fb6db62e804c5d97cfe939","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-08-04T07:05:49Z","title_canon_sha256":"ad7749077b3baaaf8d9ac522abf0109e55d89441d3cf47639029a4e033ee85cb"},"schema_version":"1.0","source":{"id":"1808.01438","kind":"arxiv","version":1}},"canonical_sha256":"c6d979e9de608ced3f67951c06267b2993e0c069a34f30dd868c5772ee6eca87","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c6d979e9de608ced3f67951c06267b2993e0c069a34f30dd868c5772ee6eca87","first_computed_at":"2026-05-18T00:08:52.980227Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:52.980227Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"65zhS3LlDi5HSBoKSR2+FfBgVmS08m2Wyzs7B4C3gHI+3qbc0+2RX6p2e9+WsAJATYgqjd2JnBw19V+u9Y6DBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:52.980898Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.01438","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:73836545e881ec217b610ab7895b8cce6b3033c195978a8caf32dabbe31f8bd7","sha256:b3f8ee971b11d200847001d37bc5f171209efa988a2b43435e06f8f2220099c1"],"state_sha256":"aa3d656fc0eb3a5da8134c6ba6846f6cf5a2adf594224b47772c9542f32ec1ec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wk4Eyu1AtzySBwkiWDtVvQC33Sn9/c0Pw3QQrD3mMeguRO8ykHfX33FlVDO2KerJZBnqCVyGk+uSEUAORHPjBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T07:30:58.102438Z","bundle_sha256":"ca58da845738688b0bcc484473fef7e3bfaa641fab53b7ff9b69ac5775fd02db"}}