{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:BAV75OW4BILVQWVE65SB6CNLKE","short_pith_number":"pith:BAV75OW4","canonical_record":{"source":{"id":"1711.08101","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-11-22T01:35:29Z","cross_cats_sorted":[],"title_canon_sha256":"0f430fbebfdbf240acd7e5044f72bb72eb8bbc968b3dcc818954bb73c8b295a6","abstract_canon_sha256":"02a3b712f50860f961eef88032506dfa47241b7013455c864b7f3d29de332a01"},"schema_version":"1.0"},"canonical_sha256":"082bfebadc0a17585aa4f7641f09ab5102c0f4f451a62c52e6d3ee9c43693324","source":{"kind":"arxiv","id":"1711.08101","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.08101","created_at":"2026-05-18T00:29:50Z"},{"alias_kind":"arxiv_version","alias_value":"1711.08101v1","created_at":"2026-05-18T00:29:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.08101","created_at":"2026-05-18T00:29:50Z"},{"alias_kind":"pith_short_12","alias_value":"BAV75OW4BILV","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BAV75OW4BILVQWVE","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BAV75OW4","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:BAV75OW4BILVQWVE65SB6CNLKE","target":"record","payload":{"canonical_record":{"source":{"id":"1711.08101","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-11-22T01:35:29Z","cross_cats_sorted":[],"title_canon_sha256":"0f430fbebfdbf240acd7e5044f72bb72eb8bbc968b3dcc818954bb73c8b295a6","abstract_canon_sha256":"02a3b712f50860f961eef88032506dfa47241b7013455c864b7f3d29de332a01"},"schema_version":"1.0"},"canonical_sha256":"082bfebadc0a17585aa4f7641f09ab5102c0f4f451a62c52e6d3ee9c43693324","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:50.677556Z","signature_b64":"koCNBh1m3xnhTg9iRuaTPYfd3MX5vCezy/PaLooCbrV33MbkfuhrA05PSIaKoevLNgZ2qCrIlOpKDxYpZG5UCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"082bfebadc0a17585aa4f7641f09ab5102c0f4f451a62c52e6d3ee9c43693324","last_reissued_at":"2026-05-18T00:29:50.676988Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:50.676988Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.08101","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:29:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qhjDtzDC+3SWYOz31rDASrKC8Q4Yr7a4ydiW4QcFbBSV8cT+Epimd/MrZV2Z4lpKoLVLZ33qN8EqBL17wDdDDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:56:55.146768Z"},"content_sha256":"ff13ea678a9ec0425f1e348145672a4f049b022a266946304a33219b705166e6","schema_version":"1.0","event_id":"sha256:ff13ea678a9ec0425f1e348145672a4f049b022a266946304a33219b705166e6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:BAV75OW4BILVQWVE65SB6CNLKE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asymmetric Action Abstractions for Multi-Unit Control in Adversarial Real-Time Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Levi H. S. Lelis, Rubens O. Moraes","submitted_at":"2017-11-22T01:35:29Z","abstract_excerpt":"Action abstractions restrict the number of legal actions available during search in multi-unit real-time adversarial games, thus allowing algorithms to focus their search on a set of promising actions. Optimal strategies derived from un-abstracted spaces are guaranteed to be no worse than optimal strategies derived from action-abstracted spaces. In practice, however, due to real-time constraints and the state space size, one is only able to derive good strategies in un-abstracted spaces in small-scale games. In this paper we introduce search algorithms that use an action abstraction scheme we "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.08101","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:29:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uV2TSBGMKSEwtz8U5RyawiRKOzs6mu2pSQCtiuql4OUIUF60QcvsZUF3tQu8OFrwayOkGLlguVEThCwPgpp8DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:56:55.147417Z"},"content_sha256":"cecadbf3b05dbee96d3a4c3d99c73b533378d2fcfc132daa934a92731e443817","schema_version":"1.0","event_id":"sha256:cecadbf3b05dbee96d3a4c3d99c73b533378d2fcfc132daa934a92731e443817"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BAV75OW4BILVQWVE65SB6CNLKE/bundle.json","state_url":"https://pith.science/pith/BAV75OW4BILVQWVE65SB6CNLKE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BAV75OW4BILVQWVE65SB6CNLKE/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-26T17:56:55Z","links":{"resolver":"https://pith.science/pith/BAV75OW4BILVQWVE65SB6CNLKE","bundle":"https://pith.science/pith/BAV75OW4BILVQWVE65SB6CNLKE/bundle.json","state":"https://pith.science/pith/BAV75OW4BILVQWVE65SB6CNLKE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BAV75OW4BILVQWVE65SB6CNLKE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:BAV75OW4BILVQWVE65SB6CNLKE","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":"02a3b712f50860f961eef88032506dfa47241b7013455c864b7f3d29de332a01","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-11-22T01:35:29Z","title_canon_sha256":"0f430fbebfdbf240acd7e5044f72bb72eb8bbc968b3dcc818954bb73c8b295a6"},"schema_version":"1.0","source":{"id":"1711.08101","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.08101","created_at":"2026-05-18T00:29:50Z"},{"alias_kind":"arxiv_version","alias_value":"1711.08101v1","created_at":"2026-05-18T00:29:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.08101","created_at":"2026-05-18T00:29:50Z"},{"alias_kind":"pith_short_12","alias_value":"BAV75OW4BILV","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BAV75OW4BILVQWVE","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BAV75OW4","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:cecadbf3b05dbee96d3a4c3d99c73b533378d2fcfc132daa934a92731e443817","target":"graph","created_at":"2026-05-18T00:29:50Z","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":"Action abstractions restrict the number of legal actions available during search in multi-unit real-time adversarial games, thus allowing algorithms to focus their search on a set of promising actions. Optimal strategies derived from un-abstracted spaces are guaranteed to be no worse than optimal strategies derived from action-abstracted spaces. In practice, however, due to real-time constraints and the state space size, one is only able to derive good strategies in un-abstracted spaces in small-scale games. In this paper we introduce search algorithms that use an action abstraction scheme we ","authors_text":"Levi H. S. Lelis, Rubens O. Moraes","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-11-22T01:35:29Z","title":"Asymmetric Action Abstractions for Multi-Unit Control in Adversarial Real-Time Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.08101","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:ff13ea678a9ec0425f1e348145672a4f049b022a266946304a33219b705166e6","target":"record","created_at":"2026-05-18T00:29:50Z","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":"02a3b712f50860f961eef88032506dfa47241b7013455c864b7f3d29de332a01","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-11-22T01:35:29Z","title_canon_sha256":"0f430fbebfdbf240acd7e5044f72bb72eb8bbc968b3dcc818954bb73c8b295a6"},"schema_version":"1.0","source":{"id":"1711.08101","kind":"arxiv","version":1}},"canonical_sha256":"082bfebadc0a17585aa4f7641f09ab5102c0f4f451a62c52e6d3ee9c43693324","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"082bfebadc0a17585aa4f7641f09ab5102c0f4f451a62c52e6d3ee9c43693324","first_computed_at":"2026-05-18T00:29:50.676988Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:50.676988Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"koCNBh1m3xnhTg9iRuaTPYfd3MX5vCezy/PaLooCbrV33MbkfuhrA05PSIaKoevLNgZ2qCrIlOpKDxYpZG5UCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:50.677556Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.08101","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ff13ea678a9ec0425f1e348145672a4f049b022a266946304a33219b705166e6","sha256:cecadbf3b05dbee96d3a4c3d99c73b533378d2fcfc132daa934a92731e443817"],"state_sha256":"a2c171aa611258485616cde22f2427b09340e789bf7a3587ed33972d1c28ef35"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fqKBe9paQ7THHf3wQBDzi7oe1lmdihOrXq0QFPJXNzsQvuO00oAcZFnwQd6zI7LK0pAwfUMQXqjbMD/Jc3ytDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T17:56:55.150697Z","bundle_sha256":"e29649c4122adb51c4a874ba97d1581e03e5e439eb0ef0743fcb1f9a0ca6546d"}}