{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:Z7VOFXJWYL2O6VS66GMVAYM2NP","short_pith_number":"pith:Z7VOFXJW","canonical_record":{"source":{"id":"1710.08996","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-10-24T21:22:13Z","cross_cats_sorted":[],"title_canon_sha256":"cbe93a79e2d70bd3f9afb38fa9aad1190ebeedce2079fd5c214b020663a913cb","abstract_canon_sha256":"837fe5d8c05775799fa14bd3dd7f76a5c7007071bf452b68d5bf9e57c2aa4998"},"schema_version":"1.0"},"canonical_sha256":"cfeae2dd36c2f4ef565ef19950619a6befdac965a28df2620dbe2e6327a8971d","source":{"kind":"arxiv","id":"1710.08996","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.08996","created_at":"2026-05-18T00:20:56Z"},{"alias_kind":"arxiv_version","alias_value":"1710.08996v2","created_at":"2026-05-18T00:20:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.08996","created_at":"2026-05-18T00:20:56Z"},{"alias_kind":"pith_short_12","alias_value":"Z7VOFXJWYL2O","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"Z7VOFXJWYL2O6VS6","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"Z7VOFXJW","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:Z7VOFXJWYL2O6VS66GMVAYM2NP","target":"record","payload":{"canonical_record":{"source":{"id":"1710.08996","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-10-24T21:22:13Z","cross_cats_sorted":[],"title_canon_sha256":"cbe93a79e2d70bd3f9afb38fa9aad1190ebeedce2079fd5c214b020663a913cb","abstract_canon_sha256":"837fe5d8c05775799fa14bd3dd7f76a5c7007071bf452b68d5bf9e57c2aa4998"},"schema_version":"1.0"},"canonical_sha256":"cfeae2dd36c2f4ef565ef19950619a6befdac965a28df2620dbe2e6327a8971d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:56.097401Z","signature_b64":"J2vwSuFhGlLIVGmAQBbffyyolUrYhXVy/IwaPTaW32R/5mOj1AP0Gpj6WTMES2+Db+fiOhV6Cp2B3hekjG1qCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cfeae2dd36c2f4ef565ef19950619a6befdac965a28df2620dbe2e6327a8971d","last_reissued_at":"2026-05-18T00:20:56.096809Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:56.096809Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.08996","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:20:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6ulrZRlb41zpgdVBOx0pT2QjkTDN1ENrqi6ZDzC3nUmK0ov9y2EfvpFtcJMhYHcK/yTkvx08oY+OG+3m9itlAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T19:17:35.413832Z"},"content_sha256":"1e11ae334db5e7165f5e4bc6635f090156594383bc51b828e16e404eacbebfb4","schema_version":"1.0","event_id":"sha256:1e11ae334db5e7165f5e4bc6635f090156594383bc51b828e16e404eacbebfb4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:Z7VOFXJWYL2O6VS66GMVAYM2NP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Permutation Games for the Weakly Aconjunctive $\\mu$-Calculus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Daniel Hausmann, Hans-Peter Deifel, Lutz Schr\\\"oder","submitted_at":"2017-10-24T21:22:13Z","abstract_excerpt":"We introduce a natural notion of limit-deterministic parity automata and present a method that uses such automata to construct satisfiability games for the weakly aconjunctive fragment of the $\\mu$-calculus. To this end we devise a method that determinizes limit-deterministic parity automata of size $n$ with $k$ priorities through limit-deterministic B\\\"uchi automata to deterministic parity automata of size $\\mathcal{O}((nk)!)$ and with $\\mathcal{O}(nk)$ priorities. The construction relies on limit-determinism to avoid the full complexity of the Safra/Piterman-construction by using partial per"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.08996","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:20:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GAYmj9B9LMiZH0pfXQrJ1APrTUeKrsByS94FJBhiYBwq0qm9hmmI6KWNYU+42+THUgLGKFke/+hDizETfkzdBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T19:17:35.414561Z"},"content_sha256":"7f09e1217451b3c6da5050e45fcfd417674b6553294e1c4040489480e54c0a48","schema_version":"1.0","event_id":"sha256:7f09e1217451b3c6da5050e45fcfd417674b6553294e1c4040489480e54c0a48"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z7VOFXJWYL2O6VS66GMVAYM2NP/bundle.json","state_url":"https://pith.science/pith/Z7VOFXJWYL2O6VS66GMVAYM2NP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z7VOFXJWYL2O6VS66GMVAYM2NP/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-26T19:17:35Z","links":{"resolver":"https://pith.science/pith/Z7VOFXJWYL2O6VS66GMVAYM2NP","bundle":"https://pith.science/pith/Z7VOFXJWYL2O6VS66GMVAYM2NP/bundle.json","state":"https://pith.science/pith/Z7VOFXJWYL2O6VS66GMVAYM2NP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z7VOFXJWYL2O6VS66GMVAYM2NP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:Z7VOFXJWYL2O6VS66GMVAYM2NP","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":"837fe5d8c05775799fa14bd3dd7f76a5c7007071bf452b68d5bf9e57c2aa4998","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-10-24T21:22:13Z","title_canon_sha256":"cbe93a79e2d70bd3f9afb38fa9aad1190ebeedce2079fd5c214b020663a913cb"},"schema_version":"1.0","source":{"id":"1710.08996","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.08996","created_at":"2026-05-18T00:20:56Z"},{"alias_kind":"arxiv_version","alias_value":"1710.08996v2","created_at":"2026-05-18T00:20:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.08996","created_at":"2026-05-18T00:20:56Z"},{"alias_kind":"pith_short_12","alias_value":"Z7VOFXJWYL2O","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"Z7VOFXJWYL2O6VS6","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"Z7VOFXJW","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:7f09e1217451b3c6da5050e45fcfd417674b6553294e1c4040489480e54c0a48","target":"graph","created_at":"2026-05-18T00:20:56Z","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 introduce a natural notion of limit-deterministic parity automata and present a method that uses such automata to construct satisfiability games for the weakly aconjunctive fragment of the $\\mu$-calculus. To this end we devise a method that determinizes limit-deterministic parity automata of size $n$ with $k$ priorities through limit-deterministic B\\\"uchi automata to deterministic parity automata of size $\\mathcal{O}((nk)!)$ and with $\\mathcal{O}(nk)$ priorities. The construction relies on limit-determinism to avoid the full complexity of the Safra/Piterman-construction by using partial per","authors_text":"Daniel Hausmann, Hans-Peter Deifel, Lutz Schr\\\"oder","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-10-24T21:22:13Z","title":"Permutation Games for the Weakly Aconjunctive $\\mu$-Calculus"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.08996","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:1e11ae334db5e7165f5e4bc6635f090156594383bc51b828e16e404eacbebfb4","target":"record","created_at":"2026-05-18T00:20:56Z","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":"837fe5d8c05775799fa14bd3dd7f76a5c7007071bf452b68d5bf9e57c2aa4998","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-10-24T21:22:13Z","title_canon_sha256":"cbe93a79e2d70bd3f9afb38fa9aad1190ebeedce2079fd5c214b020663a913cb"},"schema_version":"1.0","source":{"id":"1710.08996","kind":"arxiv","version":2}},"canonical_sha256":"cfeae2dd36c2f4ef565ef19950619a6befdac965a28df2620dbe2e6327a8971d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cfeae2dd36c2f4ef565ef19950619a6befdac965a28df2620dbe2e6327a8971d","first_computed_at":"2026-05-18T00:20:56.096809Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:56.096809Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"J2vwSuFhGlLIVGmAQBbffyyolUrYhXVy/IwaPTaW32R/5mOj1AP0Gpj6WTMES2+Db+fiOhV6Cp2B3hekjG1qCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:56.097401Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.08996","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1e11ae334db5e7165f5e4bc6635f090156594383bc51b828e16e404eacbebfb4","sha256:7f09e1217451b3c6da5050e45fcfd417674b6553294e1c4040489480e54c0a48"],"state_sha256":"c5de8882e927c615bd6428f9a3b0f9a18c805421bd31a7569fc0362cbc3d48ed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VcuNb2NMy3USn3wZ6AGDBY8YkcbOWd1qHkksVo5EeLq984gaYcfX4eNEHkFb2TP8Em0f3Z6AcSjkuFVDv2tDAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T19:17:35.418359Z","bundle_sha256":"3487804d20b20210c33421b6265d2750fbca635c6f07de3fccb19f4fcfda540c"}}