{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:WVZ63MYJLH7GQCPCUKJKPYT4VU","short_pith_number":"pith:WVZ63MYJ","canonical_record":{"source":{"id":"1902.05284","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-02-14T09:56:00Z","cross_cats_sorted":[],"title_canon_sha256":"e8c8aac849ad58c4ba279f8f7346d5a6267668bac0bc88bf15eecff1d66f65e3","abstract_canon_sha256":"f123c30ab0155645ddeedc0743fe6932de9eaf3a963d7a8dbf51c92a5357b17e"},"schema_version":"1.0"},"canonical_sha256":"b573edb30959fe6809e2a292a7e27cad09d4866d97617a308f933526b54262e1","source":{"kind":"arxiv","id":"1902.05284","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.05284","created_at":"2026-05-17T23:52:58Z"},{"alias_kind":"arxiv_version","alias_value":"1902.05284v2","created_at":"2026-05-17T23:52:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.05284","created_at":"2026-05-17T23:52:58Z"},{"alias_kind":"pith_short_12","alias_value":"WVZ63MYJLH7G","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"WVZ63MYJLH7GQCPC","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"WVZ63MYJ","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:WVZ63MYJLH7GQCPCUKJKPYT4VU","target":"record","payload":{"canonical_record":{"source":{"id":"1902.05284","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-02-14T09:56:00Z","cross_cats_sorted":[],"title_canon_sha256":"e8c8aac849ad58c4ba279f8f7346d5a6267668bac0bc88bf15eecff1d66f65e3","abstract_canon_sha256":"f123c30ab0155645ddeedc0743fe6932de9eaf3a963d7a8dbf51c92a5357b17e"},"schema_version":"1.0"},"canonical_sha256":"b573edb30959fe6809e2a292a7e27cad09d4866d97617a308f933526b54262e1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:58.170231Z","signature_b64":"JNkl9kJmXgnuS6qb+f4ZUoybvDKX+rcHMZHGAhcNQlOlqCPglbVtHBIUvwWG2VdpkTfI9NDuLKo+QEFjlQt0BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b573edb30959fe6809e2a292a7e27cad09d4866d97617a308f933526b54262e1","last_reissued_at":"2026-05-17T23:52:58.169536Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:58.169536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.05284","source_version":2,"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:52:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/YNAQnFR63snf933lxk8skfgjSyx3bhYCgqmVGZn/D5azdHKTM1pMmHIa7dY6mf6EMrlhJSpKcmrQg2pS1ZjBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T21:06:07.580846Z"},"content_sha256":"c1b198daf2622f2924f671a1a00e6434155ab75d352954213f51b632de761e7c","schema_version":"1.0","event_id":"sha256:c1b198daf2622f2924f671a1a00e6434155ab75d352954213f51b632de761e7c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:WVZ63MYJLH7GQCPCUKJKPYT4VU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learn a Prior for RHEA for Better Online Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Bin Li, Weiming Liu, Xin Tong","submitted_at":"2019-02-14T09:56:00Z","abstract_excerpt":"Rolling Horizon Evolutionary Algorithms (RHEA) are a class of online planning methods for real-time game playing; their performance is closely related to the planning horizon and the search time allowed. In this paper, we propose to learn a prior for RHEA in an offline manner by training a value network and a policy network. The value network is used to reduce the planning horizon by providing an estimation of future rewards, and the policy network is used to initialize the population, which helps to narrow down the search scope. The proposed algorithm, named prior-based RHEA (p-RHEA), trains "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.05284","kind":"arxiv","version":2},"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:52:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L/q3wDPJzn1W4vlv9yRaRj5nJD7lc8ZwLCmYKRVZQBjTySoXOh7GrBWvhftNopEE9wZ1qin7m9SzIQuBodYpAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T21:06:07.581194Z"},"content_sha256":"52086126686891684b7117731208ccf641d1d8bc2dc5dc06b250dd9fb452f6fb","schema_version":"1.0","event_id":"sha256:52086126686891684b7117731208ccf641d1d8bc2dc5dc06b250dd9fb452f6fb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WVZ63MYJLH7GQCPCUKJKPYT4VU/bundle.json","state_url":"https://pith.science/pith/WVZ63MYJLH7GQCPCUKJKPYT4VU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WVZ63MYJLH7GQCPCUKJKPYT4VU/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-03T21:06:07Z","links":{"resolver":"https://pith.science/pith/WVZ63MYJLH7GQCPCUKJKPYT4VU","bundle":"https://pith.science/pith/WVZ63MYJLH7GQCPCUKJKPYT4VU/bundle.json","state":"https://pith.science/pith/WVZ63MYJLH7GQCPCUKJKPYT4VU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WVZ63MYJLH7GQCPCUKJKPYT4VU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:WVZ63MYJLH7GQCPCUKJKPYT4VU","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":"f123c30ab0155645ddeedc0743fe6932de9eaf3a963d7a8dbf51c92a5357b17e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-02-14T09:56:00Z","title_canon_sha256":"e8c8aac849ad58c4ba279f8f7346d5a6267668bac0bc88bf15eecff1d66f65e3"},"schema_version":"1.0","source":{"id":"1902.05284","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.05284","created_at":"2026-05-17T23:52:58Z"},{"alias_kind":"arxiv_version","alias_value":"1902.05284v2","created_at":"2026-05-17T23:52:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.05284","created_at":"2026-05-17T23:52:58Z"},{"alias_kind":"pith_short_12","alias_value":"WVZ63MYJLH7G","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"WVZ63MYJLH7GQCPC","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"WVZ63MYJ","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:52086126686891684b7117731208ccf641d1d8bc2dc5dc06b250dd9fb452f6fb","target":"graph","created_at":"2026-05-17T23:52:58Z","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":"Rolling Horizon Evolutionary Algorithms (RHEA) are a class of online planning methods for real-time game playing; their performance is closely related to the planning horizon and the search time allowed. In this paper, we propose to learn a prior for RHEA in an offline manner by training a value network and a policy network. The value network is used to reduce the planning horizon by providing an estimation of future rewards, and the policy network is used to initialize the population, which helps to narrow down the search scope. The proposed algorithm, named prior-based RHEA (p-RHEA), trains ","authors_text":"Bin Li, Weiming Liu, Xin Tong","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-02-14T09:56:00Z","title":"Learn a Prior for RHEA for Better Online Planning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.05284","kind":"arxiv","version":2},"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:c1b198daf2622f2924f671a1a00e6434155ab75d352954213f51b632de761e7c","target":"record","created_at":"2026-05-17T23:52:58Z","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":"f123c30ab0155645ddeedc0743fe6932de9eaf3a963d7a8dbf51c92a5357b17e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-02-14T09:56:00Z","title_canon_sha256":"e8c8aac849ad58c4ba279f8f7346d5a6267668bac0bc88bf15eecff1d66f65e3"},"schema_version":"1.0","source":{"id":"1902.05284","kind":"arxiv","version":2}},"canonical_sha256":"b573edb30959fe6809e2a292a7e27cad09d4866d97617a308f933526b54262e1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b573edb30959fe6809e2a292a7e27cad09d4866d97617a308f933526b54262e1","first_computed_at":"2026-05-17T23:52:58.169536Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:58.169536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JNkl9kJmXgnuS6qb+f4ZUoybvDKX+rcHMZHGAhcNQlOlqCPglbVtHBIUvwWG2VdpkTfI9NDuLKo+QEFjlQt0BQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:58.170231Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.05284","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c1b198daf2622f2924f671a1a00e6434155ab75d352954213f51b632de761e7c","sha256:52086126686891684b7117731208ccf641d1d8bc2dc5dc06b250dd9fb452f6fb"],"state_sha256":"a612a7646e8dc15e3db11da8c7a904e85777c9237f526d4f130c5b43360dc9d6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/QdnxZfSncXgW43waammcst974qcBs/GwwHwa5ScCPQ5owemCdWpB8ee8EINqTEoiVTcc+ruxGmIsEBFUbHYAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T21:06:07.583137Z","bundle_sha256":"cd30c7ed270d4515de5e5a309cb33604a56b462a7e63f9e05c45552e267901ce"}}