Pith. sign in

REVIEW 1 cited by

Open Domain Knowledge Extraction for Knowledge Graphs

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 2312.09424 v1 pith:VJDHBMCC submitted 2023-10-30 cs.CL cs.AI

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

The quality of a knowledge graph directly impacts the quality of downstream applications (e.g. the number of answerable questions using the graph). One ongoing challenge when building a knowledge graph is to ensure completeness and freshness of the graph's entities and facts. In this paper, we introduce ODKE, a scalable and extensible framework that sources high-quality entities and facts from open web at scale. ODKE utilizes a wide range of extraction models and supports both streaming and batch processing at different latency. We reflect on the challenges and design decisions made and share lessons learned when building and deploying ODKE to grow an industry-scale open domain knowledge graph.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. ODKE+: Ontology-Guided Open-Domain Knowledge Extraction with LLMs

    cs.CL 2025-09 conditional novelty 4.0 of 10

    A production system using ontology-guided prompts and two LLM stages extracted 19 million high-confidence facts from Wikipedia with 98.8% reported precision.

Pith tools