Pith. sign in

REVIEW 3 cited by

Exploring the Potential of Large Language Models (LLMs) in Learning on Graphs

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 2307.03393 v4 pith:VRJZIC4A submitted 2023-07-07 cs.LG cs.AI

classification cs.LGcs.AI
keywords llmslearninggraphsknowledgenodetextattributescomprehensive
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Learning on Graphs has attracted immense attention due to its wide real-world applications. The most popular pipeline for learning on graphs with textual node attributes primarily relies on Graph Neural Networks (GNNs), and utilizes shallow text embedding as initial node representations, which has limitations in general knowledge and profound semantic understanding. In recent years, Large Language Models (LLMs) have been proven to possess extensive common knowledge and powerful semantic comprehension abilities that have revolutionized existing workflows to handle text data. In this paper, we aim to explore the potential of LLMs in graph machine learning, especially the node classification task, and investigate two possible pipelines: LLMs-as-Enhancers and LLMs-as-Predictors. The former leverages LLMs to enhance nodes' text attributes with their massive knowledge and then generate predictions through GNNs. The latter attempts to directly employ LLMs as standalone predictors. We conduct comprehensive and systematical studies on these two pipelines under various settings. From comprehensive empirical results, we make original observations and find new insights that open new possibilities and suggest promising directions to leverage LLMs for learning on graphs. Our codes and datasets are available at https://github.com/CurryTang/Graph-LLM.

Discussion (0). Sign in to comment.

Forward citations

Cited by 3 Pith papers

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

  1. Where LLM Annotators Fail: Label-Free Learning on Graphs with LLMs

    cs.LG 2026-05 unverdicted novelty 6.0 of 10

    CANE estimates cluster-specific reliability of noisy LLM pseudo-labels on graphs without ground truth to improve label-free node classification.

  2. Handling Feature Heterogeneity with Learnable Graph Patches

    cs.LG 2026-06 unverdicted novelty 5.0 of 10

    Learnable graph patches enable domain-agnostic pre-training of graph models by decomposing heterogeneous graphs into transferable semantic units via patch encoders and aggregators.

  3. Probabilistic Salary Prediction with Graph Attention Networks and a Mixture Density Network

    cs.SI 2026-06 unverdicted novelty 5.0 of 10

    GAT-MDN uses domain-specific graphs with GATs plus an MDN head to output conditional salary distributions and reports better NLL and MSE than an MLP-MDN baseline on a Dutch job dataset of over 1M records.

Pith tools