{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:JCSTYNNRMW52LRZ3SRKZKAA4DV","short_pith_number":"pith:JCSTYNNR","schema_version":"1.0","canonical_sha256":"48a53c35b165bba5c73b945595001c1d676ac13bbcd5ca34d442167f031bb18a","source":{"kind":"arxiv","id":"2502.09304","version":2},"attestation_state":"computed","paper":{"title":"KET-RAG: A Cost-Efficient Multi-Granular Indexing Framework for Graph-RAG","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Shiqi Zhang, Xiaokui Xiao, Yiqian Huang","submitted_at":"2025-02-13T13:16:16Z","abstract_excerpt":"Graph-RAG constructs a knowledge graph from text chunks to improve retrieval in Large Language Model (LLM)-based question answering. It is particularly useful in domains such as biomedicine, law, and political science, where retrieval often requires multi-hop reasoning over proprietary documents. Some existing Graph-RAG systems construct KNN graphs based on text chunk relevance, but this coarse-grained approach fails to capture entity relationships within texts, leading to sub-par retrieval and generation quality. To address this, recent solutions leverage LLMs to extract entities and relation"},"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":"2502.09304","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2025-02-13T13:16:16Z","cross_cats_sorted":[],"title_canon_sha256":"bf1894028377102bb3c0ebaad9f3e5fa63c7c93e9182a888ffdf019a3e09dc2d","abstract_canon_sha256":"97d774d30a1cfaeb11487f9f1ae7faf34891e9d76f196e9ff6c5d4ef14ac1bc9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:14:53.591078Z","signature_b64":"Yh4zNy5Jn0C0Gnv3a5it88dAD6/K+LnBY9WNKiSk+Mcjeuz8eb4W2yyslsxU8CvMPI/La800Cf0zsU4Euv8/Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48a53c35b165bba5c73b945595001c1d676ac13bbcd5ca34d442167f031bb18a","last_reissued_at":"2026-07-05T11:14:53.590633Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:14:53.590633Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"KET-RAG: A Cost-Efficient Multi-Granular Indexing Framework for Graph-RAG","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Shiqi Zhang, Xiaokui Xiao, Yiqian Huang","submitted_at":"2025-02-13T13:16:16Z","abstract_excerpt":"Graph-RAG constructs a knowledge graph from text chunks to improve retrieval in Large Language Model (LLM)-based question answering. It is particularly useful in domains such as biomedicine, law, and political science, where retrieval often requires multi-hop reasoning over proprietary documents. Some existing Graph-RAG systems construct KNN graphs based on text chunk relevance, but this coarse-grained approach fails to capture entity relationships within texts, leading to sub-par retrieval and generation quality. To address this, recent solutions leverage LLMs to extract entities and relation"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.09304","kind":"arxiv","version":2},"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/2502.09304/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":"2502.09304","created_at":"2026-07-05T11:14:53.590690+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.09304v2","created_at":"2026-07-05T11:14:53.590690+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.09304","created_at":"2026-07-05T11:14:53.590690+00:00"},{"alias_kind":"pith_short_12","alias_value":"JCSTYNNRMW52","created_at":"2026-07-05T11:14:53.590690+00:00"},{"alias_kind":"pith_short_16","alias_value":"JCSTYNNRMW52LRZ3","created_at":"2026-07-05T11:14:53.590690+00:00"},{"alias_kind":"pith_short_8","alias_value":"JCSTYNNR","created_at":"2026-07-05T11:14:53.590690+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.28365","citing_title":"CAMI: Cost-Aware Agent-Guided Multi-Indexing for Semantic Retrieval","ref_index":24,"is_internal_anchor":false},{"citing_arxiv_id":"2502.09891","citing_title":"ArchRAG: Attributed Community-based Hierarchical Retrieval-Augmented Generation","ref_index":25,"is_internal_anchor":false},{"citing_arxiv_id":"2503.04338","citing_title":"In-depth Analysis of Graph-based RAG in a Unified Framework","ref_index":33,"is_internal_anchor":false},{"citing_arxiv_id":"2604.20844","citing_title":"AtomicRAG: Atom-Entity Graphs for Retrieval-Augmented Generation","ref_index":18,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JCSTYNNRMW52LRZ3SRKZKAA4DV","json":"https://pith.science/pith/JCSTYNNRMW52LRZ3SRKZKAA4DV.json","graph_json":"https://pith.science/api/pith-number/JCSTYNNRMW52LRZ3SRKZKAA4DV/graph.json","events_json":"https://pith.science/api/pith-number/JCSTYNNRMW52LRZ3SRKZKAA4DV/events.json","paper":"https://pith.science/paper/JCSTYNNR"},"agent_actions":{"view_html":"https://pith.science/pith/JCSTYNNRMW52LRZ3SRKZKAA4DV","download_json":"https://pith.science/pith/JCSTYNNRMW52LRZ3SRKZKAA4DV.json","view_paper":"https://pith.science/paper/JCSTYNNR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.09304&json=true","fetch_graph":"https://pith.science/api/pith-number/JCSTYNNRMW52LRZ3SRKZKAA4DV/graph.json","fetch_events":"https://pith.science/api/pith-number/JCSTYNNRMW52LRZ3SRKZKAA4DV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JCSTYNNRMW52LRZ3SRKZKAA4DV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JCSTYNNRMW52LRZ3SRKZKAA4DV/action/storage_attestation","attest_author":"https://pith.science/pith/JCSTYNNRMW52LRZ3SRKZKAA4DV/action/author_attestation","sign_citation":"https://pith.science/pith/JCSTYNNRMW52LRZ3SRKZKAA4DV/action/citation_signature","submit_replication":"https://pith.science/pith/JCSTYNNRMW52LRZ3SRKZKAA4DV/action/replication_record"}},"created_at":"2026-07-05T11:14:53.590690+00:00","updated_at":"2026-07-05T11:14:53.590690+00:00"}