{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:XHVYJVWTVVKPOC3DSWU7ZNOUZ7","short_pith_number":"pith:XHVYJVWT","schema_version":"1.0","canonical_sha256":"b9eb84d6d3ad54f70b6395a9fcb5d4cfc0c3af1209a8e8defe75f7118e838f96","source":{"kind":"arxiv","id":"2311.12399","version":4},"attestation_state":"computed","paper":{"title":"A Survey of Graph Meets Large Language Model: Progress and Future Directions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.SI"],"primary_cat":"cs.LG","authors_text":"Hong Cheng, Jeffrey Xu Yu, Jia Li, Peisong Wang, Xiangguo Sun, Yuhan Li, Zhixun Li","submitted_at":"2023-11-21T07:22:48Z","abstract_excerpt":"Graph plays a significant role in representing and analyzing complex relationships in real-world applications such as citation networks, social networks, and biological data. Recently, Large Language Models (LLMs), which have achieved tremendous success in various domains, have also been leveraged in graph-related tasks to surpass traditional Graph Neural Networks (GNNs) based methods and yield state-of-the-art performance. In this survey, we first present a comprehensive review and analysis of existing methods that integrate LLMs with graphs. First of all, we propose a new taxonomy, which org"},"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":"2311.12399","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-11-21T07:22:48Z","cross_cats_sorted":["cs.CL","cs.SI"],"title_canon_sha256":"a4253dfd293509b11335bf150360d5f4d06335030463834af080c0fcaaa125a1","abstract_canon_sha256":"51881589d603defa5a55a43386945799f353b398b8f9d5cb2532729620d75f79"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:11:42.087209Z","signature_b64":"Kq0LC5PaQ2OD9KH0LAtfBSdvagoBRsgRYvqxgazsvTX4Sa1Li3JO8DF3ACZSSZvtLnaFKFxfw5LgppbMk7cSCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9eb84d6d3ad54f70b6395a9fcb5d4cfc0c3af1209a8e8defe75f7118e838f96","last_reissued_at":"2026-07-05T08:11:42.086788Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:11:42.086788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Survey of Graph Meets Large Language Model: Progress and Future Directions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.SI"],"primary_cat":"cs.LG","authors_text":"Hong Cheng, Jeffrey Xu Yu, Jia Li, Peisong Wang, Xiangguo Sun, Yuhan Li, Zhixun Li","submitted_at":"2023-11-21T07:22:48Z","abstract_excerpt":"Graph plays a significant role in representing and analyzing complex relationships in real-world applications such as citation networks, social networks, and biological data. Recently, Large Language Models (LLMs), which have achieved tremendous success in various domains, have also been leveraged in graph-related tasks to surpass traditional Graph Neural Networks (GNNs) based methods and yield state-of-the-art performance. In this survey, we first present a comprehensive review and analysis of existing methods that integrate LLMs with graphs. First of all, we propose a new taxonomy, which org"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.12399","kind":"arxiv","version":4},"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/2311.12399/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":"2311.12399","created_at":"2026-07-05T08:11:42.086842+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.12399v4","created_at":"2026-07-05T08:11:42.086842+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.12399","created_at":"2026-07-05T08:11:42.086842+00:00"},{"alias_kind":"pith_short_12","alias_value":"XHVYJVWTVVKP","created_at":"2026-07-05T08:11:42.086842+00:00"},{"alias_kind":"pith_short_16","alias_value":"XHVYJVWTVVKPOC3D","created_at":"2026-07-05T08:11:42.086842+00:00"},{"alias_kind":"pith_short_8","alias_value":"XHVYJVWT","created_at":"2026-07-05T08:11:42.086842+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":11,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.11898","citing_title":"GraspLLM: Towards Zero-Shot Generalization on Text-Attributed Graphs with LLMs","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2606.06865","citing_title":"Are Large Language Models Suitable for Graph Computation? Progress and Prospects","ref_index":210,"is_internal_anchor":false},{"citing_arxiv_id":"2606.03712","citing_title":"When Graph Tokens Sink: A Mechanistic Analysis of Graph Language Models","ref_index":32,"is_internal_anchor":false},{"citing_arxiv_id":"2606.29773","citing_title":"GLIP: Graph and LLM Joint Pretraining for Graph-Level Tasks","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2510.12369","citing_title":"A Hierarchical Quantized Tokenization Framework for Task-Adaptive Graph Representation Learning","ref_index":31,"is_internal_anchor":false},{"citing_arxiv_id":"2605.21858","citing_title":"Hypergraph as Language","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2604.03666","citing_title":"MMP-Refer: Multimodal Path Retrieval-augmented LLMs For Explainable Recommendation","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2605.11706","citing_title":"GRAFT: Graph-Tokenized LLMs for Tool Planning","ref_index":27,"is_internal_anchor":false},{"citing_arxiv_id":"2605.12061","citing_title":"SAGE: A Self-Evolving Agentic Graph-Memory Engine for Structure-Aware Associative Memory","ref_index":177,"is_internal_anchor":false},{"citing_arxiv_id":"2604.19028","citing_title":"Learning Posterior Predictive Distributions for Node Classification from Synthetic Graph Priors","ref_index":300,"is_internal_anchor":false},{"citing_arxiv_id":"2605.02452","citing_title":"Position: How can Graphs Help Large Language Models?","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XHVYJVWTVVKPOC3DSWU7ZNOUZ7","json":"https://pith.science/pith/XHVYJVWTVVKPOC3DSWU7ZNOUZ7.json","graph_json":"https://pith.science/api/pith-number/XHVYJVWTVVKPOC3DSWU7ZNOUZ7/graph.json","events_json":"https://pith.science/api/pith-number/XHVYJVWTVVKPOC3DSWU7ZNOUZ7/events.json","paper":"https://pith.science/paper/XHVYJVWT"},"agent_actions":{"view_html":"https://pith.science/pith/XHVYJVWTVVKPOC3DSWU7ZNOUZ7","download_json":"https://pith.science/pith/XHVYJVWTVVKPOC3DSWU7ZNOUZ7.json","view_paper":"https://pith.science/paper/XHVYJVWT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.12399&json=true","fetch_graph":"https://pith.science/api/pith-number/XHVYJVWTVVKPOC3DSWU7ZNOUZ7/graph.json","fetch_events":"https://pith.science/api/pith-number/XHVYJVWTVVKPOC3DSWU7ZNOUZ7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XHVYJVWTVVKPOC3DSWU7ZNOUZ7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XHVYJVWTVVKPOC3DSWU7ZNOUZ7/action/storage_attestation","attest_author":"https://pith.science/pith/XHVYJVWTVVKPOC3DSWU7ZNOUZ7/action/author_attestation","sign_citation":"https://pith.science/pith/XHVYJVWTVVKPOC3DSWU7ZNOUZ7/action/citation_signature","submit_replication":"https://pith.science/pith/XHVYJVWTVVKPOC3DSWU7ZNOUZ7/action/replication_record"}},"created_at":"2026-07-05T08:11:42.086842+00:00","updated_at":"2026-07-05T08:11:42.086842+00:00"}