{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:ADS5MQ7C5ZMWPVW4JTGNRP4FXR","short_pith_number":"pith:ADS5MQ7C","schema_version":"1.0","canonical_sha256":"00e5d643e2ee5967d6dc4cccd8bf85bc641ab12f865f0be58fd7d8dada7c03a1","source":{"kind":"arxiv","id":"1302.7008","version":2},"attestation_state":"computed","paper":{"title":"Measuring the Size of Large No-Limit Poker Games","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Michael Johanson","submitted_at":"2013-02-27T21:20:49Z","abstract_excerpt":"In the field of computational game theory, games are often compared in terms of their size. This can be measured in several ways, including the number of unique game states, the number of decision points, and the total number of legal actions over all decision points. These numbers are either known or estimated for a wide range of classic games such as chess and checkers. In the stochastic and imperfect information game of poker, these sizes are easily computed in \"limit\" games which restrict the players' available actions, but until now had only been estimated for the more complicated \"no-lim"},"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":"1302.7008","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.GT","submitted_at":"2013-02-27T21:20:49Z","cross_cats_sorted":[],"title_canon_sha256":"d08d3fe493cfeb1122a59baaea8ba35bd5a73f33788554584c359d9b1b14d465","abstract_canon_sha256":"8f5040790a2366c149844734b6ab6c9fdb2ed5bea1da4af189547c7be6565c2e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:31:33.582378Z","signature_b64":"NjdRmTLqgb77Un16kGsx3ClsoSFT6ZAJLeEek8BEOzQLAzCd3olanxMMUclN1uC7xKYUCqOwynmBtwGd/C7JAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"00e5d643e2ee5967d6dc4cccd8bf85bc641ab12f865f0be58fd7d8dada7c03a1","last_reissued_at":"2026-05-18T03:31:33.581848Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:31:33.581848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Measuring the Size of Large No-Limit Poker Games","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Michael Johanson","submitted_at":"2013-02-27T21:20:49Z","abstract_excerpt":"In the field of computational game theory, games are often compared in terms of their size. This can be measured in several ways, including the number of unique game states, the number of decision points, and the total number of legal actions over all decision points. These numbers are either known or estimated for a wide range of classic games such as chess and checkers. In the stochastic and imperfect information game of poker, these sizes are easily computed in \"limit\" games which restrict the players' available actions, but until now had only been estimated for the more complicated \"no-lim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.7008","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":"1302.7008","created_at":"2026-05-18T03:31:33.581926+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.7008v2","created_at":"2026-05-18T03:31:33.581926+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.7008","created_at":"2026-05-18T03:31:33.581926+00:00"},{"alias_kind":"pith_short_12","alias_value":"ADS5MQ7C5ZMW","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"ADS5MQ7C5ZMWPVW4","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"ADS5MQ7C","created_at":"2026-05-18T12:27:38.830355+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.06362","citing_title":"AV-AIVAT: 74x Cheaper Agent Evaluation with Certified Anytime-Valid Stopping in Imperfect-Information Games","ref_index":25,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ADS5MQ7C5ZMWPVW4JTGNRP4FXR","json":"https://pith.science/pith/ADS5MQ7C5ZMWPVW4JTGNRP4FXR.json","graph_json":"https://pith.science/api/pith-number/ADS5MQ7C5ZMWPVW4JTGNRP4FXR/graph.json","events_json":"https://pith.science/api/pith-number/ADS5MQ7C5ZMWPVW4JTGNRP4FXR/events.json","paper":"https://pith.science/paper/ADS5MQ7C"},"agent_actions":{"view_html":"https://pith.science/pith/ADS5MQ7C5ZMWPVW4JTGNRP4FXR","download_json":"https://pith.science/pith/ADS5MQ7C5ZMWPVW4JTGNRP4FXR.json","view_paper":"https://pith.science/paper/ADS5MQ7C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.7008&json=true","fetch_graph":"https://pith.science/api/pith-number/ADS5MQ7C5ZMWPVW4JTGNRP4FXR/graph.json","fetch_events":"https://pith.science/api/pith-number/ADS5MQ7C5ZMWPVW4JTGNRP4FXR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ADS5MQ7C5ZMWPVW4JTGNRP4FXR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ADS5MQ7C5ZMWPVW4JTGNRP4FXR/action/storage_attestation","attest_author":"https://pith.science/pith/ADS5MQ7C5ZMWPVW4JTGNRP4FXR/action/author_attestation","sign_citation":"https://pith.science/pith/ADS5MQ7C5ZMWPVW4JTGNRP4FXR/action/citation_signature","submit_replication":"https://pith.science/pith/ADS5MQ7C5ZMWPVW4JTGNRP4FXR/action/replication_record"}},"created_at":"2026-05-18T03:31:33.581926+00:00","updated_at":"2026-05-18T03:31:33.581926+00:00"}