{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:2DHSF4DRCTTJ5SVNQCMYDMFRV6","short_pith_number":"pith:2DHSF4DR","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"},"canonical_sha256":"d0cf22f07114e69ecaad809981b0b1afa0881c67b0990f5ba57fcf9ee24b912f","source":{"kind":"arxiv","id":"2606.21976","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.21976","created_at":"2026-06-23T02:13:04Z"},{"alias_kind":"arxiv_version","alias_value":"2606.21976v1","created_at":"2026-06-23T02:13:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.21976","created_at":"2026-06-23T02:13:04Z"},{"alias_kind":"pith_short_12","alias_value":"2DHSF4DRCTTJ","created_at":"2026-06-23T02:13:04Z"},{"alias_kind":"pith_short_16","alias_value":"2DHSF4DRCTTJ5SVN","created_at":"2026-06-23T02:13:04Z"},{"alias_kind":"pith_short_8","alias_value":"2DHSF4DR","created_at":"2026-06-23T02:13:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:2DHSF4DRCTTJ5SVNQCMYDMFRV6","target":"record","payload":{"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"},"canonical_sha256":"d0cf22f07114e69ecaad809981b0b1afa0881c67b0990f5ba57fcf9ee24b912f","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"},"source_kind":"arxiv","source_id":"2606.21976","source_version":1,"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-06-23T02:13:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jeJBzxYtivrP4IPX+7H+Lzeltjy7jong9tiwTl8GVa0aJDHd4YLlQxx1OCMCertStkOTxvoQLtHi9P6UBplVDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T02:53:22.527833Z"},"content_sha256":"33e686b65dce5f446d3c4ea31c84404ff150ad46a8326840de022b0ccd87ecf8","schema_version":"1.0","event_id":"sha256:33e686b65dce5f446d3c4ea31c84404ff150ad46a8326840de022b0ccd87ecf8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:2DHSF4DRCTTJ5SVNQCMYDMFRV6","target":"graph","payload":{"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"},"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-06-23T02:13:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"brQ91lle9GN8T6naB4TLsVRVeU23vU0J5Qb6Kzut+x5jmwnYWpbxmYUpRCCcpT+Ga9dK2wjfwMce+tY+2ZvCBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T02:53:22.528206Z"},"content_sha256":"9a8f1ab05dc209baed1e7b18bfce6c75b5db49a7ff17284aa1d8a2d05f72e492","schema_version":"1.0","event_id":"sha256:9a8f1ab05dc209baed1e7b18bfce6c75b5db49a7ff17284aa1d8a2d05f72e492"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2DHSF4DRCTTJ5SVNQCMYDMFRV6/bundle.json","state_url":"https://pith.science/pith/2DHSF4DRCTTJ5SVNQCMYDMFRV6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2DHSF4DRCTTJ5SVNQCMYDMFRV6/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-06-27T02:53:22Z","links":{"resolver":"https://pith.science/pith/2DHSF4DRCTTJ5SVNQCMYDMFRV6","bundle":"https://pith.science/pith/2DHSF4DRCTTJ5SVNQCMYDMFRV6/bundle.json","state":"https://pith.science/pith/2DHSF4DRCTTJ5SVNQCMYDMFRV6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2DHSF4DRCTTJ5SVNQCMYDMFRV6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:2DHSF4DRCTTJ5SVNQCMYDMFRV6","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":"3f55c0cc9d691063680e59f9c11a24df9a099f676a9c73889c4f03c72e347b1d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2026-06-20T10:18:32Z","title_canon_sha256":"1fcbe1e6a25b55e9ca0a6153e00631a464d764ff9ef15da93779c5d8d36181dd"},"schema_version":"1.0","source":{"id":"2606.21976","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.21976","created_at":"2026-06-23T02:13:04Z"},{"alias_kind":"arxiv_version","alias_value":"2606.21976v1","created_at":"2026-06-23T02:13:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.21976","created_at":"2026-06-23T02:13:04Z"},{"alias_kind":"pith_short_12","alias_value":"2DHSF4DRCTTJ","created_at":"2026-06-23T02:13:04Z"},{"alias_kind":"pith_short_16","alias_value":"2DHSF4DRCTTJ5SVN","created_at":"2026-06-23T02:13:04Z"},{"alias_kind":"pith_short_8","alias_value":"2DHSF4DR","created_at":"2026-06-23T02:13:04Z"}],"graph_snapshots":[{"event_id":"sha256:9a8f1ab05dc209baed1e7b18bfce6c75b5db49a7ff17284aa1d8a2d05f72e492","target":"graph","created_at":"2026-06-23T02:13:04Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.21976/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Christel Baier, Sascha Kl\\\"uppelholz, Timm Spork","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2026-06-20T10:18:32Z","title":"Probabilistic Model Checking via Families of Deterministic and Unambiguous Finite Automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.21976","kind":"arxiv","version":1},"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:33e686b65dce5f446d3c4ea31c84404ff150ad46a8326840de022b0ccd87ecf8","target":"record","created_at":"2026-06-23T02:13:04Z","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":"3f55c0cc9d691063680e59f9c11a24df9a099f676a9c73889c4f03c72e347b1d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2026-06-20T10:18:32Z","title_canon_sha256":"1fcbe1e6a25b55e9ca0a6153e00631a464d764ff9ef15da93779c5d8d36181dd"},"schema_version":"1.0","source":{"id":"2606.21976","kind":"arxiv","version":1}},"canonical_sha256":"d0cf22f07114e69ecaad809981b0b1afa0881c67b0990f5ba57fcf9ee24b912f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d0cf22f07114e69ecaad809981b0b1afa0881c67b0990f5ba57fcf9ee24b912f","first_computed_at":"2026-06-23T02:13:04.749916Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-23T02:13:04.749916Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dQYTt+PYLlIca+6GraKayQf7seLQQNmW33DE3KBA07uc11QZg/uf8V2rUaMLnvYzkOCw+/E0W9m6yI6ERZcnBQ==","signature_status":"signed_v1","signed_at":"2026-06-23T02:13:04.750324Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.21976","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:33e686b65dce5f446d3c4ea31c84404ff150ad46a8326840de022b0ccd87ecf8","sha256:9a8f1ab05dc209baed1e7b18bfce6c75b5db49a7ff17284aa1d8a2d05f72e492"],"state_sha256":"56ce6a3656b9f88654ddd6d3b2603d57b2379f3713e203f5f0492eaefb384f2b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gPXF5ri9fyhhdDe2U/Y9iOcFlwdCoxyn6DgqYpUUB6Q1YynVUOyphGw5gognMpYwKuZVS5VaBr9Gm30PrEEkBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T02:53:22.530146Z","bundle_sha256":"6c000405d6731609a0f378b7dec6f23982859997d5cea4bf462ce623ad157c36"}}