{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:6Z6XXXYFJUUUACJDN2H3U24VXU","short_pith_number":"pith:6Z6XXXYF","schema_version":"1.0","canonical_sha256":"f67d7bdf054d294009236e8fba6b95bd3a7fc84805aca6132391f28a2c39ae2e","source":{"kind":"arxiv","id":"1906.11624","version":2},"attestation_state":"computed","paper":{"title":"Good for Games Automata: From Nondeterminism to Alternation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Karoliina Lehtinen, Udi Boker","submitted_at":"2019-06-27T13:30:42Z","abstract_excerpt":"A word automaton recognizing a language $L$ is good for games (GFG) if its composition with any game with winning condition $L$ preserves the game's winner. While all deterministic automata are GFG, some nondeterministic automata are not. There are various other properties that are used in the literature for defining that a nondeterministic automaton is GFG, including \"history-deterministic\", \"compliant with some letter game\", \"good for trees\", and \"good for composition with other automata\". The equivalence of these properties has not been formally shown.\n  We generalize all of these definitio"},"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":"1906.11624","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-06-27T13:30:42Z","cross_cats_sorted":[],"title_canon_sha256":"7999057d4a28c0a0bc17dd997784ef977e97477d4b67dc2888ec427d78978ff3","abstract_canon_sha256":"b4263f9efb6543941c24e5a6c1925726d11310e5afbb34d394178fa054a2d65f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:01.909991Z","signature_b64":"eYCU8Dtt7zXJ5J0YWV2kNajvQHAb2Xz5zQqQxcPSBIuJos9GhxnUlojxwKOdmDnqEr8SW/Sw35rfRnvTZWLYDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f67d7bdf054d294009236e8fba6b95bd3a7fc84805aca6132391f28a2c39ae2e","last_reissued_at":"2026-05-17T23:42:01.909523Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:01.909523Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Good for Games Automata: From Nondeterminism to Alternation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Karoliina Lehtinen, Udi Boker","submitted_at":"2019-06-27T13:30:42Z","abstract_excerpt":"A word automaton recognizing a language $L$ is good for games (GFG) if its composition with any game with winning condition $L$ preserves the game's winner. While all deterministic automata are GFG, some nondeterministic automata are not. There are various other properties that are used in the literature for defining that a nondeterministic automaton is GFG, including \"history-deterministic\", \"compliant with some letter game\", \"good for trees\", and \"good for composition with other automata\". The equivalence of these properties has not been formally shown.\n  We generalize all of these definitio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.11624","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":"1906.11624","created_at":"2026-05-17T23:42:01.909602+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.11624v2","created_at":"2026-05-17T23:42:01.909602+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.11624","created_at":"2026-05-17T23:42:01.909602+00:00"},{"alias_kind":"pith_short_12","alias_value":"6Z6XXXYFJUUU","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"6Z6XXXYFJUUUACJD","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"6Z6XXXYF","created_at":"2026-05-18T12:33:10.108867+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/6Z6XXXYFJUUUACJDN2H3U24VXU","json":"https://pith.science/pith/6Z6XXXYFJUUUACJDN2H3U24VXU.json","graph_json":"https://pith.science/api/pith-number/6Z6XXXYFJUUUACJDN2H3U24VXU/graph.json","events_json":"https://pith.science/api/pith-number/6Z6XXXYFJUUUACJDN2H3U24VXU/events.json","paper":"https://pith.science/paper/6Z6XXXYF"},"agent_actions":{"view_html":"https://pith.science/pith/6Z6XXXYFJUUUACJDN2H3U24VXU","download_json":"https://pith.science/pith/6Z6XXXYFJUUUACJDN2H3U24VXU.json","view_paper":"https://pith.science/paper/6Z6XXXYF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.11624&json=true","fetch_graph":"https://pith.science/api/pith-number/6Z6XXXYFJUUUACJDN2H3U24VXU/graph.json","fetch_events":"https://pith.science/api/pith-number/6Z6XXXYFJUUUACJDN2H3U24VXU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6Z6XXXYFJUUUACJDN2H3U24VXU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6Z6XXXYFJUUUACJDN2H3U24VXU/action/storage_attestation","attest_author":"https://pith.science/pith/6Z6XXXYFJUUUACJDN2H3U24VXU/action/author_attestation","sign_citation":"https://pith.science/pith/6Z6XXXYFJUUUACJDN2H3U24VXU/action/citation_signature","submit_replication":"https://pith.science/pith/6Z6XXXYFJUUUACJDN2H3U24VXU/action/replication_record"}},"created_at":"2026-05-17T23:42:01.909602+00:00","updated_at":"2026-05-17T23:42:01.909602+00:00"}