{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:5QJ5GXMW4JPKF6W6DGVJ74VPCR","short_pith_number":"pith:5QJ5GXMW","schema_version":"1.0","canonical_sha256":"ec13d35d96e25ea2fade19aa9ff2af1450a401372f6842dd0dce435af778f029","source":{"kind":"arxiv","id":"1702.03401","version":1},"attestation_state":"computed","paper":{"title":"A Minimax Algorithm Better Than Alpha-beta?: No and Yes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Arie de Bruin, Aske Plaat, Jonathan Schaeffer, Wim Pijls","submitted_at":"2017-02-11T09:48:12Z","abstract_excerpt":"This paper has three main contributions to our understanding of fixed-depth minimax search: (A) A new formulation for Stockman's SSS* algorithm, based on Alpha-Beta, is presented. It solves all the perceived drawbacks of SSS*, finally transforming it into a practical algorithm. In effect, we show that SSS* = alpha-beta + ransposition tables. The crucial step is the realization that transposition tables contain so-called solution trees, structures that are used in best-first search algorithms like SSS*. Having created a practical version, we present performance measurements with tournament game"},"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":"1702.03401","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-02-11T09:48:12Z","cross_cats_sorted":[],"title_canon_sha256":"760b7d879a11291bd95f232e79185dd1abcc496a2f7b3af88331f4d8a6a13de5","abstract_canon_sha256":"78d224035448097eab33e77db59b69d09e6130219fefdcbd67356330cf8bf7d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:35.068853Z","signature_b64":"4qLHpN54Q8+FypekCoOjOKX+tMlS+MQVsG/uMTK8RJEA0vk7mWHRHIYYtNcjjW7dlx3AdWtIjMqqrARcH7VBAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec13d35d96e25ea2fade19aa9ff2af1450a401372f6842dd0dce435af778f029","last_reissued_at":"2026-05-18T00:50:35.068056Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:35.068056Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Minimax Algorithm Better Than Alpha-beta?: No and Yes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Arie de Bruin, Aske Plaat, Jonathan Schaeffer, Wim Pijls","submitted_at":"2017-02-11T09:48:12Z","abstract_excerpt":"This paper has three main contributions to our understanding of fixed-depth minimax search: (A) A new formulation for Stockman's SSS* algorithm, based on Alpha-Beta, is presented. It solves all the perceived drawbacks of SSS*, finally transforming it into a practical algorithm. In effect, we show that SSS* = alpha-beta + ransposition tables. The crucial step is the realization that transposition tables contain so-called solution trees, structures that are used in best-first search algorithms like SSS*. Having created a practical version, we present performance measurements with tournament game"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.03401","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1702.03401","created_at":"2026-05-18T00:50:35.068175+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.03401v1","created_at":"2026-05-18T00:50:35.068175+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.03401","created_at":"2026-05-18T00:50:35.068175+00:00"},{"alias_kind":"pith_short_12","alias_value":"5QJ5GXMW4JPK","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"5QJ5GXMW4JPKF6W6","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"5QJ5GXMW","created_at":"2026-05-18T12:31:00.734936+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/5QJ5GXMW4JPKF6W6DGVJ74VPCR","json":"https://pith.science/pith/5QJ5GXMW4JPKF6W6DGVJ74VPCR.json","graph_json":"https://pith.science/api/pith-number/5QJ5GXMW4JPKF6W6DGVJ74VPCR/graph.json","events_json":"https://pith.science/api/pith-number/5QJ5GXMW4JPKF6W6DGVJ74VPCR/events.json","paper":"https://pith.science/paper/5QJ5GXMW"},"agent_actions":{"view_html":"https://pith.science/pith/5QJ5GXMW4JPKF6W6DGVJ74VPCR","download_json":"https://pith.science/pith/5QJ5GXMW4JPKF6W6DGVJ74VPCR.json","view_paper":"https://pith.science/paper/5QJ5GXMW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.03401&json=true","fetch_graph":"https://pith.science/api/pith-number/5QJ5GXMW4JPKF6W6DGVJ74VPCR/graph.json","fetch_events":"https://pith.science/api/pith-number/5QJ5GXMW4JPKF6W6DGVJ74VPCR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5QJ5GXMW4JPKF6W6DGVJ74VPCR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5QJ5GXMW4JPKF6W6DGVJ74VPCR/action/storage_attestation","attest_author":"https://pith.science/pith/5QJ5GXMW4JPKF6W6DGVJ74VPCR/action/author_attestation","sign_citation":"https://pith.science/pith/5QJ5GXMW4JPKF6W6DGVJ74VPCR/action/citation_signature","submit_replication":"https://pith.science/pith/5QJ5GXMW4JPKF6W6DGVJ74VPCR/action/replication_record"}},"created_at":"2026-05-18T00:50:35.068175+00:00","updated_at":"2026-05-18T00:50:35.068175+00:00"}