Triple

T18100667
Position Surface form Disambiguated ID Type / Status
Subject Matthew Rabin E433204 entity
Predicate notableWork P4 FINISHED
Object Rabin fairness model NE NERFINISHED

How this triple was built (3 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: Rabin fairness model | Statement: [Matthew Rabin, notableWork, Rabin fairness model]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Rabin fairness model
Context triple: [Matthew Rabin, notableWork, Rabin fairness model]
  • A. Elements of Distributed Algorithms
    Elements of Distributed Algorithms is a foundational textbook that systematically presents the principles, models, and key techniques used in the design and analysis of distributed algorithms.
  • B. FLP impossibility result
    The FLP impossibility result is a foundational theorem in distributed computing showing that in an asynchronous system, no deterministic consensus protocol can guarantee both safety and liveness in the presence of even a single crash failure.
  • C. "Reaching Agreement in the Presence of Faults"
    "Reaching Agreement in the Presence of Faults" is a seminal paper in distributed computing that introduced the Byzantine Generals Problem and laid the foundations for understanding consensus in unreliable, fault-prone systems.
  • D. Jain’s fairness index
    Jain’s fairness index is a widely used quantitative metric in networking and resource allocation that measures how evenly resources are shared among multiple users or flows.
  • E. "Time, Clocks, and the Ordering of Events in a Distributed System"
    "Time, Clocks, and the Ordering of Events in a Distributed System" is a seminal 1978 paper that introduced logical clocks and the happened-before relation, fundamentally shaping the theory and practice of distributed computing.
  • F. None of above. chosen
  • G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Rabin fairness model
Target entity description: The Rabin fairness model is a behavioral economics framework that incorporates social preferences and fairness concerns into game-theoretic analysis of decision-making.
  • A. Elements of Distributed Algorithms
    Elements of Distributed Algorithms is a foundational textbook that systematically presents the principles, models, and key techniques used in the design and analysis of distributed algorithms.
  • B. FLP impossibility result
    The FLP impossibility result is a foundational theorem in distributed computing showing that in an asynchronous system, no deterministic consensus protocol can guarantee both safety and liveness in the presence of even a single crash failure.
  • C. "Reaching Agreement in the Presence of Faults"
    "Reaching Agreement in the Presence of Faults" is a seminal paper in distributed computing that introduced the Byzantine Generals Problem and laid the foundations for understanding consensus in unreliable, fault-prone systems.
  • D. Jain’s fairness index
    Jain’s fairness index is a widely used quantitative metric in networking and resource allocation that measures how evenly resources are shared among multiple users or flows.
  • E. "Time, Clocks, and the Ordering of Events in a Distributed System"
    "Time, Clocks, and the Ordering of Events in a Distributed System" is a seminal 1978 paper that introduced logical clocks and the happened-before relation, fundamentally shaping the theory and practice of distributed computing.
  • F. None of above. chosen

Provenance (2 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_69d8b90916008190a1f110bd7ced5473 completed April 10, 2026, 8:47 a.m.
NER Named-entity recognition batch_69e4ddb5e6208190b3c3cce3b95d66ad completed April 19, 2026, 1:50 p.m.
Created at: April 10, 2026, 10:27 a.m.