{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:SNDTLH35UVFXQHMPWIQFOS6MPK","short_pith_number":"pith:SNDTLH35","schema_version":"1.0","canonical_sha256":"9347359f7da54b781d8fb220574bcc7aaf71691a4360c4cbb9e48c3f0dadac25","source":{"kind":"arxiv","id":"1204.0469","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1204.0469","created_at":"2026-05-18T02:21:16.607762+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.0469v1","created_at":"2026-05-18T02:21:16.607762+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.0469","created_at":"2026-05-18T02:21:16.607762+00:00"},{"alias_kind":"pith_short_12","alias_value":"SNDTLH35UVFX","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"SNDTLH35UVFXQHMP","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"SNDTLH35","created_at":"2026-05-18T12:27:20.899486+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/SNDTLH35UVFXQHMPWIQFOS6MPK","json":"https://pith.science/pith/SNDTLH35UVFXQHMPWIQFOS6MPK.json","graph_json":"https://pith.science/api/pith-number/SNDTLH35UVFXQHMPWIQFOS6MPK/graph.json","events_json":"https://pith.science/api/pith-number/SNDTLH35UVFXQHMPWIQFOS6MPK/events.json","paper":"https://pith.science/paper/SNDTLH35"},"agent_actions":{"view_html":"https://pith.science/pith/SNDTLH35UVFXQHMPWIQFOS6MPK","download_json":"https://pith.science/pith/SNDTLH35UVFXQHMPWIQFOS6MPK.json","view_paper":"https://pith.science/paper/SNDTLH35","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.0469&json=true","fetch_graph":"https://pith.science/api/pith-number/SNDTLH35UVFXQHMPWIQFOS6MPK/graph.json","fetch_events":"https://pith.science/api/pith-number/SNDTLH35UVFXQHMPWIQFOS6MPK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SNDTLH35UVFXQHMPWIQFOS6MPK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SNDTLH35UVFXQHMPWIQFOS6MPK/action/storage_attestation","attest_author":"https://pith.science/pith/SNDTLH35UVFXQHMPWIQFOS6MPK/action/author_attestation","sign_citation":"https://pith.science/pith/SNDTLH35UVFXQHMPWIQFOS6MPK/action/citation_signature","submit_replication":"https://pith.science/pith/SNDTLH35UVFXQHMPWIQFOS6MPK/action/replication_record"}},"created_at":"2026-05-18T02:21:16.607762+00:00","updated_at":"2026-05-18T02:21:16.607762+00:00"}