{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:JI3TORXDHJ56WOA3JIQQYRHRQN","short_pith_number":"pith:JI3TORXD","schema_version":"1.0","canonical_sha256":"4a373746e33a7beb381b4a210c44f183559ae28d3d8eb3bb78baaefe7611f275","source":{"kind":"arxiv","id":"2404.16364","version":5},"attestation_state":"computed","paper":{"title":"ReZero: Boosting MCTS-based Algorithms by Backward-view and Entire-buffer Reanalyze","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Chunyu Xuan, Jing Yang, Shuai Hu, Yazhe Niu, Yuan Pu, Yu Liu","submitted_at":"2024-04-25T07:02:07Z","abstract_excerpt":"Monte Carlo Tree Search (MCTS)-based algorithms, such as MuZero and its derivatives, have achieved widespread success in various decision-making domains. These algorithms employ the reanalyze process to enhance sample efficiency from stale data, albeit at the expense of significant wall-clock time consumption. To address this issue, we propose a general approach named ReZero to boost tree search operations for MCTS-based algorithms. Specifically, drawing inspiration from the one-armed bandit model, we reanalyze training samples through a backward-view reuse technique which uses the value estim"},"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":"2404.16364","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2024-04-25T07:02:07Z","cross_cats_sorted":[],"title_canon_sha256":"bca21ba4f91725e100b3c16240c28e96d2f86ec1c2268d04b5ce98d60cdefb10","abstract_canon_sha256":"65f9c116d38421baab0c9adadca4ff8fc783d98f24891202440f59b9d01d187f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:55:56.595903Z","signature_b64":"p0Q0ZGfDKSPtKDR6i/6kLdZ6IPRcqjsjWB/mqJBQSzXfYIvdYM1dRqS0NgTWIoIIPEG9SlyKHD3201mC6rUzCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a373746e33a7beb381b4a210c44f183559ae28d3d8eb3bb78baaefe7611f275","last_reissued_at":"2026-07-05T09:55:56.595278Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:55:56.595278Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ReZero: Boosting MCTS-based Algorithms by Backward-view and Entire-buffer Reanalyze","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Chunyu Xuan, Jing Yang, Shuai Hu, Yazhe Niu, Yuan Pu, Yu Liu","submitted_at":"2024-04-25T07:02:07Z","abstract_excerpt":"Monte Carlo Tree Search (MCTS)-based algorithms, such as MuZero and its derivatives, have achieved widespread success in various decision-making domains. These algorithms employ the reanalyze process to enhance sample efficiency from stale data, albeit at the expense of significant wall-clock time consumption. To address this issue, we propose a general approach named ReZero to boost tree search operations for MCTS-based algorithms. Specifically, drawing inspiration from the one-armed bandit model, we reanalyze training samples through a backward-view reuse technique which uses the value estim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.16364","kind":"arxiv","version":5},"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/2404.16364/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2404.16364","created_at":"2026-07-05T09:55:56.595348+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.16364v5","created_at":"2026-07-05T09:55:56.595348+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.16364","created_at":"2026-07-05T09:55:56.595348+00:00"},{"alias_kind":"pith_short_12","alias_value":"JI3TORXDHJ56","created_at":"2026-07-05T09:55:56.595348+00:00"},{"alias_kind":"pith_short_16","alias_value":"JI3TORXDHJ56WOA3","created_at":"2026-07-05T09:55:56.595348+00:00"},{"alias_kind":"pith_short_8","alias_value":"JI3TORXD","created_at":"2026-07-05T09:55:56.595348+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.12289","citing_title":"PriorZero: Bridging Language Priors and World Models for Decision Making","ref_index":39,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JI3TORXDHJ56WOA3JIQQYRHRQN","json":"https://pith.science/pith/JI3TORXDHJ56WOA3JIQQYRHRQN.json","graph_json":"https://pith.science/api/pith-number/JI3TORXDHJ56WOA3JIQQYRHRQN/graph.json","events_json":"https://pith.science/api/pith-number/JI3TORXDHJ56WOA3JIQQYRHRQN/events.json","paper":"https://pith.science/paper/JI3TORXD"},"agent_actions":{"view_html":"https://pith.science/pith/JI3TORXDHJ56WOA3JIQQYRHRQN","download_json":"https://pith.science/pith/JI3TORXDHJ56WOA3JIQQYRHRQN.json","view_paper":"https://pith.science/paper/JI3TORXD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.16364&json=true","fetch_graph":"https://pith.science/api/pith-number/JI3TORXDHJ56WOA3JIQQYRHRQN/graph.json","fetch_events":"https://pith.science/api/pith-number/JI3TORXDHJ56WOA3JIQQYRHRQN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JI3TORXDHJ56WOA3JIQQYRHRQN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JI3TORXDHJ56WOA3JIQQYRHRQN/action/storage_attestation","attest_author":"https://pith.science/pith/JI3TORXDHJ56WOA3JIQQYRHRQN/action/author_attestation","sign_citation":"https://pith.science/pith/JI3TORXDHJ56WOA3JIQQYRHRQN/action/citation_signature","submit_replication":"https://pith.science/pith/JI3TORXDHJ56WOA3JIQQYRHRQN/action/replication_record"}},"created_at":"2026-07-05T09:55:56.595348+00:00","updated_at":"2026-07-05T09:55:56.595348+00:00"}