Pith. sign in

REVIEW 5 cited by

Language is All a Graph Needs

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2308.07134 v5 pith:LHTUE5I7 submitted 2023-08-14 cs.CL cs.AIcs.IRcs.LG

classification cs.CLcs.AIcs.IRcs.LG
keywords languagegraphllmsnaturalgenerativemodelfoundationgraphs
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The emergence of large-scale pre-trained language models has revolutionized various AI research domains. Transformers-based Large Language Models (LLMs) have gradually replaced CNNs and RNNs to unify fields of computer vision and natural language processing. Compared with independent data samples such as images, videos or texts, graphs usually contain rich structural and relational information. Meanwhile, language, especially natural language, being one of the most expressive mediums, excels in describing complex structures. However, existing work on incorporating graph problems into the generative language modeling framework remains very limited. Considering the rising prominence of LLMs, it becomes essential to explore whether LLMs can also replace GNNs as the foundation model for graphs. In this paper, we propose InstructGLM (Instruction-finetuned Graph Language Model) with highly scalable prompts based on natural language instructions. We use natural language to describe multi-scale geometric structure of the graph and then instruction finetune an LLM to perform graph tasks, which enables Generative Graph Learning. Our method surpasses all GNN baselines on ogbn-arxiv, Cora and PubMed datasets, underscoring its effectiveness and sheds light on generative LLMs as new foundation model for graph machine learning. Our code is open-sourced at https://github.com/agiresearch/InstructGLM.

Discussion (0). Sign in to comment.

Forward citations

Cited by 5 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Revisiting Graph-Tokenizing Large Language Models: A Systematic Evaluation of Graph Token Understanding

    cs.CL 2026-05 unverdicted novelty 6.0 of 10

    GTokenLLMs do not fully understand graph tokens, exhibiting over-sensitivity or insensitivity to instruction changes and relying heavily on text for reasoning even when graph information is preserved.

  2. Enhancing Large Language Model for Knowledge Graph Completion via Structure-Aware Alignment-Tuning

    cs.CL 2025-09 reject novelty 6.0 of 10

    SAT uses hierarchical contrastive alignment and a unified graph instruction to tune a lightweight adapter for knowledge graph completion, reporting large link prediction gains.

  3. Harnessing Adaptive Topology Representations for Zero-Shot Graph Question Answering

    cs.CL 2025-08 conditional novelty 6.0 of 10

    DynamicTRF learns question-level preferences over eight graph representations and routes each query to the best one, improving zero-shot graph QA accuracy and output brevity on seven algorithmic and two downstream tasks.

  4. No Data? No Problem: Synthesizing Security Graphs for Better Intrusion Detection

    cs.CR 2025-06 unverdicted novelty 5.0 of 10

    PROVSYN synthesizes high-fidelity security provenance graphs via graph generation and LLMs to augment imbalanced datasets, improving downstream APT detection accuracy by up to 38% on benchmarks.

  5. Intellectual Property in Graph-Based Machine Learning as a Service: Attacks and Defenses

    cs.CR 2025-08 conditional novelty 4.0 of 10

    A systematic review that organizes graph-ML IP protection into model-level and data-level attacks and defenses, and ships a benchmark library, PyGIP.

Pith tools