Triple

T13590039
Position Surface form Disambiguated ID Type / Status
Subject Eric Maskin E324668 entity
Predicate notableIdea P4 FINISHED
Object Maskin monotonicity
Maskin monotonicity is a key condition in mechanism design theory that characterizes when a social choice rule can be implemented in Nash equilibrium.
E1048346 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: Maskin monotonicity | Statement: [Eric Maskin, notableIdea, Maskin monotonicity]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Maskin monotonicity
Context triple: [Eric Maskin, notableIdea, Maskin monotonicity]
  • A. Gibbard–Satterthwaite theorem
    The Gibbard–Satterthwaite theorem is a fundamental result in social choice theory showing that every reasonable voting system with at least three options is susceptible to strategic manipulation by voters.
  • B. Arrow’s impossibility theorem
    Arrow’s impossibility theorem is a foundational result in social choice theory showing that no voting system can convert individual preferences into a collective ranking while simultaneously satisfying a set of seemingly reasonable fairness criteria.
  • C. Tarski’s fixed point theorem
    Tarski’s fixed point theorem is a fundamental result in order theory and lattice theory that guarantees the existence of fixed points for monotone functions on complete lattices, with wide applications in logic, computer science, and economics.
  • D. Gale–Nikaidō–Debreu theorem
    The Gale–Nikaidō–Debreu theorem is a fundamental result in mathematical economics that provides conditions ensuring the existence (and sometimes uniqueness) of equilibrium in certain nonlinear and general equilibrium models.
  • E. Law of the Maximum
    The Law of the Maximum was a French Revolutionary price-control measure that fixed maximum prices on essential goods to curb inflation and protect the urban poor.
  • 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: Maskin monotonicity
Triple: [Eric Maskin, notableIdea, Maskin monotonicity]
Generated description
Maskin monotonicity is a key condition in mechanism design theory that characterizes when a social choice rule can be implemented in Nash equilibrium.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Maskin monotonicity
Target entity description: Maskin monotonicity is a key condition in mechanism design theory that characterizes when a social choice rule can be implemented in Nash equilibrium.
  • A. Gibbard–Satterthwaite theorem
    The Gibbard–Satterthwaite theorem is a fundamental result in social choice theory showing that every reasonable voting system with at least three options is susceptible to strategic manipulation by voters.
  • B. Arrow’s impossibility theorem
    Arrow’s impossibility theorem is a foundational result in social choice theory showing that no voting system can convert individual preferences into a collective ranking while simultaneously satisfying a set of seemingly reasonable fairness criteria.
  • C. Tarski’s fixed point theorem
    Tarski’s fixed point theorem is a fundamental result in order theory and lattice theory that guarantees the existence of fixed points for monotone functions on complete lattices, with wide applications in logic, computer science, and economics.
  • D. Gale–Nikaidō–Debreu theorem
    The Gale–Nikaidō–Debreu theorem is a fundamental result in mathematical economics that provides conditions ensuring the existence (and sometimes uniqueness) of equilibrium in certain nonlinear and general equilibrium models.
  • E. Law of the Maximum
    The Law of the Maximum was a French Revolutionary price-control measure that fixed maximum prices on essential goods to curb inflation and protect the urban poor.
  • 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_69d80769eaf081909d82f44e484d6113 completed April 9, 2026, 8:09 p.m.
NER Named-entity recognition batch_69dbb055cc98819091fab597b69e5e3e completed April 12, 2026, 2:46 p.m.
NED1 Entity disambiguation (via context triple) batch_69f76bc347b881908267455f3bdd50e8 completed May 3, 2026, 3:37 p.m.
NEDg Description generation batch_69f77642e4b881909915c686a0d6c6fa completed May 3, 2026, 4:22 p.m.
NED2 Entity disambiguation (via description) batch_69f7791add908190af69b23a54eb7560 completed May 3, 2026, 4:34 p.m.
Created at: April 9, 2026, 9:49 p.m.