{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:PZK47RQJQGIGKLQCKF5WS7ZL6Z","short_pith_number":"pith:PZK47RQJ","schema_version":"1.0","canonical_sha256":"7e55cfc6098190652e02517b697f2bf67a64ca85f4a4258c4531b60f1931951a","source":{"kind":"arxiv","id":"2404.19234","version":1},"attestation_state":"computed","paper":{"title":"Multi-hop Question Answering over Knowledge Graphs using Large Language Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL","cs.DB"],"primary_cat":"cs.AI","authors_text":"Abir Chakraborty","submitted_at":"2024-04-30T03:31:03Z","abstract_excerpt":"Knowledge graphs (KGs) are large datasets with specific structures representing large knowledge bases (KB) where each node represents a key entity and relations amongst them are typed edges. Natural language queries formed to extract information from a KB entail starting from specific nodes and reasoning over multiple edges of the corresponding KG to arrive at the correct set of answer nodes. Traditional approaches of question answering on KG are based on (a) semantic parsing (SP), where a logical form (e.g., S-expression, SPARQL query, etc.) is generated using node and edge embeddings and the"},"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.19234","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2024-04-30T03:31:03Z","cross_cats_sorted":["cs.CL","cs.DB"],"title_canon_sha256":"3966d628517e76effd8bd16ddb478a9ab5d0b967238f81aa1b17b4fca7fa3204","abstract_canon_sha256":"67a93e997b8db0fadc26a15c71e63b61dceedfb2a9354ad8c2d53082fa11f693"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:13:40.330328Z","signature_b64":"GeVRFWhtXp72n2RR1qr6qjwIYFru+06YhSEG1NWEK4kQdn/ZVzc6vOLEcVKVRd1ItWfW8lyWfy9otWsNW37jDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e55cfc6098190652e02517b697f2bf67a64ca85f4a4258c4531b60f1931951a","last_reissued_at":"2026-07-05T08:13:40.329905Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:13:40.329905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-hop Question Answering over Knowledge Graphs using Large Language Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL","cs.DB"],"primary_cat":"cs.AI","authors_text":"Abir Chakraborty","submitted_at":"2024-04-30T03:31:03Z","abstract_excerpt":"Knowledge graphs (KGs) are large datasets with specific structures representing large knowledge bases (KB) where each node represents a key entity and relations amongst them are typed edges. Natural language queries formed to extract information from a KB entail starting from specific nodes and reasoning over multiple edges of the corresponding KG to arrive at the correct set of answer nodes. Traditional approaches of question answering on KG are based on (a) semantic parsing (SP), where a logical form (e.g., S-expression, SPARQL query, etc.) is generated using node and edge embeddings and the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.19234","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.19234/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.19234","created_at":"2026-07-05T08:13:40.329960+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.19234v1","created_at":"2026-07-05T08:13:40.329960+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.19234","created_at":"2026-07-05T08:13:40.329960+00:00"},{"alias_kind":"pith_short_12","alias_value":"PZK47RQJQGIG","created_at":"2026-07-05T08:13:40.329960+00:00"},{"alias_kind":"pith_short_16","alias_value":"PZK47RQJQGIGKLQC","created_at":"2026-07-05T08:13:40.329960+00:00"},{"alias_kind":"pith_short_8","alias_value":"PZK47RQJ","created_at":"2026-07-05T08:13:40.329960+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.05901","citing_title":"Reducing Hallucinations in Complex Question Answering using Simple Graph-based Retrieval-Augmented Generation (long version)","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2604.17458","citing_title":"EHRAG: Bridging Semantic Gaps in Lightweight GraphRAG via Hybrid Hypergraph Construction and Retrieval","ref_index":74,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PZK47RQJQGIGKLQCKF5WS7ZL6Z","json":"https://pith.science/pith/PZK47RQJQGIGKLQCKF5WS7ZL6Z.json","graph_json":"https://pith.science/api/pith-number/PZK47RQJQGIGKLQCKF5WS7ZL6Z/graph.json","events_json":"https://pith.science/api/pith-number/PZK47RQJQGIGKLQCKF5WS7ZL6Z/events.json","paper":"https://pith.science/paper/PZK47RQJ"},"agent_actions":{"view_html":"https://pith.science/pith/PZK47RQJQGIGKLQCKF5WS7ZL6Z","download_json":"https://pith.science/pith/PZK47RQJQGIGKLQCKF5WS7ZL6Z.json","view_paper":"https://pith.science/paper/PZK47RQJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.19234&json=true","fetch_graph":"https://pith.science/api/pith-number/PZK47RQJQGIGKLQCKF5WS7ZL6Z/graph.json","fetch_events":"https://pith.science/api/pith-number/PZK47RQJQGIGKLQCKF5WS7ZL6Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PZK47RQJQGIGKLQCKF5WS7ZL6Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PZK47RQJQGIGKLQCKF5WS7ZL6Z/action/storage_attestation","attest_author":"https://pith.science/pith/PZK47RQJQGIGKLQCKF5WS7ZL6Z/action/author_attestation","sign_citation":"https://pith.science/pith/PZK47RQJQGIGKLQCKF5WS7ZL6Z/action/citation_signature","submit_replication":"https://pith.science/pith/PZK47RQJQGIGKLQCKF5WS7ZL6Z/action/replication_record"}},"created_at":"2026-07-05T08:13:40.329960+00:00","updated_at":"2026-07-05T08:13:40.329960+00:00"}