{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2006:VSX3HRJRJ2RMVM2LAKKH4XTHF5","short_pith_number":"pith:VSX3HRJR","canonical_record":{"source":{"id":"cs/0610035","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"cs.LO","submitted_at":"2006-10-06T11:07:37Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"f096a65c2aad097f87b126b2423cceabe731fe99562db08c7e1693e9aaee49ab","abstract_canon_sha256":"463ec6edd1cba65f2cdfb13378126337f98d430e94881360f3ad70023b8debf3"},"schema_version":"1.0"},"canonical_sha256":"acafb3c5314ea2cab34b02947e5e672f77fc22f627064189a47f2b12c5728264","source":{"kind":"arxiv","id":"cs/0610035","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0610035","created_at":"2026-05-18T00:53:03Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0610035v2","created_at":"2026-05-18T00:53:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0610035","created_at":"2026-05-18T00:53:03Z"},{"alias_kind":"pith_short_12","alias_value":"VSX3HRJRJ2RM","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_16","alias_value":"VSX3HRJRJ2RMVM2L","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_8","alias_value":"VSX3HRJR","created_at":"2026-05-18T12:25:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2006:VSX3HRJRJ2RMVM2LAKKH4XTHF5","target":"record","payload":{"canonical_record":{"source":{"id":"cs/0610035","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"cs.LO","submitted_at":"2006-10-06T11:07:37Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"f096a65c2aad097f87b126b2423cceabe731fe99562db08c7e1693e9aaee49ab","abstract_canon_sha256":"463ec6edd1cba65f2cdfb13378126337f98d430e94881360f3ad70023b8debf3"},"schema_version":"1.0"},"canonical_sha256":"acafb3c5314ea2cab34b02947e5e672f77fc22f627064189a47f2b12c5728264","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:03.307794Z","signature_b64":"8W7jCTk2H/I1Jx681JV9WXzikz2g0zNcjXN+XkwsDcVgLV8ieE8SU63Z7ad/SGlJoxJClcOam7mOwCuGsaQfBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"acafb3c5314ea2cab34b02947e5e672f77fc22f627064189a47f2b12c5728264","last_reissued_at":"2026-05-18T00:53:03.307371Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:03.307371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/0610035","source_version":2,"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:53:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uvUW9wECOawnFZZY2AuGADXQB0FAdZYeF/RQmuKcMJSQcEwmDZYhClrCMFiD6iicFxJ8cQvcYGznY7OObkDxCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T11:39:21.995947Z"},"content_sha256":"9104be8f49ec49c45f1174480507bb6a09c5afa577504ad0773cd5a6decbc496","schema_version":"1.0","event_id":"sha256:9104be8f49ec49c45f1174480507bb6a09c5afa577504ad0773cd5a6decbc496"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2006:VSX3HRJRJ2RMVM2LAKKH4XTHF5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Positional Determinacy of Games with Infinitely Many Priorities","license":"","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.LO","authors_text":"Erich Graedel, Igor Walukiewicz","submitted_at":"2006-10-06T11:07:37Z","abstract_excerpt":"We study two-player games of infinite duration that are played on finite or infinite game graphs. A winning strategy for such a game is positional if it only depends on the current position, and not on the history of the play. A game is positionally determined if, from each position, one of the two players has a positional winning strategy.\n  The theory of such games is well studied for winning conditions that are defined in terms of a mapping that assigns to each position a priority from a finite set. Specifically, in Muller games the winner of a play is determined by the set of those priorit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0610035","kind":"arxiv","version":2},"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:53:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AwIjzEFnLBP+iba8LQeTD4Gdw6t9S/jeB66gDtutQH8ocltJpIH9XFAUPLbihUQVGzNjFKsQYzV10NLPX1eSAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T11:39:21.996284Z"},"content_sha256":"640d8d8e0237c95fc75852538ad48c01c37084bcd63adc160c96a7c92fcaed51","schema_version":"1.0","event_id":"sha256:640d8d8e0237c95fc75852538ad48c01c37084bcd63adc160c96a7c92fcaed51"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VSX3HRJRJ2RMVM2LAKKH4XTHF5/bundle.json","state_url":"https://pith.science/pith/VSX3HRJRJ2RMVM2LAKKH4XTHF5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VSX3HRJRJ2RMVM2LAKKH4XTHF5/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-05T11:39:21Z","links":{"resolver":"https://pith.science/pith/VSX3HRJRJ2RMVM2LAKKH4XTHF5","bundle":"https://pith.science/pith/VSX3HRJRJ2RMVM2LAKKH4XTHF5/bundle.json","state":"https://pith.science/pith/VSX3HRJRJ2RMVM2LAKKH4XTHF5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VSX3HRJRJ2RMVM2LAKKH4XTHF5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:VSX3HRJRJ2RMVM2LAKKH4XTHF5","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":"463ec6edd1cba65f2cdfb13378126337f98d430e94881360f3ad70023b8debf3","cross_cats_sorted":["cs.GT"],"license":"","primary_cat":"cs.LO","submitted_at":"2006-10-06T11:07:37Z","title_canon_sha256":"f096a65c2aad097f87b126b2423cceabe731fe99562db08c7e1693e9aaee49ab"},"schema_version":"1.0","source":{"id":"cs/0610035","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0610035","created_at":"2026-05-18T00:53:03Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0610035v2","created_at":"2026-05-18T00:53:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0610035","created_at":"2026-05-18T00:53:03Z"},{"alias_kind":"pith_short_12","alias_value":"VSX3HRJRJ2RM","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_16","alias_value":"VSX3HRJRJ2RMVM2L","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_8","alias_value":"VSX3HRJR","created_at":"2026-05-18T12:25:54Z"}],"graph_snapshots":[{"event_id":"sha256:640d8d8e0237c95fc75852538ad48c01c37084bcd63adc160c96a7c92fcaed51","target":"graph","created_at":"2026-05-18T00:53:03Z","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 two-player games of infinite duration that are played on finite or infinite game graphs. A winning strategy for such a game is positional if it only depends on the current position, and not on the history of the play. A game is positionally determined if, from each position, one of the two players has a positional winning strategy.\n  The theory of such games is well studied for winning conditions that are defined in terms of a mapping that assigns to each position a priority from a finite set. Specifically, in Muller games the winner of a play is determined by the set of those priorit","authors_text":"Erich Graedel, Igor Walukiewicz","cross_cats":["cs.GT"],"headline":"","license":"","primary_cat":"cs.LO","submitted_at":"2006-10-06T11:07:37Z","title":"Positional Determinacy of Games with Infinitely Many Priorities"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0610035","kind":"arxiv","version":2},"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:9104be8f49ec49c45f1174480507bb6a09c5afa577504ad0773cd5a6decbc496","target":"record","created_at":"2026-05-18T00:53:03Z","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":"463ec6edd1cba65f2cdfb13378126337f98d430e94881360f3ad70023b8debf3","cross_cats_sorted":["cs.GT"],"license":"","primary_cat":"cs.LO","submitted_at":"2006-10-06T11:07:37Z","title_canon_sha256":"f096a65c2aad097f87b126b2423cceabe731fe99562db08c7e1693e9aaee49ab"},"schema_version":"1.0","source":{"id":"cs/0610035","kind":"arxiv","version":2}},"canonical_sha256":"acafb3c5314ea2cab34b02947e5e672f77fc22f627064189a47f2b12c5728264","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"acafb3c5314ea2cab34b02947e5e672f77fc22f627064189a47f2b12c5728264","first_computed_at":"2026-05-18T00:53:03.307371Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:03.307371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8W7jCTk2H/I1Jx681JV9WXzikz2g0zNcjXN+XkwsDcVgLV8ieE8SU63Z7ad/SGlJoxJClcOam7mOwCuGsaQfBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:03.307794Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0610035","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9104be8f49ec49c45f1174480507bb6a09c5afa577504ad0773cd5a6decbc496","sha256:640d8d8e0237c95fc75852538ad48c01c37084bcd63adc160c96a7c92fcaed51"],"state_sha256":"b04601566c0d4e2e69f771d56d184dbf5a9eb3b992298e81cbf0d8deb61a513a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jM1rzRSI6p1+VLUabnoRtlTgTwIA9wIWeeQ/ILyOQp396Fnayp3LjUzTueNX1qLprzNgYnY78aeZ6U0DFpsFAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T11:39:21.998226Z","bundle_sha256":"63d0e05bfa7ae40666916f7a12ae85e0fae664fe5231be56daa718a289dbf451"}}