{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:VUADSWJ2KOLHTGU4ZZ6UEVGCQ3","short_pith_number":"pith:VUADSWJ2","canonical_record":{"source":{"id":"2102.06808","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2021-02-12T22:54:24Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"2ade2cd7f1dee9a44629d14a8f6764d9b1405d9862809570f7c845ecc02335c4","abstract_canon_sha256":"ad2833f2e78b21f9f0ae21197e7f93fa8c1da4a2089222fcd049a3ae36f9972b"},"schema_version":"1.0"},"canonical_sha256":"ad0039593a5396799a9cce7d4254c286c5f9c7c0d3d454aed6a32fc16114d330","source":{"kind":"arxiv","id":"2102.06808","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2102.06808","created_at":"2026-07-05T05:51:23Z"},{"alias_kind":"arxiv_version","alias_value":"2102.06808v3","created_at":"2026-07-05T05:51:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.06808","created_at":"2026-07-05T05:51:23Z"},{"alias_kind":"pith_short_12","alias_value":"VUADSWJ2KOLH","created_at":"2026-07-05T05:51:23Z"},{"alias_kind":"pith_short_16","alias_value":"VUADSWJ2KOLHTGU4","created_at":"2026-07-05T05:51:23Z"},{"alias_kind":"pith_short_8","alias_value":"VUADSWJ2","created_at":"2026-07-05T05:51:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:VUADSWJ2KOLHTGU4ZZ6UEVGCQ3","target":"record","payload":{"canonical_record":{"source":{"id":"2102.06808","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2021-02-12T22:54:24Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"2ade2cd7f1dee9a44629d14a8f6764d9b1405d9862809570f7c845ecc02335c4","abstract_canon_sha256":"ad2833f2e78b21f9f0ae21197e7f93fa8c1da4a2089222fcd049a3ae36f9972b"},"schema_version":"1.0"},"canonical_sha256":"ad0039593a5396799a9cce7d4254c286c5f9c7c0d3d454aed6a32fc16114d330","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:51:23.618411Z","signature_b64":"f8bSiTg1/Rj6Tfr/KG5fxcN2uQh7a9ulZyqOkawm/fJDamM3puMDcmI7OK4fLrIxS5ghGYlx3fKEhfAiVZWUAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad0039593a5396799a9cce7d4254c286c5f9c7c0d3d454aed6a32fc16114d330","last_reissued_at":"2026-07-05T05:51:23.617999Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:51:23.617999Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2102.06808","source_version":3,"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-05T05:51:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mo8rb6rAUYajwTLXHVzIpU9B3vUqqhvcVrvuugxz3/v0k21uAhm929dVng0opwH3/DDW1EiCHVBPGHN6OzAEDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T16:55:58.547049Z"},"content_sha256":"dedbed84e43ff36da1a1c4837ba585701873f0aedd488a0052d430e68e6103cd","schema_version":"1.0","event_id":"sha256:dedbed84e43ff36da1a1c4837ba585701873f0aedd488a0052d430e68e6103cd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:VUADSWJ2KOLHTGU4ZZ6UEVGCQ3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Planning and Learning Using Adaptive Entropy Tree Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Miko{\\l}aj Pacek, Piotr Kozakowski, Piotr Mi{\\l}o\\'s","submitted_at":"2021-02-12T22:54:24Z","abstract_excerpt":"Recent breakthroughs in Artificial Intelligence have shown that the combination of tree-based planning with deep learning can lead to superior performance. We present Adaptive Entropy Tree Search (ANTS) - a novel algorithm combining planning and learning in the maximum entropy paradigm. Through a comprehensive suite of experiments on the Atari benchmark we show that ANTS significantly outperforms PUCT, the planning component of the state-of-the-art AlphaZero system. ANTS builds upon recent work on maximum entropy planning methods - which however, as we show, fail in combination with learning. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.06808","kind":"arxiv","version":3},"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/2102.06808/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-05T05:51:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W5yIsq7tQZHde6UYiVgHwIja3bKLD7Ofhyjh4LtKGLMi8f9lJAjV+jqvAopXlCCOOhXonb7ooJqsxKlV7Q2yAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T16:55:58.547436Z"},"content_sha256":"3c12f3dd693cb792217c1228c479b160d2b6a84a9522aa5e7bb44a8d6838fb3d","schema_version":"1.0","event_id":"sha256:3c12f3dd693cb792217c1228c479b160d2b6a84a9522aa5e7bb44a8d6838fb3d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VUADSWJ2KOLHTGU4ZZ6UEVGCQ3/bundle.json","state_url":"https://pith.science/pith/VUADSWJ2KOLHTGU4ZZ6UEVGCQ3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VUADSWJ2KOLHTGU4ZZ6UEVGCQ3/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-06T16:55:58Z","links":{"resolver":"https://pith.science/pith/VUADSWJ2KOLHTGU4ZZ6UEVGCQ3","bundle":"https://pith.science/pith/VUADSWJ2KOLHTGU4ZZ6UEVGCQ3/bundle.json","state":"https://pith.science/pith/VUADSWJ2KOLHTGU4ZZ6UEVGCQ3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VUADSWJ2KOLHTGU4ZZ6UEVGCQ3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:VUADSWJ2KOLHTGU4ZZ6UEVGCQ3","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":"ad2833f2e78b21f9f0ae21197e7f93fa8c1da4a2089222fcd049a3ae36f9972b","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2021-02-12T22:54:24Z","title_canon_sha256":"2ade2cd7f1dee9a44629d14a8f6764d9b1405d9862809570f7c845ecc02335c4"},"schema_version":"1.0","source":{"id":"2102.06808","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2102.06808","created_at":"2026-07-05T05:51:23Z"},{"alias_kind":"arxiv_version","alias_value":"2102.06808v3","created_at":"2026-07-05T05:51:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.06808","created_at":"2026-07-05T05:51:23Z"},{"alias_kind":"pith_short_12","alias_value":"VUADSWJ2KOLH","created_at":"2026-07-05T05:51:23Z"},{"alias_kind":"pith_short_16","alias_value":"VUADSWJ2KOLHTGU4","created_at":"2026-07-05T05:51:23Z"},{"alias_kind":"pith_short_8","alias_value":"VUADSWJ2","created_at":"2026-07-05T05:51:23Z"}],"graph_snapshots":[{"event_id":"sha256:3c12f3dd693cb792217c1228c479b160d2b6a84a9522aa5e7bb44a8d6838fb3d","target":"graph","created_at":"2026-07-05T05:51:23Z","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/2102.06808/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Recent breakthroughs in Artificial Intelligence have shown that the combination of tree-based planning with deep learning can lead to superior performance. We present Adaptive Entropy Tree Search (ANTS) - a novel algorithm combining planning and learning in the maximum entropy paradigm. Through a comprehensive suite of experiments on the Atari benchmark we show that ANTS significantly outperforms PUCT, the planning component of the state-of-the-art AlphaZero system. ANTS builds upon recent work on maximum entropy planning methods - which however, as we show, fail in combination with learning. ","authors_text":"Miko{\\l}aj Pacek, Piotr Kozakowski, Piotr Mi{\\l}o\\'s","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2021-02-12T22:54:24Z","title":"Planning and Learning Using Adaptive Entropy Tree Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.06808","kind":"arxiv","version":3},"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:dedbed84e43ff36da1a1c4837ba585701873f0aedd488a0052d430e68e6103cd","target":"record","created_at":"2026-07-05T05:51:23Z","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":"ad2833f2e78b21f9f0ae21197e7f93fa8c1da4a2089222fcd049a3ae36f9972b","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2021-02-12T22:54:24Z","title_canon_sha256":"2ade2cd7f1dee9a44629d14a8f6764d9b1405d9862809570f7c845ecc02335c4"},"schema_version":"1.0","source":{"id":"2102.06808","kind":"arxiv","version":3}},"canonical_sha256":"ad0039593a5396799a9cce7d4254c286c5f9c7c0d3d454aed6a32fc16114d330","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ad0039593a5396799a9cce7d4254c286c5f9c7c0d3d454aed6a32fc16114d330","first_computed_at":"2026-07-05T05:51:23.617999Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:51:23.617999Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"f8bSiTg1/Rj6Tfr/KG5fxcN2uQh7a9ulZyqOkawm/fJDamM3puMDcmI7OK4fLrIxS5ghGYlx3fKEhfAiVZWUAA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:51:23.618411Z","signed_message":"canonical_sha256_bytes"},"source_id":"2102.06808","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dedbed84e43ff36da1a1c4837ba585701873f0aedd488a0052d430e68e6103cd","sha256:3c12f3dd693cb792217c1228c479b160d2b6a84a9522aa5e7bb44a8d6838fb3d"],"state_sha256":"8c9186d1ab941b1dad4d72e9d261677bcfb52b5c621840fe677ff2daa5aad0a5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QpSeoWgZF2h/CU1DMQPAcJ3c2BK9n2gnJ4HrvjOpvNdr+Zyfwwdj+uVTmB4L4ygO6EiW3gIOrabog98akf3xCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T16:55:58.549424Z","bundle_sha256":"3d505b261fa95c8a419e8dd0cc69f5fe415a54011954df98f3dfc8827e88d1ae"}}