{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:SNDTLH35UVFXQHMPWIQFOS6MPK","short_pith_number":"pith:SNDTLH35","canonical_record":{"source":{"id":"1204.0469","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-03-30T15:31:30Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"c3241d3c9b3652ca9e5142707520d8eace01a2db6df0a10797db88f51be4a21e","abstract_canon_sha256":"ec8106a133d8c7a685a1da9cffab08f43efe7de98601ccc425a17736736df93e"},"schema_version":"1.0"},"canonical_sha256":"9347359f7da54b781d8fb220574bcc7aaf71691a4360c4cbb9e48c3f0dadac25","source":{"kind":"arxiv","id":"1204.0469","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.0469","created_at":"2026-05-18T02:21:16Z"},{"alias_kind":"arxiv_version","alias_value":"1204.0469v1","created_at":"2026-05-18T02:21:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.0469","created_at":"2026-05-18T02:21:16Z"},{"alias_kind":"pith_short_12","alias_value":"SNDTLH35UVFX","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"SNDTLH35UVFXQHMP","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"SNDTLH35","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:SNDTLH35UVFXQHMPWIQFOS6MPK","target":"record","payload":{"canonical_record":{"source":{"id":"1204.0469","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-03-30T15:31:30Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"c3241d3c9b3652ca9e5142707520d8eace01a2db6df0a10797db88f51be4a21e","abstract_canon_sha256":"ec8106a133d8c7a685a1da9cffab08f43efe7de98601ccc425a17736736df93e"},"schema_version":"1.0"},"canonical_sha256":"9347359f7da54b781d8fb220574bcc7aaf71691a4360c4cbb9e48c3f0dadac25","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:16.608260Z","signature_b64":"DB1pZ61QdzBiGvTv0Qb2j1McLSHdw5jRsNmKBj/J12VRzT0mU/IMK0DRFb5JItmiQ1Z3BPj9LbirtP4fi6oZAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9347359f7da54b781d8fb220574bcc7aaf71691a4360c4cbb9e48c3f0dadac25","last_reissued_at":"2026-05-18T02:21:16.607673Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:16.607673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.0469","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-05-18T02:21:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t72gbcll7mZDOrfw93wfQwjDRjMAck6JovPVkm0KovsrJsXXual1RbMRXpTuqo34hJXVr9bf2RSNbrZH18l9Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T10:57:31.913201Z"},"content_sha256":"9f9b11b261d2709a0378b48dab2c50cc406c503efbb67e6196e4c50709a016f3","schema_version":"1.0","event_id":"sha256:9f9b11b261d2709a0378b48dab2c50cc406c503efbb67e6196e4c50709a016f3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:SNDTLH35UVFXQHMPWIQFOS6MPK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bounded Satisfiability for PCTL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"John Fearnley, Nathalie Bertrand, Sven Schewe","submitted_at":"2012-03-30T15:31:30Z","abstract_excerpt":"While model checking PCTL for Markov chains is decidable in polynomial-time, the decidability of PCTL satisfiability, as well as its finite model property, are long standing open problems. While general satisfiability is an intriguing challenge from a purely theoretical point of view, we argue that general solutions would not be of interest to practitioners: such solutions could be too big to be implementable or even infinite. Inspired by bounded synthesis techniques, we turn to the more applied problem of seeking models of a bounded size: we restrict our search to implementable -- and therefo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.0469","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"},"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-18T02:21:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xVZQn0r30TypFnwz+DgJBkrTn98wSGD58JewBFTsG3BpvDg3AV7SqpO4BdGB2DwQHwMwIAK1oow8PcTpMfMdBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T10:57:31.913895Z"},"content_sha256":"f884aec31190934835b03b4f676b4287f4b30f4e2b175c3cfaba210424e7ea2f","schema_version":"1.0","event_id":"sha256:f884aec31190934835b03b4f676b4287f4b30f4e2b175c3cfaba210424e7ea2f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SNDTLH35UVFXQHMPWIQFOS6MPK/bundle.json","state_url":"https://pith.science/pith/SNDTLH35UVFXQHMPWIQFOS6MPK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SNDTLH35UVFXQHMPWIQFOS6MPK/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-31T10:57:31Z","links":{"resolver":"https://pith.science/pith/SNDTLH35UVFXQHMPWIQFOS6MPK","bundle":"https://pith.science/pith/SNDTLH35UVFXQHMPWIQFOS6MPK/bundle.json","state":"https://pith.science/pith/SNDTLH35UVFXQHMPWIQFOS6MPK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SNDTLH35UVFXQHMPWIQFOS6MPK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:SNDTLH35UVFXQHMPWIQFOS6MPK","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":"ec8106a133d8c7a685a1da9cffab08f43efe7de98601ccc425a17736736df93e","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-03-30T15:31:30Z","title_canon_sha256":"c3241d3c9b3652ca9e5142707520d8eace01a2db6df0a10797db88f51be4a21e"},"schema_version":"1.0","source":{"id":"1204.0469","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.0469","created_at":"2026-05-18T02:21:16Z"},{"alias_kind":"arxiv_version","alias_value":"1204.0469v1","created_at":"2026-05-18T02:21:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.0469","created_at":"2026-05-18T02:21:16Z"},{"alias_kind":"pith_short_12","alias_value":"SNDTLH35UVFX","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"SNDTLH35UVFXQHMP","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"SNDTLH35","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:f884aec31190934835b03b4f676b4287f4b30f4e2b175c3cfaba210424e7ea2f","target":"graph","created_at":"2026-05-18T02:21:16Z","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":"While model checking PCTL for Markov chains is decidable in polynomial-time, the decidability of PCTL satisfiability, as well as its finite model property, are long standing open problems. While general satisfiability is an intriguing challenge from a purely theoretical point of view, we argue that general solutions would not be of interest to practitioners: such solutions could be too big to be implementable or even infinite. Inspired by bounded synthesis techniques, we turn to the more applied problem of seeking models of a bounded size: we restrict our search to implementable -- and therefo","authors_text":"John Fearnley, Nathalie Bertrand, Sven Schewe","cross_cats":["cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-03-30T15:31:30Z","title":"Bounded Satisfiability for PCTL"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.0469","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:9f9b11b261d2709a0378b48dab2c50cc406c503efbb67e6196e4c50709a016f3","target":"record","created_at":"2026-05-18T02:21:16Z","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":"ec8106a133d8c7a685a1da9cffab08f43efe7de98601ccc425a17736736df93e","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-03-30T15:31:30Z","title_canon_sha256":"c3241d3c9b3652ca9e5142707520d8eace01a2db6df0a10797db88f51be4a21e"},"schema_version":"1.0","source":{"id":"1204.0469","kind":"arxiv","version":1}},"canonical_sha256":"9347359f7da54b781d8fb220574bcc7aaf71691a4360c4cbb9e48c3f0dadac25","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9347359f7da54b781d8fb220574bcc7aaf71691a4360c4cbb9e48c3f0dadac25","first_computed_at":"2026-05-18T02:21:16.607673Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:16.607673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DB1pZ61QdzBiGvTv0Qb2j1McLSHdw5jRsNmKBj/J12VRzT0mU/IMK0DRFb5JItmiQ1Z3BPj9LbirtP4fi6oZAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:16.608260Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.0469","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9f9b11b261d2709a0378b48dab2c50cc406c503efbb67e6196e4c50709a016f3","sha256:f884aec31190934835b03b4f676b4287f4b30f4e2b175c3cfaba210424e7ea2f"],"state_sha256":"f7fb555245d352c421de9f8f6d39286f41ac8395fea54f25dcac132b827af73d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6s600IT4myg2GRy1AkuEY7LVzCtpSFjQcIvzDVfZh4aC5K3gzcoAB+SesOKkmF+zhpydKUpyxmPZeNcqdjCNDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T10:57:31.918332Z","bundle_sha256":"e824f0aa20ea56a4fcbfa6e53a27dd0d279d04d7f9ec70dd8327f566f383efcc"}}