{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:HOHB2ZWYZKUKMFJMTRLIC2EX73","short_pith_number":"pith:HOHB2ZWY","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"},"canonical_sha256":"3b8e1d66d8caa8a6152c9c56816897feda5ae73030d9154740d9989ecd86c437","source":{"kind":"arxiv","id":"1301.7405","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.7405","created_at":"2026-05-18T03:34:59Z"},{"alias_kind":"arxiv_version","alias_value":"1301.7405v1","created_at":"2026-05-18T03:34:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.7405","created_at":"2026-05-18T03:34:59Z"},{"alias_kind":"pith_short_12","alias_value":"HOHB2ZWYZKUK","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HOHB2ZWYZKUKMFJM","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HOHB2ZWY","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:HOHB2ZWYZKUKMFJMTRLIC2EX73","target":"record","payload":{"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"},"canonical_sha256":"3b8e1d66d8caa8a6152c9c56816897feda5ae73030d9154740d9989ecd86c437","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"},"source_kind":"arxiv","source_id":"1301.7405","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-18T03:34:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2C6/6sag0BNzen7d/irUvrRByiAVM01ktyqG0ots0sSLKOwOgiIR82Muh5IJp/HUJC0pZmDNNCrJaM87TzvBCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T18:33:10.955348Z"},"content_sha256":"6f9e8722010a555b62717ab20bfc4df2958f7934eeaa3a11e78658f040d73dd3","schema_version":"1.0","event_id":"sha256:6f9e8722010a555b62717ab20bfc4df2958f7934eeaa3a11e78658f040d73dd3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:HOHB2ZWYZKUKMFJMTRLIC2EX73","target":"graph","payload":{"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"},"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-18T03:34:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3np6tXG8h8Vt3HaR3oeLh0lkTkb8N2dxMPEC04AQHNaPU2ioqyzvIWnNrvcPTKPdE0xEzIL4oTXywD+duI4QDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T18:33:10.955987Z"},"content_sha256":"ea4ae2ce9256608e5d7e77ccae7831a0d9cce97fd9649612c72e2d8432a02182","schema_version":"1.0","event_id":"sha256:ea4ae2ce9256608e5d7e77ccae7831a0d9cce97fd9649612c72e2d8432a02182"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HOHB2ZWYZKUKMFJMTRLIC2EX73/bundle.json","state_url":"https://pith.science/pith/HOHB2ZWYZKUKMFJMTRLIC2EX73/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HOHB2ZWYZKUKMFJMTRLIC2EX73/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-06-07T18:33:10Z","links":{"resolver":"https://pith.science/pith/HOHB2ZWYZKUKMFJMTRLIC2EX73","bundle":"https://pith.science/pith/HOHB2ZWYZKUKMFJMTRLIC2EX73/bundle.json","state":"https://pith.science/pith/HOHB2ZWYZKUKMFJMTRLIC2EX73/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HOHB2ZWYZKUKMFJMTRLIC2EX73/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:HOHB2ZWYZKUKMFJMTRLIC2EX73","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":"2c5cb397147cc7bd1c7231e055de9f230d0c1084c149268d4b7ad4ea7de1b4d2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-30T15:06:15Z","title_canon_sha256":"ed546a216611b94a081162af3e4162e9336dedf4719d1db50c535927a6aef7d9"},"schema_version":"1.0","source":{"id":"1301.7405","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.7405","created_at":"2026-05-18T03:34:59Z"},{"alias_kind":"arxiv_version","alias_value":"1301.7405v1","created_at":"2026-05-18T03:34:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.7405","created_at":"2026-05-18T03:34:59Z"},{"alias_kind":"pith_short_12","alias_value":"HOHB2ZWYZKUK","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HOHB2ZWYZKUKMFJM","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HOHB2ZWY","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:ea4ae2ce9256608e5d7e77ccae7831a0d9cce97fd9649612c72e2d8432a02182","target":"graph","created_at":"2026-05-18T03:34:59Z","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":"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","authors_text":"Ron Parr","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-30T15:06:15Z","title":"Flexible Decomposition Algorithms for Weakly Coupled Markov Decision Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.7405","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:6f9e8722010a555b62717ab20bfc4df2958f7934eeaa3a11e78658f040d73dd3","target":"record","created_at":"2026-05-18T03:34:59Z","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":"2c5cb397147cc7bd1c7231e055de9f230d0c1084c149268d4b7ad4ea7de1b4d2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-30T15:06:15Z","title_canon_sha256":"ed546a216611b94a081162af3e4162e9336dedf4719d1db50c535927a6aef7d9"},"schema_version":"1.0","source":{"id":"1301.7405","kind":"arxiv","version":1}},"canonical_sha256":"3b8e1d66d8caa8a6152c9c56816897feda5ae73030d9154740d9989ecd86c437","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3b8e1d66d8caa8a6152c9c56816897feda5ae73030d9154740d9989ecd86c437","first_computed_at":"2026-05-18T03:34:59.934392Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:34:59.934392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jTYmFZIUCKB+GhPVLUghGT14JteVv5ysBpjPqm7RRwMWMoquPve5Dmas1QwO/qPzEZLGfIxLvsAOJQF5xehQCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:34:59.934906Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.7405","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6f9e8722010a555b62717ab20bfc4df2958f7934eeaa3a11e78658f040d73dd3","sha256:ea4ae2ce9256608e5d7e77ccae7831a0d9cce97fd9649612c72e2d8432a02182"],"state_sha256":"9032a7017299c3493b42e433b0a9f21d066a44c351fdad352ae4c0fea61abbb1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6pVwEALAarOdMp+tjjKfjJV0mxG33KBqJSjl0vYGCo3tH77eiSNNKcWT0G79M489ipP/Tbtxn48baAoeflWZAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T18:33:10.959213Z","bundle_sha256":"2aee9d2ce579238d1885fff22724f593cf31913460039454f0c5bdb29a6ef769"}}