Triple
T24225378
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Kleene star |
E601578
|
entity |
| Predicate | appearsIn |
P795
|
FINISHED |
| Object |
Kleene’s theorem on regular sets
Kleene’s theorem on regular sets is a fundamental result in automata theory that characterizes regular languages as exactly those that can be described by regular expressions and recognized by finite automata.
|
E1625223
|
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: Kleene’s theorem on regular sets | Statement: [Kleene star, appearsIn, Kleene’s theorem on regular sets]
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: Kleene’s theorem on regular sets Triple: [Kleene star, appearsIn, Kleene’s theorem on regular sets]
Generated description
Kleene’s theorem on regular sets is a fundamental result in automata theory that characterizes regular languages as exactly those that can be described by regular expressions and recognized by finite automata.
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_69e29537ca548190b94a37ebe1977caf |
completed | April 17, 2026, 8:16 p.m. |
| NER | Named-entity recognition | batch_69f287df14148190ac2dd00bc248ebd2 |
completed | April 29, 2026, 10:36 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_6a0fbd2549848190849e08e001851e17 |
completed | May 22, 2026, 2:19 a.m. |
| NEDg | Description generation | batch_6a0fbf33fd488190b40cd0557fd8f9b1 |
completed | May 22, 2026, 2:28 a.m. |
| NED2 | Entity disambiguation (via description) | batch_6a0fbf96d0308190923d072b37de6615 |
completed | May 22, 2026, 2:29 a.m. |
Created at: April 18, 2026, midnight