{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:XDTWAKTQ4P2JZZVXHVZG3L36WI","short_pith_number":"pith:XDTWAKTQ","schema_version":"1.0","canonical_sha256":"b8e7602a70e3f49ce6b73d726daf7eb2094408ccf9bfaa8cbd8e563162b42d8e","source":{"kind":"arxiv","id":"1511.08456","version":1},"attestation_state":"computed","paper":{"title":"A Symbolic SAT-based Algorithm for Almost-sure Reachability with Small Strategies in POMDPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Jessica Davies, Krishnendu Chatterjee, Martin Chmelik","submitted_at":"2015-11-26T17:33:05Z","abstract_excerpt":"POMDPs are standard models for probabilistic planning problems, where an agent interacts with an uncertain environment. We study the problem of almost-sure reachability, where given a set of target states, the question is to decide whether there is a policy to ensure that the target set is reached with probability 1 (almost-surely). While in general the problem is EXPTIME-complete, in many practical cases policies with a small amount of memory suffice. Moreover, the existing solution to the problem is explicit, which first requires to construct explicitly an exponential reduction to a belief-s"},"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":"1511.08456","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-11-26T17:33:05Z","cross_cats_sorted":[],"title_canon_sha256":"7a0071526cc175f23f110ffd9d8a126451b4b144ba6b70980d49285e3e3d0e3c","abstract_canon_sha256":"a99233d6f5cf98cc277f336d9586f16fb4c1288457a9f31ea2374a5ba599dd2f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:54.007267Z","signature_b64":"+Bj8OSYnj7dTOwOnSdYOSQ7guxrd6kjAUURK2LGxRtP65Ptjmg/7Hbl4MUcwYtcKk2ohig/la+I05OjRDCf4Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8e7602a70e3f49ce6b73d726daf7eb2094408ccf9bfaa8cbd8e563162b42d8e","last_reissued_at":"2026-05-18T01:25:54.006662Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:54.006662Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Symbolic SAT-based Algorithm for Almost-sure Reachability with Small Strategies in POMDPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Jessica Davies, Krishnendu Chatterjee, Martin Chmelik","submitted_at":"2015-11-26T17:33:05Z","abstract_excerpt":"POMDPs are standard models for probabilistic planning problems, where an agent interacts with an uncertain environment. We study the problem of almost-sure reachability, where given a set of target states, the question is to decide whether there is a policy to ensure that the target set is reached with probability 1 (almost-surely). While in general the problem is EXPTIME-complete, in many practical cases policies with a small amount of memory suffice. Moreover, the existing solution to the problem is explicit, which first requires to construct explicitly an exponential reduction to a belief-s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.08456","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":"1511.08456","created_at":"2026-05-18T01:25:54.006765+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.08456v1","created_at":"2026-05-18T01:25:54.006765+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.08456","created_at":"2026-05-18T01:25:54.006765+00:00"},{"alias_kind":"pith_short_12","alias_value":"XDTWAKTQ4P2J","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"XDTWAKTQ4P2JZZVX","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"XDTWAKTQ","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/XDTWAKTQ4P2JZZVXHVZG3L36WI","json":"https://pith.science/pith/XDTWAKTQ4P2JZZVXHVZG3L36WI.json","graph_json":"https://pith.science/api/pith-number/XDTWAKTQ4P2JZZVXHVZG3L36WI/graph.json","events_json":"https://pith.science/api/pith-number/XDTWAKTQ4P2JZZVXHVZG3L36WI/events.json","paper":"https://pith.science/paper/XDTWAKTQ"},"agent_actions":{"view_html":"https://pith.science/pith/XDTWAKTQ4P2JZZVXHVZG3L36WI","download_json":"https://pith.science/pith/XDTWAKTQ4P2JZZVXHVZG3L36WI.json","view_paper":"https://pith.science/paper/XDTWAKTQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.08456&json=true","fetch_graph":"https://pith.science/api/pith-number/XDTWAKTQ4P2JZZVXHVZG3L36WI/graph.json","fetch_events":"https://pith.science/api/pith-number/XDTWAKTQ4P2JZZVXHVZG3L36WI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XDTWAKTQ4P2JZZVXHVZG3L36WI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XDTWAKTQ4P2JZZVXHVZG3L36WI/action/storage_attestation","attest_author":"https://pith.science/pith/XDTWAKTQ4P2JZZVXHVZG3L36WI/action/author_attestation","sign_citation":"https://pith.science/pith/XDTWAKTQ4P2JZZVXHVZG3L36WI/action/citation_signature","submit_replication":"https://pith.science/pith/XDTWAKTQ4P2JZZVXHVZG3L36WI/action/replication_record"}},"created_at":"2026-05-18T01:25:54.006765+00:00","updated_at":"2026-05-18T01:25:54.006765+00:00"}