{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:2DHSF4DRCTTJ5SVNQCMYDMFRV6","short_pith_number":"pith:2DHSF4DR","schema_version":"1.0","canonical_sha256":"d0cf22f07114e69ecaad809981b0b1afa0881c67b0990f5ba57fcf9ee24b912f","source":{"kind":"arxiv","id":"2606.21976","version":1},"attestation_state":"computed","paper":{"title":"Probabilistic Model Checking via Families of Deterministic and Unambiguous Finite Automata","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Christel Baier, Sascha Kl\\\"uppelholz, Timm Spork","submitted_at":"2026-06-20T10:18:32Z","abstract_excerpt":"Families of deterministic finite automata (FDFA) have been introduced as a concise automaton model that characterizes $\\omega$-regular languages by processing their ultimately periodic words. FDFA are known to enjoy many good properties and can be exponentially more succinct than deterministic $\\omega$-automata with Rabin, Streett or parity acceptance. This paper addresses two main questions: (1) Are FDFA suitable for probabilistic model checking purposes? and (2) Is it possible to obtain an even more compact representation of $\\omega$-regular languages by allowing the components of an FDFA to"},"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":"2606.21976","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2026-06-20T10:18:32Z","cross_cats_sorted":[],"title_canon_sha256":"1fcbe1e6a25b55e9ca0a6153e00631a464d764ff9ef15da93779c5d8d36181dd","abstract_canon_sha256":"3f55c0cc9d691063680e59f9c11a24df9a099f676a9c73889c4f03c72e347b1d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T02:13:04.750324Z","signature_b64":"dQYTt+PYLlIca+6GraKayQf7seLQQNmW33DE3KBA07uc11QZg/uf8V2rUaMLnvYzkOCw+/E0W9m6yI6ERZcnBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0cf22f07114e69ecaad809981b0b1afa0881c67b0990f5ba57fcf9ee24b912f","last_reissued_at":"2026-06-23T02:13:04.749916Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T02:13:04.749916Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Probabilistic Model Checking via Families of Deterministic and Unambiguous Finite Automata","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Christel Baier, Sascha Kl\\\"uppelholz, Timm Spork","submitted_at":"2026-06-20T10:18:32Z","abstract_excerpt":"Families of deterministic finite automata (FDFA) have been introduced as a concise automaton model that characterizes $\\omega$-regular languages by processing their ultimately periodic words. FDFA are known to enjoy many good properties and can be exponentially more succinct than deterministic $\\omega$-automata with Rabin, Streett or parity acceptance. This paper addresses two main questions: (1) Are FDFA suitable for probabilistic model checking purposes? and (2) Is it possible to obtain an even more compact representation of $\\omega$-regular languages by allowing the components of an FDFA to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.21976","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.21976/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2606.21976","created_at":"2026-06-23T02:13:04.749980+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.21976v1","created_at":"2026-06-23T02:13:04.749980+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.21976","created_at":"2026-06-23T02:13:04.749980+00:00"},{"alias_kind":"pith_short_12","alias_value":"2DHSF4DRCTTJ","created_at":"2026-06-23T02:13:04.749980+00:00"},{"alias_kind":"pith_short_16","alias_value":"2DHSF4DRCTTJ5SVN","created_at":"2026-06-23T02:13:04.749980+00:00"},{"alias_kind":"pith_short_8","alias_value":"2DHSF4DR","created_at":"2026-06-23T02:13:04.749980+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/2DHSF4DRCTTJ5SVNQCMYDMFRV6","json":"https://pith.science/pith/2DHSF4DRCTTJ5SVNQCMYDMFRV6.json","graph_json":"https://pith.science/api/pith-number/2DHSF4DRCTTJ5SVNQCMYDMFRV6/graph.json","events_json":"https://pith.science/api/pith-number/2DHSF4DRCTTJ5SVNQCMYDMFRV6/events.json","paper":"https://pith.science/paper/2DHSF4DR"},"agent_actions":{"view_html":"https://pith.science/pith/2DHSF4DRCTTJ5SVNQCMYDMFRV6","download_json":"https://pith.science/pith/2DHSF4DRCTTJ5SVNQCMYDMFRV6.json","view_paper":"https://pith.science/paper/2DHSF4DR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.21976&json=true","fetch_graph":"https://pith.science/api/pith-number/2DHSF4DRCTTJ5SVNQCMYDMFRV6/graph.json","fetch_events":"https://pith.science/api/pith-number/2DHSF4DRCTTJ5SVNQCMYDMFRV6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2DHSF4DRCTTJ5SVNQCMYDMFRV6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2DHSF4DRCTTJ5SVNQCMYDMFRV6/action/storage_attestation","attest_author":"https://pith.science/pith/2DHSF4DRCTTJ5SVNQCMYDMFRV6/action/author_attestation","sign_citation":"https://pith.science/pith/2DHSF4DRCTTJ5SVNQCMYDMFRV6/action/citation_signature","submit_replication":"https://pith.science/pith/2DHSF4DRCTTJ5SVNQCMYDMFRV6/action/replication_record"}},"created_at":"2026-06-23T02:13:04.749980+00:00","updated_at":"2026-06-23T02:13:04.749980+00:00"}