Papers › Exploring Graph Tasks with Pure LLMs: A Comprehensive Benchmark and Investigation

Exploring Graph Tasks with Pure LLMs: A Comprehensive Benchmark and Investigation

26 Feb 2025arXiv:2502.18771archive 2025-07-28

Yuxiang Wang, Xinnan Dai, Wenqi Fan, Yao Ma

Graph-structured data has become increasingly prevalent across various domains, raising the demand for effective models to handle graph tasks like node classification and link prediction. Traditional graph learning models like Graph Neural Networks (GNNs) have made significant strides, but their capabilities in handling graph data remain limited in certain contexts. In recent years, large language models (LLMs) have emerged as promising candidates for graph tasks, yet most studies focus primarily on performance benchmarks and fail to address their broader potential, including their ability to handle limited data, their transferability across tasks, and their robustness. In this work, we provide a comprehensive exploration of LLMs applied to graph tasks. We evaluate the performance of pure LLMs, including those without parameter optimization and those fine-tuned with instructions, across various scenarios. Our analysis goes beyond accuracy, assessing LLM ability to perform in few-shot/zero-shot settings, transfer across domains, understand graph structures, and demonstrate robustness in challenging scenarios. We conduct extensive experiments with 16 graph learning models alongside 6 LLMs (e.g., Llama3B, GPT-4o, Qwen-plus), comparing their performance on datasets like Cora, PubMed, ArXiv, and Products. Our findings show that LLMs, particularly those with instruction tuning, outperform traditional models in few-shot settings, exhibit strong domain transferability, and demonstrate excellent generalization and robustness. This work offers valuable insights into the capabilities of LLMs for graph learning, highlighting their advantages and potential for real-world applications, and paving the way for future research in this area. Codes and datasets are released in https://github.com/myflashbarry/LLM-benchmarking.

PaperPDFCodeCode Syntology ran

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

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

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 12 code samples harvested from 1 repository linked to this paper: 8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code; here there are none.

By repository: official repository: 12 samples from 1 repository, 8 ran (8 with no instrument failure; 0 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Levels written between 2026-09-24 and 2026-09-25 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

myflashbarry/LLM-benchmarking officialmentioned in paperpytorchApache-2.0Syntology: 12 samples, 8 ran (0 instrument-failed) · 4 unverified 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

12 samples harvested: 8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

8ran
4unverified

Licence: 0 of the 12 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 myflashbarry/LLM-benchmarking. “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. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (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 are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. 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 six 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; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. 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.

myflashbarry/LLM-benchmarking official repository 12 samples, 8 ran (0 instrument-failed) · 4 unverified
evaluate_with_neighbor_loader baseline/Arxiv_to_product.py ran Apache-2.0 (permissive) · fba7d27f4f0b5438 · report fixture: signature model:callable/0/?, loader:list/1/callable, device:device/0/?, threshold:float/0/float · returned float · level recorded 2026-09-24
get_data_and_text baseline/Arxiv_to_product.py ran Apache-2.0 (permissive) · 5ee8c70828d72599 · report fixture: signature dataset_name:str/0/str, train_perc:float/0/float, val_perc:float/0/float, test_perc:float/0/float, use_text:bool/0/bool, seed:int/0/int · returned tuple · level recorded 2026-09-24
mask_features baseline/Arxiv_to_cora_graphmae.py ran Apache-2.0 (permissive) · 3a0569b001641d5a · report fixture: signature x:Tensor/2/float, mask_rate:float/0/float · returned Tensor · level recorded 2026-09-24
process_combination LLM/utils.py ran Apache-2.0 (permissive) · 8f73d2f2f0fad30d · report fixture: signature combinations:list/1/tuple · returned list · level recorded 2026-09-25
process_combination LLM/llama/Llama_Instruct_node.py ran Apache-2.0 (permissive) · bd51f5433db414b2 · report fixture: signature combinations:list/1/tuple · returned list · level recorded 2026-09-25
random_node_feature_masking baseline/GraphCL_link.py ran fingerprinted Apache-2.0 (permissive) · 4db581253b100901 · report fixture: signature x:Tensor/2/float, mask_prob:float/0/float · returned Tensor · level recorded 2026-09-24
split_input_text LLM/utils.py ran Apache-2.0 (permissive) · 0feefffe83da0dea · report fixture: signature input_text:str/0/str · returned tuple · level recorded 2026-09-24
split_input_text_link LLM/utils.py ran Apache-2.0 (permissive) · 988ab2719fa85cc9 · report fixture: signature input_text:str/0/str · returned tuple · level recorded 2026-09-24
get_completion_from_messages LLM/deepseek_V3/deepseek_v3_for_heterophily_node.py unverified Apache-2.0 (permissive) · ce3a0ae50cac1fb8 · report
get_completion_from_messages LLM/llama/Llama_Instruct_link.py unverified Apache-2.0 (permissive) · 91d87b3d6bcd5bab · report
get_completion_from_messages LLM/qwen/qwen_plus_for_link.py unverified Apache-2.0 (permissive) · a350b1d6962bd121 · report
get_completion_from_messages LLM/qwen/qwen_plus_for_node.py unverified Apache-2.0 (permissive) · 51b821d0781ed401 · report

Tasks

BenchmarkingGraph LearningLink PredictionNode Classification

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Focus

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