{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:XLEF3YUTM6BJAT66HJTKJ7PFTQ","short_pith_number":"pith:XLEF3YUT","schema_version":"1.0","canonical_sha256":"bac85de2936782904fde3a66a4fde59c20ddde514755b079688667d24818efa3","source":{"kind":"arxiv","id":"2404.14464","version":1},"attestation_state":"computed","paper":{"title":"Tree of Reviews: A Tree-based Dynamic Iterative Retrieval Framework for Multi-hop Question Answering","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.IR"],"primary_cat":"cs.CL","authors_text":"Chen Xiang, Li Jiapeng, Li Mingling, Liu Runze, Li Yabo, Zhou Tong","submitted_at":"2024-04-22T09:25:05Z","abstract_excerpt":"Multi-hop question answering is a knowledge-intensive complex problem. Large Language Models (LLMs) use their Chain of Thoughts (CoT) capability to reason complex problems step by step, and retrieval-augmentation can effectively alleviate factual errors caused by outdated and unknown knowledge in LLMs. Recent works have introduced retrieval-augmentation in the CoT reasoning to solve multi-hop question answering. However, these chain methods have the following problems: 1) Retrieved irrelevant paragraphs may mislead the reasoning; 2) An error in the chain structure may lead to a cascade of erro"},"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.14464","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-04-22T09:25:05Z","cross_cats_sorted":["cs.AI","cs.IR"],"title_canon_sha256":"3a0a3d8688cc3eb51d39d5841a230b0e9a1fc15039a0bc4a6562ab028475525a","abstract_canon_sha256":"de613c5eb7cbfe2e33e8867179f300de8ebf58da3d30c7eee6febfb9b19b3b09"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:11:05.620919Z","signature_b64":"pzfq5ectviheMn8UwRfEy4EEJUZ9BDFQXH1nm7T6hQ1NdqhPSwRtcAwtjajhXzlLGaoLwadAhlxHl3jImkJDAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bac85de2936782904fde3a66a4fde59c20ddde514755b079688667d24818efa3","last_reissued_at":"2026-07-05T08:11:05.620443Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:11:05.620443Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tree of Reviews: A Tree-based Dynamic Iterative Retrieval Framework for Multi-hop Question Answering","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.IR"],"primary_cat":"cs.CL","authors_text":"Chen Xiang, Li Jiapeng, Li Mingling, Liu Runze, Li Yabo, Zhou Tong","submitted_at":"2024-04-22T09:25:05Z","abstract_excerpt":"Multi-hop question answering is a knowledge-intensive complex problem. Large Language Models (LLMs) use their Chain of Thoughts (CoT) capability to reason complex problems step by step, and retrieval-augmentation can effectively alleviate factual errors caused by outdated and unknown knowledge in LLMs. Recent works have introduced retrieval-augmentation in the CoT reasoning to solve multi-hop question answering. However, these chain methods have the following problems: 1) Retrieved irrelevant paragraphs may mislead the reasoning; 2) An error in the chain structure may lead to a cascade of erro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.14464","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/2404.14464/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.14464","created_at":"2026-07-05T08:11:05.620501+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.14464v1","created_at":"2026-07-05T08:11:05.620501+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.14464","created_at":"2026-07-05T08:11:05.620501+00:00"},{"alias_kind":"pith_short_12","alias_value":"XLEF3YUTM6BJ","created_at":"2026-07-05T08:11:05.620501+00:00"},{"alias_kind":"pith_short_16","alias_value":"XLEF3YUTM6BJAT66","created_at":"2026-07-05T08:11:05.620501+00:00"},{"alias_kind":"pith_short_8","alias_value":"XLEF3YUT","created_at":"2026-07-05T08:11:05.620501+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.04069","citing_title":"Beyond Independent Passages: Adaptive Passage Combination Retrieval for Retrieval Augmented Open-Domain Question Answering","ref_index":20,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XLEF3YUTM6BJAT66HJTKJ7PFTQ","json":"https://pith.science/pith/XLEF3YUTM6BJAT66HJTKJ7PFTQ.json","graph_json":"https://pith.science/api/pith-number/XLEF3YUTM6BJAT66HJTKJ7PFTQ/graph.json","events_json":"https://pith.science/api/pith-number/XLEF3YUTM6BJAT66HJTKJ7PFTQ/events.json","paper":"https://pith.science/paper/XLEF3YUT"},"agent_actions":{"view_html":"https://pith.science/pith/XLEF3YUTM6BJAT66HJTKJ7PFTQ","download_json":"https://pith.science/pith/XLEF3YUTM6BJAT66HJTKJ7PFTQ.json","view_paper":"https://pith.science/paper/XLEF3YUT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.14464&json=true","fetch_graph":"https://pith.science/api/pith-number/XLEF3YUTM6BJAT66HJTKJ7PFTQ/graph.json","fetch_events":"https://pith.science/api/pith-number/XLEF3YUTM6BJAT66HJTKJ7PFTQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XLEF3YUTM6BJAT66HJTKJ7PFTQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XLEF3YUTM6BJAT66HJTKJ7PFTQ/action/storage_attestation","attest_author":"https://pith.science/pith/XLEF3YUTM6BJAT66HJTKJ7PFTQ/action/author_attestation","sign_citation":"https://pith.science/pith/XLEF3YUTM6BJAT66HJTKJ7PFTQ/action/citation_signature","submit_replication":"https://pith.science/pith/XLEF3YUTM6BJAT66HJTKJ7PFTQ/action/replication_record"}},"created_at":"2026-07-05T08:11:05.620501+00:00","updated_at":"2026-07-05T08:11:05.620501+00:00"}