{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:7IBFL5OOQVULC3PE5CQNZS3MHB","short_pith_number":"pith:7IBFL5OO","schema_version":"1.0","canonical_sha256":"fa0255f5ce8568b16de4e8a0dccb6c3874499b4276a647c8dda639cb6855c607","source":{"kind":"arxiv","id":"2402.07630","version":3},"attestation_state":"computed","paper":{"title":"G-Retriever: Retrieval-Augmented Generation for Textual Graph Understanding and Question Answering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bryan Hooi, Nitesh V. Chawla, Thomas Laurent, Xavier Bresson, Xiaoxin He, Yann LeCun, Yifei Sun, Yijun Tian","submitted_at":"2024-02-12T13:13:04Z","abstract_excerpt":"Given a graph with textual attributes, we enable users to `chat with their graph': that is, to ask questions about the graph using a conversational interface. In response to a user's questions, our method provides textual replies and highlights the relevant parts of the graph. While existing works integrate large language models (LLMs) and graph neural networks (GNNs) in various ways, they mostly focus on either conventional graph tasks (such as node, edge, and graph classification), or on answering simple graph queries on small or synthetic graphs. In contrast, we develop a flexible question-"},"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":"2402.07630","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-02-12T13:13:04Z","cross_cats_sorted":[],"title_canon_sha256":"95231a1c63ae5cac41842a3648f4f53a208a4b1566ecd92f9b4c8c933d1b5130","abstract_canon_sha256":"962271d3391c69c7599be5cbea2d191e3bbebd82c6f5b13fdfcc0575af162335"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:23:17.903885Z","signature_b64":"tYQM3ps5N++tNFwnmm0/6sKg+SkpdOcwwDkShrlt40gxuTBpVOSw6r/z0GMcRHffB4tvqTCEbcpdo8oQUpf9Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa0255f5ce8568b16de4e8a0dccb6c3874499b4276a647c8dda639cb6855c607","last_reissued_at":"2026-07-05T08:23:17.903415Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:23:17.903415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"G-Retriever: Retrieval-Augmented Generation for Textual Graph Understanding and Question Answering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bryan Hooi, Nitesh V. Chawla, Thomas Laurent, Xavier Bresson, Xiaoxin He, Yann LeCun, Yifei Sun, Yijun Tian","submitted_at":"2024-02-12T13:13:04Z","abstract_excerpt":"Given a graph with textual attributes, we enable users to `chat with their graph': that is, to ask questions about the graph using a conversational interface. In response to a user's questions, our method provides textual replies and highlights the relevant parts of the graph. While existing works integrate large language models (LLMs) and graph neural networks (GNNs) in various ways, they mostly focus on either conventional graph tasks (such as node, edge, and graph classification), or on answering simple graph queries on small or synthetic graphs. In contrast, we develop a flexible question-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.07630","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/2402.07630/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":"2402.07630","created_at":"2026-07-05T08:23:17.903471+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.07630v3","created_at":"2026-07-05T08:23:17.903471+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.07630","created_at":"2026-07-05T08:23:17.903471+00:00"},{"alias_kind":"pith_short_12","alias_value":"7IBFL5OOQVUL","created_at":"2026-07-05T08:23:17.903471+00:00"},{"alias_kind":"pith_short_16","alias_value":"7IBFL5OOQVULC3PE","created_at":"2026-07-05T08:23:17.903471+00:00"},{"alias_kind":"pith_short_8","alias_value":"7IBFL5OO","created_at":"2026-07-05T08:23:17.903471+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":19,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.13669","citing_title":"Agents-K1: Towards Agent-native Knowledge Orchestration","ref_index":48,"is_internal_anchor":false},{"citing_arxiv_id":"2605.31010","citing_title":"MoG: Mixture of Experts for Graph-based Retrieval-Augmented Generation","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2606.13669","citing_title":"Agents-K1: Towards Agent-native Knowledge Orchestration","ref_index":48,"is_internal_anchor":false},{"citing_arxiv_id":"2605.29606","citing_title":"HiKEY: Hierarchical Multimodal Retrieval for Open-Domain Document Question Answering","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2606.00610","citing_title":"MemGraphRAG: Memory-based Multi-Agent System for Graph Retrieval-Augmented Generation","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2312.10997","citing_title":"Retrieval-Augmented Generation for Large Language Models: A Survey","ref_index":84,"is_internal_anchor":false},{"citing_arxiv_id":"2501.17549","citing_title":"Query-Aware Learnable Graph Pooling Tokens as Prompt for Large Language Models","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2502.09891","citing_title":"ArchRAG: Attributed Community-based Hierarchical Retrieval-Augmented Generation","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2503.04338","citing_title":"In-depth Analysis of Graph-based RAG in a Unified Framework","ref_index":28,"is_internal_anchor":false},{"citing_arxiv_id":"2605.09033","citing_title":"ShadowMerge: A Novel Poisoning Attack on Graph-Based Agent Memory via Relation-Channel Conflicts","ref_index":51,"is_internal_anchor":false},{"citing_arxiv_id":"2501.00309","citing_title":"Retrieval-Augmented Generation with Graphs (GraphRAG)","ref_index":147,"is_internal_anchor":false},{"citing_arxiv_id":"2601.13969","citing_title":"Autonomous Knowledge Graph Exploration with Adaptive Breadth-Depth Retrieval","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2402.19473","citing_title":"Retrieval-Augmented Generation for AI-Generated Content: A Survey","ref_index":300,"is_internal_anchor":false},{"citing_arxiv_id":"2605.09033","citing_title":"ShadowMerge: A Novel Poisoning Attack on Graph-Based Agent Memory via Relation-Channel Conflicts","ref_index":51,"is_internal_anchor":false},{"citing_arxiv_id":"2604.09666","citing_title":"Do We Still Need GraphRAG? Benchmarking RAG and GraphRAG for Agentic Search Systems","ref_index":12,"is_internal_anchor":false},{"citing_arxiv_id":"2410.05779","citing_title":"LightRAG: Simple and Fast Retrieval-Augmented Generation","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2605.09033","citing_title":"ShadowMerge: A Novel Poisoning Attack on Graph-Based Agent Memory via Relation-Channel Conflicts","ref_index":52,"is_internal_anchor":false},{"citing_arxiv_id":"2404.16130","citing_title":"From Local to Global: A Graph RAG Approach to Query-Focused Summarization","ref_index":19,"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":125,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7IBFL5OOQVULC3PE5CQNZS3MHB","json":"https://pith.science/pith/7IBFL5OOQVULC3PE5CQNZS3MHB.json","graph_json":"https://pith.science/api/pith-number/7IBFL5OOQVULC3PE5CQNZS3MHB/graph.json","events_json":"https://pith.science/api/pith-number/7IBFL5OOQVULC3PE5CQNZS3MHB/events.json","paper":"https://pith.science/paper/7IBFL5OO"},"agent_actions":{"view_html":"https://pith.science/pith/7IBFL5OOQVULC3PE5CQNZS3MHB","download_json":"https://pith.science/pith/7IBFL5OOQVULC3PE5CQNZS3MHB.json","view_paper":"https://pith.science/paper/7IBFL5OO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.07630&json=true","fetch_graph":"https://pith.science/api/pith-number/7IBFL5OOQVULC3PE5CQNZS3MHB/graph.json","fetch_events":"https://pith.science/api/pith-number/7IBFL5OOQVULC3PE5CQNZS3MHB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7IBFL5OOQVULC3PE5CQNZS3MHB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7IBFL5OOQVULC3PE5CQNZS3MHB/action/storage_attestation","attest_author":"https://pith.science/pith/7IBFL5OOQVULC3PE5CQNZS3MHB/action/author_attestation","sign_citation":"https://pith.science/pith/7IBFL5OOQVULC3PE5CQNZS3MHB/action/citation_signature","submit_replication":"https://pith.science/pith/7IBFL5OOQVULC3PE5CQNZS3MHB/action/replication_record"}},"created_at":"2026-07-05T08:23:17.903471+00:00","updated_at":"2026-07-05T08:23:17.903471+00:00"}