{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:DDCCW6TXTAKSYSRJBK7YAOI5DX","short_pith_number":"pith:DDCCW6TX","schema_version":"1.0","canonical_sha256":"18c42b7a7798152c4a290abf80391d1df60372fedcff90c7f191174828d8b7b4","source":{"kind":"arxiv","id":"2504.13534","version":3},"attestation_state":"computed","paper":{"title":"CoT-RAG: Integrating Chain of Thought and Retrieval-Augmented Generation to Enhance Reasoning in Large Language Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Arijit Khan, Fang Wang, Feiyang Li, Peng Fang, Weihao Wang, Xin Zhang, Yongjian Cui, Zhan Shi","submitted_at":"2025-04-18T07:55:09Z","abstract_excerpt":"Chain-of-thought (CoT) reasoning boosts large language models' (LLMs) performance on complex tasks but faces two key limitations: a lack of reliability when solely relying on LLM-generated reasoning chains and lower reasoning performance from natural language prompts compared with code prompts. To address these issues, we propose CoT-RAG, a novel reasoning framework with three key designs: (i) Knowledge Graph-driven CoT Generation, featuring knowledge graphs to modulate reasoning chain generation of LLMs, thereby enhancing reasoning credibility; (ii) Learnable Knowledge Case-aware RAG, which i"},"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":"2504.13534","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2025-04-18T07:55:09Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"9b9a2205340edcd24f67dad3a13f3f8a5ee962ac26bde5744f0191b1a9e3038c","abstract_canon_sha256":"b986346dd8a43b0bff79326e6683bb37dd7faaabafc820edcfe48c6145a5a304"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:08:02.234942Z","signature_b64":"qAx/sAEOgMp9Ql1AI0uskP7KXltuBPmPw6Ej5o2i2mohUCQKtrUuqO0XjhHW0rjdbCQ/UD0kJD0gJ+Nwgy2xAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18c42b7a7798152c4a290abf80391d1df60372fedcff90c7f191174828d8b7b4","last_reissued_at":"2026-07-05T12:08:02.234434Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:08:02.234434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CoT-RAG: Integrating Chain of Thought and Retrieval-Augmented Generation to Enhance Reasoning in Large Language Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Arijit Khan, Fang Wang, Feiyang Li, Peng Fang, Weihao Wang, Xin Zhang, Yongjian Cui, Zhan Shi","submitted_at":"2025-04-18T07:55:09Z","abstract_excerpt":"Chain-of-thought (CoT) reasoning boosts large language models' (LLMs) performance on complex tasks but faces two key limitations: a lack of reliability when solely relying on LLM-generated reasoning chains and lower reasoning performance from natural language prompts compared with code prompts. To address these issues, we propose CoT-RAG, a novel reasoning framework with three key designs: (i) Knowledge Graph-driven CoT Generation, featuring knowledge graphs to modulate reasoning chain generation of LLMs, thereby enhancing reasoning credibility; (ii) Learnable Knowledge Case-aware RAG, which i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.13534","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/2504.13534/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":"2504.13534","created_at":"2026-07-05T12:08:02.234494+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.13534v3","created_at":"2026-07-05T12:08:02.234494+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.13534","created_at":"2026-07-05T12:08:02.234494+00:00"},{"alias_kind":"pith_short_12","alias_value":"DDCCW6TXTAKS","created_at":"2026-07-05T12:08:02.234494+00:00"},{"alias_kind":"pith_short_16","alias_value":"DDCCW6TXTAKSYSRJ","created_at":"2026-07-05T12:08:02.234494+00:00"},{"alias_kind":"pith_short_8","alias_value":"DDCCW6TX","created_at":"2026-07-05T12:08:02.234494+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.25191","citing_title":"To Isolate or to Score? Model-Adaptive Assessment for Cost-Efficient Multi-Agent RAG","ref_index":36,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DDCCW6TXTAKSYSRJBK7YAOI5DX","json":"https://pith.science/pith/DDCCW6TXTAKSYSRJBK7YAOI5DX.json","graph_json":"https://pith.science/api/pith-number/DDCCW6TXTAKSYSRJBK7YAOI5DX/graph.json","events_json":"https://pith.science/api/pith-number/DDCCW6TXTAKSYSRJBK7YAOI5DX/events.json","paper":"https://pith.science/paper/DDCCW6TX"},"agent_actions":{"view_html":"https://pith.science/pith/DDCCW6TXTAKSYSRJBK7YAOI5DX","download_json":"https://pith.science/pith/DDCCW6TXTAKSYSRJBK7YAOI5DX.json","view_paper":"https://pith.science/paper/DDCCW6TX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.13534&json=true","fetch_graph":"https://pith.science/api/pith-number/DDCCW6TXTAKSYSRJBK7YAOI5DX/graph.json","fetch_events":"https://pith.science/api/pith-number/DDCCW6TXTAKSYSRJBK7YAOI5DX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DDCCW6TXTAKSYSRJBK7YAOI5DX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DDCCW6TXTAKSYSRJBK7YAOI5DX/action/storage_attestation","attest_author":"https://pith.science/pith/DDCCW6TXTAKSYSRJBK7YAOI5DX/action/author_attestation","sign_citation":"https://pith.science/pith/DDCCW6TXTAKSYSRJBK7YAOI5DX/action/citation_signature","submit_replication":"https://pith.science/pith/DDCCW6TXTAKSYSRJBK7YAOI5DX/action/replication_record"}},"created_at":"2026-07-05T12:08:02.234494+00:00","updated_at":"2026-07-05T12:08:02.234494+00:00"}