Triple
T5923103
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | ISWIM |
E131742
|
entity |
| Predicate | influencedBy |
P9
|
FINISHED |
| Object | lambda calculus |
E26971
|
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: lambda calculus | Statement: [ISWIM, influencedBy, lambda calculus]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: lambda calculus Context triple: [ISWIM, influencedBy, lambda calculus]
-
A.
lambda calculus
chosen
Lambda calculus is a formal system in mathematical logic and computer science that uses function abstraction and application to investigate computation and serves as a foundational model for programming languages.
-
B.
Scheme: An Interpreter for Extended Lambda Calculus
"Scheme: An Interpreter for Extended Lambda Calculus" is the seminal 1975 technical report by Gerald Jay Sussman and Guy L. Steele Jr. that introduced the Scheme programming language and demonstrated the power of lexical scoping and first-class procedures in a minimalist Lisp dialect.
-
C.
Lambda
Lambda is a General Motors mid-size crossover SUV platform used for vehicles such as the Saturn Outlook.
-
D.
Hindley–Milner type system
The Hindley–Milner type system is a classical polymorphic type system used in many functional programming languages, notable for enabling type inference without explicit type annotations.
-
E.
Curry encoding
Curry encoding is a technique in lambda calculus for representing data structures and algebraic types purely as higher-order functions.
- 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_69c0085a1ed08190a7e9a8b6323fd680 |
completed | March 22, 2026, 3:18 p.m. |
| NER | Named-entity recognition | batch_69c03804d9808190829a418adb7864aa |
completed | March 22, 2026, 6:42 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69c0c0483e3481908e50f8b34b11a878 |
completed | March 23, 2026, 4:23 a.m. |
Created at: March 22, 2026, 4 p.m.