{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:7LVIUCVSGXSRZKEXBCJCJFAFIR","short_pith_number":"pith:7LVIUCVS","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"},"canonical_sha256":"faea8a0ab235e51ca897089224940544653e39ba512760c7fe7bb7b89dd246f8","source":{"kind":"arxiv","id":"1506.02153","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.02153","created_at":"2026-05-18T01:13:16Z"},{"alias_kind":"arxiv_version","alias_value":"1506.02153v2","created_at":"2026-05-18T01:13:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02153","created_at":"2026-05-18T01:13:16Z"},{"alias_kind":"pith_short_12","alias_value":"7LVIUCVSGXSR","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7LVIUCVSGXSRZKEX","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7LVIUCVS","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:7LVIUCVSGXSRZKEXBCJCJFAFIR","target":"record","payload":{"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"},"canonical_sha256":"faea8a0ab235e51ca897089224940544653e39ba512760c7fe7bb7b89dd246f8","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"},"source_kind":"arxiv","source_id":"1506.02153","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-18T01:13:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rLt2xfoCLQ9hfvXUJqsH/UiT9X/nbKIjPxmZE9+h0gHHK5HaG3i7PIDbKiq+Xyt9/oy3YFPNwzD7KA+PpLvkCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:24:15.542878Z"},"content_sha256":"f9afee77042a91a794963d4ff2fdef25e2a6e3af93ea81fe5db2efe9ad5c4c3a","schema_version":"1.0","event_id":"sha256:f9afee77042a91a794963d4ff2fdef25e2a6e3af93ea81fe5db2efe9ad5c4c3a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:7LVIUCVSGXSRZKEXBCJCJFAFIR","target":"graph","payload":{"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"},"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-18T01:13:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CCp9G99MQC7qwdQidlAkzzbtmaXfqaA3/wduX+L0Im8cssw1vai2WVmB8bpD/9UXmdrvz7MXGCGNhccNlqjFDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:24:15.543230Z"},"content_sha256":"e072bb8ae552a8e8aa5cb3ab3b216235af953d3f4d780cd4944c0e9966f0f4ac","schema_version":"1.0","event_id":"sha256:e072bb8ae552a8e8aa5cb3ab3b216235af953d3f4d780cd4944c0e9966f0f4ac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7LVIUCVSGXSRZKEXBCJCJFAFIR/bundle.json","state_url":"https://pith.science/pith/7LVIUCVSGXSRZKEXBCJCJFAFIR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7LVIUCVSGXSRZKEXBCJCJFAFIR/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-05-30T20:24:15Z","links":{"resolver":"https://pith.science/pith/7LVIUCVSGXSRZKEXBCJCJFAFIR","bundle":"https://pith.science/pith/7LVIUCVSGXSRZKEXBCJCJFAFIR/bundle.json","state":"https://pith.science/pith/7LVIUCVSGXSRZKEXBCJCJFAFIR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7LVIUCVSGXSRZKEXBCJCJFAFIR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:7LVIUCVSGXSRZKEXBCJCJFAFIR","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":"75062921706fedf79901d0e67cccdb96c6b6535d6f532638cff25728c4afeac9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-06-06T14:01:49Z","title_canon_sha256":"aba032f614386c8e8d562b7ef68933cba0eafda02a39a193e5206a0cf175614a"},"schema_version":"1.0","source":{"id":"1506.02153","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.02153","created_at":"2026-05-18T01:13:16Z"},{"alias_kind":"arxiv_version","alias_value":"1506.02153v2","created_at":"2026-05-18T01:13:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02153","created_at":"2026-05-18T01:13:16Z"},{"alias_kind":"pith_short_12","alias_value":"7LVIUCVSGXSR","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7LVIUCVSGXSRZKEX","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7LVIUCVS","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:e072bb8ae552a8e8aa5cb3ab3b216235af953d3f4d780cd4944c0e9966f0f4ac","target":"graph","created_at":"2026-05-18T01:13:16Z","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":"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 ","authors_text":"Alessandro Facchini, Filip Murlak, Micha{\\l} Skrzypczak","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-06-06T14:01:49Z","title":"Index problems for game automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.02153","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:f9afee77042a91a794963d4ff2fdef25e2a6e3af93ea81fe5db2efe9ad5c4c3a","target":"record","created_at":"2026-05-18T01:13:16Z","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":"75062921706fedf79901d0e67cccdb96c6b6535d6f532638cff25728c4afeac9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-06-06T14:01:49Z","title_canon_sha256":"aba032f614386c8e8d562b7ef68933cba0eafda02a39a193e5206a0cf175614a"},"schema_version":"1.0","source":{"id":"1506.02153","kind":"arxiv","version":2}},"canonical_sha256":"faea8a0ab235e51ca897089224940544653e39ba512760c7fe7bb7b89dd246f8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"faea8a0ab235e51ca897089224940544653e39ba512760c7fe7bb7b89dd246f8","first_computed_at":"2026-05-18T01:13:16.732208Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:16.732208Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SP4V6F+Nx8jC2UqtTesCbKv6T7Dbs4qOyD4XByFTnyk0mS4CGfvCx6sP8ZFWEXOkDRiSraOZaeBRy3Etb+A9DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:16.732780Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.02153","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f9afee77042a91a794963d4ff2fdef25e2a6e3af93ea81fe5db2efe9ad5c4c3a","sha256:e072bb8ae552a8e8aa5cb3ab3b216235af953d3f4d780cd4944c0e9966f0f4ac"],"state_sha256":"c0cbcd5faf67462350229c467889a74383b98fa238d09eeade2f22a2dcbcfaf9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z7W1rKL6KZYRvGJbQhaIk7+K7lDlJ7E3NnS1Itw6mfsZKc1MU3AqGAFYspwxnH57N9wY5knvWBKCADHtHszSAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T20:24:15.545353Z","bundle_sha256":"fe8df41ffd828ae75cfcbbf07dd992b9bcd0b2c52c48eea640f4ba2ce69013e9"}}