{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:YNHKPVXN7MIHF53RKRHPSUSOR6","short_pith_number":"pith:YNHKPVXN","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"},"canonical_sha256":"c34ea7d6edfb1072f771544ef9524e8f96ed35d63d6e9773399b11d9c7aed4a5","source":{"kind":"arxiv","id":"1506.02483","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.02483","created_at":"2026-05-18T01:25:47Z"},{"alias_kind":"arxiv_version","alias_value":"1506.02483v3","created_at":"2026-05-18T01:25:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02483","created_at":"2026-05-18T01:25:47Z"},{"alias_kind":"pith_short_12","alias_value":"YNHKPVXN7MIH","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"YNHKPVXN7MIHF53R","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"YNHKPVXN","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:YNHKPVXN7MIHF53RKRHPSUSOR6","target":"record","payload":{"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"},"canonical_sha256":"c34ea7d6edfb1072f771544ef9524e8f96ed35d63d6e9773399b11d9c7aed4a5","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"},"source_kind":"arxiv","source_id":"1506.02483","source_version":3,"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-05-18T01:25:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K/6kTccvfLpe+uLizdTKx3HGt/CMox4XDxm2M8FqYDfKZQHsY1Tyg/EyRjJsfia5DjfstEo1n63eCSNAofGVDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T17:28:29.705586Z"},"content_sha256":"d8fe5980a364e52f7f078ce35cbd632ddc4333fc64be15b0054191e7ff1c36ff","schema_version":"1.0","event_id":"sha256:d8fe5980a364e52f7f078ce35cbd632ddc4333fc64be15b0054191e7ff1c36ff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:YNHKPVXN7MIHF53RKRHPSUSOR6","target":"graph","payload":{"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"},"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-05-18T01:25:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7coyuEpYuw7iA4nr429bKuMXNxw29RijRW9tQlkRThkZJa6CWh4mPskpRVyhnCLHrH23xmIAaHLRPkItI20tBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T17:28:29.706251Z"},"content_sha256":"952599b35ac31a43f450c76a20940991a64550a4f7294c3587c4b116dd27074e","schema_version":"1.0","event_id":"sha256:952599b35ac31a43f450c76a20940991a64550a4f7294c3587c4b116dd27074e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YNHKPVXN7MIHF53RKRHPSUSOR6/bundle.json","state_url":"https://pith.science/pith/YNHKPVXN7MIHF53RKRHPSUSOR6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YNHKPVXN7MIHF53RKRHPSUSOR6/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-05-24T17:28:29Z","links":{"resolver":"https://pith.science/pith/YNHKPVXN7MIHF53RKRHPSUSOR6","bundle":"https://pith.science/pith/YNHKPVXN7MIHF53RKRHPSUSOR6/bundle.json","state":"https://pith.science/pith/YNHKPVXN7MIHF53RKRHPSUSOR6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YNHKPVXN7MIHF53RKRHPSUSOR6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:YNHKPVXN7MIHF53RKRHPSUSOR6","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":"79d638d12140964616f5c55175990a189d7f8befc06a663c88200ac21402ea25","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-06-08T13:30:33Z","title_canon_sha256":"10c0c09a88b8bdbfad9cb0276a10e25a321c19d2a06bca6e0721bb5dbede9df2"},"schema_version":"1.0","source":{"id":"1506.02483","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.02483","created_at":"2026-05-18T01:25:47Z"},{"alias_kind":"arxiv_version","alias_value":"1506.02483v3","created_at":"2026-05-18T01:25:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02483","created_at":"2026-05-18T01:25:47Z"},{"alias_kind":"pith_short_12","alias_value":"YNHKPVXN7MIH","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"YNHKPVXN7MIHF53R","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"YNHKPVXN","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:952599b35ac31a43f450c76a20940991a64550a4f7294c3587c4b116dd27074e","target":"graph","created_at":"2026-05-18T01:25:47Z","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"},"paper":{"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.","authors_text":"Joost-Pieter Katoen, Souymodip Chakraborty","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-06-08T13:30:33Z","title":"On the Hardness of PCTL Satisfiability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.02483","kind":"arxiv","version":3},"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:d8fe5980a364e52f7f078ce35cbd632ddc4333fc64be15b0054191e7ff1c36ff","target":"record","created_at":"2026-05-18T01:25:47Z","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":"79d638d12140964616f5c55175990a189d7f8befc06a663c88200ac21402ea25","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-06-08T13:30:33Z","title_canon_sha256":"10c0c09a88b8bdbfad9cb0276a10e25a321c19d2a06bca6e0721bb5dbede9df2"},"schema_version":"1.0","source":{"id":"1506.02483","kind":"arxiv","version":3}},"canonical_sha256":"c34ea7d6edfb1072f771544ef9524e8f96ed35d63d6e9773399b11d9c7aed4a5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c34ea7d6edfb1072f771544ef9524e8f96ed35d63d6e9773399b11d9c7aed4a5","first_computed_at":"2026-05-18T01:25:47.004633Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:25:47.004633Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"svzHgtDqjkMkqP1p1h1kccw/ijsAeH63CAZacmgcrLDBmLNzZd6DTVJ8Lfz0o9nqeYLeUukH6k+s5Tt9IXIXDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:25:47.005053Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.02483","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d8fe5980a364e52f7f078ce35cbd632ddc4333fc64be15b0054191e7ff1c36ff","sha256:952599b35ac31a43f450c76a20940991a64550a4f7294c3587c4b116dd27074e"],"state_sha256":"149ba048633875b7b2f916e7e706b687058de1164bb92dfb699a75ced5bb515b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"owoC+OBv5Gi/I7KfmO6/N9jXCcJUG6hm68/zVyyXf3qUhUOIM3w59ccsi9BhtgCLa4JWawyEjFvir0RUBebGAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T17:28:29.710091Z","bundle_sha256":"7d816a0e5ef9d5823ad4d805ba8e7e3477176035305e96fb1bacbdc35a0cb37c"}}