{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:2KD3WXVGQPHTIQ5SGPIQEYBP5S","short_pith_number":"pith:2KD3WXVG","schema_version":"1.0","canonical_sha256":"d287bb5ea683cf3443b233d102602fec89732fb7763a1657e94034373c224ce8","source":{"kind":"arxiv","id":"1809.06352","version":1},"attestation_state":"computed","paper":{"title":"Satisfiability Bounds for {\\omega}-regular Properties in Interval-valued Markov Chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Maxence Dutreix, Samuel Coogan","submitted_at":"2018-09-17T17:39:11Z","abstract_excerpt":"We derive an algorithm to compute satisfiability bounds for arbitrary {\\omega}-regular properties in an Interval-valued Markov Chain (IMC) interpreted in the adversarial sense. IMCs generalize regular Markov Chains by assigning a range of possible values to the transition probabilities between states. In particular, we expand the automata-based theory of {\\omega}-regular property verification in Markov Chains to apply it to IMCs. Any {\\omega}-regular property can be represented by a Deterministic Rabin Automata (DRA) with acceptance conditions expressed by Rabin pairs. Previous works on Markov"},"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":"1809.06352","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-09-17T17:39:11Z","cross_cats_sorted":[],"title_canon_sha256":"022ca8c046a219c07bc6ea84e62fdce10c40adc8ecaaa0fb4d842e7a5c1a8c9f","abstract_canon_sha256":"9924f3dd94286e13b4bb29cc5a1a78d8e91e12d94bce311c6de53d5f233794b9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:34.954640Z","signature_b64":"Y/xsPlebGDGMFnlpOvYCNCqFoSkheczFgNgFZeKPIx+BtGYOYZGzvNOskoxCWKKgmN0kBfIQ+S3qiuTQ7y+BCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d287bb5ea683cf3443b233d102602fec89732fb7763a1657e94034373c224ce8","last_reissued_at":"2026-05-18T00:05:34.954118Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:34.954118Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Satisfiability Bounds for {\\omega}-regular Properties in Interval-valued Markov Chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Maxence Dutreix, Samuel Coogan","submitted_at":"2018-09-17T17:39:11Z","abstract_excerpt":"We derive an algorithm to compute satisfiability bounds for arbitrary {\\omega}-regular properties in an Interval-valued Markov Chain (IMC) interpreted in the adversarial sense. IMCs generalize regular Markov Chains by assigning a range of possible values to the transition probabilities between states. In particular, we expand the automata-based theory of {\\omega}-regular property verification in Markov Chains to apply it to IMCs. Any {\\omega}-regular property can be represented by a Deterministic Rabin Automata (DRA) with acceptance conditions expressed by Rabin pairs. Previous works on Markov"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.06352","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":""},"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":"1809.06352","created_at":"2026-05-18T00:05:34.954190+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.06352v1","created_at":"2026-05-18T00:05:34.954190+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.06352","created_at":"2026-05-18T00:05:34.954190+00:00"},{"alias_kind":"pith_short_12","alias_value":"2KD3WXVGQPHT","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"2KD3WXVGQPHTIQ5S","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"2KD3WXVG","created_at":"2026-05-18T12:32:02.567920+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/2KD3WXVGQPHTIQ5SGPIQEYBP5S","json":"https://pith.science/pith/2KD3WXVGQPHTIQ5SGPIQEYBP5S.json","graph_json":"https://pith.science/api/pith-number/2KD3WXVGQPHTIQ5SGPIQEYBP5S/graph.json","events_json":"https://pith.science/api/pith-number/2KD3WXVGQPHTIQ5SGPIQEYBP5S/events.json","paper":"https://pith.science/paper/2KD3WXVG"},"agent_actions":{"view_html":"https://pith.science/pith/2KD3WXVGQPHTIQ5SGPIQEYBP5S","download_json":"https://pith.science/pith/2KD3WXVGQPHTIQ5SGPIQEYBP5S.json","view_paper":"https://pith.science/paper/2KD3WXVG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.06352&json=true","fetch_graph":"https://pith.science/api/pith-number/2KD3WXVGQPHTIQ5SGPIQEYBP5S/graph.json","fetch_events":"https://pith.science/api/pith-number/2KD3WXVGQPHTIQ5SGPIQEYBP5S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2KD3WXVGQPHTIQ5SGPIQEYBP5S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2KD3WXVGQPHTIQ5SGPIQEYBP5S/action/storage_attestation","attest_author":"https://pith.science/pith/2KD3WXVGQPHTIQ5SGPIQEYBP5S/action/author_attestation","sign_citation":"https://pith.science/pith/2KD3WXVGQPHTIQ5SGPIQEYBP5S/action/citation_signature","submit_replication":"https://pith.science/pith/2KD3WXVGQPHTIQ5SGPIQEYBP5S/action/replication_record"}},"created_at":"2026-05-18T00:05:34.954190+00:00","updated_at":"2026-05-18T00:05:34.954190+00:00"}