{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:643DFB5KGUXTWVUKZM2PH7VSYK","short_pith_number":"pith:643DFB5K","schema_version":"1.0","canonical_sha256":"f7363287aa352f3b568acb34f3feb2c295698f447b8cefb7156ff7ccb6a8bfbf","source":{"kind":"arxiv","id":"1009.0550","version":1},"attestation_state":"computed","paper":{"title":"Optimizing Selective Search in Chess","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.AI","authors_text":"Moshe Koppel, Nathan S. Netanyahu, Omid David-Tabibi","submitted_at":"2010-09-02T21:41:45Z","abstract_excerpt":"In this paper we introduce a novel method for automatically tuning the search parameters of a chess program using genetic algorithms. Our results show that a large set of parameter values can be learned automatically, such that the resulting performance is comparable with that of manually tuned parameters of top tournament-playing chess programs."},"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":"1009.0550","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2010-09-02T21:41:45Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"01bc2020fddc1a08e034ef5edddf16637a0bf22d4337502c39ae875927e917fd","abstract_canon_sha256":"c67a4071e7313c0d219a41e09fe3cee25eeefe912dc11515b147d424d32f139b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:41:25.904439Z","signature_b64":"P6Y3VvyqREaaQ0DW0fkdhNgMrqTQAKrv3Gf983GJpHNb+aUPBcP89bJfvepTd2tvhKUnNKC002tF97bgfeBBAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7363287aa352f3b568acb34f3feb2c295698f447b8cefb7156ff7ccb6a8bfbf","last_reissued_at":"2026-05-18T04:41:25.903832Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:41:25.903832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimizing Selective Search in Chess","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.AI","authors_text":"Moshe Koppel, Nathan S. Netanyahu, Omid David-Tabibi","submitted_at":"2010-09-02T21:41:45Z","abstract_excerpt":"In this paper we introduce a novel method for automatically tuning the search parameters of a chess program using genetic algorithms. Our results show that a large set of parameter values can be learned automatically, such that the resulting performance is comparable with that of manually tuned parameters of top tournament-playing chess programs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.0550","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":"1009.0550","created_at":"2026-05-18T04:41:25.903926+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.0550v1","created_at":"2026-05-18T04:41:25.903926+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.0550","created_at":"2026-05-18T04:41:25.903926+00:00"},{"alias_kind":"pith_short_12","alias_value":"643DFB5KGUXT","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_16","alias_value":"643DFB5KGUXTWVUK","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_8","alias_value":"643DFB5K","created_at":"2026-05-18T12:26:04.259169+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/643DFB5KGUXTWVUKZM2PH7VSYK","json":"https://pith.science/pith/643DFB5KGUXTWVUKZM2PH7VSYK.json","graph_json":"https://pith.science/api/pith-number/643DFB5KGUXTWVUKZM2PH7VSYK/graph.json","events_json":"https://pith.science/api/pith-number/643DFB5KGUXTWVUKZM2PH7VSYK/events.json","paper":"https://pith.science/paper/643DFB5K"},"agent_actions":{"view_html":"https://pith.science/pith/643DFB5KGUXTWVUKZM2PH7VSYK","download_json":"https://pith.science/pith/643DFB5KGUXTWVUKZM2PH7VSYK.json","view_paper":"https://pith.science/paper/643DFB5K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.0550&json=true","fetch_graph":"https://pith.science/api/pith-number/643DFB5KGUXTWVUKZM2PH7VSYK/graph.json","fetch_events":"https://pith.science/api/pith-number/643DFB5KGUXTWVUKZM2PH7VSYK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/643DFB5KGUXTWVUKZM2PH7VSYK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/643DFB5KGUXTWVUKZM2PH7VSYK/action/storage_attestation","attest_author":"https://pith.science/pith/643DFB5KGUXTWVUKZM2PH7VSYK/action/author_attestation","sign_citation":"https://pith.science/pith/643DFB5KGUXTWVUKZM2PH7VSYK/action/citation_signature","submit_replication":"https://pith.science/pith/643DFB5KGUXTWVUKZM2PH7VSYK/action/replication_record"}},"created_at":"2026-05-18T04:41:25.903926+00:00","updated_at":"2026-05-18T04:41:25.903926+00:00"}