Triple

T27034246
Position Surface form Disambiguated ID Type / Status
Subject Emil Post E681008 entity
Predicate notableWork P4 FINISHED
Object Recursively enumerable sets of positive integers and their decision problems (1944)
"Recursively enumerable sets of positive integers and their decision problems" (1944) is Emil Post’s landmark paper that helped found the theory of computability by analyzing algorithmically enumerable sets and the limits of effective decision procedures.
E1754074 NE FINISHED

How this triple was built (2 steps)

Every LLM step that produced this triple, in pipeline order — named-entity classification, the disambiguation choices (the exact options shown, with the pick highlighted), and the generated description. The batch + timestamp of each is in the Provenance table below.

NER Named-entity recognition gpt-5-mini
Instruction
Given a phrase, classify it is english named entity (e.g., persons, organizations, works of art) in Latin script, or not (e.g., literals, dates, URLs, verbose phrases). For disambiguation, the statement where the phrase occurs as object is also given. Please return a JSON object with `phrase` (string, the phrase being analyzed) and `is_ne` (boolean, indicating whether the phrase is a Named Entity).
Input
Phrase: Recursively enumerable sets of positive integers and their decision problems (1944) | Statement: [Emil Post, notableWork, Recursively enumerable sets of positive integers and their decision problems (1944)]
NEDg Description generation gpt-5.1
Instruction
Generate a one-sentence description of the target entity. 
You are given a context triple in the form (subject, predicate, object), where the object is the target entity. 
# Instructions
Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. 
Avoid repeating the information from the triple, unless really essential.
# Response Format
Return only the sentence: "Description: [one-sentence description of the target entity]"
Input
Entity: Recursively enumerable sets of positive integers and their decision problems (1944)
Triple: [Emil Post, notableWork, Recursively enumerable sets of positive integers and their decision problems (1944)]
Generated description
"Recursively enumerable sets of positive integers and their decision problems" (1944) is Emil Post’s landmark paper that helped found the theory of computability by analyzing algorithmically enumerable sets and the limits of effective decision procedures.

Provenance (5 batches)

The batch behind each pipeline step, in order, with when it ran. Timestamps are batch-level — stages were processed in waves, so the object chain (NER → NED1 → NEDg → NED2) reads in order, but predicate / elicitation batches can sit in a different wave.

Step Stage Batch ID Status When
creating Elicitation batch_69eeeb5566f08190813daf896fa3da04 completed April 27, 2026, 4:51 a.m.
NER Named-entity recognition batch_69f62266b8b48190a050b4953753e5a7 completed May 2, 2026, 4:12 p.m.
NED1 Entity disambiguation (via context triple) batch_6a123abe4f208190a817268173707c76 completed May 23, 2026, 11:39 p.m.
NEDg Description generation batch_6a123b542138819086f001a5c2dcd76b completed May 23, 2026, 11:42 p.m.
NED2 Entity disambiguation (via description) batch_6a123bf84c28819096727646233344f5 completed May 23, 2026, 11:44 p.m.
Created at: April 27, 2026, 7:15 a.m.