{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:VMNDYB4K6BI6X7SVNJXUIHLAUE","short_pith_number":"pith:VMNDYB4K","schema_version":"1.0","canonical_sha256":"ab1a3c078af051ebfe556a6f441d60a13b169684da2aa9d3bb9514b060740bb7","source":{"kind":"arxiv","id":"1208.4692","version":3},"attestation_state":"computed","paper":{"title":"Monte Carlo Search Algorithm Discovery for One Player Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.AI","authors_text":"Damien Ernst, David Lupien St-Pierre, Francis Maes","submitted_at":"2012-08-23T08:44:59Z","abstract_excerpt":"Much current research in AI and games is being devoted to Monte Carlo search (MCS) algorithms. While the quest for a single unified MCS algorithm that would perform well on all problems is of major interest for AI, practitioners often know in advance the problem they want to solve, and spend plenty of time exploiting this knowledge to customize their MCS algorithm in a problem-driven way. We propose an MCS algorithm discovery scheme to perform this in an automatic and reproducible way. We first introduce a grammar over MCS algorithms that enables inducing a rich space of candidate algorithms. "},"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":"1208.4692","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-08-23T08:44:59Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"eadc9d4ef571afc28987f01e85fc27af9ba81eda9345f853e24a74bfb122816a","abstract_canon_sha256":"161cdeaa6149ec53ea546f6d53595f728ba2b9fe4d690f4a0376348abdf71fee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:00.591114Z","signature_b64":"xVBYyQwXAXtEs2RF93/52C5zejSW4RU/FFh+Go9ptn4v7XdmvTnT94lqxJ/7cQTY4LwS6J/uriuwTH98IM/WCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab1a3c078af051ebfe556a6f441d60a13b169684da2aa9d3bb9514b060740bb7","last_reissued_at":"2026-05-18T02:21:00.590626Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:00.590626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Monte Carlo Search Algorithm Discovery for One Player Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.AI","authors_text":"Damien Ernst, David Lupien St-Pierre, Francis Maes","submitted_at":"2012-08-23T08:44:59Z","abstract_excerpt":"Much current research in AI and games is being devoted to Monte Carlo search (MCS) algorithms. While the quest for a single unified MCS algorithm that would perform well on all problems is of major interest for AI, practitioners often know in advance the problem they want to solve, and spend plenty of time exploiting this knowledge to customize their MCS algorithm in a problem-driven way. We propose an MCS algorithm discovery scheme to perform this in an automatic and reproducible way. We first introduce a grammar over MCS algorithms that enables inducing a rich space of candidate algorithms. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.4692","kind":"arxiv","version":3},"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":"1208.4692","created_at":"2026-05-18T02:21:00.590693+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.4692v3","created_at":"2026-05-18T02:21:00.590693+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.4692","created_at":"2026-05-18T02:21:00.590693+00:00"},{"alias_kind":"pith_short_12","alias_value":"VMNDYB4K6BI6","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"VMNDYB4K6BI6X7SV","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"VMNDYB4K","created_at":"2026-05-18T12:27:25.539911+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/VMNDYB4K6BI6X7SVNJXUIHLAUE","json":"https://pith.science/pith/VMNDYB4K6BI6X7SVNJXUIHLAUE.json","graph_json":"https://pith.science/api/pith-number/VMNDYB4K6BI6X7SVNJXUIHLAUE/graph.json","events_json":"https://pith.science/api/pith-number/VMNDYB4K6BI6X7SVNJXUIHLAUE/events.json","paper":"https://pith.science/paper/VMNDYB4K"},"agent_actions":{"view_html":"https://pith.science/pith/VMNDYB4K6BI6X7SVNJXUIHLAUE","download_json":"https://pith.science/pith/VMNDYB4K6BI6X7SVNJXUIHLAUE.json","view_paper":"https://pith.science/paper/VMNDYB4K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.4692&json=true","fetch_graph":"https://pith.science/api/pith-number/VMNDYB4K6BI6X7SVNJXUIHLAUE/graph.json","fetch_events":"https://pith.science/api/pith-number/VMNDYB4K6BI6X7SVNJXUIHLAUE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VMNDYB4K6BI6X7SVNJXUIHLAUE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VMNDYB4K6BI6X7SVNJXUIHLAUE/action/storage_attestation","attest_author":"https://pith.science/pith/VMNDYB4K6BI6X7SVNJXUIHLAUE/action/author_attestation","sign_citation":"https://pith.science/pith/VMNDYB4K6BI6X7SVNJXUIHLAUE/action/citation_signature","submit_replication":"https://pith.science/pith/VMNDYB4K6BI6X7SVNJXUIHLAUE/action/replication_record"}},"created_at":"2026-05-18T02:21:00.590693+00:00","updated_at":"2026-05-18T02:21:00.590693+00:00"}