{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:XDTWAKTQ4P2JZZVXHVZG3L36WI","short_pith_number":"pith:XDTWAKTQ","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"},"canonical_sha256":"b8e7602a70e3f49ce6b73d726daf7eb2094408ccf9bfaa8cbd8e563162b42d8e","source":{"kind":"arxiv","id":"1511.08456","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.08456","created_at":"2026-05-18T01:25:54Z"},{"alias_kind":"arxiv_version","alias_value":"1511.08456v1","created_at":"2026-05-18T01:25:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.08456","created_at":"2026-05-18T01:25:54Z"},{"alias_kind":"pith_short_12","alias_value":"XDTWAKTQ4P2J","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XDTWAKTQ4P2JZZVX","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XDTWAKTQ","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:XDTWAKTQ4P2JZZVXHVZG3L36WI","target":"record","payload":{"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"},"canonical_sha256":"b8e7602a70e3f49ce6b73d726daf7eb2094408ccf9bfaa8cbd8e563162b42d8e","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"},"source_kind":"arxiv","source_id":"1511.08456","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-18T01:25:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"31LlvXWhTyuWZshxFqyqe5EndQH4XuD0RH4rS9bRx1AfcU3nIfurA9xa1b2hWxo8LtYIgAVy89OYelcIcWLFAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T17:04:42.818089Z"},"content_sha256":"5d7da0d05cde660f8aea69fbe8b76f27fa01b6415d01368ac8d3e2b71554b2cf","schema_version":"1.0","event_id":"sha256:5d7da0d05cde660f8aea69fbe8b76f27fa01b6415d01368ac8d3e2b71554b2cf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:XDTWAKTQ4P2JZZVXHVZG3L36WI","target":"graph","payload":{"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"},"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:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZIh2kcSnKppDjXWjBTTGyQ3xa84GwafItjyzidrawzeifJSQp5hroU9QgRffEaPizPpHm6pLI062zWAEnm97Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T17:04:42.818726Z"},"content_sha256":"bd58f4f92092a28161a02ba9ca7900eda5bd4d501e00fd2fd19340a52da43d74","schema_version":"1.0","event_id":"sha256:bd58f4f92092a28161a02ba9ca7900eda5bd4d501e00fd2fd19340a52da43d74"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XDTWAKTQ4P2JZZVXHVZG3L36WI/bundle.json","state_url":"https://pith.science/pith/XDTWAKTQ4P2JZZVXHVZG3L36WI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XDTWAKTQ4P2JZZVXHVZG3L36WI/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-28T17:04:42Z","links":{"resolver":"https://pith.science/pith/XDTWAKTQ4P2JZZVXHVZG3L36WI","bundle":"https://pith.science/pith/XDTWAKTQ4P2JZZVXHVZG3L36WI/bundle.json","state":"https://pith.science/pith/XDTWAKTQ4P2JZZVXHVZG3L36WI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XDTWAKTQ4P2JZZVXHVZG3L36WI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:XDTWAKTQ4P2JZZVXHVZG3L36WI","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":"a99233d6f5cf98cc277f336d9586f16fb4c1288457a9f31ea2374a5ba599dd2f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-11-26T17:33:05Z","title_canon_sha256":"7a0071526cc175f23f110ffd9d8a126451b4b144ba6b70980d49285e3e3d0e3c"},"schema_version":"1.0","source":{"id":"1511.08456","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.08456","created_at":"2026-05-18T01:25:54Z"},{"alias_kind":"arxiv_version","alias_value":"1511.08456v1","created_at":"2026-05-18T01:25:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.08456","created_at":"2026-05-18T01:25:54Z"},{"alias_kind":"pith_short_12","alias_value":"XDTWAKTQ4P2J","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XDTWAKTQ4P2JZZVX","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XDTWAKTQ","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:bd58f4f92092a28161a02ba9ca7900eda5bd4d501e00fd2fd19340a52da43d74","target":"graph","created_at":"2026-05-18T01:25:54Z","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":"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","authors_text":"Jessica Davies, Krishnendu Chatterjee, Martin Chmelik","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-11-26T17:33:05Z","title":"A Symbolic SAT-based Algorithm for Almost-sure Reachability with Small Strategies in POMDPs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.08456","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:5d7da0d05cde660f8aea69fbe8b76f27fa01b6415d01368ac8d3e2b71554b2cf","target":"record","created_at":"2026-05-18T01:25:54Z","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":"a99233d6f5cf98cc277f336d9586f16fb4c1288457a9f31ea2374a5ba599dd2f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-11-26T17:33:05Z","title_canon_sha256":"7a0071526cc175f23f110ffd9d8a126451b4b144ba6b70980d49285e3e3d0e3c"},"schema_version":"1.0","source":{"id":"1511.08456","kind":"arxiv","version":1}},"canonical_sha256":"b8e7602a70e3f49ce6b73d726daf7eb2094408ccf9bfaa8cbd8e563162b42d8e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b8e7602a70e3f49ce6b73d726daf7eb2094408ccf9bfaa8cbd8e563162b42d8e","first_computed_at":"2026-05-18T01:25:54.006662Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:25:54.006662Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+Bj8OSYnj7dTOwOnSdYOSQ7guxrd6kjAUURK2LGxRtP65Ptjmg/7Hbl4MUcwYtcKk2ohig/la+I05OjRDCf4Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:25:54.007267Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.08456","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5d7da0d05cde660f8aea69fbe8b76f27fa01b6415d01368ac8d3e2b71554b2cf","sha256:bd58f4f92092a28161a02ba9ca7900eda5bd4d501e00fd2fd19340a52da43d74"],"state_sha256":"418d108f4894a6b6024ac025d89c6f535deb6c60a2c94e38933df344c447a642"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6sturvRp+NHfwQVycuxVTtUgev1Gcgit4IVpkTUaJAyW+RJmzS0+vmzULOHqVORf67B7a7mmwDtBxazy42d2AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T17:04:42.821744Z","bundle_sha256":"f89d67c444e8be1dc644094313fc7fe3e4543f97f267165508cf211e095b66ba"}}