Pith. sign in

REVIEW 4 cited by

TAGLAS: An atlas of text-attributed graph datasets in the era of large graph and language models

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 2406.14683 v2 pith:47XEHWK2 submitted 2024-06-20 cs.LG cs.CL

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

In this report, we present TAGLAS, an atlas of text-attributed graph (TAG) datasets and benchmarks. TAGs are graphs with node and edge features represented in text, which have recently gained wide applicability in training graph-language or graph foundation models. In TAGLAS, we collect and integrate more than 23 TAG datasets with domains ranging from citation graphs to molecule graphs and tasks from node classification to graph question-answering. Unlike previous graph datasets and benchmarks, all datasets in TAGLAS have a unified node and edge text feature format, which allows a graph model to be simultaneously trained and evaluated on multiple datasets from various domains. Further, we provide a standardized, efficient, and simplified way to load all datasets and tasks. We also provide useful utils like text-to-embedding conversion, and graph-to-text conversion, which can facilitate different evaluation scenarios. Finally, we also provide standard and easy-to-use evaluation utils. The project is open-sourced at https://github.com/JiaruiFeng/TAGLAS and is still under construction. Please expect more datasets/features in the future.

Discussion (0). Sign in to comment.

Forward citations

Cited by 4 Pith papers

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

  1. Delving into Instance-Dependent Label Noise in Graph Data: A Comprehensive Study and Benchmark

    cs.LG 2025-06 conditional novelty 7.0 of 10

    BeGIN provides 10 graph datasets with six label-noise types and a broad evaluation, showing that LLM-simulated noise hurts GNNs more than uniform or pairwise noise.

  2. Semi-Supervised Text-Attributed Graph Distillation

    cs.AI 2026-05 reject novelty 6.0 of 10

    STAD distills large text-attributed graphs into tiny human-readable graphs that match or beat full-graph semi-supervised node classification.

  3. Both Topology and Text Matter: Revisiting LLM-guided Out-of-Distribution Detection on Text-attributed Graphs

    cs.LG 2026-02 conditional novelty 6.0 of 10

    LG-Plug mines pseudo-OOD exposures from clustered unlabeled nodes via iterative LLM prompting and regularizes topology-driven graph OOD detectors, cutting FPR95 by ≥7% across six TAG benchmarks.

  4. GRIP: In-Parameter Graph Reasoning through Fine-Tuning Large Language Models

    cs.CL 2025-11 reject novelty 5.0 of 10

    An LLM can memorize a knowledge graph into LoRA weights and answer relation/reasoning queries about it without graph context, but the evaluation partly trains on the test task.

Pith tools