{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:J2CL2OFQLJH2RLSYGKAYJE55NO","short_pith_number":"pith:J2CL2OFQ","schema_version":"1.0","canonical_sha256":"4e84bd38b05a4fa8ae5832818493bd6bbc3bee1989010e6732ab5aaf5bb6bcef","source":{"kind":"arxiv","id":"2605.16524","version":1},"attestation_state":"computed","paper":{"title":"Toward Template-Free Explainability for Monte Carlo Tree Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.HC","authors_text":"Ayan Mukhopadhyay, Hemant Purohit, Hiba Baroud, MirSaleh Bahavarnia, Siqi Lu, Yixuan Zhang","submitted_at":"2026-05-15T18:20:52Z","abstract_excerpt":"Probabilistic search algorithms, such as Monte Carlo Tree Search (MCTS), have proven very effective in solving sequential decision-making tasks under uncertainty. However, interpreting asymmetric search trees that incorporate bandit-based tree traversal and simulation-based value estimation is difficult for end users based solely on raw tree statistics. While prior work requires hand-crafted formal logic constraints that must be updated when the problem changes, we present a framework that enables large language models (LLMs) to generate evidence-grounded explanations of MCTS decisions from re"},"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":"2605.16524","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.HC","submitted_at":"2026-05-15T18:20:52Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"78a397dfce1740c606b410324b0d6ccc3fa7e1fc4c677d47fa5da915c840d6b9","abstract_canon_sha256":"cdafb59edacf493ab14fda9c92693d7f54d7f90a2ea072ade514e36bd246d8d3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:02:27.310257Z","signature_b64":"e1NAa0u9eVFfhC+lkCmOXnPrkO8uojedDmOsR9lDEAOoOF191dCOdy58w1fvX4mrscXOLe4gGZd11HsTKAwMBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e84bd38b05a4fa8ae5832818493bd6bbc3bee1989010e6732ab5aaf5bb6bcef","last_reissued_at":"2026-05-20T00:02:27.309439Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:02:27.309439Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Toward Template-Free Explainability for Monte Carlo Tree Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.HC","authors_text":"Ayan Mukhopadhyay, Hemant Purohit, Hiba Baroud, MirSaleh Bahavarnia, Siqi Lu, Yixuan Zhang","submitted_at":"2026-05-15T18:20:52Z","abstract_excerpt":"Probabilistic search algorithms, such as Monte Carlo Tree Search (MCTS), have proven very effective in solving sequential decision-making tasks under uncertainty. However, interpreting asymmetric search trees that incorporate bandit-based tree traversal and simulation-based value estimation is difficult for end users based solely on raw tree statistics. While prior work requires hand-crafted formal logic constraints that must be updated when the problem changes, we present a framework that enables large language models (LLMs) to generate evidence-grounded explanations of MCTS decisions from re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.16524","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/2605.16524/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-19T19:33:23.078259Z","status":"skipped","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T19:21:56.943134Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"c393828e28dd808fe6437b539995b2d6509e7100dac1125af093668af7f78117"},"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":"2605.16524","created_at":"2026-05-20T00:02:27.309563+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.16524v1","created_at":"2026-05-20T00:02:27.309563+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16524","created_at":"2026-05-20T00:02:27.309563+00:00"},{"alias_kind":"pith_short_12","alias_value":"J2CL2OFQLJH2","created_at":"2026-05-20T00:02:27.309563+00:00"},{"alias_kind":"pith_short_16","alias_value":"J2CL2OFQLJH2RLSY","created_at":"2026-05-20T00:02:27.309563+00:00"},{"alias_kind":"pith_short_8","alias_value":"J2CL2OFQ","created_at":"2026-05-20T00:02:27.309563+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/J2CL2OFQLJH2RLSYGKAYJE55NO","json":"https://pith.science/pith/J2CL2OFQLJH2RLSYGKAYJE55NO.json","graph_json":"https://pith.science/api/pith-number/J2CL2OFQLJH2RLSYGKAYJE55NO/graph.json","events_json":"https://pith.science/api/pith-number/J2CL2OFQLJH2RLSYGKAYJE55NO/events.json","paper":"https://pith.science/paper/J2CL2OFQ"},"agent_actions":{"view_html":"https://pith.science/pith/J2CL2OFQLJH2RLSYGKAYJE55NO","download_json":"https://pith.science/pith/J2CL2OFQLJH2RLSYGKAYJE55NO.json","view_paper":"https://pith.science/paper/J2CL2OFQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.16524&json=true","fetch_graph":"https://pith.science/api/pith-number/J2CL2OFQLJH2RLSYGKAYJE55NO/graph.json","fetch_events":"https://pith.science/api/pith-number/J2CL2OFQLJH2RLSYGKAYJE55NO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J2CL2OFQLJH2RLSYGKAYJE55NO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J2CL2OFQLJH2RLSYGKAYJE55NO/action/storage_attestation","attest_author":"https://pith.science/pith/J2CL2OFQLJH2RLSYGKAYJE55NO/action/author_attestation","sign_citation":"https://pith.science/pith/J2CL2OFQLJH2RLSYGKAYJE55NO/action/citation_signature","submit_replication":"https://pith.science/pith/J2CL2OFQLJH2RLSYGKAYJE55NO/action/replication_record"}},"created_at":"2026-05-20T00:02:27.309563+00:00","updated_at":"2026-05-20T00:02:27.309563+00:00"}