{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:C22OKG2G6GCNB2MHFLJBJJ3HGB","short_pith_number":"pith:C22OKG2G","canonical_record":{"source":{"id":"1110.0028","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-09-30T20:57:35Z","cross_cats_sorted":[],"title_canon_sha256":"c648cfa7d2bc9b379d34e6ae816748b1ec7e474072703a986e36376177be01e4","abstract_canon_sha256":"f2ab8ca4115770e7ca43ce2cd8ef04875137f3302d9d24f04ef7a8508394beb4"},"schema_version":"1.0"},"canonical_sha256":"16b4e51b46f184d0e9872ad214a76730470fe23752db6a78ffc5810396d7859c","source":{"kind":"arxiv","id":"1110.0028","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.0028","created_at":"2026-05-18T04:11:50Z"},{"alias_kind":"arxiv_version","alias_value":"1110.0028v1","created_at":"2026-05-18T04:11:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.0028","created_at":"2026-05-18T04:11:50Z"},{"alias_kind":"pith_short_12","alias_value":"C22OKG2G6GCN","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"C22OKG2G6GCNB2MH","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"C22OKG2G","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:C22OKG2G6GCNB2MHFLJBJJ3HGB","target":"record","payload":{"canonical_record":{"source":{"id":"1110.0028","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-09-30T20:57:35Z","cross_cats_sorted":[],"title_canon_sha256":"c648cfa7d2bc9b379d34e6ae816748b1ec7e474072703a986e36376177be01e4","abstract_canon_sha256":"f2ab8ca4115770e7ca43ce2cd8ef04875137f3302d9d24f04ef7a8508394beb4"},"schema_version":"1.0"},"canonical_sha256":"16b4e51b46f184d0e9872ad214a76730470fe23752db6a78ffc5810396d7859c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:11:50.930252Z","signature_b64":"T3VfG3CP1Y742hWJgzsrkAsFQVYydsm30Ogdk5KI8vPIDaVTbw6C2vbv3UOzdVvnVyaf9xxmtANuFllEYvviCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"16b4e51b46f184d0e9872ad214a76730470fe23752db6a78ffc5810396d7859c","last_reissued_at":"2026-05-18T04:11:50.929712Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:11:50.929712Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1110.0028","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:11:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kLzfYAF4btIZo+ipKypQTGjo6iu4RwFxhPW1G+fFs1GG+TB5jfBrVOmMz58GxsFhlFfbyXyhVFYswBBv/NFtDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T11:31:41.882904Z"},"content_sha256":"c9cbfa395510d706e07552288bf78bb401a9a49615183c1bf91482d105cda355","schema_version":"1.0","event_id":"sha256:c9cbfa395510d706e07552288bf78bb401a9a49615183c1bf91482d105cda355"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:C22OKG2G6GCNB2MHFLJBJJ3HGB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solving Factored MDPs with Hybrid State and Action Variables","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"B. Kveton, C. Guestrin, M. Hauskrecht","submitted_at":"2011-09-30T20:57:35Z","abstract_excerpt":"Efficient representations and solutions for large decision problems with continuous and discrete variables are among the most important challenges faced by the designers of automated decision support systems. In this paper, we describe a novel hybrid factored Markov decision process (MDP) model that allows for a compact representation of these problems, and a new hybrid approximate linear programming (HALP) framework that permits their efficient solutions. The central idea of HALP is to approximate the optimal value function by a linear combination of basis functions and optimize its weights b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.0028","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:11:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lZKtIntIZY3p68uxCl8hsYjCuDfaV1PUBDBPpsCAZWjPUefQroFp8Nh3hiavRgtrrIkp3L4Y7xUkiQtGMOyTBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T11:31:41.883616Z"},"content_sha256":"f976d56c2b7a3c24017437ddb411ca066ac77b94f5f57be20a4d2bc7519d7b35","schema_version":"1.0","event_id":"sha256:f976d56c2b7a3c24017437ddb411ca066ac77b94f5f57be20a4d2bc7519d7b35"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C22OKG2G6GCNB2MHFLJBJJ3HGB/bundle.json","state_url":"https://pith.science/pith/C22OKG2G6GCNB2MHFLJBJJ3HGB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C22OKG2G6GCNB2MHFLJBJJ3HGB/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-09T11:31:41Z","links":{"resolver":"https://pith.science/pith/C22OKG2G6GCNB2MHFLJBJJ3HGB","bundle":"https://pith.science/pith/C22OKG2G6GCNB2MHFLJBJJ3HGB/bundle.json","state":"https://pith.science/pith/C22OKG2G6GCNB2MHFLJBJJ3HGB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C22OKG2G6GCNB2MHFLJBJJ3HGB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:C22OKG2G6GCNB2MHFLJBJJ3HGB","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":"f2ab8ca4115770e7ca43ce2cd8ef04875137f3302d9d24f04ef7a8508394beb4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-09-30T20:57:35Z","title_canon_sha256":"c648cfa7d2bc9b379d34e6ae816748b1ec7e474072703a986e36376177be01e4"},"schema_version":"1.0","source":{"id":"1110.0028","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.0028","created_at":"2026-05-18T04:11:50Z"},{"alias_kind":"arxiv_version","alias_value":"1110.0028v1","created_at":"2026-05-18T04:11:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.0028","created_at":"2026-05-18T04:11:50Z"},{"alias_kind":"pith_short_12","alias_value":"C22OKG2G6GCN","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"C22OKG2G6GCNB2MH","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"C22OKG2G","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:f976d56c2b7a3c24017437ddb411ca066ac77b94f5f57be20a4d2bc7519d7b35","target":"graph","created_at":"2026-05-18T04:11:50Z","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":"Efficient representations and solutions for large decision problems with continuous and discrete variables are among the most important challenges faced by the designers of automated decision support systems. In this paper, we describe a novel hybrid factored Markov decision process (MDP) model that allows for a compact representation of these problems, and a new hybrid approximate linear programming (HALP) framework that permits their efficient solutions. The central idea of HALP is to approximate the optimal value function by a linear combination of basis functions and optimize its weights b","authors_text":"B. Kveton, C. Guestrin, M. Hauskrecht","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-09-30T20:57:35Z","title":"Solving Factored MDPs with Hybrid State and Action Variables"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.0028","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:c9cbfa395510d706e07552288bf78bb401a9a49615183c1bf91482d105cda355","target":"record","created_at":"2026-05-18T04:11:50Z","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":"f2ab8ca4115770e7ca43ce2cd8ef04875137f3302d9d24f04ef7a8508394beb4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-09-30T20:57:35Z","title_canon_sha256":"c648cfa7d2bc9b379d34e6ae816748b1ec7e474072703a986e36376177be01e4"},"schema_version":"1.0","source":{"id":"1110.0028","kind":"arxiv","version":1}},"canonical_sha256":"16b4e51b46f184d0e9872ad214a76730470fe23752db6a78ffc5810396d7859c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"16b4e51b46f184d0e9872ad214a76730470fe23752db6a78ffc5810396d7859c","first_computed_at":"2026-05-18T04:11:50.929712Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:11:50.929712Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T3VfG3CP1Y742hWJgzsrkAsFQVYydsm30Ogdk5KI8vPIDaVTbw6C2vbv3UOzdVvnVyaf9xxmtANuFllEYvviCg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:11:50.930252Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.0028","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c9cbfa395510d706e07552288bf78bb401a9a49615183c1bf91482d105cda355","sha256:f976d56c2b7a3c24017437ddb411ca066ac77b94f5f57be20a4d2bc7519d7b35"],"state_sha256":"dadcbc11bb2b44b7328a4fcaf77b7f1185dd05b61ab3d3bbc620e1060db2be1d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0KKtOb/5hba95H5+f8Q8rus013MaLzr2uK2HcJMDJbmMTXYhfwmzh8FLrY7Rj+uoLQiBO/6TFwdEVN/5uRPLCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T11:31:41.887858Z","bundle_sha256":"2efe96e0fe6828c62ab67e6139b61b0136f9303019ffbdfafa51fd8e2d47ada8"}}