Hugging Face Trending Papers October 5, 2026

GraphDecide: Benchmarking System One Models on Graph Tasks

Read the original on Hugging Face Trending Papers →

GraphDecide is a model‑independent benchmark designed to evaluate System One models—such as Jev—that make decisions directly from supplied options on graph‑related tasks. The benchmark combines structural task profiles, matched graph‑text input contrasts, and heuristic‑proposal controls to diagnose graph decision performance. In testing fourteen model‑interface configurations, GraphDecide shows that accurate adjacency recognition does not guarantee broader structural correctness, joint graph‑text input does not consistently improve prediction, and feasible construction does not ensure high solution quality.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at Hugging Face Trending Papers.

arXiv AI

Aug 14

Unified Multi-Dimensional Benchmark for Complex Graph Reasoning in Large Language Models

arXiv:2608. 12391v1 Announce Type: cross Abstract: Graph reasoning provides a promising testbed for evaluating the reasoning ability of large language models (LLMs), as graph instances can be programmatically generated, structurally controlled, and naturally scaled to long-input settings.

By Fali Wang, Ali Al-Lawati, Iliyas Bektas, Jinxuan Fang, Alek Melenski, Tianxiang Zhao, Yao Ma, Suhang Wang

llms rag fine-tuning benchmarks

arXiv Machine Learning

2d ago

Teaching LLMs to See Graphs: Unifying Text and Structural Reasoning

arXiv:2605.10247v2 Announce Type: replace Abstract: Applying Large Language Models (LLMs) to graph-structured data usually involves multi-step pipelines in which textual node attributes are compresse...

By Dario Vajda

llms fine-tuning benchmarks

Hugging Face Trending Papers

Aug 31

Graph Evidence Is Not Enough: Diagnosing Native Decoder Use in Graph-Augmented LLMs

Graph-augmented large language models often assume that graph evidence produced by external computation and placed in the input can be used by the native decoder. We test this assumption with HopQA, a...

llms safety

arXiv Computation and Language

Sep 1

Graph Evidence Is Not Enough: Diagnosing Native Decoder Use in Graph-Augmented LLMs

arXiv:2608.30437v1 Announce Type: new Abstract: Graph-augmented large language models often assume that graph evidence produced by external computation and placed in the input can be used by the nati...

By Xiaoyu Guo, Pengcheng Chen, Jiong Yu, Yi Lu, Yaohua Wang, Ziyang Li

llms safety

arXiv AI

Jun 10

Lost in Serialization: Invariance and Generalization of LLM Graph Reasoners

arXiv:2511. 10234v3 Announce Type: replace-cross Abstract: While promising, graph reasoners based on Large Language Models (LLMs) lack built-in invariance to symmetries in graph representations.

By Daniel Herbst, Lea Karbevska, Divyanshu Kumar, Akanksha Ahuja, Fatemeh Gholamzadeh Nasrabadi, Fabrizio Frasca

llms fine-tuning benchmarks

arXiv Machine Learning

Jun 11

GraphInfer-Bench: Benchmarking LLM's Inference Capability on Graphs

arXiv:2606. 11562v1 Announce Type: new Abstract: Graph analysis underlies many applications whose answers cannot be looked up in a single record or retrieved along a path: laundering rings, drug repurposing, user preference, and scientific theme are all inferred from a node together with its neighbourhood.

By Zhuoyi Peng, Jingzhou Jiang, Hanlin Gu, Lixin Fan, Yi Yang

llms fine-tuning benchmarks safety

One email a morning, machine-written

Related stories

Unified Multi-Dimensional Benchmark for Complex Graph Reasoning in Large Language Models

Teaching LLMs to See Graphs: Unifying Text and Structural Reasoning

Graph Evidence Is Not Enough: Diagnosing Native Decoder Use in Graph-Augmented LLMs

Graph Evidence Is Not Enough: Diagnosing Native Decoder Use in Graph-Augmented LLMs

Lost in Serialization: Invariance and Generalization of LLM Graph Reasoners

GraphInfer-Bench: Benchmarking LLM's Inference Capability on Graphs