{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:TVV65YTUG73HBFJFRGQ7QAVKIL","short_pith_number":"pith:TVV65YTU","schema_version":"1.0","canonical_sha256":"9d6beee27437f670952589a1f802aa42cf98a37a0c46874665a280a71a885ef1","source":{"kind":"arxiv","id":"2506.02404","version":3},"attestation_state":"computed","paper":{"title":"GraphRAG-Bench: Challenging Domain-Specific Reasoning for Evaluating Graph Retrieval-Augmented Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Chuang Zhou, Di Yin, Junnan Dong, Qian-Wen Zhang, Su Dong, Xiao Huang, Xing Sun, Yilin Xiao","submitted_at":"2025-06-03T03:44:26Z","abstract_excerpt":"Graph Retrieval Augmented Generation (GraphRAG) has garnered increasing recognition for its potential to enhance large language models (LLMs) by structurally organizing domain-specific corpora and facilitating complex reasoning. However, current evaluations of GraphRAG models predominantly rely on traditional question-answering datasets. Their limited scope in questions and evaluation metrics fails to comprehensively assess the reasoning capacity improvements enabled by GraphRAG models. To address this gap, we introduce GraphRAG-Bench, a large-scale, domain-specific benchmark designed to rigor"},"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":"2506.02404","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2025-06-03T03:44:26Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"30cbe1ea3d888b102ae61c623f197794e78405f1fe254e15bb9824d1c07fdc8f","abstract_canon_sha256":"e3bfce35e3e502cb895acc260f931d4f8c5c3b9842905e6377ff03813164f7c4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:24:21.852799Z","signature_b64":"kgsVe5KrZEmGITFyjD3u7ShCi2iqszegcX7eSojEEjUHc/aIZIDqA6DUq++FVsdft5ijYCX5WR5pZIYBZRrwCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d6beee27437f670952589a1f802aa42cf98a37a0c46874665a280a71a885ef1","last_reissued_at":"2026-07-05T11:24:21.852287Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:24:21.852287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GraphRAG-Bench: Challenging Domain-Specific Reasoning for Evaluating Graph Retrieval-Augmented Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Chuang Zhou, Di Yin, Junnan Dong, Qian-Wen Zhang, Su Dong, Xiao Huang, Xing Sun, Yilin Xiao","submitted_at":"2025-06-03T03:44:26Z","abstract_excerpt":"Graph Retrieval Augmented Generation (GraphRAG) has garnered increasing recognition for its potential to enhance large language models (LLMs) by structurally organizing domain-specific corpora and facilitating complex reasoning. However, current evaluations of GraphRAG models predominantly rely on traditional question-answering datasets. Their limited scope in questions and evaluation metrics fails to comprehensively assess the reasoning capacity improvements enabled by GraphRAG models. To address this gap, we introduce GraphRAG-Bench, a large-scale, domain-specific benchmark designed to rigor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.02404","kind":"arxiv","version":3},"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/2506.02404/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":"2506.02404","created_at":"2026-07-05T11:24:21.852357+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.02404v3","created_at":"2026-07-05T11:24:21.852357+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.02404","created_at":"2026-07-05T11:24:21.852357+00:00"},{"alias_kind":"pith_short_12","alias_value":"TVV65YTUG73H","created_at":"2026-07-05T11:24:21.852357+00:00"},{"alias_kind":"pith_short_16","alias_value":"TVV65YTUG73HBFJF","created_at":"2026-07-05T11:24:21.852357+00:00"},{"alias_kind":"pith_short_8","alias_value":"TVV65YTU","created_at":"2026-07-05T11:24:21.852357+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":7,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.11562","citing_title":"GraphInfer-Bench: Benchmarking LLM's Inference Capability on Graphs","ref_index":34,"is_internal_anchor":false},{"citing_arxiv_id":"2606.05901","citing_title":"Reducing Hallucinations in Complex Question Answering using Simple Graph-based Retrieval-Augmented Generation (long version)","ref_index":59,"is_internal_anchor":false},{"citing_arxiv_id":"2605.31010","citing_title":"MoG: Mixture of Experts for Graph-based Retrieval-Augmented Generation","ref_index":36,"is_internal_anchor":false},{"citing_arxiv_id":"2606.30093","citing_title":"Efficient Retrieval-Augmented Generation via Token Co-occurrence Graphs","ref_index":45,"is_internal_anchor":false},{"citing_arxiv_id":"2509.24276","citing_title":"G-reasoner: Foundation Models for Unified Reasoning over Graph-structured Knowledge","ref_index":48,"is_internal_anchor":false},{"citing_arxiv_id":"2604.02954","citing_title":"LogicPoison: Logical Attacks on Graph Retrieval-Augmented Generation","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2605.00529","citing_title":"Hierarchical Abstract Tree for Cross-Document Retrieval-Augmented Generation","ref_index":20,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TVV65YTUG73HBFJFRGQ7QAVKIL","json":"https://pith.science/pith/TVV65YTUG73HBFJFRGQ7QAVKIL.json","graph_json":"https://pith.science/api/pith-number/TVV65YTUG73HBFJFRGQ7QAVKIL/graph.json","events_json":"https://pith.science/api/pith-number/TVV65YTUG73HBFJFRGQ7QAVKIL/events.json","paper":"https://pith.science/paper/TVV65YTU"},"agent_actions":{"view_html":"https://pith.science/pith/TVV65YTUG73HBFJFRGQ7QAVKIL","download_json":"https://pith.science/pith/TVV65YTUG73HBFJFRGQ7QAVKIL.json","view_paper":"https://pith.science/paper/TVV65YTU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.02404&json=true","fetch_graph":"https://pith.science/api/pith-number/TVV65YTUG73HBFJFRGQ7QAVKIL/graph.json","fetch_events":"https://pith.science/api/pith-number/TVV65YTUG73HBFJFRGQ7QAVKIL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TVV65YTUG73HBFJFRGQ7QAVKIL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TVV65YTUG73HBFJFRGQ7QAVKIL/action/storage_attestation","attest_author":"https://pith.science/pith/TVV65YTUG73HBFJFRGQ7QAVKIL/action/author_attestation","sign_citation":"https://pith.science/pith/TVV65YTUG73HBFJFRGQ7QAVKIL/action/citation_signature","submit_replication":"https://pith.science/pith/TVV65YTUG73HBFJFRGQ7QAVKIL/action/replication_record"}},"created_at":"2026-07-05T11:24:21.852357+00:00","updated_at":"2026-07-05T11:24:21.852357+00:00"}