{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:XOHXV65FPASSOVJJYW6WG6STZJ","short_pith_number":"pith:XOHXV65F","schema_version":"1.0","canonical_sha256":"bb8f7afba57825275529c5bd637a53ca45f9f7ad22d7f5a533cb6c144b238ca6","source":{"kind":"arxiv","id":"2502.16235","version":2},"attestation_state":"computed","paper":{"title":"Dynamic Parallel Tree Search for Efficient LLM Reasoning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Bo Du, Dacheng Tao, Jing Zhang, Jinyang Guo, Shunyu Liu, Wentao Jiang, Xianglong Liu, Yifu Ding, Yingjie Wang, Yongcheng Jing, Zengmao Wang, Ziwei Liu","submitted_at":"2025-02-22T14:13:37Z","abstract_excerpt":"Tree of Thoughts (ToT) enhances Large Language Model (LLM) reasoning by structuring problem-solving as a spanning tree. However, recent methods focus on search accuracy while overlooking computational efficiency. The challenges of accelerating the ToT lie in the frequent switching of reasoning focus, and the redundant exploration of suboptimal solutions. To alleviate this dilemma, we propose Dynamic Parallel Tree Search (DPTS), a novel parallelism framework that aims to dynamically optimize the reasoning path in inference. It includes the Parallelism Streamline in the generation phase to build"},"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":"2502.16235","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2025-02-22T14:13:37Z","cross_cats_sorted":[],"title_canon_sha256":"684e032f0cfd68dd5e3321aa7d5fb88ff5bdcf5683b0f348517020c3b1982dc6","abstract_canon_sha256":"e3babe3425fb45a055e4bc07f0a766b80c73f70379f65a04d4edc5dc71424b00"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:20:45.225413Z","signature_b64":"h0khGGhfOFoU360wk24euvVfq1v+mY6NGTiOyf2GS/obRxv8ERY2Xgayjj8IugpLhy8FUvhN0QrLtZUoK6ZpBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb8f7afba57825275529c5bd637a53ca45f9f7ad22d7f5a533cb6c144b238ca6","last_reissued_at":"2026-07-05T10:20:45.224913Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:20:45.224913Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic Parallel Tree Search for Efficient LLM Reasoning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Bo Du, Dacheng Tao, Jing Zhang, Jinyang Guo, Shunyu Liu, Wentao Jiang, Xianglong Liu, Yifu Ding, Yingjie Wang, Yongcheng Jing, Zengmao Wang, Ziwei Liu","submitted_at":"2025-02-22T14:13:37Z","abstract_excerpt":"Tree of Thoughts (ToT) enhances Large Language Model (LLM) reasoning by structuring problem-solving as a spanning tree. However, recent methods focus on search accuracy while overlooking computational efficiency. The challenges of accelerating the ToT lie in the frequent switching of reasoning focus, and the redundant exploration of suboptimal solutions. To alleviate this dilemma, we propose Dynamic Parallel Tree Search (DPTS), a novel parallelism framework that aims to dynamically optimize the reasoning path in inference. It includes the Parallelism Streamline in the generation phase to build"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.16235","kind":"arxiv","version":2},"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/2502.16235/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":"2502.16235","created_at":"2026-07-05T10:20:45.224968+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.16235v2","created_at":"2026-07-05T10:20:45.224968+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.16235","created_at":"2026-07-05T10:20:45.224968+00:00"},{"alias_kind":"pith_short_12","alias_value":"XOHXV65FPASS","created_at":"2026-07-05T10:20:45.224968+00:00"},{"alias_kind":"pith_short_16","alias_value":"XOHXV65FPASSOVJJ","created_at":"2026-07-05T10:20:45.224968+00:00"},{"alias_kind":"pith_short_8","alias_value":"XOHXV65F","created_at":"2026-07-05T10:20:45.224968+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.22106","citing_title":"ArborKV: Structure-Aware KV Cache Management for Scaling Tree-based LLM Reasoning","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2503.16419","citing_title":"Stop Overthinking: A Survey on Efficient Reasoning for Large Language Models","ref_index":38,"is_internal_anchor":false},{"citing_arxiv_id":"2503.09567","citing_title":"Towards Reasoning Era: A Survey of Long Chain-of-Thought for Reasoning Large Language Models","ref_index":157,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06165","citing_title":"Post Reasoning: Improving the Performance of Non-Thinking Models at No Cost","ref_index":131,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XOHXV65FPASSOVJJYW6WG6STZJ","json":"https://pith.science/pith/XOHXV65FPASSOVJJYW6WG6STZJ.json","graph_json":"https://pith.science/api/pith-number/XOHXV65FPASSOVJJYW6WG6STZJ/graph.json","events_json":"https://pith.science/api/pith-number/XOHXV65FPASSOVJJYW6WG6STZJ/events.json","paper":"https://pith.science/paper/XOHXV65F"},"agent_actions":{"view_html":"https://pith.science/pith/XOHXV65FPASSOVJJYW6WG6STZJ","download_json":"https://pith.science/pith/XOHXV65FPASSOVJJYW6WG6STZJ.json","view_paper":"https://pith.science/paper/XOHXV65F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.16235&json=true","fetch_graph":"https://pith.science/api/pith-number/XOHXV65FPASSOVJJYW6WG6STZJ/graph.json","fetch_events":"https://pith.science/api/pith-number/XOHXV65FPASSOVJJYW6WG6STZJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XOHXV65FPASSOVJJYW6WG6STZJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XOHXV65FPASSOVJJYW6WG6STZJ/action/storage_attestation","attest_author":"https://pith.science/pith/XOHXV65FPASSOVJJYW6WG6STZJ/action/author_attestation","sign_citation":"https://pith.science/pith/XOHXV65FPASSOVJJYW6WG6STZJ/action/citation_signature","submit_replication":"https://pith.science/pith/XOHXV65FPASSOVJJYW6WG6STZJ/action/replication_record"}},"created_at":"2026-07-05T10:20:45.224968+00:00","updated_at":"2026-07-05T10:20:45.224968+00:00"}