Triple

T23281102
Position Surface form Disambiguated ID Type / Status
Subject combinatory logic E588865 entity
Predicate hasPrimitive P107341 FINISHED
Object K combinator
The K combinator is a fundamental operator in combinatory logic that takes two arguments and returns the first, embodying constant function abstraction.
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: K combinator | Statement: [combinatory logic, hasPrimitive, K combinator]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: K combinator
Context triple: [combinatory logic, hasPrimitive, K combinator]
  • A. 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.
  • B. Kleene
    Kleene is a surname most notably associated with American mathematician Stephen Kleene, a pioneer in recursion theory and mathematical logic.
  • C. 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.
  • D. Curry encoding
    Curry encoding is a technique in lambda calculus for representing data structures and algebraic types purely as higher-order functions.
  • E. Krivine machine
    The Krivine machine is an abstract machine used to implement call-by-name evaluation of lambda calculus expressions, particularly in the context of functional programming language semantics.
  • 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: K combinator
Triple: [combinatory logic, hasPrimitive, K combinator]
Generated description
The K combinator is a fundamental operator in combinatory logic that takes two arguments and returns the first, embodying constant function abstraction.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: K combinator
Target entity description: The K combinator is a fundamental operator in combinatory logic that takes two arguments and returns the first, embodying constant function abstraction.
  • A. combinatory logic chosen
    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.
  • B. Kleene
    Kleene is a surname most notably associated with American mathematician Stephen Kleene, a pioneer in recursion theory and mathematical logic.
  • C. 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.
  • D. Curry encoding
    Curry encoding is a technique in lambda calculus for representing data structures and algebraic types purely as higher-order functions.
  • E. Krivine machine
    The Krivine machine is an abstract machine used to implement call-by-name evaluation of lambda calculus expressions, particularly in the context of functional programming language semantics.
  • F. None of above.

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_69e25d16e2c08190a291de254703129e completed April 17, 2026, 4:17 p.m.
NER Named-entity recognition batch_69f19642b46481909fd455acd2155792 completed April 29, 2026, 5:25 a.m.
NED1 Entity disambiguation (via context triple) batch_6a0c3f7f06a08190a3ac574cdcd79e3d completed May 19, 2026, 10:46 a.m.
NEDg Description generation batch_6a0c4075bc508190ae0dc8b61c24faa0 completed May 19, 2026, 10:50 a.m.
NED2 Entity disambiguation (via description) batch_6a0c411702a48190ba2964ba221394d1 completed May 19, 2026, 10:53 a.m.
Created at: April 17, 2026, 4:57 p.m.