{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:SHEUIEQXK3E4F7B4JCCVQPAGCA","short_pith_number":"pith:SHEUIEQX","canonical_record":{"source":{"id":"2412.00941","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.CC","submitted_at":"2024-12-01T19:26:03Z","cross_cats_sorted":[],"title_canon_sha256":"880a8d2ff36c9a25c050b31912e3ccdc826b3211b1fc08c05565e7330941801f","abstract_canon_sha256":"fa8310fee9e4f49ba9c9610bd8774b4d6d7a9cd5467e14ef9dc879252e93b807"},"schema_version":"1.0"},"canonical_sha256":"91c944121756c9c2fc3c4885583c061031960d7d49cb269d4935722d6ffbafa7","source":{"kind":"arxiv","id":"2412.00941","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.00941","created_at":"2026-07-05T11:20:48Z"},{"alias_kind":"arxiv_version","alias_value":"2412.00941v2","created_at":"2026-07-05T11:20:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.00941","created_at":"2026-07-05T11:20:48Z"},{"alias_kind":"pith_short_12","alias_value":"SHEUIEQXK3E4","created_at":"2026-07-05T11:20:48Z"},{"alias_kind":"pith_short_16","alias_value":"SHEUIEQXK3E4F7B4","created_at":"2026-07-05T11:20:48Z"},{"alias_kind":"pith_short_8","alias_value":"SHEUIEQX","created_at":"2026-07-05T11:20:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:SHEUIEQXK3E4F7B4JCCVQPAGCA","target":"record","payload":{"canonical_record":{"source":{"id":"2412.00941","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.CC","submitted_at":"2024-12-01T19:26:03Z","cross_cats_sorted":[],"title_canon_sha256":"880a8d2ff36c9a25c050b31912e3ccdc826b3211b1fc08c05565e7330941801f","abstract_canon_sha256":"fa8310fee9e4f49ba9c9610bd8774b4d6d7a9cd5467e14ef9dc879252e93b807"},"schema_version":"1.0"},"canonical_sha256":"91c944121756c9c2fc3c4885583c061031960d7d49cb269d4935722d6ffbafa7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:20:48.354492Z","signature_b64":"hoBaLMTpx6z6ekaDnTzjk+ZTX27+GcH1RID4WRPaM3eLxsWlQWkcCsMj7GbnZKeXqkAkDzrXTO6LBf+KzgjhDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91c944121756c9c2fc3c4885583c061031960d7d49cb269d4935722d6ffbafa7","last_reissued_at":"2026-07-05T11:20:48.353981Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:20:48.353981Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2412.00941","source_version":2,"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-07-05T11:20:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"09Ii4QPvj3dUQc9eLFDqY6FtqgL6pZWqi6RqbvEcb7U/FQ/e7euQpD4mN/GOOQ6yvrItmJxrDaIRIdzz4fE6AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T21:38:10.990792Z"},"content_sha256":"3c513c79a4192fdcb2bc371f6e3ef8a4f3759219641a70249e2f13a183c6a7a2","schema_version":"1.0","event_id":"sha256:3c513c79a4192fdcb2bc371f6e3ef8a4f3759219641a70249e2f13a183c6a7a2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:SHEUIEQXK3E4F7B4JCCVQPAGCA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Limit-sure reachability for small memory policies in POMDPs is NP-complete","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Ali Asadi, Ali Shafiee, Krishnendu Chatterjee, Raimundo Saona","submitted_at":"2024-12-01T19:26:03Z","abstract_excerpt":"A standard model that arises in several applications in sequential decision making is partially observable Markov decision processes (POMDPs) where a decision-making agent interacts with an uncertain environment. A basic objective in such POMDPs is the reachability objective, where given a target set of states, the goal is to eventually arrive at one of them. The limit-sure problem asks whether reachability can be ensured with probability arbitrarily close to 1. In general, the limit-sure reachability problem for POMDPs is undecidable. However, in many practical cases the most relevant questio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.00941","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.00941/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T11:20:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IvAHKSFcSEy2U2w6UrqSXbWEQ+sBJno+J1MSkLtz0TlTf5XLNjeFDs9mL/Hm0oVi6mAG5eBC65nWf9jjFn6SBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T21:38:10.991877Z"},"content_sha256":"f9509ee05a6118c7b9afc0d8597cf993e104898588951d0c276b1bbcb93635f1","schema_version":"1.0","event_id":"sha256:f9509ee05a6118c7b9afc0d8597cf993e104898588951d0c276b1bbcb93635f1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SHEUIEQXK3E4F7B4JCCVQPAGCA/bundle.json","state_url":"https://pith.science/pith/SHEUIEQXK3E4F7B4JCCVQPAGCA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SHEUIEQXK3E4F7B4JCCVQPAGCA/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-08-04T21:38:10Z","links":{"resolver":"https://pith.science/pith/SHEUIEQXK3E4F7B4JCCVQPAGCA","bundle":"https://pith.science/pith/SHEUIEQXK3E4F7B4JCCVQPAGCA/bundle.json","state":"https://pith.science/pith/SHEUIEQXK3E4F7B4JCCVQPAGCA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SHEUIEQXK3E4F7B4JCCVQPAGCA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:SHEUIEQXK3E4F7B4JCCVQPAGCA","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":"fa8310fee9e4f49ba9c9610bd8774b4d6d7a9cd5467e14ef9dc879252e93b807","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.CC","submitted_at":"2024-12-01T19:26:03Z","title_canon_sha256":"880a8d2ff36c9a25c050b31912e3ccdc826b3211b1fc08c05565e7330941801f"},"schema_version":"1.0","source":{"id":"2412.00941","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.00941","created_at":"2026-07-05T11:20:48Z"},{"alias_kind":"arxiv_version","alias_value":"2412.00941v2","created_at":"2026-07-05T11:20:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.00941","created_at":"2026-07-05T11:20:48Z"},{"alias_kind":"pith_short_12","alias_value":"SHEUIEQXK3E4","created_at":"2026-07-05T11:20:48Z"},{"alias_kind":"pith_short_16","alias_value":"SHEUIEQXK3E4F7B4","created_at":"2026-07-05T11:20:48Z"},{"alias_kind":"pith_short_8","alias_value":"SHEUIEQX","created_at":"2026-07-05T11:20:48Z"}],"graph_snapshots":[{"event_id":"sha256:f9509ee05a6118c7b9afc0d8597cf993e104898588951d0c276b1bbcb93635f1","target":"graph","created_at":"2026-07-05T11:20:48Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2412.00941/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A standard model that arises in several applications in sequential decision making is partially observable Markov decision processes (POMDPs) where a decision-making agent interacts with an uncertain environment. A basic objective in such POMDPs is the reachability objective, where given a target set of states, the goal is to eventually arrive at one of them. The limit-sure problem asks whether reachability can be ensured with probability arbitrarily close to 1. In general, the limit-sure reachability problem for POMDPs is undecidable. However, in many practical cases the most relevant questio","authors_text":"Ali Asadi, Ali Shafiee, Krishnendu Chatterjee, Raimundo Saona","cross_cats":[],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.CC","submitted_at":"2024-12-01T19:26:03Z","title":"Limit-sure reachability for small memory policies in POMDPs is NP-complete"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.00941","kind":"arxiv","version":2},"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:3c513c79a4192fdcb2bc371f6e3ef8a4f3759219641a70249e2f13a183c6a7a2","target":"record","created_at":"2026-07-05T11:20:48Z","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":"fa8310fee9e4f49ba9c9610bd8774b4d6d7a9cd5467e14ef9dc879252e93b807","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.CC","submitted_at":"2024-12-01T19:26:03Z","title_canon_sha256":"880a8d2ff36c9a25c050b31912e3ccdc826b3211b1fc08c05565e7330941801f"},"schema_version":"1.0","source":{"id":"2412.00941","kind":"arxiv","version":2}},"canonical_sha256":"91c944121756c9c2fc3c4885583c061031960d7d49cb269d4935722d6ffbafa7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"91c944121756c9c2fc3c4885583c061031960d7d49cb269d4935722d6ffbafa7","first_computed_at":"2026-07-05T11:20:48.353981Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:20:48.353981Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hoBaLMTpx6z6ekaDnTzjk+ZTX27+GcH1RID4WRPaM3eLxsWlQWkcCsMj7GbnZKeXqkAkDzrXTO6LBf+KzgjhDA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:20:48.354492Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.00941","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3c513c79a4192fdcb2bc371f6e3ef8a4f3759219641a70249e2f13a183c6a7a2","sha256:f9509ee05a6118c7b9afc0d8597cf993e104898588951d0c276b1bbcb93635f1"],"state_sha256":"c7d52320376445f21c84d280bc87e43c4a6005083322f3f4593471564d31a00a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kElY7br/FIDVwwzODSWNYjRCmHung6OqNu0jOYIaGBYCTBnTZRBsIerNozTppLED/BGe2bzufrkMX+t08KMRCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T21:38:10.997589Z","bundle_sha256":"9d6107a8c2f389a09897c6a132352712a39b91a6a4f1f636a03afe7be1158145"}}