{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:576EG4MRCEAGPE3AYSSXJKT2PA","short_pith_number":"pith:576EG4MR","schema_version":"1.0","canonical_sha256":"effc4371911100679360c4a574aa7a782583d604cc6b5337fec0fc1222f9d4b4","source":{"kind":"arxiv","id":"2005.07156","version":1},"attestation_state":"computed","paper":{"title":"Competing in a Complex Hidden Role Game with Information Set Monte Carlo Tree Search","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.AI","authors_text":"Jack Reinhardt","submitted_at":"2020-05-14T17:21:10Z","abstract_excerpt":"Advances in intelligent game playing agents have led to successes in perfect information games like Go and imperfect information games like Poker. The Information Set Monte Carlo Tree Search (ISMCTS) family of algorithms outperforms previous algorithms using Monte Carlo methods in imperfect information games. In this paper, Single Observer Information Set Monte Carlo Tree Search (SO-ISMCTS) is applied to Secret Hitler, a popular social deduction board game that combines traditional hidden role mechanics with the randomness of a card deck. This combination leads to a more complex information mo"},"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":"2005.07156","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2020-05-14T17:21:10Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"0cc1bbfcbed5b05594386f3bbb79654671455a9c90faa3e36a3b15ac322f50ef","abstract_canon_sha256":"d30b43e120eeee6ab45d49ad5f6da623fdd1fab7c887114e3816253cffa63cbe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:02:53.558201Z","signature_b64":"ElbRjI8+BTM4aozkIBM9oKdp7JZnhkCE5QRLExzSMjdVbG+sbGpgSRPYw61QXip9gRVcy1ptzHtkUOGtz4o9Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"effc4371911100679360c4a574aa7a782583d604cc6b5337fec0fc1222f9d4b4","last_reissued_at":"2026-07-05T01:02:53.557824Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:02:53.557824Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Competing in a Complex Hidden Role Game with Information Set Monte Carlo Tree Search","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.AI","authors_text":"Jack Reinhardt","submitted_at":"2020-05-14T17:21:10Z","abstract_excerpt":"Advances in intelligent game playing agents have led to successes in perfect information games like Go and imperfect information games like Poker. The Information Set Monte Carlo Tree Search (ISMCTS) family of algorithms outperforms previous algorithms using Monte Carlo methods in imperfect information games. In this paper, Single Observer Information Set Monte Carlo Tree Search (SO-ISMCTS) is applied to Secret Hitler, a popular social deduction board game that combines traditional hidden role mechanics with the randomness of a card deck. This combination leads to a more complex information mo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.07156","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2005.07156/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2005.07156","created_at":"2026-07-05T01:02:53.557876+00:00"},{"alias_kind":"arxiv_version","alias_value":"2005.07156v1","created_at":"2026-07-05T01:02:53.557876+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.07156","created_at":"2026-07-05T01:02:53.557876+00:00"},{"alias_kind":"pith_short_12","alias_value":"576EG4MRCEAG","created_at":"2026-07-05T01:02:53.557876+00:00"},{"alias_kind":"pith_short_16","alias_value":"576EG4MRCEAGPE3A","created_at":"2026-07-05T01:02:53.557876+00:00"},{"alias_kind":"pith_short_8","alias_value":"576EG4MR","created_at":"2026-07-05T01:02:53.557876+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.18455","citing_title":"Conversation Games and a Strategic View of the Turing Test","ref_index":2020,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/576EG4MRCEAGPE3AYSSXJKT2PA","json":"https://pith.science/pith/576EG4MRCEAGPE3AYSSXJKT2PA.json","graph_json":"https://pith.science/api/pith-number/576EG4MRCEAGPE3AYSSXJKT2PA/graph.json","events_json":"https://pith.science/api/pith-number/576EG4MRCEAGPE3AYSSXJKT2PA/events.json","paper":"https://pith.science/paper/576EG4MR"},"agent_actions":{"view_html":"https://pith.science/pith/576EG4MRCEAGPE3AYSSXJKT2PA","download_json":"https://pith.science/pith/576EG4MRCEAGPE3AYSSXJKT2PA.json","view_paper":"https://pith.science/paper/576EG4MR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2005.07156&json=true","fetch_graph":"https://pith.science/api/pith-number/576EG4MRCEAGPE3AYSSXJKT2PA/graph.json","fetch_events":"https://pith.science/api/pith-number/576EG4MRCEAGPE3AYSSXJKT2PA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/576EG4MRCEAGPE3AYSSXJKT2PA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/576EG4MRCEAGPE3AYSSXJKT2PA/action/storage_attestation","attest_author":"https://pith.science/pith/576EG4MRCEAGPE3AYSSXJKT2PA/action/author_attestation","sign_citation":"https://pith.science/pith/576EG4MRCEAGPE3AYSSXJKT2PA/action/citation_signature","submit_replication":"https://pith.science/pith/576EG4MRCEAGPE3AYSSXJKT2PA/action/replication_record"}},"created_at":"2026-07-05T01:02:53.557876+00:00","updated_at":"2026-07-05T01:02:53.557876+00:00"}