{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:VSX3HRJRJ2RMVM2LAKKH4XTHF5","short_pith_number":"pith:VSX3HRJR","schema_version":"1.0","canonical_sha256":"acafb3c5314ea2cab34b02947e5e672f77fc22f627064189a47f2b12c5728264","source":{"kind":"arxiv","id":"cs/0610035","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"cs/0610035","created_at":"2026-05-18T00:53:03.307434+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0610035v2","created_at":"2026-05-18T00:53:03.307434+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0610035","created_at":"2026-05-18T00:53:03.307434+00:00"},{"alias_kind":"pith_short_12","alias_value":"VSX3HRJRJ2RM","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_16","alias_value":"VSX3HRJRJ2RMVM2L","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_8","alias_value":"VSX3HRJR","created_at":"2026-05-18T12:25:54.717736+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VSX3HRJRJ2RMVM2LAKKH4XTHF5","json":"https://pith.science/pith/VSX3HRJRJ2RMVM2LAKKH4XTHF5.json","graph_json":"https://pith.science/api/pith-number/VSX3HRJRJ2RMVM2LAKKH4XTHF5/graph.json","events_json":"https://pith.science/api/pith-number/VSX3HRJRJ2RMVM2LAKKH4XTHF5/events.json","paper":"https://pith.science/paper/VSX3HRJR"},"agent_actions":{"view_html":"https://pith.science/pith/VSX3HRJRJ2RMVM2LAKKH4XTHF5","download_json":"https://pith.science/pith/VSX3HRJRJ2RMVM2LAKKH4XTHF5.json","view_paper":"https://pith.science/paper/VSX3HRJR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0610035&json=true","fetch_graph":"https://pith.science/api/pith-number/VSX3HRJRJ2RMVM2LAKKH4XTHF5/graph.json","fetch_events":"https://pith.science/api/pith-number/VSX3HRJRJ2RMVM2LAKKH4XTHF5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VSX3HRJRJ2RMVM2LAKKH4XTHF5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VSX3HRJRJ2RMVM2LAKKH4XTHF5/action/storage_attestation","attest_author":"https://pith.science/pith/VSX3HRJRJ2RMVM2LAKKH4XTHF5/action/author_attestation","sign_citation":"https://pith.science/pith/VSX3HRJRJ2RMVM2LAKKH4XTHF5/action/citation_signature","submit_replication":"https://pith.science/pith/VSX3HRJRJ2RMVM2LAKKH4XTHF5/action/replication_record"}},"created_at":"2026-05-18T00:53:03.307434+00:00","updated_at":"2026-05-18T00:53:03.307434+00:00"}