{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:P3JHPLPSPSXLLICPR2O3KJZ5U3","short_pith_number":"pith:P3JHPLPS","canonical_record":{"source":{"id":"1603.03795","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.HC","submitted_at":"2016-03-11T21:36:27Z","cross_cats_sorted":["cs.AI","cs.NE"],"title_canon_sha256":"8a26365a4363d5c3dda2510714686aeced7b6c2084509aacd1681a80219f5657","abstract_canon_sha256":"661231bb8ce626c047beca3d22666951a8cff6e3d540179d92d9657002e85ce1"},"schema_version":"1.0"},"canonical_sha256":"7ed277adf27caeb5a04f8e9db5273da6f5951a7496b89de018d02e725be08807","source":{"kind":"arxiv","id":"1603.03795","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.03795","created_at":"2026-05-18T01:19:10Z"},{"alias_kind":"arxiv_version","alias_value":"1603.03795v1","created_at":"2026-05-18T01:19:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.03795","created_at":"2026-05-18T01:19:10Z"},{"alias_kind":"pith_short_12","alias_value":"P3JHPLPSPSXL","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"P3JHPLPSPSXLLICP","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"P3JHPLPS","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:P3JHPLPSPSXLLICPR2O3KJZ5U3","target":"record","payload":{"canonical_record":{"source":{"id":"1603.03795","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.HC","submitted_at":"2016-03-11T21:36:27Z","cross_cats_sorted":["cs.AI","cs.NE"],"title_canon_sha256":"8a26365a4363d5c3dda2510714686aeced7b6c2084509aacd1681a80219f5657","abstract_canon_sha256":"661231bb8ce626c047beca3d22666951a8cff6e3d540179d92d9657002e85ce1"},"schema_version":"1.0"},"canonical_sha256":"7ed277adf27caeb5a04f8e9db5273da6f5951a7496b89de018d02e725be08807","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:10.469061Z","signature_b64":"SUEWspZyRfhISWTfnvxf1JitUoH2Y54gTnGIFd8IoCwPJBVi+VowrXlZaXvP28DHFKgr87wRRJdM3vtsCyr7Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ed277adf27caeb5a04f8e9db5273da6f5951a7496b89de018d02e725be08807","last_reissued_at":"2026-05-18T01:19:10.468429Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:10.468429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.03795","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:19:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W2AqhDN9t1gGgQ1jOZsnaLgb1O3285wU7r1gvdmXt9QIR9T/UixfA9oDY/YavtZYzGOr5OBLTztJo7tzYIYZAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T18:40:28.740507Z"},"content_sha256":"919648c0b388a1dfd36e7e6d087e10ea38091ddc6ea6fddef726e1a8fb949550","schema_version":"1.0","event_id":"sha256:919648c0b388a1dfd36e7e6d087e10ea38091ddc6ea6fddef726e1a8fb949550"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:P3JHPLPSPSXLLICPR2O3KJZ5U3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Demonstrating the Feasibility of Automatic Game Balancing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.NE"],"primary_cat":"cs.HC","authors_text":"Boris Naujoks, G\\\"unter Rudolph, Vanessa Volz","submitted_at":"2016-03-11T21:36:27Z","abstract_excerpt":"Game balancing is an important part of the (computer) game design process, in which designers adapt a game prototype so that the resulting gameplay is as entertaining as possible. In industry, the evaluation of a game is often based on costly playtests with human players. It suggests itself to automate this process using surrogate models for the prediction of gameplay and outcome. In this paper, the feasibility of automatic balancing using simulation- and deck-based objectives is investigated for the card game top trumps. Additionally, the necessity of a multi-objective approach is asserted by"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.03795","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:19:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SVg5bXh/fT4OVVzs1dIL7o+dTTcz7kaii7Lb6GXTMBxgUDCjhUsBGN3MYwqMzhpABXDXRgpraFOXMKc82eqUAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T18:40:28.740852Z"},"content_sha256":"44082bce1b35dab41072d5e5569cba64f19c10d13a43748e7b83baa8d5b06e91","schema_version":"1.0","event_id":"sha256:44082bce1b35dab41072d5e5569cba64f19c10d13a43748e7b83baa8d5b06e91"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P3JHPLPSPSXLLICPR2O3KJZ5U3/bundle.json","state_url":"https://pith.science/pith/P3JHPLPSPSXLLICPR2O3KJZ5U3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P3JHPLPSPSXLLICPR2O3KJZ5U3/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-01T18:40:28Z","links":{"resolver":"https://pith.science/pith/P3JHPLPSPSXLLICPR2O3KJZ5U3","bundle":"https://pith.science/pith/P3JHPLPSPSXLLICPR2O3KJZ5U3/bundle.json","state":"https://pith.science/pith/P3JHPLPSPSXLLICPR2O3KJZ5U3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P3JHPLPSPSXLLICPR2O3KJZ5U3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:P3JHPLPSPSXLLICPR2O3KJZ5U3","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":"661231bb8ce626c047beca3d22666951a8cff6e3d540179d92d9657002e85ce1","cross_cats_sorted":["cs.AI","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.HC","submitted_at":"2016-03-11T21:36:27Z","title_canon_sha256":"8a26365a4363d5c3dda2510714686aeced7b6c2084509aacd1681a80219f5657"},"schema_version":"1.0","source":{"id":"1603.03795","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.03795","created_at":"2026-05-18T01:19:10Z"},{"alias_kind":"arxiv_version","alias_value":"1603.03795v1","created_at":"2026-05-18T01:19:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.03795","created_at":"2026-05-18T01:19:10Z"},{"alias_kind":"pith_short_12","alias_value":"P3JHPLPSPSXL","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"P3JHPLPSPSXLLICP","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"P3JHPLPS","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:44082bce1b35dab41072d5e5569cba64f19c10d13a43748e7b83baa8d5b06e91","target":"graph","created_at":"2026-05-18T01:19:10Z","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":"Game balancing is an important part of the (computer) game design process, in which designers adapt a game prototype so that the resulting gameplay is as entertaining as possible. In industry, the evaluation of a game is often based on costly playtests with human players. It suggests itself to automate this process using surrogate models for the prediction of gameplay and outcome. In this paper, the feasibility of automatic balancing using simulation- and deck-based objectives is investigated for the card game top trumps. Additionally, the necessity of a multi-objective approach is asserted by","authors_text":"Boris Naujoks, G\\\"unter Rudolph, Vanessa Volz","cross_cats":["cs.AI","cs.NE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.HC","submitted_at":"2016-03-11T21:36:27Z","title":"Demonstrating the Feasibility of Automatic Game Balancing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.03795","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:919648c0b388a1dfd36e7e6d087e10ea38091ddc6ea6fddef726e1a8fb949550","target":"record","created_at":"2026-05-18T01:19:10Z","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":"661231bb8ce626c047beca3d22666951a8cff6e3d540179d92d9657002e85ce1","cross_cats_sorted":["cs.AI","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.HC","submitted_at":"2016-03-11T21:36:27Z","title_canon_sha256":"8a26365a4363d5c3dda2510714686aeced7b6c2084509aacd1681a80219f5657"},"schema_version":"1.0","source":{"id":"1603.03795","kind":"arxiv","version":1}},"canonical_sha256":"7ed277adf27caeb5a04f8e9db5273da6f5951a7496b89de018d02e725be08807","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7ed277adf27caeb5a04f8e9db5273da6f5951a7496b89de018d02e725be08807","first_computed_at":"2026-05-18T01:19:10.468429Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:10.468429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SUEWspZyRfhISWTfnvxf1JitUoH2Y54gTnGIFd8IoCwPJBVi+VowrXlZaXvP28DHFKgr87wRRJdM3vtsCyr7Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:10.469061Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.03795","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:919648c0b388a1dfd36e7e6d087e10ea38091ddc6ea6fddef726e1a8fb949550","sha256:44082bce1b35dab41072d5e5569cba64f19c10d13a43748e7b83baa8d5b06e91"],"state_sha256":"1bca2afaf063cdab44c0ef111a54572aef963ffc644537e647bbaf540ad06b96"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kewkLR/fMaxI3JFKREMcJZLGLoFiSFXC6+MfBZDj68ZlGdqIDkspI9jJG7IvELqBGXTYPFXDL0i5vL4uPEsgBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T18:40:28.742782Z","bundle_sha256":"e4b4e55dccb899149daa5027bb48a51294c80fc8e1fc6aa200ccb3758c209a44"}}