Triple

T9690898
Position Surface form Disambiguated ID Type / Status
Subject Marzullo's algorithm E234530 entity
Predicate relatedTo P37 FINISHED
Object Cristian's algorithm
Cristian's algorithm is a clock synchronization method in distributed systems that estimates accurate time on client machines by querying a time server and adjusting for message delays.
E815702 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: Cristian's algorithm | Statement: [Marzullo's algorithm, relatedTo, Cristian's algorithm]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Cristian's algorithm
Context triple: [Marzullo's algorithm, relatedTo, Cristian's algorithm]
  • A. Marzullo's algorithm
    Marzullo's algorithm is a method for selecting the most likely correct time interval from multiple, possibly conflicting time sources, commonly used in clock synchronization systems.
  • B. Benettin algorithm
    The Benettin algorithm is a numerical method used in dynamical systems theory to estimate Lyapunov exponents, which quantify the rate of separation of nearby trajectories and indicate chaos.
  • C. Scarf algorithm
    The Scarf algorithm is a combinatorial method in mathematical economics and game theory used to compute fixed points and prove the existence of equilibria in markets and games.
  • D. Thompson's algorithm
    Thompson's algorithm is a classic computer science method for converting regular expressions into nondeterministic finite automata (NFAs), widely used in pattern matching and lexical analysis.
  • E. Warnock algorithm
    The Warnock algorithm is a classic hidden surface determination technique in computer graphics that recursively subdivides a scene into smaller regions to efficiently resolve visibility.
  • 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: Cristian's algorithm
Triple: [Marzullo's algorithm, relatedTo, Cristian's algorithm]
Generated description
Cristian's algorithm is a clock synchronization method in distributed systems that estimates accurate time on client machines by querying a time server and adjusting for message delays.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Cristian's algorithm
Target entity description: Cristian's algorithm is a clock synchronization method in distributed systems that estimates accurate time on client machines by querying a time server and adjusting for message delays.
  • A. Marzullo's algorithm
    Marzullo's algorithm is a method for selecting the most likely correct time interval from multiple, possibly conflicting time sources, commonly used in clock synchronization systems.
  • B. Benettin algorithm
    The Benettin algorithm is a numerical method used in dynamical systems theory to estimate Lyapunov exponents, which quantify the rate of separation of nearby trajectories and indicate chaos.
  • C. Scarf algorithm
    The Scarf algorithm is a combinatorial method in mathematical economics and game theory used to compute fixed points and prove the existence of equilibria in markets and games.
  • D. Thompson's algorithm
    Thompson's algorithm is a classic computer science method for converting regular expressions into nondeterministic finite automata (NFAs), widely used in pattern matching and lexical analysis.
  • E. Warnock algorithm
    The Warnock algorithm is a classic hidden surface determination technique in computer graphics that recursively subdivides a scene into smaller regions to efficiently resolve visibility.
  • 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_69ca84ca73208190957a900c8543bdcc completed March 30, 2026, 2:12 p.m.
NER Named-entity recognition batch_69cd9d0422e88190a234ba74eb0dad25 completed April 1, 2026, 10:32 p.m.
NED1 Entity disambiguation (via context triple) batch_69d19118874c81909a97f874b1dc2db8 completed April 4, 2026, 10:30 p.m.
NEDg Description generation batch_69d193a5cdac8190b84564f397d00124 completed April 4, 2026, 10:41 p.m.
NED2 Entity disambiguation (via description) batch_69d19457c6488190a7bc72e1a27c088a completed April 4, 2026, 10:44 p.m.
Created at: March 30, 2026, 8:17 p.m.