{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:Z25LLDHWSNRPO5RXQ5IYAOLEPD","short_pith_number":"pith:Z25LLDHW","canonical_record":{"source":{"id":"1304.0084","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-30T10:17:14Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"325dccfbd6a60e9783f4689950d94181c42d7131bf7934280120f82a8e546ec0","abstract_canon_sha256":"9e9350d1f6c5bfb530eafebac786450280e26c7f6f5715a3f6127922930f71ed"},"schema_version":"1.0"},"canonical_sha256":"cebab58cf69362f77637875180396478d51b562fd7f7a6bdaee18498039542b8","source":{"kind":"arxiv","id":"1304.0084","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.0084","created_at":"2026-05-18T01:09:32Z"},{"alias_kind":"arxiv_version","alias_value":"1304.0084v2","created_at":"2026-05-18T01:09:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.0084","created_at":"2026-05-18T01:09:32Z"},{"alias_kind":"pith_short_12","alias_value":"Z25LLDHWSNRP","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"Z25LLDHWSNRPO5RX","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"Z25LLDHW","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:Z25LLDHWSNRPO5RXQ5IYAOLEPD","target":"record","payload":{"canonical_record":{"source":{"id":"1304.0084","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-30T10:17:14Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"325dccfbd6a60e9783f4689950d94181c42d7131bf7934280120f82a8e546ec0","abstract_canon_sha256":"9e9350d1f6c5bfb530eafebac786450280e26c7f6f5715a3f6127922930f71ed"},"schema_version":"1.0"},"canonical_sha256":"cebab58cf69362f77637875180396478d51b562fd7f7a6bdaee18498039542b8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:32.992755Z","signature_b64":"8iUKspLndz9BL7tvI+TmxR1OU/2HQmFlxwnaJd86KvnXsw/0tFSoaNZWizCwDEewJ0u+zSAb7zlr+25OBYfECg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cebab58cf69362f77637875180396478d51b562fd7f7a6bdaee18498039542b8","last_reissued_at":"2026-05-18T01:09:32.992368Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:32.992368Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.0084","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-05-18T01:09:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YHPT4XAaJz/gojeNCjN2Qy1W341ZHEyONpNiYCg6J33VWRM736JP64uAfk7XEKJN/nTByYGhGC5v9D7xC4hNAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:26:24.595174Z"},"content_sha256":"1b6fedc2d2c50214485adb6cf41604cc70ce463064df12447d7d7c6c6938980f","schema_version":"1.0","event_id":"sha256:1b6fedc2d2c50214485adb6cf41604cc70ce463064df12447d7d7c6c6938980f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:Z25LLDHWSNRPO5RXQ5IYAOLEPD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster Algorithms for Markov Decision Processes with Low Treewidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.DS","authors_text":"Jakub {\\L}\\k{a}cki, Krishnendu Chatterjee","submitted_at":"2013-03-30T10:17:14Z","abstract_excerpt":"We consider two core algorithmic problems for probabilistic verification: the maximal end-component decomposition and the almost-sure reachability set computation for Markov decision processes (MDPs). For MDPs with treewidth $k$, we present two improved static algorithms for both the problems that run in time $O(n \\cdot k^{2.38} \\cdot 2^k)$ and $O(m \\cdot \\log n \\cdot k)$, respectively, where $n$ is the number of states and $m$ is the number of edges, significantly improving the previous known $O(n\\cdot k \\cdot \\sqrt{n\\cdot k})$ bound for low treewidth. We also present decremental algorithms f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.0084","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":""},"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:09:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FMFckqyc1/SI9cSkeYE5MFeBf1y6z1jxRGjdSeNtw44Y7lYAQ2PVNtNX7Uv1CFwxLj8fHxNTZoaog5mqbXvhCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:26:24.595847Z"},"content_sha256":"5356cefda40866aa3d08418cc1a0b324b31200f349ea34f6c049535d17f222d8","schema_version":"1.0","event_id":"sha256:5356cefda40866aa3d08418cc1a0b324b31200f349ea34f6c049535d17f222d8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z25LLDHWSNRPO5RXQ5IYAOLEPD/bundle.json","state_url":"https://pith.science/pith/Z25LLDHWSNRPO5RXQ5IYAOLEPD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z25LLDHWSNRPO5RXQ5IYAOLEPD/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-25T16:26:24Z","links":{"resolver":"https://pith.science/pith/Z25LLDHWSNRPO5RXQ5IYAOLEPD","bundle":"https://pith.science/pith/Z25LLDHWSNRPO5RXQ5IYAOLEPD/bundle.json","state":"https://pith.science/pith/Z25LLDHWSNRPO5RXQ5IYAOLEPD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z25LLDHWSNRPO5RXQ5IYAOLEPD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:Z25LLDHWSNRPO5RXQ5IYAOLEPD","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":"9e9350d1f6c5bfb530eafebac786450280e26c7f6f5715a3f6127922930f71ed","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-30T10:17:14Z","title_canon_sha256":"325dccfbd6a60e9783f4689950d94181c42d7131bf7934280120f82a8e546ec0"},"schema_version":"1.0","source":{"id":"1304.0084","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.0084","created_at":"2026-05-18T01:09:32Z"},{"alias_kind":"arxiv_version","alias_value":"1304.0084v2","created_at":"2026-05-18T01:09:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.0084","created_at":"2026-05-18T01:09:32Z"},{"alias_kind":"pith_short_12","alias_value":"Z25LLDHWSNRP","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"Z25LLDHWSNRPO5RX","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"Z25LLDHW","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:5356cefda40866aa3d08418cc1a0b324b31200f349ea34f6c049535d17f222d8","target":"graph","created_at":"2026-05-18T01:09:32Z","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":"We consider two core algorithmic problems for probabilistic verification: the maximal end-component decomposition and the almost-sure reachability set computation for Markov decision processes (MDPs). For MDPs with treewidth $k$, we present two improved static algorithms for both the problems that run in time $O(n \\cdot k^{2.38} \\cdot 2^k)$ and $O(m \\cdot \\log n \\cdot k)$, respectively, where $n$ is the number of states and $m$ is the number of edges, significantly improving the previous known $O(n\\cdot k \\cdot \\sqrt{n\\cdot k})$ bound for low treewidth. We also present decremental algorithms f","authors_text":"Jakub {\\L}\\k{a}cki, Krishnendu Chatterjee","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-30T10:17:14Z","title":"Faster Algorithms for Markov Decision Processes with Low Treewidth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.0084","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:1b6fedc2d2c50214485adb6cf41604cc70ce463064df12447d7d7c6c6938980f","target":"record","created_at":"2026-05-18T01:09:32Z","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":"9e9350d1f6c5bfb530eafebac786450280e26c7f6f5715a3f6127922930f71ed","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-30T10:17:14Z","title_canon_sha256":"325dccfbd6a60e9783f4689950d94181c42d7131bf7934280120f82a8e546ec0"},"schema_version":"1.0","source":{"id":"1304.0084","kind":"arxiv","version":2}},"canonical_sha256":"cebab58cf69362f77637875180396478d51b562fd7f7a6bdaee18498039542b8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cebab58cf69362f77637875180396478d51b562fd7f7a6bdaee18498039542b8","first_computed_at":"2026-05-18T01:09:32.992368Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:32.992368Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8iUKspLndz9BL7tvI+TmxR1OU/2HQmFlxwnaJd86KvnXsw/0tFSoaNZWizCwDEewJ0u+zSAb7zlr+25OBYfECg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:32.992755Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.0084","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1b6fedc2d2c50214485adb6cf41604cc70ce463064df12447d7d7c6c6938980f","sha256:5356cefda40866aa3d08418cc1a0b324b31200f349ea34f6c049535d17f222d8"],"state_sha256":"5379e9945b18f908e44f91303c8f7e549dc46643008d08cad3cc216c1644c14f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZlZH0XZ+AzBjMQZZiYUmaJwuPMJcozM0liU7ickGtrqen0V+FjraW577pJh/RiXJNAbMB/QlGXmhBx5QEKd6CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T16:26:24.599147Z","bundle_sha256":"80a0c3cd0bc5db00730f709a8256593d402ae471d5e766806d5d5fef650058f6"}}