Triple
T11747167
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | John Venn |
E279312
|
entity |
| Predicate | associatedWith |
P37
|
FINISHED |
| Object | Boolean algebra |
E883488
|
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: Boolean algebra | Statement: [John Venn, associatedWith, Boolean algebra]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Boolean algebra Context triple: [John Venn, associatedWith, Boolean algebra]
-
A.
Boolean algebra
chosen
Boolean algebra is a branch of algebraic logic that studies variables and operations based on two values, typically true and false, forming the mathematical foundation of digital circuits and classical logic.
-
B.
De Morgan's laws
De Morgan's laws are fundamental rules in Boolean algebra and set theory that relate conjunctions and disjunctions through negation, forming a cornerstone of classical logic.
-
C.
Kleene algebra
Kleene algebra is an algebraic structure used to model and reason about regular expressions, program control flow, and formal languages through operations like choice, sequencing, and iteration.
-
D.
OBDDs
OBDDs (Ordered Binary Decision Diagrams) are a canonical, graph-based representation of Boolean functions that enables efficient manipulation and verification in formal methods and model checking.
-
E.
A Symbolic Analysis of Relay and Switching Circuits
A Symbolic Analysis of Relay and Switching Circuits is Claude Shannon’s landmark 1937 master’s thesis that founded modern digital circuit design by applying Boolean algebra to relay and switching systems.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Provenance (3 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_69d6ab01038c819080714901502c84fc |
completed | April 8, 2026, 7:22 p.m. |
| NER | Named-entity recognition | batch_69d8a50763a081908597da118bd0a64e |
completed | April 10, 2026, 7:21 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69f019f5f29c81909d80a9e6127ec6ef |
completed | April 28, 2026, 2:22 a.m. |
Created at: April 8, 2026, 9:41 p.m.