{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:YZPKBXB7MX2CJHFYMVELUAGCZ7","short_pith_number":"pith:YZPKBXB7","schema_version":"1.0","canonical_sha256":"c65ea0dc3f65f4249cb86548ba00c2cfdbe28b020a7b632c4623237975570949","source":{"kind":"arxiv","id":"2410.20753","version":2},"attestation_state":"computed","paper":{"title":"Plan*RAG: Efficient Test-Time Planning for Retrieval Augmented Generation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Amit Sharma, Arno Solin, Gaurav Sinha, Nagarajan Natarajan, Prakhar Verma, Sukruta Prakash Midigeshi","submitted_at":"2024-10-28T05:35:04Z","abstract_excerpt":"We introduce Plan*RAG, a novel framework that enables structured multi-hop reasoning in retrieval-augmented generation (RAG) through test-time reasoning plan generation. While existing approaches such as ReAct maintain reasoning chains within the language model's context window, we observe that this often leads to plan fragmentation and execution failures. Our key insight is that by isolating the reasoning plan as a directed acyclic graph (DAG) outside the LM's working memory, we can enable (1) systematic exploration of reasoning paths, (2) atomic subqueries enabling precise retrievals and gro"},"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":"2410.20753","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-10-28T05:35:04Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"200daa52f0e6fce6691c68aad3250f1d084b87e07636d08c2486fa46e6469fe2","abstract_canon_sha256":"8be6852f7a79e48b44c552bf8ea35fa6e32df4ed546283d70b6982167e6b0b15"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:09:11.336728Z","signature_b64":"xSSIQMTpezonLqCmBwxkTBXVjXLUHEof2n10IipSFVLAf8305NPIxgNKeND1WrIuE2KG7Q9hT7dX/5xSMgHdAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c65ea0dc3f65f4249cb86548ba00c2cfdbe28b020a7b632c4623237975570949","last_reissued_at":"2026-07-05T10:09:11.336281Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:09:11.336281Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Plan*RAG: Efficient Test-Time Planning for Retrieval Augmented Generation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Amit Sharma, Arno Solin, Gaurav Sinha, Nagarajan Natarajan, Prakhar Verma, Sukruta Prakash Midigeshi","submitted_at":"2024-10-28T05:35:04Z","abstract_excerpt":"We introduce Plan*RAG, a novel framework that enables structured multi-hop reasoning in retrieval-augmented generation (RAG) through test-time reasoning plan generation. While existing approaches such as ReAct maintain reasoning chains within the language model's context window, we observe that this often leads to plan fragmentation and execution failures. Our key insight is that by isolating the reasoning plan as a directed acyclic graph (DAG) outside the LM's working memory, we can enable (1) systematic exploration of reasoning paths, (2) atomic subqueries enabling precise retrievals and gro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.20753","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/2410.20753/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":"2410.20753","created_at":"2026-07-05T10:09:11.336340+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.20753v2","created_at":"2026-07-05T10:09:11.336340+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.20753","created_at":"2026-07-05T10:09:11.336340+00:00"},{"alias_kind":"pith_short_12","alias_value":"YZPKBXB7MX2C","created_at":"2026-07-05T10:09:11.336340+00:00"},{"alias_kind":"pith_short_16","alias_value":"YZPKBXB7MX2CJHFY","created_at":"2026-07-05T10:09:11.336340+00:00"},{"alias_kind":"pith_short_8","alias_value":"YZPKBXB7","created_at":"2026-07-05T10:09:11.336340+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.22681","citing_title":"Only Ask What You Don't Know: Grounded Delta Planning for Efficient Multi-step RAG","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2606.10921","citing_title":"Trace Only What You Need: Structure-Aware On-Demand Hypergraph Memory for Long-Document Question Answering","ref_index":35,"is_internal_anchor":false},{"citing_arxiv_id":"2606.01240","citing_title":"Efficient RAG with Intent-Aware Retrieval and Semantics-Preserving Chunking","ref_index":12,"is_internal_anchor":false},{"citing_arxiv_id":"2606.22681","citing_title":"Only Ask What You Don't Know: Grounded Delta Planning for Efficient Multi-step RAG","ref_index":55,"is_internal_anchor":false},{"citing_arxiv_id":"2501.05366","citing_title":"Search-o1: Agentic Search-Enhanced Large Reasoning Models","ref_index":56,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YZPKBXB7MX2CJHFYMVELUAGCZ7","json":"https://pith.science/pith/YZPKBXB7MX2CJHFYMVELUAGCZ7.json","graph_json":"https://pith.science/api/pith-number/YZPKBXB7MX2CJHFYMVELUAGCZ7/graph.json","events_json":"https://pith.science/api/pith-number/YZPKBXB7MX2CJHFYMVELUAGCZ7/events.json","paper":"https://pith.science/paper/YZPKBXB7"},"agent_actions":{"view_html":"https://pith.science/pith/YZPKBXB7MX2CJHFYMVELUAGCZ7","download_json":"https://pith.science/pith/YZPKBXB7MX2CJHFYMVELUAGCZ7.json","view_paper":"https://pith.science/paper/YZPKBXB7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.20753&json=true","fetch_graph":"https://pith.science/api/pith-number/YZPKBXB7MX2CJHFYMVELUAGCZ7/graph.json","fetch_events":"https://pith.science/api/pith-number/YZPKBXB7MX2CJHFYMVELUAGCZ7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YZPKBXB7MX2CJHFYMVELUAGCZ7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YZPKBXB7MX2CJHFYMVELUAGCZ7/action/storage_attestation","attest_author":"https://pith.science/pith/YZPKBXB7MX2CJHFYMVELUAGCZ7/action/author_attestation","sign_citation":"https://pith.science/pith/YZPKBXB7MX2CJHFYMVELUAGCZ7/action/citation_signature","submit_replication":"https://pith.science/pith/YZPKBXB7MX2CJHFYMVELUAGCZ7/action/replication_record"}},"created_at":"2026-07-05T10:09:11.336340+00:00","updated_at":"2026-07-05T10:09:11.336340+00:00"}