Papers › Label-free Node Classification on Graphs with Large Language Models (LLMS)

Label-free Node Classification on Graphs with Large Language Models (LLMS)

7 Oct 2023arXiv:2310.04668archive 2025-07-28

Zhikai Chen, Haitao Mao, Hongzhi Wen, Haoyu Han, Wei Jin, Haiyang Zhang, Hui Liu, Jiliang Tang

In recent years, there have been remarkable advancements in node classification achieved by Graph Neural Networks (GNNs). However, they necessitate abundant high-quality labels to ensure promising performance. In contrast, Large Language Models (LLMs) exhibit impressive zero-shot proficiency on text-attributed graphs. Yet, they face challenges in efficiently processing structural data and suffer from high inference costs. In light of these observations, this work introduces a label-free node classification on graphs with LLMs pipeline, LLM-GNN. It amalgamates the strengths of both GNNs and LLMs while mitigating their limitations. Specifically, LLMs are leveraged to annotate a small portion of nodes and then GNNs are trained on LLMs' annotations to make predictions for the remaining large portion of nodes. The implementation of LLM-GNN faces a unique challenge: how can we actively select nodes for LLMs to annotate and consequently enhance the GNN training? How can we leverage LLMs to obtain annotations of high quality, representativeness, and diversity, thereby enhancing GNN performance with less cost? To tackle this challenge, we develop an annotation quality heuristic and leverage the confidence scores derived from LLMs to advanced node selection. Comprehensive experimental results validate the effectiveness of LLM-GNN. In particular, LLM-GNN can achieve an accuracy of 74.9% on a vast-scale dataset \products with a cost less than 1 dollar.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2310.04668")

Code

Syntology Ran 22 of 29 code samples harvested from 2 repositories linked to this paper; 7 have no recorded run. Of those that ran: 1 ran · honoured contract; 3 ran · our draft was wrong; 18 ran with no contract checked.

By repository: official repository: 10 samples from 1 repository, 5 ran; found in paper text by Syntology: 19 samples from 1 repository, 17 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

currytang/llmgnn officialmentioned in papermentioned on GitHubpytorch report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

29 samples harvested; 22 ran; 1 honoured the contract we drafted; 7 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

1ran · honoured contract
3ran · our draft was wrong
18ran
7unverified

Licence: 10 of the 29 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from 2 repositories linked to this paper, official or community; each sample names its own and says which. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

