{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:C3ITLEMOATMK2D2K4QK57ZBI35","short_pith_number":"pith:C3ITLEMO","canonical_record":{"source":{"id":"1106.1822","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-06-09T13:58:37Z","cross_cats_sorted":[],"title_canon_sha256":"61ceef096d4247ebf983d66f8ee01954e4a7b2057c18ace1f78f8523360bda66","abstract_canon_sha256":"aec1728c796a441d476fd8d5a6dc5ffeeeb80365125cbefd81064c6ec44bd558"},"schema_version":"1.0"},"canonical_sha256":"16d135918e04d8ad0f4ae415dfe428df77ba6874f47ef5b23c53c0cec9fd4bb0","source":{"kind":"arxiv","id":"1106.1822","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.1822","created_at":"2026-05-18T04:20:15Z"},{"alias_kind":"arxiv_version","alias_value":"1106.1822v1","created_at":"2026-05-18T04:20:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.1822","created_at":"2026-05-18T04:20:15Z"},{"alias_kind":"pith_short_12","alias_value":"C3ITLEMOATMK","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"C3ITLEMOATMK2D2K","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"C3ITLEMO","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:C3ITLEMOATMK2D2K4QK57ZBI35","target":"record","payload":{"canonical_record":{"source":{"id":"1106.1822","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-06-09T13:58:37Z","cross_cats_sorted":[],"title_canon_sha256":"61ceef096d4247ebf983d66f8ee01954e4a7b2057c18ace1f78f8523360bda66","abstract_canon_sha256":"aec1728c796a441d476fd8d5a6dc5ffeeeb80365125cbefd81064c6ec44bd558"},"schema_version":"1.0"},"canonical_sha256":"16d135918e04d8ad0f4ae415dfe428df77ba6874f47ef5b23c53c0cec9fd4bb0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:20:15.066615Z","signature_b64":"vBZtSqSm+uHWplEdf1dYcq3TyU4YHVFNWs31X/pp2e5BtYOXyxHB0MCGFDc5Twybdh27D9CYLeYorIkbEHFQBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"16d135918e04d8ad0f4ae415dfe428df77ba6874f47ef5b23c53c0cec9fd4bb0","last_reissued_at":"2026-05-18T04:20:15.066060Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:20:15.066060Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1106.1822","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-18T04:20:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pMXQmyD0G79Qthwe9CLoT2OGqGmVrSidFfK20hgSaTTFcUgYqvzIAm0z7FV8CihJ0flri6Sp9sT+EZ0tjMQiDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T14:23:16.180051Z"},"content_sha256":"29e23e56fa0019df367e75abe18c59b4d4419f76e60046e5e868eaa8934078fe","schema_version":"1.0","event_id":"sha256:29e23e56fa0019df367e75abe18c59b4d4419f76e60046e5e868eaa8934078fe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:C3ITLEMOATMK2D2K4QK57ZBI35","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Solution Algorithms for Factored MDPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"C. Guestrin, D. Koller, R. Parr, S. Venkataraman","submitted_at":"2011-06-09T13:58:37Z","abstract_excerpt":"This paper addresses the problem of planning under uncertainty in large Markov Decision Processes (MDPs). Factored MDPs represent a complex state space using state variables and the transition model using a dynamic Bayesian network. This representation often allows an exponential reduction in the representation size of structured MDPs, but the complexity of exact solution algorithms for such MDPs can grow exponentially in the representation size.  In this paper, we present two approximate solution algorithms that exploit structure in factored MDPs.  Both use an approximate value function repre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.1822","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-18T04:20:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K4nCi6Ciwstdloogt2o3E+DEziDJZ0QdBXJHQGwYNz65OzLzo7X3AVw53s9KnSXDCTRMwJONAcs2c36F3tcVCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T14:23:16.180639Z"},"content_sha256":"e30255ff937140cb2bd201b69ade24b4d93113484600c9625c00c1d006e7a8c5","schema_version":"1.0","event_id":"sha256:e30255ff937140cb2bd201b69ade24b4d93113484600c9625c00c1d006e7a8c5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C3ITLEMOATMK2D2K4QK57ZBI35/bundle.json","state_url":"https://pith.science/pith/C3ITLEMOATMK2D2K4QK57ZBI35/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C3ITLEMOATMK2D2K4QK57ZBI35/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-08T14:23:16Z","links":{"resolver":"https://pith.science/pith/C3ITLEMOATMK2D2K4QK57ZBI35","bundle":"https://pith.science/pith/C3ITLEMOATMK2D2K4QK57ZBI35/bundle.json","state":"https://pith.science/pith/C3ITLEMOATMK2D2K4QK57ZBI35/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C3ITLEMOATMK2D2K4QK57ZBI35/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:C3ITLEMOATMK2D2K4QK57ZBI35","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":"aec1728c796a441d476fd8d5a6dc5ffeeeb80365125cbefd81064c6ec44bd558","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-06-09T13:58:37Z","title_canon_sha256":"61ceef096d4247ebf983d66f8ee01954e4a7b2057c18ace1f78f8523360bda66"},"schema_version":"1.0","source":{"id":"1106.1822","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.1822","created_at":"2026-05-18T04:20:15Z"},{"alias_kind":"arxiv_version","alias_value":"1106.1822v1","created_at":"2026-05-18T04:20:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.1822","created_at":"2026-05-18T04:20:15Z"},{"alias_kind":"pith_short_12","alias_value":"C3ITLEMOATMK","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"C3ITLEMOATMK2D2K","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"C3ITLEMO","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:e30255ff937140cb2bd201b69ade24b4d93113484600c9625c00c1d006e7a8c5","target":"graph","created_at":"2026-05-18T04:20:15Z","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 addresses the problem of planning under uncertainty in large Markov Decision Processes (MDPs). Factored MDPs represent a complex state space using state variables and the transition model using a dynamic Bayesian network. This representation often allows an exponential reduction in the representation size of structured MDPs, but the complexity of exact solution algorithms for such MDPs can grow exponentially in the representation size.  In this paper, we present two approximate solution algorithms that exploit structure in factored MDPs.  Both use an approximate value function repre","authors_text":"C. Guestrin, D. Koller, R. Parr, S. Venkataraman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-06-09T13:58:37Z","title":"Efficient Solution Algorithms for Factored MDPs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.1822","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:29e23e56fa0019df367e75abe18c59b4d4419f76e60046e5e868eaa8934078fe","target":"record","created_at":"2026-05-18T04:20:15Z","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":"aec1728c796a441d476fd8d5a6dc5ffeeeb80365125cbefd81064c6ec44bd558","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-06-09T13:58:37Z","title_canon_sha256":"61ceef096d4247ebf983d66f8ee01954e4a7b2057c18ace1f78f8523360bda66"},"schema_version":"1.0","source":{"id":"1106.1822","kind":"arxiv","version":1}},"canonical_sha256":"16d135918e04d8ad0f4ae415dfe428df77ba6874f47ef5b23c53c0cec9fd4bb0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"16d135918e04d8ad0f4ae415dfe428df77ba6874f47ef5b23c53c0cec9fd4bb0","first_computed_at":"2026-05-18T04:20:15.066060Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:20:15.066060Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vBZtSqSm+uHWplEdf1dYcq3TyU4YHVFNWs31X/pp2e5BtYOXyxHB0MCGFDc5Twybdh27D9CYLeYorIkbEHFQBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:20:15.066615Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.1822","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:29e23e56fa0019df367e75abe18c59b4d4419f76e60046e5e868eaa8934078fe","sha256:e30255ff937140cb2bd201b69ade24b4d93113484600c9625c00c1d006e7a8c5"],"state_sha256":"efa4b24c24bc009fd5efb883292e64b4ef0ca061e39a8fcbb227d46128fec493"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+oNGD51EKx4XpGlK3bsMAFUH6+AHivx1Rjw5e6pTPgxUXQ9uEhGfmac0rAHhg6QnMbcqldrKXNFo/GGfdqn0Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T14:23:16.183790Z","bundle_sha256":"da08222e54e177a66eef8e05c5cb3a70dbfd13aa1f8a4d8421b653f69ef04634"}}