{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:QA6OUCGD52CQEU5TMLCVTKHVF2","short_pith_number":"pith:QA6OUCGD","canonical_record":{"source":{"id":"2005.07677","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2020-05-15T17:48:18Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"4163b483d1475efb88642dbaf970a821a0969ef57137fb8375ba837567e22896","abstract_canon_sha256":"c351945beb6db79b6fdb4c07aeef29ff1347528fb63ed1dae368b9750be99fe0"},"schema_version":"1.0"},"canonical_sha256":"803cea08c3ee850253b362c559a8f52eb7615b307088deb3b8b07da7d1fb5891","source":{"kind":"arxiv","id":"2005.07677","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2005.07677","created_at":"2026-07-05T01:13:44Z"},{"alias_kind":"arxiv_version","alias_value":"2005.07677v2","created_at":"2026-07-05T01:13:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.07677","created_at":"2026-07-05T01:13:44Z"},{"alias_kind":"pith_short_12","alias_value":"QA6OUCGD52CQ","created_at":"2026-07-05T01:13:44Z"},{"alias_kind":"pith_short_16","alias_value":"QA6OUCGD52CQEU5T","created_at":"2026-07-05T01:13:44Z"},{"alias_kind":"pith_short_8","alias_value":"QA6OUCGD","created_at":"2026-07-05T01:13:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:QA6OUCGD52CQEU5TMLCVTKHVF2","target":"record","payload":{"canonical_record":{"source":{"id":"2005.07677","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2020-05-15T17:48:18Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"4163b483d1475efb88642dbaf970a821a0969ef57137fb8375ba837567e22896","abstract_canon_sha256":"c351945beb6db79b6fdb4c07aeef29ff1347528fb63ed1dae368b9750be99fe0"},"schema_version":"1.0"},"canonical_sha256":"803cea08c3ee850253b362c559a8f52eb7615b307088deb3b8b07da7d1fb5891","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:13:44.960960Z","signature_b64":"rIfpIh6KAqf9EI8oFvhaBUxk5HiTnq9VBWkVLCVkF+xzfk9JkoE+5FBKMDWu0Ge/MPgWJ9Us+LlQTZnmflQuCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"803cea08c3ee850253b362c559a8f52eb7615b307088deb3b8b07da7d1fb5891","last_reissued_at":"2026-07-05T01:13:44.960493Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:13:44.960493Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2005.07677","source_version":2,"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-07-05T01:13:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0gKXD38u+fKxfmbF8bZCmSTyJyL9HSYH1sC+m4278qHffW/VGi7zGabH+xPD5Uuij3NwGWF9Q+h4yv23PS7vCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-24T23:45:59.313721Z"},"content_sha256":"1618c38820a262961b0a8208b70dcd2e5c47bf126101b85e3beaf2b7ee6eac0d","schema_version":"1.0","event_id":"sha256:1618c38820a262961b0a8208b70dcd2e5c47bf126101b85e3beaf2b7ee6eac0d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:QA6OUCGD52CQEU5TMLCVTKHVF2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding Game Levels with the Right Difficulty in a Few Trials through Intelligent Trial-and-Error","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"David Ha, Miguel Gonz\\'alez-Duque, Rasmus Berg Palm, Sebastian Risi","submitted_at":"2020-05-15T17:48:18Z","abstract_excerpt":"Methods for dynamic difficulty adjustment allow games to be tailored to particular players to maximize their engagement. However, current methods often only modify a limited set of game features such as the difficulty of the opponents, or the availability of resources. Other approaches, such as experience-driven Procedural Content Generation (PCG), can generate complete levels with desired properties such as levels that are neither too hard nor too easy, but require many iterations. This paper presents a method that can generate and search for complete levels with a specific target difficulty "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.07677","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2005.07677/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:13:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qpSYqdZR/Y66xnqkkFTBqxaPicZSmtoMHsE0V/5+RBzc+mGIW4N75YpF4ZpQhxJlHlWtsTOVz8r8oxZ0MP+CDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-24T23:45:59.314090Z"},"content_sha256":"0eab2adc76e0caefd8344f67dcb2ce1c04f2c193d7f8f0993c497c990c336202","schema_version":"1.0","event_id":"sha256:0eab2adc76e0caefd8344f67dcb2ce1c04f2c193d7f8f0993c497c990c336202"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QA6OUCGD52CQEU5TMLCVTKHVF2/bundle.json","state_url":"https://pith.science/pith/QA6OUCGD52CQEU5TMLCVTKHVF2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QA6OUCGD52CQEU5TMLCVTKHVF2/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-07-24T23:45:59Z","links":{"resolver":"https://pith.science/pith/QA6OUCGD52CQEU5TMLCVTKHVF2","bundle":"https://pith.science/pith/QA6OUCGD52CQEU5TMLCVTKHVF2/bundle.json","state":"https://pith.science/pith/QA6OUCGD52CQEU5TMLCVTKHVF2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QA6OUCGD52CQEU5TMLCVTKHVF2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:QA6OUCGD52CQEU5TMLCVTKHVF2","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":"c351945beb6db79b6fdb4c07aeef29ff1347528fb63ed1dae368b9750be99fe0","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2020-05-15T17:48:18Z","title_canon_sha256":"4163b483d1475efb88642dbaf970a821a0969ef57137fb8375ba837567e22896"},"schema_version":"1.0","source":{"id":"2005.07677","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2005.07677","created_at":"2026-07-05T01:13:44Z"},{"alias_kind":"arxiv_version","alias_value":"2005.07677v2","created_at":"2026-07-05T01:13:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.07677","created_at":"2026-07-05T01:13:44Z"},{"alias_kind":"pith_short_12","alias_value":"QA6OUCGD52CQ","created_at":"2026-07-05T01:13:44Z"},{"alias_kind":"pith_short_16","alias_value":"QA6OUCGD52CQEU5T","created_at":"2026-07-05T01:13:44Z"},{"alias_kind":"pith_short_8","alias_value":"QA6OUCGD","created_at":"2026-07-05T01:13:44Z"}],"graph_snapshots":[{"event_id":"sha256:0eab2adc76e0caefd8344f67dcb2ce1c04f2c193d7f8f0993c497c990c336202","target":"graph","created_at":"2026-07-05T01:13:44Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2005.07677/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Methods for dynamic difficulty adjustment allow games to be tailored to particular players to maximize their engagement. However, current methods often only modify a limited set of game features such as the difficulty of the opponents, or the availability of resources. Other approaches, such as experience-driven Procedural Content Generation (PCG), can generate complete levels with desired properties such as levels that are neither too hard nor too easy, but require many iterations. This paper presents a method that can generate and search for complete levels with a specific target difficulty ","authors_text":"David Ha, Miguel Gonz\\'alez-Duque, Rasmus Berg Palm, Sebastian Risi","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2020-05-15T17:48:18Z","title":"Finding Game Levels with the Right Difficulty in a Few Trials through Intelligent Trial-and-Error"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.07677","kind":"arxiv","version":2},"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:1618c38820a262961b0a8208b70dcd2e5c47bf126101b85e3beaf2b7ee6eac0d","target":"record","created_at":"2026-07-05T01:13:44Z","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":"c351945beb6db79b6fdb4c07aeef29ff1347528fb63ed1dae368b9750be99fe0","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2020-05-15T17:48:18Z","title_canon_sha256":"4163b483d1475efb88642dbaf970a821a0969ef57137fb8375ba837567e22896"},"schema_version":"1.0","source":{"id":"2005.07677","kind":"arxiv","version":2}},"canonical_sha256":"803cea08c3ee850253b362c559a8f52eb7615b307088deb3b8b07da7d1fb5891","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"803cea08c3ee850253b362c559a8f52eb7615b307088deb3b8b07da7d1fb5891","first_computed_at":"2026-07-05T01:13:44.960493Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:13:44.960493Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rIfpIh6KAqf9EI8oFvhaBUxk5HiTnq9VBWkVLCVkF+xzfk9JkoE+5FBKMDWu0Ge/MPgWJ9Us+LlQTZnmflQuCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:13:44.960960Z","signed_message":"canonical_sha256_bytes"},"source_id":"2005.07677","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1618c38820a262961b0a8208b70dcd2e5c47bf126101b85e3beaf2b7ee6eac0d","sha256:0eab2adc76e0caefd8344f67dcb2ce1c04f2c193d7f8f0993c497c990c336202"],"state_sha256":"f6ae6fd74b3a51972f28ade7ed20296064c0eabb3cd7310079547fa0d629d775"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qADxm4bcbCg2yc4UgLYOJcp11LDEMXUiSuw808VyWiMnyzLmIGgvTHyBK0m4BiV7WWF6WRflLgpBm5mcSvrdDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-24T23:45:59.316233Z","bundle_sha256":"997302db3ac31421f9127b326d416041a155711564294c476c017aa175ab6c8a"}}