{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:VDRHEC6NPZ5OMAL76AYM2NALM5","short_pith_number":"pith:VDRHEC6N","canonical_record":{"source":{"id":"1401.4591","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-01-18T21:03:42Z","cross_cats_sorted":[],"title_canon_sha256":"6991764d6da0eac2e59f0f3797afcbbcfc018372c709c27915907563a37cb09d","abstract_canon_sha256":"75710ecb7cca41efd9b35341acfe2804ae6a893e500b82a6e3de929dc93eab59"},"schema_version":"1.0"},"canonical_sha256":"a8e2720bcd7e7ae6017ff030cd340b677d722eac0241c16cefac8f35258b5e3d","source":{"kind":"arxiv","id":"1401.4591","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.4591","created_at":"2026-05-18T03:01:45Z"},{"alias_kind":"arxiv_version","alias_value":"1401.4591v1","created_at":"2026-05-18T03:01:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4591","created_at":"2026-05-18T03:01:45Z"},{"alias_kind":"pith_short_12","alias_value":"VDRHEC6NPZ5O","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"VDRHEC6NPZ5OMAL7","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"VDRHEC6N","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:VDRHEC6NPZ5OMAL76AYM2NALM5","target":"record","payload":{"canonical_record":{"source":{"id":"1401.4591","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-01-18T21:03:42Z","cross_cats_sorted":[],"title_canon_sha256":"6991764d6da0eac2e59f0f3797afcbbcfc018372c709c27915907563a37cb09d","abstract_canon_sha256":"75710ecb7cca41efd9b35341acfe2804ae6a893e500b82a6e3de929dc93eab59"},"schema_version":"1.0"},"canonical_sha256":"a8e2720bcd7e7ae6017ff030cd340b677d722eac0241c16cefac8f35258b5e3d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:45.367591Z","signature_b64":"r2heCk/L2NSY3H7GMU/3CsrLmhYhSjva2/sjS13MBy1ryUmpYuP7ieykqhmDCeVMyZBfgM2n9aLdcsH+n0piDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8e2720bcd7e7ae6017ff030cd340b677d722eac0241c16cefac8f35258b5e3d","last_reissued_at":"2026-05-18T03:01:45.367085Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:45.367085Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.4591","source_version":1,"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-18T03:01:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bKDM9iTk/rt6/DD0GaiLQe8eMjxxp7JtD5U/GyIiRU6b0C5uzl118sNV67h3Wp5T1xPVLff6EPU12pLse7ASCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T15:03:41.642496Z"},"content_sha256":"25b060f75fada2acc9ce908fb7d45d78b49ffc5a67e0cd1f0d875c44fc2d6ecb","schema_version":"1.0","event_id":"sha256:25b060f75fada2acc9ce908fb7d45d78b49ffc5a67e0cd1f0d875c44fc2d6ecb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:VDRHEC6NPZ5OMAL76AYM2NALM5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computing Approximate Nash Equilibria and Robust Best-Responses Using Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Marc Lanctot, Marc Ponsen, Steven de Jong","submitted_at":"2014-01-18T21:03:42Z","abstract_excerpt":"This article discusses two contributions to decision-making in complex partially observable stochastic games. First, we apply two state-of-the-art search techniques that use Monte-Carlo sampling to the task of approximating a Nash-Equilibrium (NE) in such games, namely Monte-Carlo Tree Search (MCTS) and Monte-Carlo Counterfactual Regret Minimization (MCCFR). MCTS has been proven to approximate a NE in perfect-information games. We show that the algorithm quickly finds a reasonably strong strategy (but not a NE) in a complex imperfect information game, i.e. Poker. MCCFR on the other hand has th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.4591","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":""},"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-18T03:01:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iJwBYSXHkd3miDuaD1dcWetuK/Cp3PL/irvGeoHI0VHep4558ddC0YuFkqTbLoVvlExwjq9x5MkpBNbSrTtTAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T15:03:41.643144Z"},"content_sha256":"51165b517b68aff9ef59e0fdc6f66f8b8a5d4fdf42c5a51c58ac1ae42d255f3b","schema_version":"1.0","event_id":"sha256:51165b517b68aff9ef59e0fdc6f66f8b8a5d4fdf42c5a51c58ac1ae42d255f3b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VDRHEC6NPZ5OMAL76AYM2NALM5/bundle.json","state_url":"https://pith.science/pith/VDRHEC6NPZ5OMAL76AYM2NALM5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VDRHEC6NPZ5OMAL76AYM2NALM5/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-06-10T15:03:41Z","links":{"resolver":"https://pith.science/pith/VDRHEC6NPZ5OMAL76AYM2NALM5","bundle":"https://pith.science/pith/VDRHEC6NPZ5OMAL76AYM2NALM5/bundle.json","state":"https://pith.science/pith/VDRHEC6NPZ5OMAL76AYM2NALM5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VDRHEC6NPZ5OMAL76AYM2NALM5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:VDRHEC6NPZ5OMAL76AYM2NALM5","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":"75710ecb7cca41efd9b35341acfe2804ae6a893e500b82a6e3de929dc93eab59","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-01-18T21:03:42Z","title_canon_sha256":"6991764d6da0eac2e59f0f3797afcbbcfc018372c709c27915907563a37cb09d"},"schema_version":"1.0","source":{"id":"1401.4591","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.4591","created_at":"2026-05-18T03:01:45Z"},{"alias_kind":"arxiv_version","alias_value":"1401.4591v1","created_at":"2026-05-18T03:01:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4591","created_at":"2026-05-18T03:01:45Z"},{"alias_kind":"pith_short_12","alias_value":"VDRHEC6NPZ5O","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"VDRHEC6NPZ5OMAL7","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"VDRHEC6N","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:51165b517b68aff9ef59e0fdc6f66f8b8a5d4fdf42c5a51c58ac1ae42d255f3b","target":"graph","created_at":"2026-05-18T03:01:45Z","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 article discusses two contributions to decision-making in complex partially observable stochastic games. First, we apply two state-of-the-art search techniques that use Monte-Carlo sampling to the task of approximating a Nash-Equilibrium (NE) in such games, namely Monte-Carlo Tree Search (MCTS) and Monte-Carlo Counterfactual Regret Minimization (MCCFR). MCTS has been proven to approximate a NE in perfect-information games. We show that the algorithm quickly finds a reasonably strong strategy (but not a NE) in a complex imperfect information game, i.e. Poker. MCCFR on the other hand has th","authors_text":"Marc Lanctot, Marc Ponsen, Steven de Jong","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-01-18T21:03:42Z","title":"Computing Approximate Nash Equilibria and Robust Best-Responses Using Sampling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.4591","kind":"arxiv","version":1},"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:25b060f75fada2acc9ce908fb7d45d78b49ffc5a67e0cd1f0d875c44fc2d6ecb","target":"record","created_at":"2026-05-18T03:01:45Z","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":"75710ecb7cca41efd9b35341acfe2804ae6a893e500b82a6e3de929dc93eab59","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-01-18T21:03:42Z","title_canon_sha256":"6991764d6da0eac2e59f0f3797afcbbcfc018372c709c27915907563a37cb09d"},"schema_version":"1.0","source":{"id":"1401.4591","kind":"arxiv","version":1}},"canonical_sha256":"a8e2720bcd7e7ae6017ff030cd340b677d722eac0241c16cefac8f35258b5e3d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a8e2720bcd7e7ae6017ff030cd340b677d722eac0241c16cefac8f35258b5e3d","first_computed_at":"2026-05-18T03:01:45.367085Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:01:45.367085Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r2heCk/L2NSY3H7GMU/3CsrLmhYhSjva2/sjS13MBy1ryUmpYuP7ieykqhmDCeVMyZBfgM2n9aLdcsH+n0piDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:01:45.367591Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.4591","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:25b060f75fada2acc9ce908fb7d45d78b49ffc5a67e0cd1f0d875c44fc2d6ecb","sha256:51165b517b68aff9ef59e0fdc6f66f8b8a5d4fdf42c5a51c58ac1ae42d255f3b"],"state_sha256":"608c7db0f5da63e3b2e2b3967624129689e0b86226d6f624df8dc9e9f28dc6b3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1hMVHsqnWe/xrOGUa7vapFSyPEFETxIivjkVYa9GZfbxxdglcplH7NlvF1i+Dvdbkb1N68fXQnHUtxpAA09wAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T15:03:41.646889Z","bundle_sha256":"a33a6fa7a2576372bd7cb61c0fe3cea5d1afa687a5c5ed9ccdd6b4eb98bf0fee"}}