{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:AZVBFHFU6BE5FSF7APCRDLX35Q","short_pith_number":"pith:AZVBFHFU","canonical_record":{"source":{"id":"1709.03480","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-09-11T17:17:51Z","cross_cats_sorted":[],"title_canon_sha256":"0ecc7ad98fb3b98648e0c6dc7cad85f0dd728bde05483011c71288ec8b7b0bae","abstract_canon_sha256":"db4f893e2f47917b6ff60d953dd104af5c866e71073ac8e58b2272a86be7c6f0"},"schema_version":"1.0"},"canonical_sha256":"066a129cb4f049d2c8bf03c511aefbec0a056b62f288be1d41fa65626bb31034","source":{"kind":"arxiv","id":"1709.03480","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.03480","created_at":"2026-05-18T00:35:36Z"},{"alias_kind":"arxiv_version","alias_value":"1709.03480v1","created_at":"2026-05-18T00:35:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.03480","created_at":"2026-05-18T00:35:36Z"},{"alias_kind":"pith_short_12","alias_value":"AZVBFHFU6BE5","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"AZVBFHFU6BE5FSF7","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"AZVBFHFU","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:AZVBFHFU6BE5FSF7APCRDLX35Q","target":"record","payload":{"canonical_record":{"source":{"id":"1709.03480","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-09-11T17:17:51Z","cross_cats_sorted":[],"title_canon_sha256":"0ecc7ad98fb3b98648e0c6dc7cad85f0dd728bde05483011c71288ec8b7b0bae","abstract_canon_sha256":"db4f893e2f47917b6ff60d953dd104af5c866e71073ac8e58b2272a86be7c6f0"},"schema_version":"1.0"},"canonical_sha256":"066a129cb4f049d2c8bf03c511aefbec0a056b62f288be1d41fa65626bb31034","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:36.614196Z","signature_b64":"pASuj6MQWIMNr/cP5GwtAR5X+lmlrEqCtu7sDzbmdZngtVDpUkx58vogcHMLjxgDPVIvNdi36aFtG83gBE7vBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"066a129cb4f049d2c8bf03c511aefbec0a056b62f288be1d41fa65626bb31034","last_reissued_at":"2026-05-18T00:35:36.613569Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:36.613569Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.03480","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-18T00:35:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FX2b9XIkHVEchCK15WM5MGpfONG8J5e4PHJ4GXkfAN0DWaX+WDtMY2oc4y+HBmgnvk9plpdTtOLhWLv0Q/nXBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:24:42.886690Z"},"content_sha256":"3fcf3384acc78922d460d85ae24c575c7a5bef56d6fe191f1a92274b7550bd0b","schema_version":"1.0","event_id":"sha256:3fcf3384acc78922d460d85ae24c575c7a5bef56d6fe191f1a92274b7550bd0b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:AZVBFHFU6BE5FSF7APCRDLX35Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Combining Strategic Learning and Tactical Search in Real-Time Strategy Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Marius Stanescu, Michael Buro, Nicolas A. Barriga","submitted_at":"2017-09-11T17:17:51Z","abstract_excerpt":"A commonly used technique for managing AI complexity in real-time strategy (RTS) games is to use action and/or state abstractions. High-level abstractions can often lead to good strategic decision making, but tactical decision quality may suffer due to lost details. A competing method is to sample the search space which often leads to good tactical performance in simple scenarios, but poor high-level planning.\n  We propose to use a deep convolutional neural network (CNN) to select among a limited set of abstract action choices, and to utilize the remaining computation time for game tree search"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.03480","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-18T00:35:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RcYKgw9/bKSXsQefEJnsNb9FcQ87bjwPWT556/L2XyTm3OoEfa5JA/vTQ2UGop9S5PF8jQL7CoQ51tjHIeDgBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:24:42.887252Z"},"content_sha256":"0a852b217aee6dead76ded4c7704f8963d384fc7e911ddfad98560533794dd69","schema_version":"1.0","event_id":"sha256:0a852b217aee6dead76ded4c7704f8963d384fc7e911ddfad98560533794dd69"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AZVBFHFU6BE5FSF7APCRDLX35Q/bundle.json","state_url":"https://pith.science/pith/AZVBFHFU6BE5FSF7APCRDLX35Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AZVBFHFU6BE5FSF7APCRDLX35Q/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-25T20:24:42Z","links":{"resolver":"https://pith.science/pith/AZVBFHFU6BE5FSF7APCRDLX35Q","bundle":"https://pith.science/pith/AZVBFHFU6BE5FSF7APCRDLX35Q/bundle.json","state":"https://pith.science/pith/AZVBFHFU6BE5FSF7APCRDLX35Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AZVBFHFU6BE5FSF7APCRDLX35Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:AZVBFHFU6BE5FSF7APCRDLX35Q","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":"db4f893e2f47917b6ff60d953dd104af5c866e71073ac8e58b2272a86be7c6f0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-09-11T17:17:51Z","title_canon_sha256":"0ecc7ad98fb3b98648e0c6dc7cad85f0dd728bde05483011c71288ec8b7b0bae"},"schema_version":"1.0","source":{"id":"1709.03480","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.03480","created_at":"2026-05-18T00:35:36Z"},{"alias_kind":"arxiv_version","alias_value":"1709.03480v1","created_at":"2026-05-18T00:35:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.03480","created_at":"2026-05-18T00:35:36Z"},{"alias_kind":"pith_short_12","alias_value":"AZVBFHFU6BE5","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"AZVBFHFU6BE5FSF7","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"AZVBFHFU","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:0a852b217aee6dead76ded4c7704f8963d384fc7e911ddfad98560533794dd69","target":"graph","created_at":"2026-05-18T00:35:36Z","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":"A commonly used technique for managing AI complexity in real-time strategy (RTS) games is to use action and/or state abstractions. High-level abstractions can often lead to good strategic decision making, but tactical decision quality may suffer due to lost details. A competing method is to sample the search space which often leads to good tactical performance in simple scenarios, but poor high-level planning.\n  We propose to use a deep convolutional neural network (CNN) to select among a limited set of abstract action choices, and to utilize the remaining computation time for game tree search","authors_text":"Marius Stanescu, Michael Buro, Nicolas A. Barriga","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-09-11T17:17:51Z","title":"Combining Strategic Learning and Tactical Search in Real-Time Strategy Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.03480","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:3fcf3384acc78922d460d85ae24c575c7a5bef56d6fe191f1a92274b7550bd0b","target":"record","created_at":"2026-05-18T00:35:36Z","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":"db4f893e2f47917b6ff60d953dd104af5c866e71073ac8e58b2272a86be7c6f0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-09-11T17:17:51Z","title_canon_sha256":"0ecc7ad98fb3b98648e0c6dc7cad85f0dd728bde05483011c71288ec8b7b0bae"},"schema_version":"1.0","source":{"id":"1709.03480","kind":"arxiv","version":1}},"canonical_sha256":"066a129cb4f049d2c8bf03c511aefbec0a056b62f288be1d41fa65626bb31034","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"066a129cb4f049d2c8bf03c511aefbec0a056b62f288be1d41fa65626bb31034","first_computed_at":"2026-05-18T00:35:36.613569Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:36.613569Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pASuj6MQWIMNr/cP5GwtAR5X+lmlrEqCtu7sDzbmdZngtVDpUkx58vogcHMLjxgDPVIvNdi36aFtG83gBE7vBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:36.614196Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.03480","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3fcf3384acc78922d460d85ae24c575c7a5bef56d6fe191f1a92274b7550bd0b","sha256:0a852b217aee6dead76ded4c7704f8963d384fc7e911ddfad98560533794dd69"],"state_sha256":"59e8c4c382eb75d4a745a0c891da7ddb5e4606c3046edaf5798778a235a2f227"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K8QHUhEKQq8GaPqjoVCH/e6RumCC5S7ufj9voKaa/j+JloCgws2ipK+W9jNhHtIRRKhuCPgP468p+aF/973NAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T20:24:42.890234Z","bundle_sha256":"ed545b845736dac5930a6ddb281caa5356adc2b01a7fd4eb819c9f9fa3545ac6"}}