{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:IJVFN7IGNRBTKLV6LLFLVK46SJ","short_pith_number":"pith:IJVFN7IG","schema_version":"1.0","canonical_sha256":"426a56fd066c43352ebe5acabaab9e9247aab34340491cacaa495ef4c08b30d3","source":{"kind":"arxiv","id":"2506.10508","version":1},"attestation_state":"computed","paper":{"title":"Reliable Reasoning Path: Distilling Effective Guidance for LLM Reasoning with Knowledge Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Bo Li, Chuang Zhou, Qinggang Zhang, Qing Li, Xiao Huang, Yilin Xiao","submitted_at":"2025-06-12T09:10:32Z","abstract_excerpt":"Large language models (LLMs) often struggle with knowledge-intensive tasks due to a lack of background knowledge and a tendency to hallucinate. To address these limitations, integrating knowledge graphs (KGs) with LLMs has been intensively studied. Existing KG-enhanced LLMs focus on supplementary factual knowledge, but still struggle with solving complex questions. We argue that refining the relationships among facts and organizing them into a logically consistent reasoning path is equally important as factual knowledge itself. Despite their potential, extracting reliable reasoning paths from "},"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":"2506.10508","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2025-06-12T09:10:32Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"e78531c02753972cfc28525de30be9f870a757b1e28a3f1aa306e25d74a166fb","abstract_canon_sha256":"3820091133dfd8404c86225ba9a1ad88376fc37001cecc05571e413467f5cb97"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:20:25.151009Z","signature_b64":"pMOJMVgl4xe2mkrVZkYWkYlmRrshJuwjvYcmXmKHKFzJQDZGToxXxmOptzld1eHwhh64c7C7MaI6otFpAO4QAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"426a56fd066c43352ebe5acabaab9e9247aab34340491cacaa495ef4c08b30d3","last_reissued_at":"2026-07-05T11:20:25.150530Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:20:25.150530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reliable Reasoning Path: Distilling Effective Guidance for LLM Reasoning with Knowledge Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Bo Li, Chuang Zhou, Qinggang Zhang, Qing Li, Xiao Huang, Yilin Xiao","submitted_at":"2025-06-12T09:10:32Z","abstract_excerpt":"Large language models (LLMs) often struggle with knowledge-intensive tasks due to a lack of background knowledge and a tendency to hallucinate. To address these limitations, integrating knowledge graphs (KGs) with LLMs has been intensively studied. Existing KG-enhanced LLMs focus on supplementary factual knowledge, but still struggle with solving complex questions. We argue that refining the relationships among facts and organizing them into a logically consistent reasoning path is equally important as factual knowledge itself. Despite their potential, extracting reliable reasoning paths from "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.10508","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/2506.10508/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":"2506.10508","created_at":"2026-07-05T11:20:25.150588+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.10508v1","created_at":"2026-07-05T11:20:25.150588+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.10508","created_at":"2026-07-05T11:20:25.150588+00:00"},{"alias_kind":"pith_short_12","alias_value":"IJVFN7IGNRBT","created_at":"2026-07-05T11:20:25.150588+00:00"},{"alias_kind":"pith_short_16","alias_value":"IJVFN7IGNRBTKLV6","created_at":"2026-07-05T11:20:25.150588+00:00"},{"alias_kind":"pith_short_8","alias_value":"IJVFN7IG","created_at":"2026-07-05T11:20:25.150588+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.00610","citing_title":"MemGraphRAG: Memory-based Multi-Agent System for Graph Retrieval-Augmented Generation","ref_index":62,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IJVFN7IGNRBTKLV6LLFLVK46SJ","json":"https://pith.science/pith/IJVFN7IGNRBTKLV6LLFLVK46SJ.json","graph_json":"https://pith.science/api/pith-number/IJVFN7IGNRBTKLV6LLFLVK46SJ/graph.json","events_json":"https://pith.science/api/pith-number/IJVFN7IGNRBTKLV6LLFLVK46SJ/events.json","paper":"https://pith.science/paper/IJVFN7IG"},"agent_actions":{"view_html":"https://pith.science/pith/IJVFN7IGNRBTKLV6LLFLVK46SJ","download_json":"https://pith.science/pith/IJVFN7IGNRBTKLV6LLFLVK46SJ.json","view_paper":"https://pith.science/paper/IJVFN7IG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.10508&json=true","fetch_graph":"https://pith.science/api/pith-number/IJVFN7IGNRBTKLV6LLFLVK46SJ/graph.json","fetch_events":"https://pith.science/api/pith-number/IJVFN7IGNRBTKLV6LLFLVK46SJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IJVFN7IGNRBTKLV6LLFLVK46SJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IJVFN7IGNRBTKLV6LLFLVK46SJ/action/storage_attestation","attest_author":"https://pith.science/pith/IJVFN7IGNRBTKLV6LLFLVK46SJ/action/author_attestation","sign_citation":"https://pith.science/pith/IJVFN7IGNRBTKLV6LLFLVK46SJ/action/citation_signature","submit_replication":"https://pith.science/pith/IJVFN7IGNRBTKLV6LLFLVK46SJ/action/replication_record"}},"created_at":"2026-07-05T11:20:25.150588+00:00","updated_at":"2026-07-05T11:20:25.150588+00:00"}