Triple
T6370953
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Curry encoding |
E143341
|
entity |
| Predicate | influencedBy |
P9
|
FINISHED |
| Object |
combinatory logic
Combinatory logic is a foundational formal system in mathematical logic and computer science that eliminates variables by expressing computation through the combination of a small set of primitive functions.
|
E588865
|
NE FINISHED |
How this triple was built (4 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: combinatory logic | Statement: [Curry encoding, influencedBy, combinatory logic]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: combinatory logic Context triple: [Curry encoding, influencedBy, combinatory logic]
-
A.
lambda calculus
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.
linear logic
Linear logic is a substructural logic introduced by Jean-Yves Girard that treats logical propositions as resources, carefully tracking their use to model state change, concurrency, and resource-sensitive computation.
-
C.
Church–Rosser property
The Church–Rosser property is a confluence property of rewriting systems stating that if an expression can be reduced in different ways, all reduction paths can be further reduced to a common equivalent form.
-
D.
Symbolic Logic
Symbolic Logic is a foundational work in mathematical logic by John Venn that systematically develops and popularizes the use of diagrams and algebraic methods to represent logical relations.
-
E.
The Logic of Computer Programming
The Logic of Computer Programming is a foundational textbook in theoretical computer science that rigorously develops methods for specifying, proving, and reasoning about the correctness of computer programs.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
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: combinatory logic Triple: [Curry encoding, influencedBy, combinatory logic]
Generated description
Combinatory logic is a foundational formal system in mathematical logic and computer science that eliminates variables by expressing computation through the combination of a small set of primitive functions.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: combinatory logic Target entity description: Combinatory logic is a foundational formal system in mathematical logic and computer science that eliminates variables by expressing computation through the combination of a small set of primitive functions.
-
A.
lambda calculus
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.
linear logic
Linear logic is a substructural logic introduced by Jean-Yves Girard that treats logical propositions as resources, carefully tracking their use to model state change, concurrency, and resource-sensitive computation.
-
C.
Church–Rosser property
The Church–Rosser property is a confluence property of rewriting systems stating that if an expression can be reduced in different ways, all reduction paths can be further reduced to a common equivalent form.
-
D.
Symbolic Logic
Symbolic Logic is a foundational work in mathematical logic by John Venn that systematically develops and popularizes the use of diagrams and algebraic methods to represent logical relations.
-
E.
The Logic of Computer Programming
The Logic of Computer Programming is a foundational textbook in theoretical computer science that rigorously develops methods for specifying, proving, and reasoning about the correctness of computer programs.
- F. None of above. chosen
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_69c008d8c61081908bcaf61510d881ed |
completed | March 22, 2026, 3:20 p.m. |
| NER | Named-entity recognition | batch_69c068289eac8190a17affed87340c1f |
completed | March 22, 2026, 10:07 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69c62d9203988190a535b4f06f478292 |
completed | March 27, 2026, 7:11 a.m. |
| NEDg | Description generation | batch_69c6306eca2c81909ee4930c0dc62072 |
completed | March 27, 2026, 7:23 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69c630eb15cc8190b55c6cf60c5690d2 |
completed | March 27, 2026, 7:25 a.m. |
Created at: March 22, 2026, 4:33 p.m.