Pith. sign in

REVIEW 4 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

classification cs.CLcs.AI
keywords knowledgegraphapproachgenerationmainzero-shotconstructiondifferent
verification ladder T0 review T1 audit T2 compute T3 formal
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). Continue with ORCID 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. Deconstructing Depression Stigma: Integrating AI-driven Data Collection and Analysis with Causal Knowledge Graphs

    cs.HC 2025-02 conditional novelty 6.0 of 10

    A chatbot interview pipeline with AI-assisted coding and causal knowledge graphs can elicit and decompose depression stigma at scale.

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

    cs.CL 2025-09 unverdicted novelty 5.0 of 10

    Using LLM extraction on 681 papers, the authors build a public knowledge graph showing financial NLP moved from LLM adoption to limitation-aware, modular system design between 2022 and 2025.

  3. HyDRA: A Hybrid-Driven Reasoning Architecture for Verifiable Knowledge Graphs

    cs.LG 2025-07 conditional novelty 5.0 of 10

    HyDRA, a contract-driven LLM pipeline for building ontologies and knowledge graphs, scored 42-62% accuracy on MedExQA biomedical QA while an ontology-free baseline scored 95-98%.

  4. Zero-Shot End-to-End Relation Extraction in Chinese: A Comparative Study of Gemini, LLaMA and ChatGPT

    cs.CL 2025-02 conditional novelty 4.0 of 10

    In a zero-shot Chinese relation extraction test on DuIE 2.0, gpt-4-turbo achieved the best F1 at 0.367, Gemini flash models were fastest, and LLaMA models performed worst.

Pith tools