{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:D3SZR2CFXNSAPYAASXCY7OOYIL","short_pith_number":"pith:D3SZR2CF","canonical_record":{"source":{"id":"1607.01730","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-07-06T18:03:18Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"bb146b201b7abe6a57f71a95a93451fb65119d2ee50f7dbd8407d7e804937eef","abstract_canon_sha256":"58fd5782da6e2174f1d3663f8c3bd80c7207dec81e98e58a838c10b0bcee9cd6"},"schema_version":"1.0"},"canonical_sha256":"1ee598e845bb6407e00095c58fb9d842cccb4a9182921e35cdd925e676dc3b95","source":{"kind":"arxiv","id":"1607.01730","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.01730","created_at":"2026-05-18T01:11:25Z"},{"alias_kind":"arxiv_version","alias_value":"1607.01730v1","created_at":"2026-05-18T01:11:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.01730","created_at":"2026-05-18T01:11:25Z"},{"alias_kind":"pith_short_12","alias_value":"D3SZR2CFXNSA","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"D3SZR2CFXNSAPYAA","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"D3SZR2CF","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:D3SZR2CFXNSAPYAASXCY7OOYIL","target":"record","payload":{"canonical_record":{"source":{"id":"1607.01730","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-07-06T18:03:18Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"bb146b201b7abe6a57f71a95a93451fb65119d2ee50f7dbd8407d7e804937eef","abstract_canon_sha256":"58fd5782da6e2174f1d3663f8c3bd80c7207dec81e98e58a838c10b0bcee9cd6"},"schema_version":"1.0"},"canonical_sha256":"1ee598e845bb6407e00095c58fb9d842cccb4a9182921e35cdd925e676dc3b95","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:25.603834Z","signature_b64":"AMwFojvdiqlsrPUTM/F5xghxqO5jutV2tev7yk1hxFUDTZnYnvu+8ysyLbE4qpYnNtLqpfaKaRSUHj+Lf0gmDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ee598e845bb6407e00095c58fb9d842cccb4a9182921e35cdd925e676dc3b95","last_reissued_at":"2026-05-18T01:11:25.603297Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:25.603297Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.01730","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-18T01:11:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1rAUBqfr46x/XORV41flERII0jva7sYK24vgEDpKKMLDwHe80pVANsCvl+uzB9Cb2ppTyXHO6JS0ETGE+9dTBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:26:56.423988Z"},"content_sha256":"b96575dc504743b3c07e323e16b847b2d0f7db8cdb76963e7c9e5824cd1fd870","schema_version":"1.0","event_id":"sha256:b96575dc504743b3c07e323e16b847b2d0f7db8cdb76963e7c9e5824cd1fd870"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:D3SZR2CFXNSAPYAASXCY7OOYIL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rolling Horizon Coevolutionary Planning for Two-Player Video Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.AI","authors_text":"Diego P\\'erez-Li\\'ebana, Jialin Liu, Simon M. Lucas","submitted_at":"2016-07-06T18:03:18Z","abstract_excerpt":"This paper describes a new algorithm for decision making in two-player real-time video games. As with Monte Carlo Tree Search, the algorithm can be used without heuristics and has been developed for use in general video game AI. The approach is to extend recent work on rolling horizon evolutionary planning, which has been shown to work well for single-player games, to two (or in principle many) player games. To select an action the algorithm co-evolves two (or in the general case N) populations, one for each player, where each individual is a sequence of actions for the respective player. The "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.01730","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-18T01:11:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L/7kF8WZRzeYAUs23MJ82IRZFdYVsAGp1HxhLCa+pRVEGSRImuaAV+/Lz3u1lXwAxxu9yCnBQ3ZnJp/HM8IQAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:26:56.424349Z"},"content_sha256":"71c63a67b1fcfefa7e235b7eaa33993dc15ac1674c64def366d44fd40f936c94","schema_version":"1.0","event_id":"sha256:71c63a67b1fcfefa7e235b7eaa33993dc15ac1674c64def366d44fd40f936c94"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D3SZR2CFXNSAPYAASXCY7OOYIL/bundle.json","state_url":"https://pith.science/pith/D3SZR2CFXNSAPYAASXCY7OOYIL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D3SZR2CFXNSAPYAASXCY7OOYIL/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-03T01:26:56Z","links":{"resolver":"https://pith.science/pith/D3SZR2CFXNSAPYAASXCY7OOYIL","bundle":"https://pith.science/pith/D3SZR2CFXNSAPYAASXCY7OOYIL/bundle.json","state":"https://pith.science/pith/D3SZR2CFXNSAPYAASXCY7OOYIL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D3SZR2CFXNSAPYAASXCY7OOYIL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:D3SZR2CFXNSAPYAASXCY7OOYIL","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":"58fd5782da6e2174f1d3663f8c3bd80c7207dec81e98e58a838c10b0bcee9cd6","cross_cats_sorted":["cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-07-06T18:03:18Z","title_canon_sha256":"bb146b201b7abe6a57f71a95a93451fb65119d2ee50f7dbd8407d7e804937eef"},"schema_version":"1.0","source":{"id":"1607.01730","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.01730","created_at":"2026-05-18T01:11:25Z"},{"alias_kind":"arxiv_version","alias_value":"1607.01730v1","created_at":"2026-05-18T01:11:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.01730","created_at":"2026-05-18T01:11:25Z"},{"alias_kind":"pith_short_12","alias_value":"D3SZR2CFXNSA","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"D3SZR2CFXNSAPYAA","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"D3SZR2CF","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:71c63a67b1fcfefa7e235b7eaa33993dc15ac1674c64def366d44fd40f936c94","target":"graph","created_at":"2026-05-18T01:11:25Z","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 describes a new algorithm for decision making in two-player real-time video games. As with Monte Carlo Tree Search, the algorithm can be used without heuristics and has been developed for use in general video game AI. The approach is to extend recent work on rolling horizon evolutionary planning, which has been shown to work well for single-player games, to two (or in principle many) player games. To select an action the algorithm co-evolves two (or in the general case N) populations, one for each player, where each individual is a sequence of actions for the respective player. The ","authors_text":"Diego P\\'erez-Li\\'ebana, Jialin Liu, Simon M. Lucas","cross_cats":["cs.NE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-07-06T18:03:18Z","title":"Rolling Horizon Coevolutionary Planning for Two-Player Video Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.01730","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:b96575dc504743b3c07e323e16b847b2d0f7db8cdb76963e7c9e5824cd1fd870","target":"record","created_at":"2026-05-18T01:11:25Z","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":"58fd5782da6e2174f1d3663f8c3bd80c7207dec81e98e58a838c10b0bcee9cd6","cross_cats_sorted":["cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-07-06T18:03:18Z","title_canon_sha256":"bb146b201b7abe6a57f71a95a93451fb65119d2ee50f7dbd8407d7e804937eef"},"schema_version":"1.0","source":{"id":"1607.01730","kind":"arxiv","version":1}},"canonical_sha256":"1ee598e845bb6407e00095c58fb9d842cccb4a9182921e35cdd925e676dc3b95","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1ee598e845bb6407e00095c58fb9d842cccb4a9182921e35cdd925e676dc3b95","first_computed_at":"2026-05-18T01:11:25.603297Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:25.603297Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AMwFojvdiqlsrPUTM/F5xghxqO5jutV2tev7yk1hxFUDTZnYnvu+8ysyLbE4qpYnNtLqpfaKaRSUHj+Lf0gmDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:25.603834Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.01730","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b96575dc504743b3c07e323e16b847b2d0f7db8cdb76963e7c9e5824cd1fd870","sha256:71c63a67b1fcfefa7e235b7eaa33993dc15ac1674c64def366d44fd40f936c94"],"state_sha256":"27963a034a1d05ae17571b3d283e6f1771beeb7a5fd4e1f89df1cb2b617b7af1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bd5XpKIpVDAeD8+XUKU9l5V+gt4P6Mxa9qEFoDxDOc4ZnhdOXY4nA2HhZhP53NI0yMvG+WJmv2WvXhVYBXyyDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T01:26:56.426342Z","bundle_sha256":"cb7c37733b59983dbb88f8c779ad1dd640ad3f5367eef95c2f25bc3480a6d5a0"}}