{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:Z25LLDHWSNRPO5RXQ5IYAOLEPD","short_pith_number":"pith:Z25LLDHW","schema_version":"1.0","canonical_sha256":"cebab58cf69362f77637875180396478d51b562fd7f7a6bdaee18498039542b8","source":{"kind":"arxiv","id":"1304.0084","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1304.0084","created_at":"2026-05-18T01:09:32.992427+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.0084v2","created_at":"2026-05-18T01:09:32.992427+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.0084","created_at":"2026-05-18T01:09:32.992427+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z25LLDHWSNRP","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z25LLDHWSNRPO5RX","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z25LLDHW","created_at":"2026-05-18T12:28:09.283467+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/Z25LLDHWSNRPO5RXQ5IYAOLEPD","json":"https://pith.science/pith/Z25LLDHWSNRPO5RXQ5IYAOLEPD.json","graph_json":"https://pith.science/api/pith-number/Z25LLDHWSNRPO5RXQ5IYAOLEPD/graph.json","events_json":"https://pith.science/api/pith-number/Z25LLDHWSNRPO5RXQ5IYAOLEPD/events.json","paper":"https://pith.science/paper/Z25LLDHW"},"agent_actions":{"view_html":"https://pith.science/pith/Z25LLDHWSNRPO5RXQ5IYAOLEPD","download_json":"https://pith.science/pith/Z25LLDHWSNRPO5RXQ5IYAOLEPD.json","view_paper":"https://pith.science/paper/Z25LLDHW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.0084&json=true","fetch_graph":"https://pith.science/api/pith-number/Z25LLDHWSNRPO5RXQ5IYAOLEPD/graph.json","fetch_events":"https://pith.science/api/pith-number/Z25LLDHWSNRPO5RXQ5IYAOLEPD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z25LLDHWSNRPO5RXQ5IYAOLEPD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z25LLDHWSNRPO5RXQ5IYAOLEPD/action/storage_attestation","attest_author":"https://pith.science/pith/Z25LLDHWSNRPO5RXQ5IYAOLEPD/action/author_attestation","sign_citation":"https://pith.science/pith/Z25LLDHWSNRPO5RXQ5IYAOLEPD/action/citation_signature","submit_replication":"https://pith.science/pith/Z25LLDHWSNRPO5RXQ5IYAOLEPD/action/replication_record"}},"created_at":"2026-05-18T01:09:32.992427+00:00","updated_at":"2026-05-18T01:09:32.992427+00:00"}