{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:OEBHKGGOMZDYOWSIRG4IL6UAJ2","short_pith_number":"pith:OEBHKGGO","schema_version":"1.0","canonical_sha256":"71027518ce6647875a4889b885fa804eb2534c5394250e3eb08a825af944ce9b","source":{"kind":"arxiv","id":"2508.06559","version":1},"attestation_state":"computed","paper":{"title":"Solving Pasur Using GPU-Accelerated Counterfactual Regret Minimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.GT","cs.LG"],"primary_cat":"cs.AI","authors_text":"Sina Baghal","submitted_at":"2025-08-06T15:15:11Z","abstract_excerpt":"Pasur is a fishing card game played over six rounds and is played similarly to games such as Cassino and Scopa, and Bastra. This paper introduces a CUDA-accelerated computational framework for simulating Pasur, emphasizing efficient memory management. We use our framework to compute near-Nash equilibria via Counterfactual Regret Minimization (CFR), a well-known algorithm for solving large imperfect-information games.\n  Solving Pasur presents unique challenges due to its intricate rules and the large size of its game tree. We handle rule complexity using PyTorch CUDA tensors and to address the "},"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":"2508.06559","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-08-06T15:15:11Z","cross_cats_sorted":["cs.GT","cs.LG"],"title_canon_sha256":"a6ca8d0c5977d39b50417c12e9e762c8e9f69a34cb924c5ded411df8e381ab4d","abstract_canon_sha256":"67193ac33d9f33b4ef5104a7e8e9233bd21f73feab82298128c5293ad1d6861d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:51:02.549024Z","signature_b64":"zRjitfyhcRyUGHY/x63RMYQ0kcA6KFW2NN6ciriah1t0uf1oqHXlIhlMzzZfXvgbUAvAa5Xeuw8+ShvJygEWCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71027518ce6647875a4889b885fa804eb2534c5394250e3eb08a825af944ce9b","last_reissued_at":"2026-07-05T11:51:02.548306Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:51:02.548306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving Pasur Using GPU-Accelerated Counterfactual Regret Minimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.GT","cs.LG"],"primary_cat":"cs.AI","authors_text":"Sina Baghal","submitted_at":"2025-08-06T15:15:11Z","abstract_excerpt":"Pasur is a fishing card game played over six rounds and is played similarly to games such as Cassino and Scopa, and Bastra. This paper introduces a CUDA-accelerated computational framework for simulating Pasur, emphasizing efficient memory management. We use our framework to compute near-Nash equilibria via Counterfactual Regret Minimization (CFR), a well-known algorithm for solving large imperfect-information games.\n  Solving Pasur presents unique challenges due to its intricate rules and the large size of its game tree. We handle rule complexity using PyTorch CUDA tensors and to address the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.06559","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/2508.06559/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":"2508.06559","created_at":"2026-07-05T11:51:02.548415+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.06559v1","created_at":"2026-07-05T11:51:02.548415+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.06559","created_at":"2026-07-05T11:51:02.548415+00:00"},{"alias_kind":"pith_short_12","alias_value":"OEBHKGGOMZDY","created_at":"2026-07-05T11:51:02.548415+00:00"},{"alias_kind":"pith_short_16","alias_value":"OEBHKGGOMZDYOWSI","created_at":"2026-07-05T11:51:02.548415+00:00"},{"alias_kind":"pith_short_8","alias_value":"OEBHKGGO","created_at":"2026-07-05T11:51:02.548415+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OEBHKGGOMZDYOWSIRG4IL6UAJ2","json":"https://pith.science/pith/OEBHKGGOMZDYOWSIRG4IL6UAJ2.json","graph_json":"https://pith.science/api/pith-number/OEBHKGGOMZDYOWSIRG4IL6UAJ2/graph.json","events_json":"https://pith.science/api/pith-number/OEBHKGGOMZDYOWSIRG4IL6UAJ2/events.json","paper":"https://pith.science/paper/OEBHKGGO"},"agent_actions":{"view_html":"https://pith.science/pith/OEBHKGGOMZDYOWSIRG4IL6UAJ2","download_json":"https://pith.science/pith/OEBHKGGOMZDYOWSIRG4IL6UAJ2.json","view_paper":"https://pith.science/paper/OEBHKGGO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.06559&json=true","fetch_graph":"https://pith.science/api/pith-number/OEBHKGGOMZDYOWSIRG4IL6UAJ2/graph.json","fetch_events":"https://pith.science/api/pith-number/OEBHKGGOMZDYOWSIRG4IL6UAJ2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OEBHKGGOMZDYOWSIRG4IL6UAJ2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OEBHKGGOMZDYOWSIRG4IL6UAJ2/action/storage_attestation","attest_author":"https://pith.science/pith/OEBHKGGOMZDYOWSIRG4IL6UAJ2/action/author_attestation","sign_citation":"https://pith.science/pith/OEBHKGGOMZDYOWSIRG4IL6UAJ2/action/citation_signature","submit_replication":"https://pith.science/pith/OEBHKGGOMZDYOWSIRG4IL6UAJ2/action/replication_record"}},"created_at":"2026-07-05T11:51:02.548415+00:00","updated_at":"2026-07-05T11:51:02.548415+00:00"}