{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:BE2NQAD5JZFA45Z4FIQXS2LSP5","short_pith_number":"pith:BE2NQAD5","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"},"canonical_sha256":"0934d8007d4e4a0e773c2a217969727f4fb68278a0307191a9d9bd02ed877cce","source":{"kind":"arxiv","id":"1902.06075","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.06075","created_at":"2026-05-17T23:46:09Z"},{"alias_kind":"arxiv_version","alias_value":"1902.06075v2","created_at":"2026-05-17T23:46:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.06075","created_at":"2026-05-17T23:46:09Z"},{"alias_kind":"pith_short_12","alias_value":"BE2NQAD5JZFA","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BE2NQAD5JZFA45Z4","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BE2NQAD5","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:BE2NQAD5JZFA45Z4FIQXS2LSP5","target":"record","payload":{"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"},"canonical_sha256":"0934d8007d4e4a0e773c2a217969727f4fb68278a0307191a9d9bd02ed877cce","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"},"source_kind":"arxiv","source_id":"1902.06075","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-05-17T23:46:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IHkgW4IUl5O0nhBw1bt2i1FzHtSS87GAMmPwS0QmbdRUIO/bSe1V1ypDDho2SCyI7GIvfof+XPcNSGrqgG3lBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:48:27.822312Z"},"content_sha256":"f77735fa22fed5f759d1e69db94cec4bfd71e213cd58a4929fee1d8284e6a851","schema_version":"1.0","event_id":"sha256:f77735fa22fed5f759d1e69db94cec4bfd71e213cd58a4929fee1d8284e6a851"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:BE2NQAD5JZFA45Z4FIQXS2LSP5","target":"graph","payload":{"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"},"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-17T23:46:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kKM9f6So9FUVGSAlAfAbRYVA1Q7aDgs6WUrt6fTvwpUQSErOOHIZQ5TGYdx+EBqJOEwtBFoGYuPwYQ2TqtGLAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:48:27.822967Z"},"content_sha256":"672b9a339ea93947bf6715966bd91aa8e7b26a39dbdcec1ee56dd40592c01c1b","schema_version":"1.0","event_id":"sha256:672b9a339ea93947bf6715966bd91aa8e7b26a39dbdcec1ee56dd40592c01c1b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BE2NQAD5JZFA45Z4FIQXS2LSP5/bundle.json","state_url":"https://pith.science/pith/BE2NQAD5JZFA45Z4FIQXS2LSP5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BE2NQAD5JZFA45Z4FIQXS2LSP5/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-05-25T20:48:27Z","links":{"resolver":"https://pith.science/pith/BE2NQAD5JZFA45Z4FIQXS2LSP5","bundle":"https://pith.science/pith/BE2NQAD5JZFA45Z4FIQXS2LSP5/bundle.json","state":"https://pith.science/pith/BE2NQAD5JZFA45Z4FIQXS2LSP5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BE2NQAD5JZFA45Z4FIQXS2LSP5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:BE2NQAD5JZFA45Z4FIQXS2LSP5","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":"65d91f6291c2251462376a835e2b4d339838955a2f8e4a9252742e7ed1b16e46","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-02-16T09:42:41Z","title_canon_sha256":"d68123c17d8ba84309ef72878c6e8bd809192e35379157f8f52d38294d3225fa"},"schema_version":"1.0","source":{"id":"1902.06075","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.06075","created_at":"2026-05-17T23:46:09Z"},{"alias_kind":"arxiv_version","alias_value":"1902.06075v2","created_at":"2026-05-17T23:46:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.06075","created_at":"2026-05-17T23:46:09Z"},{"alias_kind":"pith_short_12","alias_value":"BE2NQAD5JZFA","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BE2NQAD5JZFA45Z4","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BE2NQAD5","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:672b9a339ea93947bf6715966bd91aa8e7b26a39dbdcec1ee56dd40592c01c1b","target":"graph","created_at":"2026-05-17T23:46:09Z","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":"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","authors_text":"James Goodman","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-02-16T09:42:41Z","title":"Re-determinizing Information Set Monte Carlo Tree Search in Hanabi"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.06075","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:f77735fa22fed5f759d1e69db94cec4bfd71e213cd58a4929fee1d8284e6a851","target":"record","created_at":"2026-05-17T23:46:09Z","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":"65d91f6291c2251462376a835e2b4d339838955a2f8e4a9252742e7ed1b16e46","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-02-16T09:42:41Z","title_canon_sha256":"d68123c17d8ba84309ef72878c6e8bd809192e35379157f8f52d38294d3225fa"},"schema_version":"1.0","source":{"id":"1902.06075","kind":"arxiv","version":2}},"canonical_sha256":"0934d8007d4e4a0e773c2a217969727f4fb68278a0307191a9d9bd02ed877cce","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0934d8007d4e4a0e773c2a217969727f4fb68278a0307191a9d9bd02ed877cce","first_computed_at":"2026-05-17T23:46:09.102310Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:09.102310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6+zlGblrJL9zoY12oWuPplnwDXClj7X/Du7v2GQoGTnD7LpitYjkP+6tBAXjGnpwK+vnsk+EAj7xY5FPz2VoAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:09.102728Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.06075","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f77735fa22fed5f759d1e69db94cec4bfd71e213cd58a4929fee1d8284e6a851","sha256:672b9a339ea93947bf6715966bd91aa8e7b26a39dbdcec1ee56dd40592c01c1b"],"state_sha256":"c4d3f344288f99432e59a5afd275b4d152bb43f05de9e6bc7f578cc6f0167b5e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qo9gMw28DKxmBAnPROBFk5AgZuFyHX2biXs3MG1Ovfd4BfzutFr5Vto1qHS0txsQfUDUF+SOpe2t7PEb3QaWBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T20:48:27.826416Z","bundle_sha256":"6cd9fb38775d2d69cb5d83062088673a9857b754171a63ba45eb770ea44bee71"}}