Pith. sign in

REVIEW 1 cited by

Developing a Scalable Benchmark for Assessing Large Language Models in Knowledge Graph Engineering

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 2308.16622 v1 pith:OUEB5W2F submitted 2023-08-31 cs.AI cs.CLcs.DB

Developing a Scalable Benchmark for Assessing Large Language Models in Knowledge Graph Engineering

classification cs.AI cs.CLcs.DB
keywords engineeringgraphknowledgeframeworkgenerationlanguagelargellms
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

As the field of Large Language Models (LLMs) evolves at an accelerated pace, the critical need to assess and monitor their performance emerges. We introduce a benchmarking framework focused on knowledge graph engineering (KGE) accompanied by three challenges addressing syntax and error correction, facts extraction and dataset generation. We show that while being a useful tool, LLMs are yet unfit to assist in knowledge graph generation with zero-shot prompting. Consequently, our LLM-KG-Bench framework provides automatic evaluation and storage of LLM responses as well as statistical data and visualization tools to support tracking of prompt engineering and model performance.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

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

  1. Integrating Graphs, Large Language Models, and Agents: Reasoning and Retrieval

    cs.AI 2026-04 unverdicted novelty 6.0

    A structured survey organizing graph-LLM integration methods by purpose, modality, and strategy across application domains.