{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:Z7VOFXJWYL2O6VS66GMVAYM2NP","short_pith_number":"pith:Z7VOFXJW","schema_version":"1.0","canonical_sha256":"cfeae2dd36c2f4ef565ef19950619a6befdac965a28df2620dbe2e6327a8971d","source":{"kind":"arxiv","id":"1710.08996","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1710.08996","created_at":"2026-05-18T00:20:56.096899+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.08996v2","created_at":"2026-05-18T00:20:56.096899+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.08996","created_at":"2026-05-18T00:20:56.096899+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z7VOFXJWYL2O","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z7VOFXJWYL2O6VS6","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z7VOFXJW","created_at":"2026-05-18T12:31:59.375834+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/Z7VOFXJWYL2O6VS66GMVAYM2NP","json":"https://pith.science/pith/Z7VOFXJWYL2O6VS66GMVAYM2NP.json","graph_json":"https://pith.science/api/pith-number/Z7VOFXJWYL2O6VS66GMVAYM2NP/graph.json","events_json":"https://pith.science/api/pith-number/Z7VOFXJWYL2O6VS66GMVAYM2NP/events.json","paper":"https://pith.science/paper/Z7VOFXJW"},"agent_actions":{"view_html":"https://pith.science/pith/Z7VOFXJWYL2O6VS66GMVAYM2NP","download_json":"https://pith.science/pith/Z7VOFXJWYL2O6VS66GMVAYM2NP.json","view_paper":"https://pith.science/paper/Z7VOFXJW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.08996&json=true","fetch_graph":"https://pith.science/api/pith-number/Z7VOFXJWYL2O6VS66GMVAYM2NP/graph.json","fetch_events":"https://pith.science/api/pith-number/Z7VOFXJWYL2O6VS66GMVAYM2NP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z7VOFXJWYL2O6VS66GMVAYM2NP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z7VOFXJWYL2O6VS66GMVAYM2NP/action/storage_attestation","attest_author":"https://pith.science/pith/Z7VOFXJWYL2O6VS66GMVAYM2NP/action/author_attestation","sign_citation":"https://pith.science/pith/Z7VOFXJWYL2O6VS66GMVAYM2NP/action/citation_signature","submit_replication":"https://pith.science/pith/Z7VOFXJWYL2O6VS66GMVAYM2NP/action/replication_record"}},"created_at":"2026-05-18T00:20:56.096899+00:00","updated_at":"2026-05-18T00:20:56.096899+00:00"}