{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:BE2NQAD5JZFA45Z4FIQXS2LSP5","short_pith_number":"pith:BE2NQAD5","schema_version":"1.0","canonical_sha256":"0934d8007d4e4a0e773c2a217969727f4fb68278a0307191a9d9bd02ed877cce","source":{"kind":"arxiv","id":"1902.06075","version":2},"attestation_state":"computed","paper":{"title":"Re-determinizing Information Set Monte Carlo Tree Search in Hanabi","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"James Goodman","submitted_at":"2019-02-16T09:42:41Z","abstract_excerpt":"This technical report documents the winner of the Computational Intelligence in Games(CIG) 2018 Hanabi competition. We introduce Re-determinizing IS-MCTS, a novel extension of Information Set Monte Carlo Tree Search (IS-MCTS) that prevents a leakage of hidden information into opponent models that can occur in IS-MCTS, and is particularly severe in Hanabi. Re-determinizing IS-MCTS scores higher in Hanabi for 2-4 players than previously published work at the time of the competition. Given the 40ms competition time limit per move we use a learned evaluation function to estimate leaf node values a"},"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":"1902.06075","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-02-16T09:42:41Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"d68123c17d8ba84309ef72878c6e8bd809192e35379157f8f52d38294d3225fa","abstract_canon_sha256":"65d91f6291c2251462376a835e2b4d339838955a2f8e4a9252742e7ed1b16e46"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:09.102728Z","signature_b64":"6+zlGblrJL9zoY12oWuPplnwDXClj7X/Du7v2GQoGTnD7LpitYjkP+6tBAXjGnpwK+vnsk+EAj7xY5FPz2VoAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0934d8007d4e4a0e773c2a217969727f4fb68278a0307191a9d9bd02ed877cce","last_reissued_at":"2026-05-17T23:46:09.102310Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:09.102310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Re-determinizing Information Set Monte Carlo Tree Search in Hanabi","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"James Goodman","submitted_at":"2019-02-16T09:42:41Z","abstract_excerpt":"This technical report documents the winner of the Computational Intelligence in Games(CIG) 2018 Hanabi competition. We introduce Re-determinizing IS-MCTS, a novel extension of Information Set Monte Carlo Tree Search (IS-MCTS) that prevents a leakage of hidden information into opponent models that can occur in IS-MCTS, and is particularly severe in Hanabi. Re-determinizing IS-MCTS scores higher in Hanabi for 2-4 players than previously published work at the time of the competition. Given the 40ms competition time limit per move we use a learned evaluation function to estimate leaf node values a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.06075","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":""},"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":"1902.06075","created_at":"2026-05-17T23:46:09.102380+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.06075v2","created_at":"2026-05-17T23:46:09.102380+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.06075","created_at":"2026-05-17T23:46:09.102380+00:00"},{"alias_kind":"pith_short_12","alias_value":"BE2NQAD5JZFA","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"BE2NQAD5JZFA45Z4","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"BE2NQAD5","created_at":"2026-05-18T12:33:12.712433+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.03840","citing_title":"Diverse Agents for Ad-Hoc Cooperation in Hanabi","ref_index":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BE2NQAD5JZFA45Z4FIQXS2LSP5","json":"https://pith.science/pith/BE2NQAD5JZFA45Z4FIQXS2LSP5.json","graph_json":"https://pith.science/api/pith-number/BE2NQAD5JZFA45Z4FIQXS2LSP5/graph.json","events_json":"https://pith.science/api/pith-number/BE2NQAD5JZFA45Z4FIQXS2LSP5/events.json","paper":"https://pith.science/paper/BE2NQAD5"},"agent_actions":{"view_html":"https://pith.science/pith/BE2NQAD5JZFA45Z4FIQXS2LSP5","download_json":"https://pith.science/pith/BE2NQAD5JZFA45Z4FIQXS2LSP5.json","view_paper":"https://pith.science/paper/BE2NQAD5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.06075&json=true","fetch_graph":"https://pith.science/api/pith-number/BE2NQAD5JZFA45Z4FIQXS2LSP5/graph.json","fetch_events":"https://pith.science/api/pith-number/BE2NQAD5JZFA45Z4FIQXS2LSP5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BE2NQAD5JZFA45Z4FIQXS2LSP5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BE2NQAD5JZFA45Z4FIQXS2LSP5/action/storage_attestation","attest_author":"https://pith.science/pith/BE2NQAD5JZFA45Z4FIQXS2LSP5/action/author_attestation","sign_citation":"https://pith.science/pith/BE2NQAD5JZFA45Z4FIQXS2LSP5/action/citation_signature","submit_replication":"https://pith.science/pith/BE2NQAD5JZFA45Z4FIQXS2LSP5/action/replication_record"}},"created_at":"2026-05-17T23:46:09.102380+00:00","updated_at":"2026-05-17T23:46:09.102380+00:00"}