Pith. sign in

REVIEW 5 cited by

Iterative Zero-Shot LLM Prompting for Knowledge Graph Construction

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 2307.01128 v1 pith:22PB6NGK submitted 2023-07-03 cs.CL cs.AI

Iterative Zero-Shot LLM Prompting for Knowledge Graph Construction

classification cs.CL cs.AI
keywords knowledgegraphapproachgenerationmainzero-shotconstructiondifferent
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

In the current digitalization era, capturing and effectively representing knowledge is crucial in most real-world scenarios. In this context, knowledge graphs represent a potent tool for retrieving and organizing a vast amount of information in a properly interconnected and interpretable structure. However, their generation is still challenging and often requires considerable human effort and domain expertise, hampering the scalability and flexibility across different application fields. This paper proposes an innovative knowledge graph generation approach that leverages the potential of the latest generative large language models, such as GPT-3.5, that can address all the main critical issues in knowledge graph building. The approach is conveyed in a pipeline that comprises novel iterative zero-shot and external knowledge-agnostic strategies in the main stages of the generation process. Our unique manifold approach may encompass significant benefits to the scientific community. In particular, the main contribution can be summarized by: (i) an innovative strategy for iteratively prompting large language models to extract relevant components of the final graph; (ii) a zero-shot strategy for each prompt, meaning that there is no need for providing examples for "guiding" the prompt result; (iii) a scalable solution, as the adoption of LLMs avoids the need for any external resources or human expertise. To assess the effectiveness of our proposed model, we performed experiments on a dataset that covered a specific domain. We claim that our proposal is a suitable solution for scalable and versatile knowledge graph construction and may be applied to different and novel contexts.

discussion (0)

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

Forward citations

Cited by 5 Pith papers

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.

  2. MetaGraph: A Large-Scale Meta-Analysis of GenAI in Financial NLP (2022-2025)

    cs.CL 2025-09 unverdicted novelty 5.0

    MetaGraph uses ontology-guided LLM extraction to build knowledge graphs from 681 papers on GenAI in financial NLP, identifying three distinct phases of development from 2022 to 2025.

  3. Automated Construction of a Knowledge Graph of Nuclear Fusion Energy for Effective Elicitation and Retrieval of Information

    cs.CL 2025-04 unverdicted novelty 4.0

    A multi-step LLM-based pipeline constructs the first knowledge graph for nuclear fusion energy and enables RAG for multi-hop queries.

  4. Construction of Knowledge Graph based on Language Model

    cs.CL 2026-04 unverdicted novelty 3.0

    The paper surveys PLM-based knowledge graph construction and proposes the LLHKG framework claiming that lightweight LLMs achieve KG construction performance comparable to GPT-3.5.

  5. FineREX: Fine-Tuned NER-RE for Human Smuggling Knowledge Graphs

    cs.CL 2026-06 unverdicted novelty 2.0

    Domain-specific fine-tuning of an LLM for NER-RE on human-smuggling court texts yields 15.5% and 31.46% absolute F1 gains over a larger baseline, with reduced noise, duplication, and runtime.