{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:7LVIUCVSGXSRZKEXBCJCJFAFIR","short_pith_number":"pith:7LVIUCVS","schema_version":"1.0","canonical_sha256":"faea8a0ab235e51ca897089224940544653e39ba512760c7fe7bb7b89dd246f8","source":{"kind":"arxiv","id":"1506.02153","version":2},"attestation_state":"computed","paper":{"title":"Index problems for game automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Alessandro Facchini, Filip Murlak, Micha{\\l} Skrzypczak","submitted_at":"2015-06-06T14:01:49Z","abstract_excerpt":"For a given regular language of infinite trees, one can ask about the minimal number of priorities needed to recognize this language with a non-deterministic, alternating, or weak alternating parity automaton. These questions are known as, respectively, the non-deterministic, alternating, and weak Rabin-Mostowski index problems. Whether they can be answered effectively is a long-standing open problem, solved so far only for languages recognizable by deterministic automata (the alternating variant trivializes).\n  We investigate a wider class of regular languages, recognizable by so-called game "},"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":"1506.02153","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-06-06T14:01:49Z","cross_cats_sorted":[],"title_canon_sha256":"aba032f614386c8e8d562b7ef68933cba0eafda02a39a193e5206a0cf175614a","abstract_canon_sha256":"75062921706fedf79901d0e67cccdb96c6b6535d6f532638cff25728c4afeac9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:16.732780Z","signature_b64":"SP4V6F+Nx8jC2UqtTesCbKv6T7Dbs4qOyD4XByFTnyk0mS4CGfvCx6sP8ZFWEXOkDRiSraOZaeBRy3Etb+A9DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"faea8a0ab235e51ca897089224940544653e39ba512760c7fe7bb7b89dd246f8","last_reissued_at":"2026-05-18T01:13:16.732208Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:16.732208Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Index problems for game automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Alessandro Facchini, Filip Murlak, Micha{\\l} Skrzypczak","submitted_at":"2015-06-06T14:01:49Z","abstract_excerpt":"For a given regular language of infinite trees, one can ask about the minimal number of priorities needed to recognize this language with a non-deterministic, alternating, or weak alternating parity automaton. These questions are known as, respectively, the non-deterministic, alternating, and weak Rabin-Mostowski index problems. Whether they can be answered effectively is a long-standing open problem, solved so far only for languages recognizable by deterministic automata (the alternating variant trivializes).\n  We investigate a wider class of regular languages, recognizable by so-called game "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.02153","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":"1506.02153","created_at":"2026-05-18T01:13:16.732282+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.02153v2","created_at":"2026-05-18T01:13:16.732282+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02153","created_at":"2026-05-18T01:13:16.732282+00:00"},{"alias_kind":"pith_short_12","alias_value":"7LVIUCVSGXSR","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"7LVIUCVSGXSRZKEX","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"7LVIUCVS","created_at":"2026-05-18T12:29:10.953037+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/7LVIUCVSGXSRZKEXBCJCJFAFIR","json":"https://pith.science/pith/7LVIUCVSGXSRZKEXBCJCJFAFIR.json","graph_json":"https://pith.science/api/pith-number/7LVIUCVSGXSRZKEXBCJCJFAFIR/graph.json","events_json":"https://pith.science/api/pith-number/7LVIUCVSGXSRZKEXBCJCJFAFIR/events.json","paper":"https://pith.science/paper/7LVIUCVS"},"agent_actions":{"view_html":"https://pith.science/pith/7LVIUCVSGXSRZKEXBCJCJFAFIR","download_json":"https://pith.science/pith/7LVIUCVSGXSRZKEXBCJCJFAFIR.json","view_paper":"https://pith.science/paper/7LVIUCVS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.02153&json=true","fetch_graph":"https://pith.science/api/pith-number/7LVIUCVSGXSRZKEXBCJCJFAFIR/graph.json","fetch_events":"https://pith.science/api/pith-number/7LVIUCVSGXSRZKEXBCJCJFAFIR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7LVIUCVSGXSRZKEXBCJCJFAFIR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7LVIUCVSGXSRZKEXBCJCJFAFIR/action/storage_attestation","attest_author":"https://pith.science/pith/7LVIUCVSGXSRZKEXBCJCJFAFIR/action/author_attestation","sign_citation":"https://pith.science/pith/7LVIUCVSGXSRZKEXBCJCJFAFIR/action/citation_signature","submit_replication":"https://pith.science/pith/7LVIUCVSGXSRZKEXBCJCJFAFIR/action/replication_record"}},"created_at":"2026-05-18T01:13:16.732282+00:00","updated_at":"2026-05-18T01:13:16.732282+00:00"}