{"as_of":"2026-08-08T19:44:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:eccdfdcaa8cf371899864f6f23fc4470a9194cb2e860d98990c5e5f0b2dd1147","coverage":[{"denominator":25,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":25,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T00:40:25.291518Z","state":"measured"},{"denominator":25,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":25,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2506.13223/citation-record","integrity":"/paper/2506.13223/integrity","json":"/paper/2506.13223/citation-record.json","paper":"/paper/2506.13223"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:40:29.642008Z","title":"Explainable artificial intelligence (XAI): Concepts, taxonomies, opportunities and challenges toward responsible AI,","venue":null,"work_id":"9a8595c4-afb6-4bac-8498-206beae9dcd3","year":2020},"citing_paper":{"arxiv_id":"2506.13223","last_updated":"2025-06-16T08:21:37Z","snapshot_observed_at":"2026-08-07T00:34:40.867347Z","submitted_at":"2025-06-16T08:21:37Z","title":"Towards Explaining Monte-Carlo Tree Search by Using Its Enhancements","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T00:40:23.627377Z"},"links":{"citing_paper":"/paper/2506.13223"},"observation_digest":"sha256:15d4b63f6dae645f0a8d8eb9e5e46204be1d53c8ede91cd0dcd25ef0dcfefaa5","observation_id":"7b0eda21-c72c-4410-b42d-e21047dd0ff4","resolution":{"observed_at":"2026-08-07T00:40:29.764614Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:40:29.407603Z","title":"A survey of methods for explaining black box models,","venue":null,"work_id":"55c11cc3-780c-4cff-9f90-7c0f793069f0","year":2018},"citing_paper":{"arxiv_id":"2506.13223","last_updated":"2025-06-16T08:21:37Z","snapshot_observed_at":"2026-08-07T00:34:40.867347Z","submitted_at":"2025-06-16T08:21:37Z","title":"Towards Explaining Monte-Carlo Tree Search by Using Its Enhancements","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T00:40:23.693819Z"},"links":{"citing_paper":"/paper/2506.13223"},"observation_digest":"sha256:5a3b1970a65974fc206aebf317efb787c3fe7298548587248e6a3823881723be","observation_id":"77f8c08c-2ddb-4f6a-9982-a95cd603ea06","resolution":{"observed_at":"2026-08-07T00:40:29.550238Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:40:29.121518Z","title":"Linguistic summaries as explanation mechanism for classification problems,","venue":null,"work_id":"201cf7ba-ac8b-4eb8-85c3-ec8889fc9f10","year":2022},"citing_paper":{"arxiv_id":"2506.13223","last_updated":"2025-06-16T08:21:37Z","snapshot_observed_at":"2026-08-07T00:34:40.867347Z","submitted_at":"2025-06-16T08:21:37Z","title":"Towards Explaining Monte-Carlo Tree Search by Using Its Enhancements","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T00:40:23.781194Z"},"links":{"citing_paper":"/paper/2506.13223"},"observation_digest":"sha256:96bdc5118c9b38e8fa4d389a17a496c0dd285d6d495b42bd8271bf529af2a26f","observation_id":"48325583-6319-449e-b5fc-6b5b30caac32","resolution":{"observed_at":"2026-08-07T00:40:29.229536Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:40:28.902698Z","title":"Explainable search,","venue":null,"work_id":"e1ec2686-131b-4c7b-b062-c26aff12ac4d","year":2020},"citing_paper":{"arxiv_id":"2506.13223","last_updated":"2025-06-16T08:21:37Z","snapshot_observed_at":"2026-08-07T00:34:40.867347Z","submitted_at":"2025-06-16T08:21:37Z","title":"Towards Explaining Monte-Carlo Tree Search by Using Its Enhancements","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T00:40:23.834222Z"},"links":{"citing_paper":"/paper/2506.13223"},"observation_digest":"sha256:f80861035f1fb5f6c0c0008dda3de5f110e0667699a8cae6edc7c8c4e6de0f89","observation_id":"05696cd1-7634-42b6-950f-cfd733f556bc","resolution":{"observed_at":"2026-08-07T00:40:29.010240Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:40:28.680876Z","title":"Efficient selectivity and backup operators in monte-carlo tree search,","venue":null,"work_id":"ecb79a45-671f-423a-9003-d043d4902ae3","year":2007},"citing_paper":{"arxiv_id":"2506.13223","last_updated":"2025-06-16T08:21:37Z","snapshot_observed_at":"2026-08-07T00:34:40.867347Z","submitted_at":"2025-06-16T08:21:37Z","title":"Towards Explaining Monte-Carlo Tree Search by Using Its Enhancements","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T00:40:23.915691Z"},"links":{"citing_paper":"/paper/2506.13223"},"observation_digest":"sha256:b7b18b7e94bc78e65c19a94d43768cb934dd8c7faafb171bc4e2ad7b6af1bab7","observation_id":"c1aefead-a9d9-4056-b121-3e10223185bf","resolution":{"observed_at":"2026-08-07T00:40:28.789267Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:40:28.379797Z","title":"Monte-Carlo Tree Search Solver,","venue":null,"work_id":"e819b494-6320-4bde-8aa1-152b1f5a1ece","year":2008},"citing_paper":{"arxiv_id":"2506.13223","last_updated":"2025-06-16T08:21:37Z","snapshot_observed_at":"2026-08-07T00:34:40.867347Z","submitted_at":"2025-06-16T08:21:37Z","title":"Towards Explaining Monte-Carlo Tree Search by Using Its Enhancements","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T00:40:23.984979Z"},"links":{"citing_paper":"/paper/2506.13223"},"observation_digest":"sha256:7d23542aa2ca85232739e14243fffa907b0b950a77372fdf7cffc5cc02fc80b5","observation_id":"608c0f47-0f46-4183-8f4b-6d964e9b6cf9","resolution":{"observed_at":"2026-08-07T00:40:28.531633Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:40:28.154039Z","title":"Simulation-based Approach to General Game Playing","venue":null,"work_id":"0bf6b18c-5685-4fc9-a6e0-9bad55d35eb7","year":2008},"citing_paper":{"arxiv_id":"2506.13223","last_updated":"2025-06-16T08:21:37Z","snapshot_observed_at":"2026-08-07T00:34:40.867347Z","submitted_at":"2025-06-16T08:21:37Z","title":"Towards Explaining Monte-Carlo Tree Search by Using Its Enhancements","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T00:40:24.048307Z"},"links":{"citing_paper":"/paper/2506.13223"},"observation_digest":"sha256:f6c51ad11f21f64e7420c75ccc68d938f1bafabd9d70416fc5620ee615dab83f","observation_id":"27110371-ecee-4a71-8ec3-d1b2a89bde28","resolution":{"observed_at":"2026-08-07T00:40:28.264460Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:40:27.761449Z","title":"Generalized rapid action value estimation,","venue":null,"work_id":"5b877537-27d6-40fa-aa45-380dabc6d894","year":2015},"citing_paper":{"arxiv_id":"2506.13223","last_updated":"2025-06-16T08:21:37Z","snapshot_observed_at":"2026-08-07T00:34:40.867347Z","submitted_at":"2025-06-16T08:21:37Z","title":"Towards Explaining Monte-Carlo Tree Search by Using Its Enhancements","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T00:40:24.114500Z"},"links":{"citing_paper":"/paper/2506.13223"},"observation_digest":"sha256:9d71decad84c2642f626e840e16e0c065a05aa6574378dab533fcfaca1cfdf86","observation_id":"83a1ebdd-2557-4e09-90a4-19ad2399ec91","resolution":{"observed_at":"2026-08-07T00:40:27.946034Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:40:27.471237Z","title":"N-Grams and the Last-Good-Reply Policy Applied in General Game Playing,","venue":null,"work_id":"ccfaa685-d649-4922-ba01-14e8078cc80e","year":2012},"citing_paper":{"arxiv_id":"2506.13223","last_updated":"2025-06-16T08:21:37Z","snapshot_observed_at":"2026-08-07T00:34:40.867347Z","submitted_at":"2025-06-16T08:21:37Z","title":"Towards Explaining Monte-Carlo Tree Search by Using Its Enhancements","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T00:40:24.178563Z"},"links":{"citing_paper":"/paper/2506.13223"},"observation_digest":"sha256:927fc10ab8d71941874d07ee47512bf9131009d227d09c48db3f2f6e29093f4b","observation_id":"a03e8334-7d2b-4c1d-93cc-8409158696a0","resolution":{"observed_at":"2026-08-07T00:40:27.586414Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:40:27.266993Z","title":"Proof Number Based Monte-Carlo Tree Search,","venue":null,"work_id":"c7f11b74-edc9-4ab2-a19b-055816a5f517","year":2024},"citing_paper":{"arxiv_id":"2506.13223","last_updated":"2025-06-16T08:21:37Z","snapshot_observed_at":"2026-08-07T00:34:40.867347Z","submitted_at":"2025-06-16T08:21:37Z","title":"Towards Explaining Monte-Carlo Tree Search by Using Its Enhancements","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T00:40:24.237483Z"},"links":{"citing_paper":"/paper/2506.13223"},"observation_digest":"sha256:f6207dd51097862ac256d253d1ef291891e2fc79907a30a907969c74694ba297","observation_id":"4b27e81c-80f4-4ae8-9ddd-eb76bc750296","resolution":{"observed_at":"2026-08-07T00:40:27.363521Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:40:27.034586Z","title":"Ludii – The Ludemic General Game System,","venue":null,"work_id":"60ad1898-43a7-4e1a-ace7-ffabdf51a8b4","year":2020},"citing_paper":{"arxiv_id":"2506.13223","last_updated":"2025-06-16T08:21:37Z","snapshot_observed_at":"2026-08-07T00:34:40.867347Z","submitted_at":"2025-06-16T08:21:37Z","title":"Towards Explaining Monte-Carlo Tree Search by Using Its Enhancements","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T00:40:24.307063Z"},"links":{"citing_paper":"/paper/2506.13223"},"observation_digest":"sha256:73db0724f83f6eaf0981021533910b289862b21d4fa0376fba4452963a8e0f44","observation_id":"68fbfe60-e327-426b-ad1d-f9ccc4fb4f7a","resolution":{"observed_at":"2026-08-07T00:40:27.132410Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:40:26.948261Z","title":"Towards explainable MCTS,","venue":null,"work_id":"fabcf7f5-3dca-498a-8537-9643dcaa603e","year":2021},"citing_paper":{"arxiv_id":"2506.13223","last_updated":"2025-06-16T08:21:37Z","snapshot_observed_at":"2026-08-07T00:34:40.867347Z","submitted_at":"2025-06-16T08:21:37Z","title":"Towards Explaining Monte-Carlo Tree Search by Using Its Enhancements","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T00:40:24.357795Z"},"links":{"citing_paper":"/paper/2506.13223"},"observation_digest":"sha256:b1d944555eaf3816a55bc2b7379f53265642c66ba393b28b1eb98a3c9312ac14","observation_id":"dea17a3c-feb4-4e60-b45e-f621442d7158","resolution":{"observed_at":"2026-08-07T00:40:26.982239Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:40:26.797634Z","title":"Enabling MCTS explainability for sequential planning through computation tree logic,","venue":null,"work_id":"535fb94d-b253-420e-8057-dd046ad3e7a0","year":2024},"citing_paper":{"arxiv_id":"2506.13223","last_updated":"2025-06-16T08:21:37Z","snapshot_observed_at":"2026-08-07T00:34:40.867347Z","submitted_at":"2025-06-16T08:21:37Z","title":"Towards Explaining Monte-Carlo Tree Search by Using Its Enhancements","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T00:40:24.433365Z"},"links":{"citing_paper":"/paper/2506.13223"},"observation_digest":"sha256:1b7ed7bf7155dc1e224dc5c659ddebed2c70c90640ef6c83ba3d7aaed4991b01","observation_id":"5cce1a13-a108-4e1a-a8f6-4973e6a3bf89","resolution":{"observed_at":"2026-08-07T00:40:26.864390Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:40:26.667606Z","title":"Explainable search: An exploratory study in SameGame,","venue":null,"work_id":"f5a290f2-e341-46d7-9c13-bcd7f82b7c01","year":2023},"citing_paper":{"arxiv_id":"2506.13223","last_updated":"2025-06-16T08:21:37Z","snapshot_observed_at":"2026-08-07T00:34:40.867347Z","submitted_at":"2025-06-16T08:21:37Z","title":"Towards Explaining Monte-Carlo Tree Search by Using Its Enhancements","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T00:40:24.474066Z"},"links":{"citing_paper":"/paper/2506.13223"},"observation_digest":"sha256:a39cb27f084e91b2ac2f3a48dfe8af783d54b994822b8a9e8d8b9b83f839bc34","observation_id":"c97caa30-7e13-458f-b7bf-c0c6246c4a0e","resolution":{"observed_at":"2026-08-07T00:40:26.726139Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:40:26.526344Z","title":"Searching for Explainable Solutions in Sudoku,","venue":null,"work_id":"c927a706-d5fe-457f-8652-c7aaae7b9edb","year":2021},"citing_paper":{"arxiv_id":"2506.13223","last_updated":"2025-06-16T08:21:37Z","snapshot_observed_at":"2026-08-07T00:34:40.867347Z","submitted_at":"2025-06-16T08:21:37Z","title":"Towards Explaining Monte-Carlo Tree Search by Using Its Enhancements","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T00:40:24.575247Z"},"links":{"citing_paper":"/paper/2506.13223"},"observation_digest":"sha256:3866fccfe09cb03d8acbe8b84296b1b256ba5e3208f1976bd18566883c827dd6","observation_id":"6ee9699e-6ad6-44bc-9ea6-03902bd26de9","resolution":{"observed_at":"2026-08-07T00:40:26.604555Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.00610","last_updated":"2025-05-01T15:40:58Z","snapshot_observed_at":"2026-08-07T15:57:20.677962Z","submitted_at":"2025-05-01T15:40:58Z","title":"Combining LLMs with Logic-Based Framework to Explain MCTS","version":1},"cited_work":{"arxiv_id":"2505.00610","doi":null,"metadata_source":"pith","pith_arxiv_id":"2505.00610","snapshot_observed_at":"2026-08-07T00:40:25.407138Z","title":"Combining LLMs with Logic-Based Framework to Explain MCTS","venue":"cs.AI","work_id":"123601ea-ce0b-49b8-99d2-4368696b7f29","year":2025},"citing_paper":{"arxiv_id":"2506.13223","last_updated":"2025-06-16T08:21:37Z","snapshot_observed_at":"2026-08-07T00:34:40.867347Z","submitted_at":"2025-06-16T08:21:37Z","title":"Towards Explaining Monte-Carlo Tree Search by Using Its Enhancements","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T00:40:24.664719Z"},"links":{"cited_paper":"/paper/2505.00610","citing_paper":"/paper/2506.13223"},"observation_digest":"sha256:83432600ef8b28226fca724c87c2c1ec02d23694bebc5f19a740dd4603146650","observation_id":"fd7c4bf1-bd5b-452f-b763-9fc54c8ce09a","resolution":{"observed_at":"2026-08-07T00:40:25.439701Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.01707","last_updated":"2024-12-25T13:32:54Z","snapshot_observed_at":"2026-07-06T19:26:22.646942Z","submitted_at":"2024-10-02T16:15:31Z","title":"Interpretable Contrastive Monte Carlo Tree Search Reasoning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.01707","snapshot_observed_at":"2026-08-07T00:40:24.740620Z","title":"Interpretable contrastive monte carlo tree search reasoning,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.13223","last_updated":"2025-06-16T08:21:37Z","snapshot_observed_at":"2026-08-07T00:34:40.867347Z","submitted_at":"2025-06-16T08:21:37Z","title":"Towards Explaining Monte-Carlo Tree Search by Using Its Enhancements","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T00:40:24.740620Z"},"links":{"cited_paper":"/paper/2410.01707","citing_paper":"/paper/2506.13223"},"observation_digest":"sha256:527e2f09e304f2d29c987c168efca6043ca3422863cb0495f290a770b109a2fb","observation_id":"636a3449-caa7-46d2-a524-67c0be1237ef","resolution":{"observed_at":"2026-08-07T00:40:24.740620Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:40:26.361136Z","title":"GameTable Working Group 1 meeting report on search, planning, learning, and explainability,","venue":null,"work_id":"c15dbff1-106f-48ac-a2c7-5321e41561db","year":2024},"citing_paper":{"arxiv_id":"2506.13223","last_updated":"2025-06-16T08:21:37Z","snapshot_observed_at":"2026-08-07T00:34:40.867347Z","submitted_at":"2025-06-16T08:21:37Z","title":"Towards Explaining Monte-Carlo Tree Search by Using Its Enhancements","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T00:40:24.853825Z"},"links":{"citing_paper":"/paper/2506.13223"},"observation_digest":"sha256:08706f11cf6f5bfdf7f6514d014bac07d64bc3f0ac4df649376c0929a9127d32","observation_id":"3f0e2123-df9b-422e-92c3-31a3dd3a412a","resolution":{"observed_at":"2026-08-07T00:40:26.449452Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:40:26.201824Z","title":"General game heuristic prediction based on ludeme descriptions,","venue":null,"work_id":"7a8c6024-ce5a-4ea2-b266-4695f1a25ef8","year":2021},"citing_paper":{"arxiv_id":"2506.13223","last_updated":"2025-06-16T08:21:37Z","snapshot_observed_at":"2026-08-07T00:34:40.867347Z","submitted_at":"2025-06-16T08:21:37Z","title":"Towards Explaining Monte-Carlo Tree Search by Using Its Enhancements","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T00:40:24.920878Z"},"links":{"citing_paper":"/paper/2506.13223"},"observation_digest":"sha256:ad8154f7b8deb0d523480a1518607393eb987d968e4013405ae88c48913d3ee2","observation_id":"8294cc07-1ef2-40ad-a368-a828c80b7824","resolution":{"observed_at":"2026-08-07T00:40:26.250886Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:40:26.076319Z","title":"Monte Carlo Tree Search: A Review of Recent Modifications and Applications,","venue":null,"work_id":"a49779b9-2f26-4b98-929d-273f38469c02","year":2023},"citing_paper":{"arxiv_id":"2506.13223","last_updated":"2025-06-16T08:21:37Z","snapshot_observed_at":"2026-08-07T00:34:40.867347Z","submitted_at":"2025-06-16T08:21:37Z","title":"Towards Explaining Monte-Carlo Tree Search by Using Its Enhancements","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T00:40:24.999338Z"},"links":{"citing_paper":"/paper/2506.13223"},"observation_digest":"sha256:d7df7d8cf5ccf151302f135a9dce1fed116ad6fd16577613aab494ab1bdce6d9","observation_id":"e6e13ef8-2590-4940-bd8c-f3ffcd0addd9","resolution":{"observed_at":"2026-08-07T00:40:26.141290Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:40:25.936233Z","title":"Combining Online and Offline Knowledge in UCT,","venue":null,"work_id":"d61d9f45-b158-48b6-b387-77a061ccf6ab","year":2007},"citing_paper":{"arxiv_id":"2506.13223","last_updated":"2025-06-16T08:21:37Z","snapshot_observed_at":"2026-08-07T00:34:40.867347Z","submitted_at":"2025-06-16T08:21:37Z","title":"Towards Explaining Monte-Carlo Tree Search by Using Its Enhancements","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T00:40:25.051536Z"},"links":{"citing_paper":"/paper/2506.13223"},"observation_digest":"sha256:cc9747d040acbeef01f716fdccfea507f7a579db7aef53df94a383983d97df4b","observation_id":"9b5fb5bd-389c-41f8-90ea-2a1ea8144eab","resolution":{"observed_at":"2026-08-07T00:40:26.012460Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:40:25.822005Z","title":"Score Bounded Monte-Carlo Tree Search,","venue":null,"work_id":"39c0a1ca-d571-4cee-91b6-8554a94bb942","year":2011},"citing_paper":{"arxiv_id":"2506.13223","last_updated":"2025-06-16T08:21:37Z","snapshot_observed_at":"2026-08-07T00:34:40.867347Z","submitted_at":"2025-06-16T08:21:37Z","title":"Towards Explaining Monte-Carlo Tree Search by Using Its Enhancements","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T00:40:25.122000Z"},"links":{"citing_paper":"/paper/2506.13223"},"observation_digest":"sha256:02387e8b22d842d7725c4f614bebcc41a2c97b2a903daf97bb913c1b53bc7206","observation_id":"3e224a02-d552-445c-ab2d-127ccbcbd6f5","resolution":{"observed_at":"2026-08-07T00:40:25.878309Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:40:25.704847Z","title":"Proof-number search,","venue":null,"work_id":"dca9a33d-b4f4-448a-b316-afb264645032","year":1994},"citing_paper":{"arxiv_id":"2506.13223","last_updated":"2025-06-16T08:21:37Z","snapshot_observed_at":"2026-08-07T00:34:40.867347Z","submitted_at":"2025-06-16T08:21:37Z","title":"Towards Explaining Monte-Carlo Tree Search by Using Its Enhancements","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T00:40:25.188587Z"},"links":{"citing_paper":"/paper/2506.13223"},"observation_digest":"sha256:eec03f8fda396fbb1ebab8b5f33f44d7912ac71cc68edd95dd94977527c1408e","observation_id":"6fba1630-49d8-4d0e-9a0c-90e1b5750276","resolution":{"observed_at":"2026-08-07T00:40:25.740702Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:40:25.608814Z","title":"The power of forgetting: Improving the last- good-reply policy in Monte Carlo Go,","venue":null,"work_id":"df72b9a5-7520-4ad2-98a6-8a60a5c6f8f1","year":2010},"citing_paper":{"arxiv_id":"2506.13223","last_updated":"2025-06-16T08:21:37Z","snapshot_observed_at":"2026-08-07T00:34:40.867347Z","submitted_at":"2025-06-16T08:21:37Z","title":"Towards Explaining Monte-Carlo Tree Search by Using Its Enhancements","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T00:40:25.226339Z"},"links":{"citing_paper":"/paper/2506.13223"},"observation_digest":"sha256:b2ac35641e56308f3f36de970fb5c5edfc3c8b2f86bd4e0160024776e1f0a22d","observation_id":"2d476a26-dd44-4fd3-b5c1-0852a03f79e3","resolution":{"observed_at":"2026-08-07T00:40:25.658839Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:40:25.514042Z","title":"Transpositions and Move Groups in Monte Carlo Tree Search,","venue":null,"work_id":"42a9e751-54f2-4142-a61c-a7383712f0d1","year":2008},"citing_paper":{"arxiv_id":"2506.13223","last_updated":"2025-06-16T08:21:37Z","snapshot_observed_at":"2026-08-07T00:34:40.867347Z","submitted_at":"2025-06-16T08:21:37Z","title":"Towards Explaining Monte-Carlo Tree Search by Using Its Enhancements","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T00:40:25.291518Z"},"links":{"citing_paper":"/paper/2506.13223"},"observation_digest":"sha256:c34f916ac350a73c08d45240d8082c2d3f212bbf4cafcf01b7fd2db4e05f3676","observation_id":"be5f739a-77fe-49d0-a86a-10fdd348c90c","resolution":{"observed_at":"2026-08-07T00:40:25.556757Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.13223","last_updated":"2025-06-16T08:21:37Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-07T00:34:40.867347Z","submitted_at":"2025-06-16T08:21:37Z","title":"Towards Explaining Monte-Carlo Tree Search by Using Its Enhancements"},"reference_resolution":{"displayed":25,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":1,"verified_fuzzy":23},"total_outbound_references":25},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 25 of 25 outbound references and 0 inbound Pith citation observations for arXiv:2506.13223."}