{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:V2YAACMXPGFIJX7YAXUKPWE3JS","short_pith_number":"pith:V2YAACMX","canonical_record":{"source":{"id":"1904.03008","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-04-05T11:57:41Z","cross_cats_sorted":[],"title_canon_sha256":"69c7e8c1e10c8bd7e589fb54b604b989ee58d77a8537f2c9f56370355bd99f90","abstract_canon_sha256":"df162a43b6ec0a3befeb26cba1a5265bd1a63a5e65e87d387c1cd26a6c8e43c8"},"schema_version":"1.0"},"canonical_sha256":"aeb0000997798a84dff805e8a7d89b4ca18feac2224bba851d40cccbe0c85b47","source":{"kind":"arxiv","id":"1904.03008","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.03008","created_at":"2026-05-17T23:49:18Z"},{"alias_kind":"arxiv_version","alias_value":"1904.03008v1","created_at":"2026-05-17T23:49:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.03008","created_at":"2026-05-17T23:49:18Z"},{"alias_kind":"pith_short_12","alias_value":"V2YAACMXPGFI","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"V2YAACMXPGFIJX7Y","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"V2YAACMX","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:V2YAACMXPGFIJX7YAXUKPWE3JS","target":"record","payload":{"canonical_record":{"source":{"id":"1904.03008","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-04-05T11:57:41Z","cross_cats_sorted":[],"title_canon_sha256":"69c7e8c1e10c8bd7e589fb54b604b989ee58d77a8537f2c9f56370355bd99f90","abstract_canon_sha256":"df162a43b6ec0a3befeb26cba1a5265bd1a63a5e65e87d387c1cd26a6c8e43c8"},"schema_version":"1.0"},"canonical_sha256":"aeb0000997798a84dff805e8a7d89b4ca18feac2224bba851d40cccbe0c85b47","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:18.909003Z","signature_b64":"c48+8PPHt9sJTvsdnJGScSJ7PNEapnLlGnKG6ZjokL4HtR1EEc7ckPV4iZxwd9tReo/YxP6d2Mz4Z8AYFGzNDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aeb0000997798a84dff805e8a7d89b4ca18feac2224bba851d40cccbe0c85b47","last_reissued_at":"2026-05-17T23:49:18.908375Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:18.908375Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.03008","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-17T23:49:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wAmiDkkW41Ti8R+oitp56eib8M6cvLt/3VqC2GuHFI0U11Qo+X5EtzlAjNMHnxjLIFtszo73ZwpmHmdEd978AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:58:21.104082Z"},"content_sha256":"345930cf5a1d1f0035d60b9122189fe437060b4fde6dff5b15b6f6fdda3e159e","schema_version":"1.0","event_id":"sha256:345930cf5a1d1f0035d60b9122189fe437060b4fde6dff5b15b6f6fdda3e159e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:V2YAACMXPGFIJX7YAXUKPWE3JS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Combining Offline Models and Online Monte-Carlo Tree Search for Planning from Scratch","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Jianyang Zheng, Yunlong Liu","submitted_at":"2019-04-05T11:57:41Z","abstract_excerpt":"Planning in stochastic and partially observable environments is a central issue in artificial intelligence. One commonly used technique for solving such a problem is by constructing an accurate model firstly. Although some recent approaches have been proposed for learning optimal behaviour under model uncertainty, prior knowledge about the environment is still needed to guarantee the performance of the proposed algorithms. With the benefits of the Predictive State Representations~(PSRs) approach for state representation and model prediction, in this paper, we introduce an approach for planning"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.03008","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-17T23:49:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BEy2CJrEVLb24WVN09MHklYxCyFFq86TbuiP7UUk6mEtsis1kjwvHEdC5fStKZZ2if9cor2jxsMa1eAEKgaGCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:58:21.104455Z"},"content_sha256":"05699585bc6f6e0652c9af4ca95a6b9e5637bc585e9dc372404cd7a26dd9d601","schema_version":"1.0","event_id":"sha256:05699585bc6f6e0652c9af4ca95a6b9e5637bc585e9dc372404cd7a26dd9d601"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V2YAACMXPGFIJX7YAXUKPWE3JS/bundle.json","state_url":"https://pith.science/pith/V2YAACMXPGFIJX7YAXUKPWE3JS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V2YAACMXPGFIJX7YAXUKPWE3JS/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-05-28T03:58:21Z","links":{"resolver":"https://pith.science/pith/V2YAACMXPGFIJX7YAXUKPWE3JS","bundle":"https://pith.science/pith/V2YAACMXPGFIJX7YAXUKPWE3JS/bundle.json","state":"https://pith.science/pith/V2YAACMXPGFIJX7YAXUKPWE3JS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V2YAACMXPGFIJX7YAXUKPWE3JS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:V2YAACMXPGFIJX7YAXUKPWE3JS","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":"df162a43b6ec0a3befeb26cba1a5265bd1a63a5e65e87d387c1cd26a6c8e43c8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-04-05T11:57:41Z","title_canon_sha256":"69c7e8c1e10c8bd7e589fb54b604b989ee58d77a8537f2c9f56370355bd99f90"},"schema_version":"1.0","source":{"id":"1904.03008","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.03008","created_at":"2026-05-17T23:49:18Z"},{"alias_kind":"arxiv_version","alias_value":"1904.03008v1","created_at":"2026-05-17T23:49:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.03008","created_at":"2026-05-17T23:49:18Z"},{"alias_kind":"pith_short_12","alias_value":"V2YAACMXPGFI","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"V2YAACMXPGFIJX7Y","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"V2YAACMX","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:05699585bc6f6e0652c9af4ca95a6b9e5637bc585e9dc372404cd7a26dd9d601","target":"graph","created_at":"2026-05-17T23:49:18Z","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":"Planning in stochastic and partially observable environments is a central issue in artificial intelligence. One commonly used technique for solving such a problem is by constructing an accurate model firstly. Although some recent approaches have been proposed for learning optimal behaviour under model uncertainty, prior knowledge about the environment is still needed to guarantee the performance of the proposed algorithms. With the benefits of the Predictive State Representations~(PSRs) approach for state representation and model prediction, in this paper, we introduce an approach for planning","authors_text":"Jianyang Zheng, Yunlong Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-04-05T11:57:41Z","title":"Combining Offline Models and Online Monte-Carlo Tree Search for Planning from Scratch"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.03008","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:345930cf5a1d1f0035d60b9122189fe437060b4fde6dff5b15b6f6fdda3e159e","target":"record","created_at":"2026-05-17T23:49:18Z","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":"df162a43b6ec0a3befeb26cba1a5265bd1a63a5e65e87d387c1cd26a6c8e43c8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-04-05T11:57:41Z","title_canon_sha256":"69c7e8c1e10c8bd7e589fb54b604b989ee58d77a8537f2c9f56370355bd99f90"},"schema_version":"1.0","source":{"id":"1904.03008","kind":"arxiv","version":1}},"canonical_sha256":"aeb0000997798a84dff805e8a7d89b4ca18feac2224bba851d40cccbe0c85b47","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aeb0000997798a84dff805e8a7d89b4ca18feac2224bba851d40cccbe0c85b47","first_computed_at":"2026-05-17T23:49:18.908375Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:18.908375Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c48+8PPHt9sJTvsdnJGScSJ7PNEapnLlGnKG6ZjokL4HtR1EEc7ckPV4iZxwd9tReo/YxP6d2Mz4Z8AYFGzNDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:18.909003Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.03008","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:345930cf5a1d1f0035d60b9122189fe437060b4fde6dff5b15b6f6fdda3e159e","sha256:05699585bc6f6e0652c9af4ca95a6b9e5637bc585e9dc372404cd7a26dd9d601"],"state_sha256":"f4f9cf9b219dac858fede4e65f26a0dbb723b83b1ff81d12eee6d67ccaa85d8d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zAoofRwLnisgRchTO5RJtSbxrtmBRQWNefdV076TERfyyM0UPA5CmVLnPbyEr8Mdec0xpM5TZChvhMsqhsD5Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T03:58:21.106430Z","bundle_sha256":"376d21d61ecefe97853e1883d1d6f7845fd5cd268ee5eb4620062fdaf47f6464"}}