{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:HOHB2ZWYZKUKMFJMTRLIC2EX73","short_pith_number":"pith:HOHB2ZWY","schema_version":"1.0","canonical_sha256":"3b8e1d66d8caa8a6152c9c56816897feda5ae73030d9154740d9989ecd86c437","source":{"kind":"arxiv","id":"1301.7405","version":1},"attestation_state":"computed","paper":{"title":"Flexible Decomposition Algorithms for Weakly Coupled Markov Decision Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Ron Parr","submitted_at":"2013-01-30T15:06:15Z","abstract_excerpt":"This paper presents two new approaches to decomposing and solving large Markov decision problems (MDPs), a partial decoupling method and a complete decoupling method.  In these approaches, a large, stochastic decision problem is divided into smaller pieces.  The first approach builds a cache of policies for each part of the problem independently, and then combines the pieces in a separate, light-weight step.  A second approach also divides the problem into smaller pieces, but information is communicated between the different problem pieces, allowing intelligent decisions to be made about which"},"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":"1301.7405","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-30T15:06:15Z","cross_cats_sorted":[],"title_canon_sha256":"ed546a216611b94a081162af3e4162e9336dedf4719d1db50c535927a6aef7d9","abstract_canon_sha256":"2c5cb397147cc7bd1c7231e055de9f230d0c1084c149268d4b7ad4ea7de1b4d2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:34:59.934906Z","signature_b64":"jTYmFZIUCKB+GhPVLUghGT14JteVv5ysBpjPqm7RRwMWMoquPve5Dmas1QwO/qPzEZLGfIxLvsAOJQF5xehQCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b8e1d66d8caa8a6152c9c56816897feda5ae73030d9154740d9989ecd86c437","last_reissued_at":"2026-05-18T03:34:59.934392Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:34:59.934392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Flexible Decomposition Algorithms for Weakly Coupled Markov Decision Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Ron Parr","submitted_at":"2013-01-30T15:06:15Z","abstract_excerpt":"This paper presents two new approaches to decomposing and solving large Markov decision problems (MDPs), a partial decoupling method and a complete decoupling method.  In these approaches, a large, stochastic decision problem is divided into smaller pieces.  The first approach builds a cache of policies for each part of the problem independently, and then combines the pieces in a separate, light-weight step.  A second approach also divides the problem into smaller pieces, but information is communicated between the different problem pieces, allowing intelligent decisions to be made about which"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.7405","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":"1301.7405","created_at":"2026-05-18T03:34:59.934463+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.7405v1","created_at":"2026-05-18T03:34:59.934463+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.7405","created_at":"2026-05-18T03:34:59.934463+00:00"},{"alias_kind":"pith_short_12","alias_value":"HOHB2ZWYZKUK","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"HOHB2ZWYZKUKMFJM","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"HOHB2ZWY","created_at":"2026-05-18T12:27:46.883200+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/HOHB2ZWYZKUKMFJMTRLIC2EX73","json":"https://pith.science/pith/HOHB2ZWYZKUKMFJMTRLIC2EX73.json","graph_json":"https://pith.science/api/pith-number/HOHB2ZWYZKUKMFJMTRLIC2EX73/graph.json","events_json":"https://pith.science/api/pith-number/HOHB2ZWYZKUKMFJMTRLIC2EX73/events.json","paper":"https://pith.science/paper/HOHB2ZWY"},"agent_actions":{"view_html":"https://pith.science/pith/HOHB2ZWYZKUKMFJMTRLIC2EX73","download_json":"https://pith.science/pith/HOHB2ZWYZKUKMFJMTRLIC2EX73.json","view_paper":"https://pith.science/paper/HOHB2ZWY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.7405&json=true","fetch_graph":"https://pith.science/api/pith-number/HOHB2ZWYZKUKMFJMTRLIC2EX73/graph.json","fetch_events":"https://pith.science/api/pith-number/HOHB2ZWYZKUKMFJMTRLIC2EX73/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HOHB2ZWYZKUKMFJMTRLIC2EX73/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HOHB2ZWYZKUKMFJMTRLIC2EX73/action/storage_attestation","attest_author":"https://pith.science/pith/HOHB2ZWYZKUKMFJMTRLIC2EX73/action/author_attestation","sign_citation":"https://pith.science/pith/HOHB2ZWYZKUKMFJMTRLIC2EX73/action/citation_signature","submit_replication":"https://pith.science/pith/HOHB2ZWYZKUKMFJMTRLIC2EX73/action/replication_record"}},"created_at":"2026-05-18T03:34:59.934463+00:00","updated_at":"2026-05-18T03:34:59.934463+00:00"}