{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:NAOU3ZYO4JCWQXPDAF4VXTPBXL","short_pith_number":"pith:NAOU3ZYO","schema_version":"1.0","canonical_sha256":"681d4de70ee245685de301795bcde1baf08da68d1544021dd6ba9599ba687447","source":{"kind":"arxiv","id":"1705.01080","version":1},"attestation_state":"computed","paper":{"title":"The N-Tuple Bandit Evolutionary Algorithm for Automatic Game Improvement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Diego Perez-Liebana, Jialin Liu, Kamolwan Kunanusont, Raluca D. Gaina, Simon M. Lucas","submitted_at":"2017-03-18T09:10:09Z","abstract_excerpt":"This paper describes a new evolutionary algorithm that is especially well suited to AI-Assisted Game Design. The approach adopted in this paper is to use observations of AI agents playing the game to estimate the game's quality. Some of best agents for this purpose are General Video Game AI agents, since they can be deployed directly on a new game without game-specific tuning; these agents tend to be based on stochastic algorithms which give robust but noisy results and tend to be expensive to run. This motivates the main contribution of the paper: the development of the novel N-Tuple Bandit E"},"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":"1705.01080","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-03-18T09:10:09Z","cross_cats_sorted":[],"title_canon_sha256":"cc4ff36e3c8d3a13ead7d73b57c14829b894bb40e1866da01d61a431108acd64","abstract_canon_sha256":"25be7a4d306944339f2ffe1cd2da7e655890e58340e8c523ca01971b1bed95b4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:08.977844Z","signature_b64":"qeYA4CxL2j3l+vK6eH/2pzsW3twRWpfnOROFf27cjtuO9UkylX6bJT/C7/xyOmr9hES+laO84ad15MquemiBAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"681d4de70ee245685de301795bcde1baf08da68d1544021dd6ba9599ba687447","last_reissued_at":"2026-05-18T00:45:08.977282Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:08.977282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The N-Tuple Bandit Evolutionary Algorithm for Automatic Game Improvement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Diego Perez-Liebana, Jialin Liu, Kamolwan Kunanusont, Raluca D. Gaina, Simon M. Lucas","submitted_at":"2017-03-18T09:10:09Z","abstract_excerpt":"This paper describes a new evolutionary algorithm that is especially well suited to AI-Assisted Game Design. The approach adopted in this paper is to use observations of AI agents playing the game to estimate the game's quality. Some of best agents for this purpose are General Video Game AI agents, since they can be deployed directly on a new game without game-specific tuning; these agents tend to be based on stochastic algorithms which give robust but noisy results and tend to be expensive to run. This motivates the main contribution of the paper: the development of the novel N-Tuple Bandit E"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.01080","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":"1705.01080","created_at":"2026-05-18T00:45:08.977367+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.01080v1","created_at":"2026-05-18T00:45:08.977367+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.01080","created_at":"2026-05-18T00:45:08.977367+00:00"},{"alias_kind":"pith_short_12","alias_value":"NAOU3ZYO4JCW","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"NAOU3ZYO4JCWQXPD","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"NAOU3ZYO","created_at":"2026-05-18T12:31:31.346846+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/NAOU3ZYO4JCWQXPDAF4VXTPBXL","json":"https://pith.science/pith/NAOU3ZYO4JCWQXPDAF4VXTPBXL.json","graph_json":"https://pith.science/api/pith-number/NAOU3ZYO4JCWQXPDAF4VXTPBXL/graph.json","events_json":"https://pith.science/api/pith-number/NAOU3ZYO4JCWQXPDAF4VXTPBXL/events.json","paper":"https://pith.science/paper/NAOU3ZYO"},"agent_actions":{"view_html":"https://pith.science/pith/NAOU3ZYO4JCWQXPDAF4VXTPBXL","download_json":"https://pith.science/pith/NAOU3ZYO4JCWQXPDAF4VXTPBXL.json","view_paper":"https://pith.science/paper/NAOU3ZYO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.01080&json=true","fetch_graph":"https://pith.science/api/pith-number/NAOU3ZYO4JCWQXPDAF4VXTPBXL/graph.json","fetch_events":"https://pith.science/api/pith-number/NAOU3ZYO4JCWQXPDAF4VXTPBXL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NAOU3ZYO4JCWQXPDAF4VXTPBXL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NAOU3ZYO4JCWQXPDAF4VXTPBXL/action/storage_attestation","attest_author":"https://pith.science/pith/NAOU3ZYO4JCWQXPDAF4VXTPBXL/action/author_attestation","sign_citation":"https://pith.science/pith/NAOU3ZYO4JCWQXPDAF4VXTPBXL/action/citation_signature","submit_replication":"https://pith.science/pith/NAOU3ZYO4JCWQXPDAF4VXTPBXL/action/replication_record"}},"created_at":"2026-05-18T00:45:08.977367+00:00","updated_at":"2026-05-18T00:45:08.977367+00:00"}