{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:Y6G2GXVU4QCAM3665V4U2HLFBF","short_pith_number":"pith:Y6G2GXVU","schema_version":"1.0","canonical_sha256":"c78da35eb4e404066fdeed794d1d65096041d0eb4ea8319faf86d7933744d0c8","source":{"kind":"arxiv","id":"2503.01642","version":1},"attestation_state":"computed","paper":{"title":"Graph-Augmented Reasoning: Evolving Step-by-Step Knowledge Graph Retrieval for LLM Reasoning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Dacheng Tao, Wenbin Hu, Wenjie Wu, Yingjie Wang, Yongcheng Jing","submitted_at":"2025-03-03T15:20:41Z","abstract_excerpt":"Recent large language model (LLM) reasoning, despite its success, suffers from limited domain knowledge, susceptibility to hallucinations, and constrained reasoning depth, particularly in small-scale models deployed in resource-constrained environments. This paper presents the first investigation into integrating step-wise knowledge graph retrieval with step-wise reasoning to address these challenges, introducing a novel paradigm termed as graph-augmented reasoning. Our goal is to enable frozen, small-scale LLMs to retrieve and process relevant mathematical knowledge in a step-wise manner, enh"},"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":"2503.01642","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-03-03T15:20:41Z","cross_cats_sorted":[],"title_canon_sha256":"2bf56ba3986ac118abf146325c261b28e02d53df9e18a028a38a35c573a18350","abstract_canon_sha256":"d94a8460012bf51d0528ad46c2fcd5bbb9af9876bbd243951a621d4654f780fc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:23:11.505853Z","signature_b64":"/LIRon5C/JVit3qzFpvGgz55B/TtJKw4sEueHIlGWEnkWGu2bXdeLNzQPCnZfpoN44bE1qkRNjPYoMVg9F3PCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c78da35eb4e404066fdeed794d1d65096041d0eb4ea8319faf86d7933744d0c8","last_reissued_at":"2026-07-05T10:23:11.505310Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:23:11.505310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph-Augmented Reasoning: Evolving Step-by-Step Knowledge Graph Retrieval for LLM Reasoning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Dacheng Tao, Wenbin Hu, Wenjie Wu, Yingjie Wang, Yongcheng Jing","submitted_at":"2025-03-03T15:20:41Z","abstract_excerpt":"Recent large language model (LLM) reasoning, despite its success, suffers from limited domain knowledge, susceptibility to hallucinations, and constrained reasoning depth, particularly in small-scale models deployed in resource-constrained environments. This paper presents the first investigation into integrating step-wise knowledge graph retrieval with step-wise reasoning to address these challenges, introducing a novel paradigm termed as graph-augmented reasoning. Our goal is to enable frozen, small-scale LLMs to retrieve and process relevant mathematical knowledge in a step-wise manner, enh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.01642","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/2503.01642/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":"2503.01642","created_at":"2026-07-05T10:23:11.505399+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.01642v1","created_at":"2026-07-05T10:23:11.505399+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.01642","created_at":"2026-07-05T10:23:11.505399+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y6G2GXVU4QCA","created_at":"2026-07-05T10:23:11.505399+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y6G2GXVU4QCAM366","created_at":"2026-07-05T10:23:11.505399+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y6G2GXVU","created_at":"2026-07-05T10:23:11.505399+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.02054","citing_title":"eMoT: evolving Memory-of-Thought via Symbolic Anchoring and Memory Corrosion","ref_index":22,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Y6G2GXVU4QCAM3665V4U2HLFBF","json":"https://pith.science/pith/Y6G2GXVU4QCAM3665V4U2HLFBF.json","graph_json":"https://pith.science/api/pith-number/Y6G2GXVU4QCAM3665V4U2HLFBF/graph.json","events_json":"https://pith.science/api/pith-number/Y6G2GXVU4QCAM3665V4U2HLFBF/events.json","paper":"https://pith.science/paper/Y6G2GXVU"},"agent_actions":{"view_html":"https://pith.science/pith/Y6G2GXVU4QCAM3665V4U2HLFBF","download_json":"https://pith.science/pith/Y6G2GXVU4QCAM3665V4U2HLFBF.json","view_paper":"https://pith.science/paper/Y6G2GXVU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.01642&json=true","fetch_graph":"https://pith.science/api/pith-number/Y6G2GXVU4QCAM3665V4U2HLFBF/graph.json","fetch_events":"https://pith.science/api/pith-number/Y6G2GXVU4QCAM3665V4U2HLFBF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y6G2GXVU4QCAM3665V4U2HLFBF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y6G2GXVU4QCAM3665V4U2HLFBF/action/storage_attestation","attest_author":"https://pith.science/pith/Y6G2GXVU4QCAM3665V4U2HLFBF/action/author_attestation","sign_citation":"https://pith.science/pith/Y6G2GXVU4QCAM3665V4U2HLFBF/action/citation_signature","submit_replication":"https://pith.science/pith/Y6G2GXVU4QCAM3665V4U2HLFBF/action/replication_record"}},"created_at":"2026-07-05T10:23:11.505399+00:00","updated_at":"2026-07-05T10:23:11.505399+00:00"}