{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:YXQ5FVNRNIVK26HZVPOAD3WOCB","short_pith_number":"pith:YXQ5FVNR","schema_version":"1.0","canonical_sha256":"c5e1d2d5b16a2aad78f9abdc01eece10719a4c554e8235f27381e7feecd1d1c7","source":{"kind":"arxiv","id":"1912.11323","version":2},"attestation_state":"computed","paper":{"title":"Bidding in Spades","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Gal Cohensius, Nadav Oved, Reshef Meir, Roni Stern","submitted_at":"2019-12-24T12:49:53Z","abstract_excerpt":"We present a Spades bidding algorithm that is superior to recreational human players and to publicly available bots. Like in Bridge, the game of Spades is composed of two independent phases, \\textit{bidding} and \\textit{playing}. This paper focuses on the bidding algorithm, since this phase holds a precise challenge: based on the input, choose the bid that maximizes the agent's winning probability. Our \\emph{Bidding-in-Spades} (BIS) algorithm heuristically determines the bidding strategy by comparing the expected utility of each possible bid. A major challenge is how to estimate these expected"},"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":"1912.11323","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-12-24T12:49:53Z","cross_cats_sorted":[],"title_canon_sha256":"d50d487572d7ff7cf40b66112cfdd8c0fbcc72a1496847b9bfc66b35158d6902","abstract_canon_sha256":"0d4b2865d8eac3266b15afde62aa8857609d316fdcb9133ff930c71e915c60b6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:39:16.337763Z","signature_b64":"CqABtCNcE90voUjX+el1xFNvetn8Evgo2/ptG6qd4Nz9tvGrKXzDFFDrCu2Ytj/ljTCxLf/8a3v4jzDu8SNBBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c5e1d2d5b16a2aad78f9abdc01eece10719a4c554e8235f27381e7feecd1d1c7","last_reissued_at":"2026-07-05T00:39:16.337308Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:39:16.337308Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bidding in Spades","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Gal Cohensius, Nadav Oved, Reshef Meir, Roni Stern","submitted_at":"2019-12-24T12:49:53Z","abstract_excerpt":"We present a Spades bidding algorithm that is superior to recreational human players and to publicly available bots. Like in Bridge, the game of Spades is composed of two independent phases, \\textit{bidding} and \\textit{playing}. This paper focuses on the bidding algorithm, since this phase holds a precise challenge: based on the input, choose the bid that maximizes the agent's winning probability. Our \\emph{Bidding-in-Spades} (BIS) algorithm heuristically determines the bidding strategy by comparing the expected utility of each possible bid. A major challenge is how to estimate these expected"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.11323","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1912.11323/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":"1912.11323","created_at":"2026-07-05T00:39:16.337373+00:00"},{"alias_kind":"arxiv_version","alias_value":"1912.11323v2","created_at":"2026-07-05T00:39:16.337373+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.11323","created_at":"2026-07-05T00:39:16.337373+00:00"},{"alias_kind":"pith_short_12","alias_value":"YXQ5FVNRNIVK","created_at":"2026-07-05T00:39:16.337373+00:00"},{"alias_kind":"pith_short_16","alias_value":"YXQ5FVNRNIVK26HZ","created_at":"2026-07-05T00:39:16.337373+00:00"},{"alias_kind":"pith_short_8","alias_value":"YXQ5FVNR","created_at":"2026-07-05T00:39:16.337373+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/YXQ5FVNRNIVK26HZVPOAD3WOCB","json":"https://pith.science/pith/YXQ5FVNRNIVK26HZVPOAD3WOCB.json","graph_json":"https://pith.science/api/pith-number/YXQ5FVNRNIVK26HZVPOAD3WOCB/graph.json","events_json":"https://pith.science/api/pith-number/YXQ5FVNRNIVK26HZVPOAD3WOCB/events.json","paper":"https://pith.science/paper/YXQ5FVNR"},"agent_actions":{"view_html":"https://pith.science/pith/YXQ5FVNRNIVK26HZVPOAD3WOCB","download_json":"https://pith.science/pith/YXQ5FVNRNIVK26HZVPOAD3WOCB.json","view_paper":"https://pith.science/paper/YXQ5FVNR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1912.11323&json=true","fetch_graph":"https://pith.science/api/pith-number/YXQ5FVNRNIVK26HZVPOAD3WOCB/graph.json","fetch_events":"https://pith.science/api/pith-number/YXQ5FVNRNIVK26HZVPOAD3WOCB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YXQ5FVNRNIVK26HZVPOAD3WOCB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YXQ5FVNRNIVK26HZVPOAD3WOCB/action/storage_attestation","attest_author":"https://pith.science/pith/YXQ5FVNRNIVK26HZVPOAD3WOCB/action/author_attestation","sign_citation":"https://pith.science/pith/YXQ5FVNRNIVK26HZVPOAD3WOCB/action/citation_signature","submit_replication":"https://pith.science/pith/YXQ5FVNRNIVK26HZVPOAD3WOCB/action/replication_record"}},"created_at":"2026-07-05T00:39:16.337373+00:00","updated_at":"2026-07-05T00:39:16.337373+00:00"}