{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:NDWJV4OU3A7YB2NGODG3J3RTQA","short_pith_number":"pith:NDWJV4OU","schema_version":"1.0","canonical_sha256":"68ec9af1d4d83f80e9a670cdb4ee338018a851b40058901e9ca3905cdcec4a32","source":{"kind":"arxiv","id":"2404.10384","version":1},"attestation_state":"computed","paper":{"title":"Reasoning on Efficient Knowledge Paths:Knowledge Graph Guides Large Language Model for Domain Question Answering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.IR"],"primary_cat":"cs.CL","authors_text":"Boran Jiang, Dawei He, Liangcai Gao, Peng Cheng, Yi Luo, Yuqi Wang","submitted_at":"2024-04-16T08:28:16Z","abstract_excerpt":"Large language models (LLMs), such as GPT3.5, GPT4 and LLAMA2 perform surprisingly well and outperform human experts on many tasks. However, in many domain-specific evaluations, these LLMs often suffer from hallucination problems due to insufficient training of relevant corpus. Furthermore, fine-tuning large models may face problems such as the LLMs are not open source or the construction of high-quality domain instruction is difficult. Therefore, structured knowledge databases such as knowledge graph can better provide domain background knowledge for LLMs and make full use of the reasoning an"},"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":"2404.10384","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2024-04-16T08:28:16Z","cross_cats_sorted":["cs.AI","cs.IR"],"title_canon_sha256":"eff6e2422c9e0f15f634fb1e3bd1a81a5b510ec9771b914e42dcd605a16a2fb1","abstract_canon_sha256":"2c865a0344fcb26de7d9555c38686bac98cd4fff0df5d5d56050bab2f5133e3e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:09:30.353296Z","signature_b64":"KSh3f9YlaMiq0VYATXIVKezFMIJO2smu/DvqYz4cRkk4W6Oo3i5av8zaJ+PAe6iUZVNAl+ncINufeKRxyNcvAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68ec9af1d4d83f80e9a670cdb4ee338018a851b40058901e9ca3905cdcec4a32","last_reissued_at":"2026-07-05T08:09:30.352846Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:09:30.352846Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reasoning on Efficient Knowledge Paths:Knowledge Graph Guides Large Language Model for Domain Question Answering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.IR"],"primary_cat":"cs.CL","authors_text":"Boran Jiang, Dawei He, Liangcai Gao, Peng Cheng, Yi Luo, Yuqi Wang","submitted_at":"2024-04-16T08:28:16Z","abstract_excerpt":"Large language models (LLMs), such as GPT3.5, GPT4 and LLAMA2 perform surprisingly well and outperform human experts on many tasks. However, in many domain-specific evaluations, these LLMs often suffer from hallucination problems due to insufficient training of relevant corpus. Furthermore, fine-tuning large models may face problems such as the LLMs are not open source or the construction of high-quality domain instruction is difficult. Therefore, structured knowledge databases such as knowledge graph can better provide domain background knowledge for LLMs and make full use of the reasoning an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.10384","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/2404.10384/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":"2404.10384","created_at":"2026-07-05T08:09:30.352908+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.10384v1","created_at":"2026-07-05T08:09:30.352908+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.10384","created_at":"2026-07-05T08:09:30.352908+00:00"},{"alias_kind":"pith_short_12","alias_value":"NDWJV4OU3A7Y","created_at":"2026-07-05T08:09:30.352908+00:00"},{"alias_kind":"pith_short_16","alias_value":"NDWJV4OU3A7YB2NG","created_at":"2026-07-05T08:09:30.352908+00:00"},{"alias_kind":"pith_short_8","alias_value":"NDWJV4OU","created_at":"2026-07-05T08:09:30.352908+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.20417","citing_title":"KG-CQR: Leveraging Structured Relation Representations in Knowledge Graphs for Contextual Query Retrieval","ref_index":40,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NDWJV4OU3A7YB2NGODG3J3RTQA","json":"https://pith.science/pith/NDWJV4OU3A7YB2NGODG3J3RTQA.json","graph_json":"https://pith.science/api/pith-number/NDWJV4OU3A7YB2NGODG3J3RTQA/graph.json","events_json":"https://pith.science/api/pith-number/NDWJV4OU3A7YB2NGODG3J3RTQA/events.json","paper":"https://pith.science/paper/NDWJV4OU"},"agent_actions":{"view_html":"https://pith.science/pith/NDWJV4OU3A7YB2NGODG3J3RTQA","download_json":"https://pith.science/pith/NDWJV4OU3A7YB2NGODG3J3RTQA.json","view_paper":"https://pith.science/paper/NDWJV4OU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.10384&json=true","fetch_graph":"https://pith.science/api/pith-number/NDWJV4OU3A7YB2NGODG3J3RTQA/graph.json","fetch_events":"https://pith.science/api/pith-number/NDWJV4OU3A7YB2NGODG3J3RTQA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NDWJV4OU3A7YB2NGODG3J3RTQA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NDWJV4OU3A7YB2NGODG3J3RTQA/action/storage_attestation","attest_author":"https://pith.science/pith/NDWJV4OU3A7YB2NGODG3J3RTQA/action/author_attestation","sign_citation":"https://pith.science/pith/NDWJV4OU3A7YB2NGODG3J3RTQA/action/citation_signature","submit_replication":"https://pith.science/pith/NDWJV4OU3A7YB2NGODG3J3RTQA/action/replication_record"}},"created_at":"2026-07-05T08:09:30.352908+00:00","updated_at":"2026-07-05T08:09:30.352908+00:00"}