{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:NFLVLHN2ENU2Y6LWZXZ22BIVJY","short_pith_number":"pith:NFLVLHN2","schema_version":"1.0","canonical_sha256":"6957559dba2369ac7976cdf3ad05154e3047e6e38276dae05ce141a930e94748","source":{"kind":"arxiv","id":"2408.04948","version":1},"attestation_state":"computed","paper":{"title":"HybridRAG: Integrating Knowledge Graphs and Vector Retrieval Augmented Generation for Efficient Information Extraction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","q-fin.ST","stat.AP","stat.ML"],"primary_cat":"cs.CL","authors_text":"Benika Hall, Bhaskarjit Sarmah, Dhagash Mehta, Rohan Rao, Stefano Pasquali, Sunil Patel","submitted_at":"2024-08-09T09:07:48Z","abstract_excerpt":"Extraction and interpretation of intricate information from unstructured text data arising in financial applications, such as earnings call transcripts, present substantial challenges to large language models (LLMs) even using the current best practices to use Retrieval Augmented Generation (RAG) (referred to as VectorRAG techniques which utilize vector databases for information retrieval) due to challenges such as domain specific terminology and complex formats of the documents. We introduce a novel approach based on a combination, called HybridRAG, of the Knowledge Graphs (KGs) based RAG tec"},"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":"2408.04948","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2024-08-09T09:07:48Z","cross_cats_sorted":["cs.LG","q-fin.ST","stat.AP","stat.ML"],"title_canon_sha256":"68fc3203b9f3acb079eeec5299f57713655fa3407ab29dbb5cf30c11458af858","abstract_canon_sha256":"9344a71f9de88208641431867f222bd900884a633b1c0f05df4f0f5f00f40539"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:53:46.220131Z","signature_b64":"rcM/6PUzF6Ia+jXnphALP8ECc2TWrWbWo0hz3uEwKJ3SAIu3SgZnQ8eLjIMP6i6b5bhYB4rE0sQJwqN3l3YUBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6957559dba2369ac7976cdf3ad05154e3047e6e38276dae05ce141a930e94748","last_reissued_at":"2026-07-05T08:53:46.219688Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:53:46.219688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"HybridRAG: Integrating Knowledge Graphs and Vector Retrieval Augmented Generation for Efficient Information Extraction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","q-fin.ST","stat.AP","stat.ML"],"primary_cat":"cs.CL","authors_text":"Benika Hall, Bhaskarjit Sarmah, Dhagash Mehta, Rohan Rao, Stefano Pasquali, Sunil Patel","submitted_at":"2024-08-09T09:07:48Z","abstract_excerpt":"Extraction and interpretation of intricate information from unstructured text data arising in financial applications, such as earnings call transcripts, present substantial challenges to large language models (LLMs) even using the current best practices to use Retrieval Augmented Generation (RAG) (referred to as VectorRAG techniques which utilize vector databases for information retrieval) due to challenges such as domain specific terminology and complex formats of the documents. We introduce a novel approach based on a combination, called HybridRAG, of the Knowledge Graphs (KGs) based RAG tec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.04948","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/2408.04948/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":"2408.04948","created_at":"2026-07-05T08:53:46.219743+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.04948v1","created_at":"2026-07-05T08:53:46.219743+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.04948","created_at":"2026-07-05T08:53:46.219743+00:00"},{"alias_kind":"pith_short_12","alias_value":"NFLVLHN2ENU2","created_at":"2026-07-05T08:53:46.219743+00:00"},{"alias_kind":"pith_short_16","alias_value":"NFLVLHN2ENU2Y6LW","created_at":"2026-07-05T08:53:46.219743+00:00"},{"alias_kind":"pith_short_8","alias_value":"NFLVLHN2","created_at":"2026-07-05T08:53:46.219743+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.08292","citing_title":"Reverse Engineering Compliance: A Dual-Graph Verification Framework for Auditing Legacy IT Security Concepts","ref_index":21,"is_internal_anchor":true},{"citing_arxiv_id":"2606.25608","citing_title":"An Approach for a Supporting Multi-LLM System for Automated Certification Based on the German IT-Grundschutz","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2604.27415","citing_title":"ChipLingo: A Systematic Training Framework for Large Language Models in EDA","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2605.00060","citing_title":"TADI: Tool-Augmented Drilling Intelligence via Agentic LLM Orchestration over Heterogeneous Wellsite Data","ref_index":27,"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":230,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NFLVLHN2ENU2Y6LWZXZ22BIVJY","json":"https://pith.science/pith/NFLVLHN2ENU2Y6LWZXZ22BIVJY.json","graph_json":"https://pith.science/api/pith-number/NFLVLHN2ENU2Y6LWZXZ22BIVJY/graph.json","events_json":"https://pith.science/api/pith-number/NFLVLHN2ENU2Y6LWZXZ22BIVJY/events.json","paper":"https://pith.science/paper/NFLVLHN2"},"agent_actions":{"view_html":"https://pith.science/pith/NFLVLHN2ENU2Y6LWZXZ22BIVJY","download_json":"https://pith.science/pith/NFLVLHN2ENU2Y6LWZXZ22BIVJY.json","view_paper":"https://pith.science/paper/NFLVLHN2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.04948&json=true","fetch_graph":"https://pith.science/api/pith-number/NFLVLHN2ENU2Y6LWZXZ22BIVJY/graph.json","fetch_events":"https://pith.science/api/pith-number/NFLVLHN2ENU2Y6LWZXZ22BIVJY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NFLVLHN2ENU2Y6LWZXZ22BIVJY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NFLVLHN2ENU2Y6LWZXZ22BIVJY/action/storage_attestation","attest_author":"https://pith.science/pith/NFLVLHN2ENU2Y6LWZXZ22BIVJY/action/author_attestation","sign_citation":"https://pith.science/pith/NFLVLHN2ENU2Y6LWZXZ22BIVJY/action/citation_signature","submit_replication":"https://pith.science/pith/NFLVLHN2ENU2Y6LWZXZ22BIVJY/action/replication_record"}},"created_at":"2026-07-05T08:53:46.219743+00:00","updated_at":"2026-07-05T08:53:46.219743+00:00"}