Papers › GraphOmni: A Comprehensive and Extendable Benchmark Framework for Large Language...

GraphOmni: A Comprehensive and Extendable Benchmark Framework for Large Language Models on Graph-theoretic Tasks

17 Apr 2025arXiv:2504.12764archive 2025-07-28

Hao Xu, Xiangru Jian, Xinjian Zhao, Wei Pang, Chao Zhang, Suyuchen Wang, Qixin Zhang, Zhengyuan Dong, Joao Monteiro, Bang Liu, Qiuzhuang Sun, Tianshu Yu

This paper introduces GraphOmni, a comprehensive benchmark designed to evaluate the reasoning capabilities of LLMs on graph-theoretic tasks articulated in natural language. GraphOmni encompasses diverse graph types, serialization formats, and prompting schemes, significantly exceeding prior efforts in both scope and depth. Through extensive systematic evaluation, we identify critical interactions among these dimensions, demonstrating their substantial impact on model performance. Our experiments reveal that state-of-the-art models like Claude-3.5 and o4-mini consistently outperform other models, yet even these leading models exhibit substantial room for improvement. Performance variability is evident depending on the specific combinations of factors we considered, underscoring the necessity of comprehensive evaluations across these interconnected dimensions. Additionally, we observe distinct impacts of serialization and prompting strategies between open-source and closed-source models, encouraging the development of tailored approaches. Motivated by the findings, we also propose a reinforcement learning-inspired framework that adaptively selects the optimal factors influencing LLM reasoning capabilities. This flexible and extendable benchmark not only deepens our understanding of LLM performance on structured tasks but also provides a robust foundation for advancing research in LLM-based graph reasoning. The code and datasets are available at https://github.com/GAI-Community/GraphOmni.

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 27 code samples harvested from 2 repositories linked to this paper: 21 ran (of which 0 constructed an object rather than computing a result; 21 with no instrument failure: 0 honoured, 0 violated, 21 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code; here there are none.

By repository: official repository: 27 samples from 2 repositories, 21 ran (21 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.

gai-community/graphomni officialmentioned in papermentioned on GitHubMITSyntology: 26 samples, 20 ran (0 instrument-failed) · 6 unverified report
more1643127748/graphomni officialmentioned in papermentioned on GitHubMITSyntology: 1 sample, 1 ran (0 instrument-failed) · 0 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

27 samples harvested: 21 ran (of which 0 constructed an object rather than computing a result; 21 with no instrument failure: 0 honoured, 0 violated, 21 with no contract checked; 0 where Syntology's instrument failed) · 6 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.

21ran
6unverified

Licence: 0 of the 27 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; the list below is grouped by repository, each group headed by its name and what it is to the paper. “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.

A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity.

gai-community/graphomni official repository 26 samples, 20 ran (0 instrument-failed) · 6 unverified
build_graph in 20 papers eval_fun/verification.py ran MIT (permissive) · 83b83cb8a93f63f4 · report fixture: signature edges:list/1/tuple · returned defaultdict · level recorded 2026-09-24
build_graph_from_csv eval_fun/verification.py ran MIT (permissive) · d7ca9d0e9d027761 · report fixture: signature file_path:str/0/str · returned defaultdict · level recorded 2026-09-24
convert_english_numbers eval_fun/triangle_eval_fun.py ran fingerprinted MIT (permissive) · 138606b1a03b7b4d · report fixture: signature text:str/0/str · returned str · level recorded 2026-09-25
create_adj_matrix eval_fun/token.py ran MIT (permissive) · 70beee368bff933c · report fixture: signature nodes:list/1/int, edges:list/1/tuple · returned ndarray · level recorded 2026-09-25
eval_connectivity eval_fun/connectivity_eval_fun.py ran fingerprinted MIT (permissive) · b16ac88a9e21c924 · report fixture: signature ans:str/0/str, gt:bool/0/bool · returned int · level recorded 2026-09-24
eval_cycle eval_fun/cycle_eval_fun.py ran MIT (permissive) · a7c5dc906f2a4be7 · report fixture: signature ans:str/0/str, gt:str/0/str · returned int · level recorded 2026-09-24
eval_diameter_number eval_fun/diameter_eval_fun.py ran MIT (permissive) · 2d2637dd0f93dd94 · report fixture: signature text:str/0/str, gt:float/0/float · returned int · level recorded 2026-09-25
extract_and_check_numbers_bfsorder eval_fun/bfsorder_eval_fun.py ran fingerprinted MIT (permissive) · 3efcfb2d6b5a05d1 · report fixture: signature content:str/0/str, start:int/0/int · returned dict · level recorded 2026-09-25
extract_and_check_numbers_dimater eval_fun/diameter_eval_fun.py ran fingerprinted MIT (permissive) · b7515efb0fb3c7a9 · report fixture: signature content:str/0/str · returned dict · level recorded 2026-09-25
extract_and_check_numbers_path eval_fun/shortest_path_eval_fun.py ran fingerprinted MIT (permissive) · d61be97e2d23280d · report fixture: signature content:str/0/str, start:int/0/int, end:int/0/int · returned dict · level recorded 2026-09-24
extract_and_check_numbers_triangle eval_fun/triangle_eval_fun.py ran fingerprinted MIT (permissive) · d8333297634fc3ad · report fixture: signature content:str/0/str · returned dict · level recorded 2026-09-24
extract_data_from_jsonl closedllm/batchapi_openai_6tasks_retrive.py ran MIT (permissive) · 08ecf1166f290426 · report fixture: signature file_paths:list/1/str · returned dict · level recorded 2026-09-25
extract_numbers_before_node eval_fun/bfsorder_eval_fun.py ran fingerprinted MIT (permissive) · f6524b105c2bfbee · report fixture: signature input_str:str/0/str · returned list · level recorded 2026-09-24
extract_relevant_sentences eval_fun/connectivity_eval_fun.py ran fingerprinted MIT (permissive) · a1917cc156eef5d6 · report fixture: signature ans:str/0/str · returned tuple · level recorded 2026-09-25
filter_sentences eval_fun/connectivity_eval_fun.py ran MIT (permissive) · 5474a9d6201092ed · report fixture: signature sentences:list/1/str, truelist:list/1/str, notsurelist:list/1/str · returned list · level recorded 2026-09-25
find_batch_ids_in_logs closedllm/batchapi_openai_6tasks_retrive.py ran MIT (permissive) · dd84d21546412fc1 · report fixture: signature args:Args/0/? · returned dict · level recorded 2026-09-24
get_edges_from_str eval_fun/token.py ran MIT (permissive) · f700f4d3a7aa2d5c · report fixture: signature matrix_str:str/0/str · returned list · level recorded 2026-09-24
loadqery closedllm/batchapi_openai_6tasks.py ran MIT (permissive) · 4fe8ce25424e3f7f · report fixture: signature args:Namespace/0/? · returned dict · level recorded 2026-09-25
merge_short_paragraphs eval_fun/diameter_eval_fun.py ran fingerprinted MIT (permissive) · 75a1d893016bda9f · report fixture: signature text:str/0/str, length_threshold:int/0/int · returned str · level recorded 2026-09-25
validate_bfs eval_fun/verification.py ran MIT (permissive) · 090ce4b1b724e715 · report fixture: signature graph:dict/0/?, start:int/0/int, order:list/1/int · returned bool · level recorded 2026-09-25
check_and_download_model openllm/predict.py unverified MIT (permissive) · e3b4cb8414c7b5ec · report
count_tokens in 39 papers eval_fun/token.py unverified MIT (permissive) · c4fa9aad367464fa · report
evaltask main_closemodel.py unverified MIT (permissive) · 2f51bb646f57b609 · report
evaluate_bfsorder eval_fun/bfsorder_eval_fun.py unverified MIT (permissive) · 21523d87e7f7f8d1 · report
evaluate_shortest_path eval_fun/shortest_path_eval_fun.py unverified MIT (permissive) · a336e706c03b0e4e · report
getquery main_closemodel.py unverified MIT (permissive) · e80463f3f6994f9a · report
more1643127748/graphomni official repository 1 sample, 1 ran (0 instrument-failed) · 0 unverified
extract_relevant_sentences eval_fun/cycle_eval_fun.py ran fingerprinted MIT (permissive) · 8027b8a1f685b048 · report fixture: signature ans:str/0/str · returned tuple · level recorded 2026-09-24

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