{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:YNHKPVXN7MIHF53RKRHPSUSOR6","short_pith_number":"pith:YNHKPVXN","schema_version":"1.0","canonical_sha256":"c34ea7d6edfb1072f771544ef9524e8f96ed35d63d6e9773399b11d9c7aed4a5","source":{"kind":"arxiv","id":"1506.02483","version":3},"attestation_state":"computed","paper":{"title":"On the Hardness of PCTL Satisfiability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Joost-Pieter Katoen, Souymodip Chakraborty","submitted_at":"2015-06-08T13:30:33Z","abstract_excerpt":"This paper shows that the satisfiability problem for probabilistic CTL (PCTL, for short) is undecidable. By a reduction from $1\\frac{1}{2}$-player games with PCTL winning objectives, we establish that the PCTL satisfiability problem is ${\\Sigma}_1^1$-hard. We present an exponential-time algorithm for the satisfiability of a bounded, negation-closed fragment of PCTL, and show that the satisfiability problem for this fragment is EXPTIME-hard."},"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":"1506.02483","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-06-08T13:30:33Z","cross_cats_sorted":[],"title_canon_sha256":"10c0c09a88b8bdbfad9cb0276a10e25a321c19d2a06bca6e0721bb5dbede9df2","abstract_canon_sha256":"79d638d12140964616f5c55175990a189d7f8befc06a663c88200ac21402ea25"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:47.005053Z","signature_b64":"svzHgtDqjkMkqP1p1h1kccw/ijsAeH63CAZacmgcrLDBmLNzZd6DTVJ8Lfz0o9nqeYLeUukH6k+s5Tt9IXIXDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c34ea7d6edfb1072f771544ef9524e8f96ed35d63d6e9773399b11d9c7aed4a5","last_reissued_at":"2026-05-18T01:25:47.004633Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:47.004633Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Hardness of PCTL Satisfiability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Joost-Pieter Katoen, Souymodip Chakraborty","submitted_at":"2015-06-08T13:30:33Z","abstract_excerpt":"This paper shows that the satisfiability problem for probabilistic CTL (PCTL, for short) is undecidable. By a reduction from $1\\frac{1}{2}$-player games with PCTL winning objectives, we establish that the PCTL satisfiability problem is ${\\Sigma}_1^1$-hard. We present an exponential-time algorithm for the satisfiability of a bounded, negation-closed fragment of PCTL, and show that the satisfiability problem for this fragment is EXPTIME-hard."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.02483","kind":"arxiv","version":3},"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":"1506.02483","created_at":"2026-05-18T01:25:47.004699+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.02483v3","created_at":"2026-05-18T01:25:47.004699+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02483","created_at":"2026-05-18T01:25:47.004699+00:00"},{"alias_kind":"pith_short_12","alias_value":"YNHKPVXN7MIH","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"YNHKPVXN7MIHF53R","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"YNHKPVXN","created_at":"2026-05-18T12:29:50.041715+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/YNHKPVXN7MIHF53RKRHPSUSOR6","json":"https://pith.science/pith/YNHKPVXN7MIHF53RKRHPSUSOR6.json","graph_json":"https://pith.science/api/pith-number/YNHKPVXN7MIHF53RKRHPSUSOR6/graph.json","events_json":"https://pith.science/api/pith-number/YNHKPVXN7MIHF53RKRHPSUSOR6/events.json","paper":"https://pith.science/paper/YNHKPVXN"},"agent_actions":{"view_html":"https://pith.science/pith/YNHKPVXN7MIHF53RKRHPSUSOR6","download_json":"https://pith.science/pith/YNHKPVXN7MIHF53RKRHPSUSOR6.json","view_paper":"https://pith.science/paper/YNHKPVXN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.02483&json=true","fetch_graph":"https://pith.science/api/pith-number/YNHKPVXN7MIHF53RKRHPSUSOR6/graph.json","fetch_events":"https://pith.science/api/pith-number/YNHKPVXN7MIHF53RKRHPSUSOR6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YNHKPVXN7MIHF53RKRHPSUSOR6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YNHKPVXN7MIHF53RKRHPSUSOR6/action/storage_attestation","attest_author":"https://pith.science/pith/YNHKPVXN7MIHF53RKRHPSUSOR6/action/author_attestation","sign_citation":"https://pith.science/pith/YNHKPVXN7MIHF53RKRHPSUSOR6/action/citation_signature","submit_replication":"https://pith.science/pith/YNHKPVXN7MIHF53RKRHPSUSOR6/action/replication_record"}},"created_at":"2026-05-18T01:25:47.004699+00:00","updated_at":"2026-05-18T01:25:47.004699+00:00"}