get_different_num CurryTang/LLMGNN/src/helper/data.py official repository ran · honoured contract fingerprinted no licence file found · pointer only · 393a0d8988f753de · report
inject_random_noise CurryTang/LLMGNN/src/helper/data.py official repository ran · our draft was wrong no licence file found · pointer only · 7841874972fcbc73 · report
keep_first_n_words CurryTang/LLMGNN/src/llm.py official repository ran · our draft was wrong fingerprinted no licence file found · pointer only · e2a07418f83e3b77 · report
most_common_number CurryTang/LLMGNN/src/llm.py official repository ran · our draft was wrong fingerprinted no licence file found · pointer only · 78364baf10dfdc68 · report
replace_args_with_dict_values currytang/llmgnn/src/helper/args.py official repository ran no licence file found · pointer only · ca3bd8e13278c0f7 · report
budget_density_query currytang/llmgnn/src/helper/active.py official repository unverified no licence file found · pointer only · 71366d46fc7695ec · report
budget_density_query2 currytang/llmgnn/src/helper/active.py official repository unverified no licence file found · pointer only · 492a608a449a11f4 · report
get_T_HOC currytang/llmgnn/src/helper/hoc.py official repository unverified no licence file found · pointer only · a8799dcc333a0cdf · report
get_T_P_global currytang/llmgnn/src/helper/hoc.py official repository unverified no licence file found · pointer only · d1b530f92e04557e · report
get_T_P_local currytang/llmgnn/src/helper/hoc.py official repository unverified no licence file found · pointer only · 26a4b05c4ea2e051 · report
calc_ratios pmernyei/wiki-cs-dataset/data_processing/pyscripts/calc_sim_neighbours.py found in paper text by Syntology ran MIT (permissive) · 6061fb3161a49f36 · report
calculate_avg_cosine_similarities pmernyei/wiki-cs-dataset/data_processing/pyscripts/analyze_datasets.py found in paper text by Syntology ran MIT (permissive) · ddc2ead4604bc732 · report
calculate_connectivity_stats pmernyei/wiki-cs-dataset/data_processing/pyscripts/analyze_datasets.py found in paper text by Syntology ran MIT (permissive) · 0b02ef4443cf1e77 · report
calculate_milestone_tree pmernyei/wiki-cs-dataset/data_processing/pyscripts/inspect_milestone_tree.py found in paper text by Syntology ran MIT (permissive) · f87b1e7f91458a7b · report
get_all_descendants pmernyei/wiki-cs-dataset/data_processing/pyscripts/inspect_milestone_tree.py found in paper text by Syntology ran MIT (permissive) · 0778263c5d981ef7 · report
get_values pmernyei/wiki-cs-dataset/data_processing/pyscripts/mysqldump_to_csv.py found in paper text by Syntology ran fingerprinted MIT (permissive) · 2b9ee849ce40d859 · report
is_insert pmernyei/wiki-cs-dataset/data_processing/pyscripts/mysqldump_to_csv.py found in paper text by Syntology ran MIT (permissive) · 0354e7c71fe7c820 · report
label_set pmernyei/wiki-cs-dataset/data_processing/pyscripts/process_dataset.py found in paper text by Syntology ran MIT (permissive) · a559c37cf21d8253 · report
load_data pmernyei/wiki-cs-dataset/experiments/linkprediction/load_wiki.py found in paper text by Syntology ran MIT (permissive) · 465405a2bbb6bd57 · report
load_glove_dict pmernyei/wiki-cs-dataset/data_processing/pyscripts/process_dataset.py found in paper text by Syntology ran MIT (permissive) · 7baee91fefde7b99 · report
load_redirects pmernyei/wiki-cs-dataset/data_processing/pyscripts/extract_full_data_for_dataset.py found in paper text by Syntology ran MIT (permissive) · 04fc08ae6a6e7056 · report
load_wiki pmernyei/wiki-cs-dataset/data_processing/pyscripts/calc_shortest_paths.py found in paper text by Syntology ran MIT (permissive) · d3648e98b2f4d8ef · report
load_wiki pmernyei/wiki-cs-dataset/data_processing/pyscripts/calc_sim_neighbours.py found in paper text by Syntology ran MIT (permissive) · 2003a5c4bbb37699 · report
page_titles_to_ids pmernyei/wiki-cs-dataset/data_processing/pyscripts/extract_full_data_for_dataset.py found in paper text by Syntology ran MIT (permissive) · 17e9b89c587f323d · report
page_titles_to_labels pmernyei/wiki-cs-dataset/data_processing/pyscripts/extract_full_data_for_dataset.py found in paper text by Syntology ran MIT (permissive) · 46b893445845c5f7 · report
raw_data_dict pmernyei/wiki-cs-dataset/data_processing/pyscripts/process_dataset.py found in paper text by Syntology ran MIT (permissive) · 0199f42427faddb5 · report
values_sanity_check pmernyei/wiki-cs-dataset/data_processing/pyscripts/mysqldump_to_csv.py found in paper text by Syntology ran MIT (permissive) · 50aabaf962cff885 · report
bfs_component pmernyei/wiki-cs-dataset/data_processing/pyscripts/calc_shortest_paths.py found in paper text by Syntology unverified MIT (permissive) · 640e9a0511864dc6 · report
get_category_sizes pmernyei/wiki-cs-dataset/data_processing/pyscripts/inspect_milestone_tree.py found in paper text by Syntology unverified MIT (permissive) · 7d905d3619fb5a98 · report

Tasks

Node Classification

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections