{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:5SFCM45PDMAPGEX5WZO376V5RJ","short_pith_number":"pith:5SFCM45P","canonical_record":{"source":{"id":"2607.07151","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-07-08T08:40:18Z","cross_cats_sorted":[],"title_canon_sha256":"bb8d732f1b13a84f8caa40e582fb347876b1bbd6a4853fc11df7b7b5c05301fd","abstract_canon_sha256":"c91718227be8a09e9e15b4196dd878d0ee1ef4644d44d0f43089e4cef5fabff7"},"schema_version":"1.0"},"canonical_sha256":"ec8a2673af1b00f312fdb65dbffabd8a71681374c115a8b4772237771cccfd69","source":{"kind":"arxiv","id":"2607.07151","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.07151","created_at":"2026-07-09T01:20:15Z"},{"alias_kind":"arxiv_version","alias_value":"2607.07151v1","created_at":"2026-07-09T01:20:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.07151","created_at":"2026-07-09T01:20:15Z"},{"alias_kind":"pith_short_12","alias_value":"5SFCM45PDMAP","created_at":"2026-07-09T01:20:15Z"},{"alias_kind":"pith_short_16","alias_value":"5SFCM45PDMAPGEX5","created_at":"2026-07-09T01:20:15Z"},{"alias_kind":"pith_short_8","alias_value":"5SFCM45P","created_at":"2026-07-09T01:20:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:5SFCM45PDMAPGEX5WZO376V5RJ","target":"record","payload":{"canonical_record":{"source":{"id":"2607.07151","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-07-08T08:40:18Z","cross_cats_sorted":[],"title_canon_sha256":"bb8d732f1b13a84f8caa40e582fb347876b1bbd6a4853fc11df7b7b5c05301fd","abstract_canon_sha256":"c91718227be8a09e9e15b4196dd878d0ee1ef4644d44d0f43089e4cef5fabff7"},"schema_version":"1.0"},"canonical_sha256":"ec8a2673af1b00f312fdb65dbffabd8a71681374c115a8b4772237771cccfd69","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-09T01:20:15.800489Z","signature_b64":"mXINsbX0mNBc8UmX1Q68Qs+5SwXD4suSc3iM3R4PiOPGw4mVNX7+1xxugVPuTdo58QXEoorTCUwExf7OJ145Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec8a2673af1b00f312fdb65dbffabd8a71681374c115a8b4772237771cccfd69","last_reissued_at":"2026-07-09T01:20:15.800152Z","signature_status":"signed_v1","first_computed_at":"2026-07-09T01:20:15.800152Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.07151","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-07-09T01:20:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CUakboXSc5+jiNGDAfeH8yoXgkS6TrLBcY8wcdhrBd7Tei0xHUUKwEUHy5FD13l9kSp4e5+Jr8STIVMARE7RBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T09:35:36.865758Z"},"content_sha256":"7be88853791bbbe8c6c8dc82295e22d3323755b51c6cbfe5bd474efa71159d64","schema_version":"1.0","event_id":"sha256:7be88853791bbbe8c6c8dc82295e22d3323755b51c6cbfe5bd474efa71159d64"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:5SFCM45PDMAPGEX5WZO376V5RJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simple Nash Equilibria for Qualitative Multiplayer Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"James C. A. Main, Mona Alluwaym, Sven Schewe","submitted_at":"2026-07-08T08:40:18Z","abstract_excerpt":"We investigate memory requirements for Nash and subgame-perfect equilibria in turn-based deterministic games with $\\omega$-regular objectives. We prove that memoryless randomised (i.e., stationary) subgame-perfect equilibria always exist in games with reachability, safety, and 0-2 Muller objectives (i.e., Muller objectives for which accepting sets are either up- or downward closed), and any combination of these objectives. We provide an algorithm to construct such an equilibrium. We also show that randomisation may be required to construct memoryless equilibria in games with reachability or B\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.07151","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.07151/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-09T01:20:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Aw+6htsHBJApIaW5Ni86dtev8Y7GNj4MJw60HXV26//ZX/qy9tsuER7wRVVqpsrOQ2pOtQMyqHFIHTjTmO6yAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T09:35:36.866646Z"},"content_sha256":"858291d3f9020aa817a862359125f75460f23817f0cfb77d4ad63c4152673c37","schema_version":"1.0","event_id":"sha256:858291d3f9020aa817a862359125f75460f23817f0cfb77d4ad63c4152673c37"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:5SFCM45PDMAPGEX5WZO376V5RJ","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.46298/LMCS-21(1:28) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"URL:https://doi.org/10.46298/lmcs-21(1: 28)2025,doi:10.46298/LMCS-21(1:28)2025. 14 Krishnendu Chatterjee. Optimal strategy synthesis in stochastic Müller games. In Helmut Seidl, editor,Proceedings of the 10th International Conference on Fou","arxiv_id":"2607.07151","detector":"doi_compliance","evidence":{"ref_index":7,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"URL:https://doi.org/10.46298/lmcs-21(1: 28)2025,doi:10.46298/LMCS-21(1:28)2025. 14 Krishnendu Chatterjee. Optimal strategy synthesis in stochastic Müller games. In Helmut Seidl, editor,Proceedings of the 10th International Conference on Fou","reconstructed_doi":"10.46298/LMCS-21(1:28"},"severity":"advisory","ref_index":7,"audited_at":"2026-07-09T19:49:12.289259Z","event_type":"pith.integrity.v1","detected_doi":"10.46298/LMCS-21(1:28","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"8fde81f838400912ac4230c8ab54c5f02b144f71eed86aa6112cbae8adf44248","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":10541,"payload_sha256":"b69e32e6e0e5f21d7d76c33bb2d92c32567d61f8b9c7b6de6456d64b81d84b30","signature_b64":"iIbn0fbFMfkObKknzlffASzJYMWvT7sr9FkY0zUks/dfoHPHcxX/8osBlOskVDgoOCbh9TnL31RkeJSSIYj4Cw==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-09T19:53:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UfbnGljL2kt/4qsyl9Jqez1DZRuOu0ttaMBFQfL/m5JkmCYEQnN/eUUy7xzcYbp5lXkPbbvhRMqw/9YKMW+pCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T09:35:36.871337Z"},"content_sha256":"40f02842817e1224c936b41d26f4bb218f1bccf7a215713745ae789f67774448","schema_version":"1.0","event_id":"sha256:40f02842817e1224c936b41d26f4bb218f1bccf7a215713745ae789f67774448"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5SFCM45PDMAPGEX5WZO376V5RJ/bundle.json","state_url":"https://pith.science/pith/5SFCM45PDMAPGEX5WZO376V5RJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5SFCM45PDMAPGEX5WZO376V5RJ/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-08T09:35:36Z","links":{"resolver":"https://pith.science/pith/5SFCM45PDMAPGEX5WZO376V5RJ","bundle":"https://pith.science/pith/5SFCM45PDMAPGEX5WZO376V5RJ/bundle.json","state":"https://pith.science/pith/5SFCM45PDMAPGEX5WZO376V5RJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5SFCM45PDMAPGEX5WZO376V5RJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:5SFCM45PDMAPGEX5WZO376V5RJ","merge_version":"pith-open-graph-merge-v1","event_count":3,"valid_event_count":3,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c91718227be8a09e9e15b4196dd878d0ee1ef4644d44d0f43089e4cef5fabff7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-07-08T08:40:18Z","title_canon_sha256":"bb8d732f1b13a84f8caa40e582fb347876b1bbd6a4853fc11df7b7b5c05301fd"},"schema_version":"1.0","source":{"id":"2607.07151","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.07151","created_at":"2026-07-09T01:20:15Z"},{"alias_kind":"arxiv_version","alias_value":"2607.07151v1","created_at":"2026-07-09T01:20:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.07151","created_at":"2026-07-09T01:20:15Z"},{"alias_kind":"pith_short_12","alias_value":"5SFCM45PDMAP","created_at":"2026-07-09T01:20:15Z"},{"alias_kind":"pith_short_16","alias_value":"5SFCM45PDMAPGEX5","created_at":"2026-07-09T01:20:15Z"},{"alias_kind":"pith_short_8","alias_value":"5SFCM45P","created_at":"2026-07-09T01:20:15Z"}],"graph_snapshots":[{"event_id":"sha256:858291d3f9020aa817a862359125f75460f23817f0cfb77d4ad63c4152673c37","target":"graph","created_at":"2026-07-09T01:20:15Z","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/2607.07151/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We investigate memory requirements for Nash and subgame-perfect equilibria in turn-based deterministic games with $\\omega$-regular objectives. We prove that memoryless randomised (i.e., stationary) subgame-perfect equilibria always exist in games with reachability, safety, and 0-2 Muller objectives (i.e., Muller objectives for which accepting sets are either up- or downward closed), and any combination of these objectives. We provide an algorithm to construct such an equilibrium. We also show that randomisation may be required to construct memoryless equilibria in games with reachability or B\\","authors_text":"James C. A. Main, Mona Alluwaym, Sven Schewe","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-07-08T08:40:18Z","title":"Simple Nash Equilibria for Qualitative Multiplayer Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.07151","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:7be88853791bbbe8c6c8dc82295e22d3323755b51c6cbfe5bd474efa71159d64","target":"record","created_at":"2026-07-09T01:20:15Z","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":"c91718227be8a09e9e15b4196dd878d0ee1ef4644d44d0f43089e4cef5fabff7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-07-08T08:40:18Z","title_canon_sha256":"bb8d732f1b13a84f8caa40e582fb347876b1bbd6a4853fc11df7b7b5c05301fd"},"schema_version":"1.0","source":{"id":"2607.07151","kind":"arxiv","version":1}},"canonical_sha256":"ec8a2673af1b00f312fdb65dbffabd8a71681374c115a8b4772237771cccfd69","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ec8a2673af1b00f312fdb65dbffabd8a71681374c115a8b4772237771cccfd69","first_computed_at":"2026-07-09T01:20:15.800152Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-09T01:20:15.800152Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mXINsbX0mNBc8UmX1Q68Qs+5SwXD4suSc3iM3R4PiOPGw4mVNX7+1xxugVPuTdo58QXEoorTCUwExf7OJ145Dg==","signature_status":"signed_v1","signed_at":"2026-07-09T01:20:15.800489Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.07151","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7be88853791bbbe8c6c8dc82295e22d3323755b51c6cbfe5bd474efa71159d64","sha256:858291d3f9020aa817a862359125f75460f23817f0cfb77d4ad63c4152673c37","sha256:40f02842817e1224c936b41d26f4bb218f1bccf7a215713745ae789f67774448"],"state_sha256":"90e5fc40347f8326b5d6d01a3858584d5ef2051283c6b5a93e3a0f53b25caac2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hIuP/Ks5xC1SgHw0u9cA7LAyOa98BmqiQP80foIMQpWpbJisgwlJ7Gh3g84NuuRdE8ksjI11Wive5lSGspbrAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T09:35:36.874695Z","bundle_sha256":"dc877afd292489c17fe4b14a2b48f8e25947c91fc65f6dc2360bb910f031f9de"}}