{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:WTSN7RKOQLWTKRUNA2AOX7HATO","short_pith_number":"pith:WTSN7RKO","canonical_record":{"source":{"id":"1206.6842","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-27T16:20:30Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"1e4de52909363d4c7b5c1398f1c6964954a9e467b87a23528922f4cbfa7546b3","abstract_canon_sha256":"73bc9043eef862e61a22a46cbb1d7b3e07b7eaa2e826a5c335dae4961790631c"},"schema_version":"1.0"},"canonical_sha256":"b4e4dfc54e82ed35468d0680ebfce09ba8b9aa6486f84f830ec1e7de3df2b1e4","source":{"kind":"arxiv","id":"1206.6842","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.6842","created_at":"2026-05-18T03:52:15Z"},{"alias_kind":"arxiv_version","alias_value":"1206.6842v1","created_at":"2026-05-18T03:52:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.6842","created_at":"2026-05-18T03:52:15Z"},{"alias_kind":"pith_short_12","alias_value":"WTSN7RKOQLWT","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"WTSN7RKOQLWTKRUN","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"WTSN7RKO","created_at":"2026-05-18T12:27:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:WTSN7RKOQLWTKRUNA2AOX7HATO","target":"record","payload":{"canonical_record":{"source":{"id":"1206.6842","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-27T16:20:30Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"1e4de52909363d4c7b5c1398f1c6964954a9e467b87a23528922f4cbfa7546b3","abstract_canon_sha256":"73bc9043eef862e61a22a46cbb1d7b3e07b7eaa2e826a5c335dae4961790631c"},"schema_version":"1.0"},"canonical_sha256":"b4e4dfc54e82ed35468d0680ebfce09ba8b9aa6486f84f830ec1e7de3df2b1e4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:52:15.646943Z","signature_b64":"tRwY/hu08uARocCuUElpNT8D2r7N0Z/hqKK6vSOIIs05FRr4n+JSX8tN2+LyRRId2fG+90faldHPwwgy5+jdDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4e4dfc54e82ed35468d0680ebfce09ba8b9aa6486f84f830ec1e7de3df2b1e4","last_reissued_at":"2026-05-18T03:52:15.646304Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:52:15.646304Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.6842","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:52:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w+j/6jsu7TVTDm55OPs94iGTLCgakVIXekGOEMF5GsDLli/0yJSzGbUE1TF/FgPqSUXE8ejhYVeQcBK/jV4DBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T05:23:51.665987Z"},"content_sha256":"0bc684c3c235ab186e8e5038c58adbeb39ebc9f5a0d873427827a602412c05a3","schema_version":"1.0","event_id":"sha256:0bc684c3c235ab186e8e5038c58adbeb39ebc9f5a0d873427827a602412c05a3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:WTSN7RKOQLWTKRUNA2AOX7HATO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Chi-square Tests Driven Method for Learning the Structure of Factored MDPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Olivier Sigaud, Pierre-Henri Wuillemin, Thomas Degris","submitted_at":"2012-06-27T16:20:30Z","abstract_excerpt":"SDYNA is a general framework designed to address large stochastic reinforcement learning problems. Unlike previous model based methods in FMDPs, it incrementally learns the structure and the parameters of a RL problem using supervised learning techniques. Then, it integrates decision-theoric planning algorithms based on FMDPs to compute its policy. SPITI is an instanciation of SDYNA that exploits ITI, an incremental decision tree algorithm, to learn the reward function and the Dynamic Bayesian Networks with local structures representing the transition function of the problem. These representat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.6842","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:52:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N5k+b6e7TgLUe8VJ6mXlidxu4Q3RpeBLizyhclzuR0rWinHBXvXfylFBHFMQGx8FXbtQGCAAzN4kLjAb8aIWDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T05:23:51.666641Z"},"content_sha256":"620958c7620b73e382f126a1d6dae2881d8d01aa935973c295394de77d3f37e0","schema_version":"1.0","event_id":"sha256:620958c7620b73e382f126a1d6dae2881d8d01aa935973c295394de77d3f37e0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WTSN7RKOQLWTKRUNA2AOX7HATO/bundle.json","state_url":"https://pith.science/pith/WTSN7RKOQLWTKRUNA2AOX7HATO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WTSN7RKOQLWTKRUNA2AOX7HATO/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-12T05:23:51Z","links":{"resolver":"https://pith.science/pith/WTSN7RKOQLWTKRUNA2AOX7HATO","bundle":"https://pith.science/pith/WTSN7RKOQLWTKRUNA2AOX7HATO/bundle.json","state":"https://pith.science/pith/WTSN7RKOQLWTKRUNA2AOX7HATO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WTSN7RKOQLWTKRUNA2AOX7HATO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:WTSN7RKOQLWTKRUNA2AOX7HATO","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":"73bc9043eef862e61a22a46cbb1d7b3e07b7eaa2e826a5c335dae4961790631c","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-27T16:20:30Z","title_canon_sha256":"1e4de52909363d4c7b5c1398f1c6964954a9e467b87a23528922f4cbfa7546b3"},"schema_version":"1.0","source":{"id":"1206.6842","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.6842","created_at":"2026-05-18T03:52:15Z"},{"alias_kind":"arxiv_version","alias_value":"1206.6842v1","created_at":"2026-05-18T03:52:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.6842","created_at":"2026-05-18T03:52:15Z"},{"alias_kind":"pith_short_12","alias_value":"WTSN7RKOQLWT","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"WTSN7RKOQLWTKRUN","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"WTSN7RKO","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:620958c7620b73e382f126a1d6dae2881d8d01aa935973c295394de77d3f37e0","target":"graph","created_at":"2026-05-18T03:52: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":"SDYNA is a general framework designed to address large stochastic reinforcement learning problems. Unlike previous model based methods in FMDPs, it incrementally learns the structure and the parameters of a RL problem using supervised learning techniques. Then, it integrates decision-theoric planning algorithms based on FMDPs to compute its policy. SPITI is an instanciation of SDYNA that exploits ITI, an incremental decision tree algorithm, to learn the reward function and the Dynamic Bayesian Networks with local structures representing the transition function of the problem. These representat","authors_text":"Olivier Sigaud, Pierre-Henri Wuillemin, Thomas Degris","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-27T16:20:30Z","title":"Chi-square Tests Driven Method for Learning the Structure of Factored MDPs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.6842","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:0bc684c3c235ab186e8e5038c58adbeb39ebc9f5a0d873427827a602412c05a3","target":"record","created_at":"2026-05-18T03:52: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":"73bc9043eef862e61a22a46cbb1d7b3e07b7eaa2e826a5c335dae4961790631c","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-27T16:20:30Z","title_canon_sha256":"1e4de52909363d4c7b5c1398f1c6964954a9e467b87a23528922f4cbfa7546b3"},"schema_version":"1.0","source":{"id":"1206.6842","kind":"arxiv","version":1}},"canonical_sha256":"b4e4dfc54e82ed35468d0680ebfce09ba8b9aa6486f84f830ec1e7de3df2b1e4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b4e4dfc54e82ed35468d0680ebfce09ba8b9aa6486f84f830ec1e7de3df2b1e4","first_computed_at":"2026-05-18T03:52:15.646304Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:52:15.646304Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tRwY/hu08uARocCuUElpNT8D2r7N0Z/hqKK6vSOIIs05FRr4n+JSX8tN2+LyRRId2fG+90faldHPwwgy5+jdDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:52:15.646943Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.6842","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0bc684c3c235ab186e8e5038c58adbeb39ebc9f5a0d873427827a602412c05a3","sha256:620958c7620b73e382f126a1d6dae2881d8d01aa935973c295394de77d3f37e0"],"state_sha256":"b55947d569afb6ae3396012f2c805af573c9e9e4671bce43a090738c93c1a45e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+7r7JqTvBtN3OC95uzsD6myOWgJFzzgr2l7QcD87N0RWWu77nN9HrzQH4jGV+w6J9Hr+UWweScmPLbSAagyMBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T05:23:51.670676Z","bundle_sha256":"9dde6bef88802ff90436af919d3320c9a51d9dd815e92b384871d1245b5834d7"}}