{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:3P2QCJ35BJE7ZY2ORT45HQMRNQ","short_pith_number":"pith:3P2QCJ35","schema_version":"1.0","canonical_sha256":"dbf501277d0a49fce34e8cf9d3c1916c134ac3b16dd481bd667c0e927fea37fd","source":{"kind":"arxiv","id":"2406.14282","version":3},"attestation_state":"computed","paper":{"title":"Learning to Plan for Retrieval-Augmented Large Language Models from Knowledge Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"BinBin Hu, Dan Yang, Huajun Chen, Jeff Z. Pan, Jinjie Gu, Junjie Wang, Jun Zhou, Mingyang Chen, Peng Wei, Wen Zhang, Yue Shen, Zhiqiang Zhang, Ziqi Liu","submitted_at":"2024-06-20T13:07:38Z","abstract_excerpt":"Improving the performance of large language models (LLMs) in complex question-answering (QA) scenarios has always been a research focal point. Recent studies have attempted to enhance LLMs' performance by combining step-wise planning with external retrieval. While effective for advanced models like GPT-3.5, smaller LLMs face challenges in decomposing complex questions, necessitating supervised fine-tuning. Previous work has relied on manual annotation and knowledge distillation from teacher LLMs, which are time-consuming and not accurate enough. In this paper, we introduce a novel framework fo"},"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":"2406.14282","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2024-06-20T13:07:38Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"80167e944de462791daac7bf8b2a2d715439bf7304078ce92934bad3e3087a46","abstract_canon_sha256":"05c3f43404924aa24553fd082bf3dfbccfbc53ee9ceb86af665ad759ea673f5f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:24:36.296051Z","signature_b64":"IBMej58r43e/q/TuOwM/La6yCGFiV8w2OL8Twhwv8pZWYPso3DrQj8uX/QtUHTHRVEckLcWPlpkIWGFziHtADw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dbf501277d0a49fce34e8cf9d3c1916c134ac3b16dd481bd667c0e927fea37fd","last_reissued_at":"2026-07-05T09:24:36.295582Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:24:36.295582Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning to Plan for Retrieval-Augmented Large Language Models from Knowledge Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"BinBin Hu, Dan Yang, Huajun Chen, Jeff Z. Pan, Jinjie Gu, Junjie Wang, Jun Zhou, Mingyang Chen, Peng Wei, Wen Zhang, Yue Shen, Zhiqiang Zhang, Ziqi Liu","submitted_at":"2024-06-20T13:07:38Z","abstract_excerpt":"Improving the performance of large language models (LLMs) in complex question-answering (QA) scenarios has always been a research focal point. Recent studies have attempted to enhance LLMs' performance by combining step-wise planning with external retrieval. While effective for advanced models like GPT-3.5, smaller LLMs face challenges in decomposing complex questions, necessitating supervised fine-tuning. Previous work has relied on manual annotation and knowledge distillation from teacher LLMs, which are time-consuming and not accurate enough. In this paper, we introduce a novel framework fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.14282","kind":"arxiv","version":3},"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/2406.14282/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":"2406.14282","created_at":"2026-07-05T09:24:36.295639+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.14282v3","created_at":"2026-07-05T09:24:36.295639+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.14282","created_at":"2026-07-05T09:24:36.295639+00:00"},{"alias_kind":"pith_short_12","alias_value":"3P2QCJ35BJE7","created_at":"2026-07-05T09:24:36.295639+00:00"},{"alias_kind":"pith_short_16","alias_value":"3P2QCJ35BJE7ZY2O","created_at":"2026-07-05T09:24:36.295639+00:00"},{"alias_kind":"pith_short_8","alias_value":"3P2QCJ35","created_at":"2026-07-05T09:24:36.295639+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.17458","citing_title":"EHRAG: Bridging Semantic Gaps in Lightweight GraphRAG via Hybrid Hypergraph Construction and Retrieval","ref_index":174,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3P2QCJ35BJE7ZY2ORT45HQMRNQ","json":"https://pith.science/pith/3P2QCJ35BJE7ZY2ORT45HQMRNQ.json","graph_json":"https://pith.science/api/pith-number/3P2QCJ35BJE7ZY2ORT45HQMRNQ/graph.json","events_json":"https://pith.science/api/pith-number/3P2QCJ35BJE7ZY2ORT45HQMRNQ/events.json","paper":"https://pith.science/paper/3P2QCJ35"},"agent_actions":{"view_html":"https://pith.science/pith/3P2QCJ35BJE7ZY2ORT45HQMRNQ","download_json":"https://pith.science/pith/3P2QCJ35BJE7ZY2ORT45HQMRNQ.json","view_paper":"https://pith.science/paper/3P2QCJ35","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.14282&json=true","fetch_graph":"https://pith.science/api/pith-number/3P2QCJ35BJE7ZY2ORT45HQMRNQ/graph.json","fetch_events":"https://pith.science/api/pith-number/3P2QCJ35BJE7ZY2ORT45HQMRNQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3P2QCJ35BJE7ZY2ORT45HQMRNQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3P2QCJ35BJE7ZY2ORT45HQMRNQ/action/storage_attestation","attest_author":"https://pith.science/pith/3P2QCJ35BJE7ZY2ORT45HQMRNQ/action/author_attestation","sign_citation":"https://pith.science/pith/3P2QCJ35BJE7ZY2ORT45HQMRNQ/action/citation_signature","submit_replication":"https://pith.science/pith/3P2QCJ35BJE7ZY2ORT45HQMRNQ/action/replication_record"}},"created_at":"2026-07-05T09:24:36.295639+00:00","updated_at":"2026-07-05T09:24:36.295639+00:00"}