{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:BAV75OW4BILVQWVE65SB6CNLKE","short_pith_number":"pith:BAV75OW4","schema_version":"1.0","canonical_sha256":"082bfebadc0a17585aa4f7641f09ab5102c0f4f451a62c52e6d3ee9c43693324","source":{"kind":"arxiv","id":"1711.08101","version":1},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1711.08101","created_at":"2026-05-18T00:29:50.677071+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.08101v1","created_at":"2026-05-18T00:29:50.677071+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.08101","created_at":"2026-05-18T00:29:50.677071+00:00"},{"alias_kind":"pith_short_12","alias_value":"BAV75OW4BILV","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"BAV75OW4BILVQWVE","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"BAV75OW4","created_at":"2026-05-18T12:31:08.081275+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BAV75OW4BILVQWVE65SB6CNLKE","json":"https://pith.science/pith/BAV75OW4BILVQWVE65SB6CNLKE.json","graph_json":"https://pith.science/api/pith-number/BAV75OW4BILVQWVE65SB6CNLKE/graph.json","events_json":"https://pith.science/api/pith-number/BAV75OW4BILVQWVE65SB6CNLKE/events.json","paper":"https://pith.science/paper/BAV75OW4"},"agent_actions":{"view_html":"https://pith.science/pith/BAV75OW4BILVQWVE65SB6CNLKE","download_json":"https://pith.science/pith/BAV75OW4BILVQWVE65SB6CNLKE.json","view_paper":"https://pith.science/paper/BAV75OW4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.08101&json=true","fetch_graph":"https://pith.science/api/pith-number/BAV75OW4BILVQWVE65SB6CNLKE/graph.json","fetch_events":"https://pith.science/api/pith-number/BAV75OW4BILVQWVE65SB6CNLKE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BAV75OW4BILVQWVE65SB6CNLKE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BAV75OW4BILVQWVE65SB6CNLKE/action/storage_attestation","attest_author":"https://pith.science/pith/BAV75OW4BILVQWVE65SB6CNLKE/action/author_attestation","sign_citation":"https://pith.science/pith/BAV75OW4BILVQWVE65SB6CNLKE/action/citation_signature","submit_replication":"https://pith.science/pith/BAV75OW4BILVQWVE65SB6CNLKE/action/replication_record"}},"created_at":"2026-05-18T00:29:50.677071+00:00","updated_at":"2026-05-18T00:29:50.677071+00:00"}