{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:2YXFIGSO3AAE4LJ3QCS7ACI6WP","short_pith_number":"pith:2YXFIGSO","schema_version":"1.0","canonical_sha256":"d62e541a4ed8004e2d3b80a5f0091eb3ee48298c94023640cf4644344682fc72","source":{"kind":"arxiv","id":"2505.02322","version":2},"attestation_state":"computed","paper":{"title":"HyperTree Planning: Enhancing LLM Reasoning via Hierarchical Thinking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Chi Ma, Defu Lian, Enhong Chen, Feng Wu, Huiling Zhen, Jianye Hao, Jie Wang, Mingxuan Yuan, Runquan Gui, Zhihai Wang","submitted_at":"2025-05-05T02:38:58Z","abstract_excerpt":"Recent advancements have significantly enhanced the performance of large language models (LLMs) in tackling complex reasoning tasks, achieving notable success in domains like mathematical and logical reasoning. However, these methods encounter challenges with complex planning tasks, primarily due to extended reasoning steps, diverse constraints, and the challenge of handling multiple distinct sub-tasks. To address these challenges, we propose HyperTree Planning (HTP), a novel reasoning paradigm that constructs hypertree-structured planning outlines for effective planning. The hypertree structu"},"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":"2505.02322","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2025-05-05T02:38:58Z","cross_cats_sorted":[],"title_canon_sha256":"c023d1d9f92c17090176b952eccc7b20a98050876b98cc12ef68e36f840efa80","abstract_canon_sha256":"70f82029c958437373f94ad3bdcd7dec008badff661c427fac5add17d11e6b08"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:11:44.615352Z","signature_b64":"ckGYgkEYiTHAKidY7gmkmcv2TFjoA3gLB2dFf78b5b+71hDFJPUabsvDQRxHgEZ0WVo9f9nlh8bNxRx6mUD/Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d62e541a4ed8004e2d3b80a5f0091eb3ee48298c94023640cf4644344682fc72","last_reissued_at":"2026-07-05T11:11:44.614834Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:11:44.614834Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"HyperTree Planning: Enhancing LLM Reasoning via Hierarchical Thinking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Chi Ma, Defu Lian, Enhong Chen, Feng Wu, Huiling Zhen, Jianye Hao, Jie Wang, Mingxuan Yuan, Runquan Gui, Zhihai Wang","submitted_at":"2025-05-05T02:38:58Z","abstract_excerpt":"Recent advancements have significantly enhanced the performance of large language models (LLMs) in tackling complex reasoning tasks, achieving notable success in domains like mathematical and logical reasoning. However, these methods encounter challenges with complex planning tasks, primarily due to extended reasoning steps, diverse constraints, and the challenge of handling multiple distinct sub-tasks. To address these challenges, we propose HyperTree Planning (HTP), a novel reasoning paradigm that constructs hypertree-structured planning outlines for effective planning. The hypertree structu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.02322","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/2505.02322/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":"2505.02322","created_at":"2026-07-05T11:11:44.614892+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.02322v2","created_at":"2026-07-05T11:11:44.614892+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.02322","created_at":"2026-07-05T11:11:44.614892+00:00"},{"alias_kind":"pith_short_12","alias_value":"2YXFIGSO3AAE","created_at":"2026-07-05T11:11:44.614892+00:00"},{"alias_kind":"pith_short_16","alias_value":"2YXFIGSO3AAE4LJ3","created_at":"2026-07-05T11:11:44.614892+00:00"},{"alias_kind":"pith_short_8","alias_value":"2YXFIGSO","created_at":"2026-07-05T11:11:44.614892+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2601.12538","citing_title":"Agentic Reasoning for Large Language Models","ref_index":76,"is_internal_anchor":false},{"citing_arxiv_id":"2511.20857","citing_title":"Evo-Memory: Benchmarking LLM Agent Test-time Learning with Self-Evolving Memory","ref_index":227,"is_internal_anchor":false},{"citing_arxiv_id":"2604.21027","citing_title":"HypEHR: Hyperbolic Modeling of Electronic Health Records for Efficient Question Answering","ref_index":42,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2YXFIGSO3AAE4LJ3QCS7ACI6WP","json":"https://pith.science/pith/2YXFIGSO3AAE4LJ3QCS7ACI6WP.json","graph_json":"https://pith.science/api/pith-number/2YXFIGSO3AAE4LJ3QCS7ACI6WP/graph.json","events_json":"https://pith.science/api/pith-number/2YXFIGSO3AAE4LJ3QCS7ACI6WP/events.json","paper":"https://pith.science/paper/2YXFIGSO"},"agent_actions":{"view_html":"https://pith.science/pith/2YXFIGSO3AAE4LJ3QCS7ACI6WP","download_json":"https://pith.science/pith/2YXFIGSO3AAE4LJ3QCS7ACI6WP.json","view_paper":"https://pith.science/paper/2YXFIGSO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.02322&json=true","fetch_graph":"https://pith.science/api/pith-number/2YXFIGSO3AAE4LJ3QCS7ACI6WP/graph.json","fetch_events":"https://pith.science/api/pith-number/2YXFIGSO3AAE4LJ3QCS7ACI6WP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2YXFIGSO3AAE4LJ3QCS7ACI6WP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2YXFIGSO3AAE4LJ3QCS7ACI6WP/action/storage_attestation","attest_author":"https://pith.science/pith/2YXFIGSO3AAE4LJ3QCS7ACI6WP/action/author_attestation","sign_citation":"https://pith.science/pith/2YXFIGSO3AAE4LJ3QCS7ACI6WP/action/citation_signature","submit_replication":"https://pith.science/pith/2YXFIGSO3AAE4LJ3QCS7ACI6WP/action/replication_record"}},"created_at":"2026-07-05T11:11:44.614892+00:00","updated_at":"2026-07-05T11:11:44.614892+00:00"}