Triple
T4596126
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Quicksort |
E100207
|
entity |
| Predicate | comparedWith |
P278
|
FINISHED |
| Object |
Merge sort
Merge sort is a comparison-based, divide-and-conquer sorting algorithm that recursively splits a list into halves, sorts them, and then merges the sorted halves into a fully ordered sequence.
|
E459515
|
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: Merge sort | Statement: [Quicksort, comparedWith, Merge sort]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Merge sort Context triple: [Quicksort, comparedWith, Merge sort]
-
A.
Quicksort
Quicksort is a highly efficient, comparison-based sorting algorithm that uses a divide-and-conquer strategy and is widely employed in computer science and software systems.
-
B.
Divide and Conquer
"Divide and Conquer" is a World War II-era American propaganda documentary in the "Why We Fight" series that chronicles Nazi Germany’s invasion and subjugation of Western Europe.
-
C.
Fibonacci heap
A Fibonacci heap is an advanced data structure for implementing priority queues that supports very fast amortized running times for operations like insert and decrease-key, making it useful in algorithms such as Dijkstra’s shortest path.
-
D.
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.
-
E.
Heap
Heap is the surname of Imogen Heap, an English singer-songwriter, producer, and audio engineer known for her innovative electronic music and vocal processing.
- 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: Merge sort Triple: [Quicksort, comparedWith, Merge sort]
Generated description
Merge sort is a comparison-based, divide-and-conquer sorting algorithm that recursively splits a list into halves, sorts them, and then merges the sorted halves into a fully ordered sequence.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Merge sort Target entity description: Merge sort is a comparison-based, divide-and-conquer sorting algorithm that recursively splits a list into halves, sorts them, and then merges the sorted halves into a fully ordered sequence.
-
A.
Quicksort
Quicksort is a highly efficient, comparison-based sorting algorithm that uses a divide-and-conquer strategy and is widely employed in computer science and software systems.
-
B.
Divide and Conquer
"Divide and Conquer" is a World War II-era American propaganda documentary in the "Why We Fight" series that chronicles Nazi Germany’s invasion and subjugation of Western Europe.
-
C.
Fibonacci heap
A Fibonacci heap is an advanced data structure for implementing priority queues that supports very fast amortized running times for operations like insert and decrease-key, making it useful in algorithms such as Dijkstra’s shortest path.
-
D.
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.
-
E.
Heap
Heap is the surname of Imogen Heap, an English singer-songwriter, producer, and audio engineer known for her innovative electronic music and vocal processing.
- 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_69bd43cbc014819098b45f435908f88a |
completed | March 20, 2026, 12:55 p.m. |
| NER | Named-entity recognition | batch_69bd594055dc8190a50f1b4be2be1ba0 |
completed | March 20, 2026, 2:27 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69bdfa4552148190be200be028ef3fdd |
completed | March 21, 2026, 1:54 a.m. |
| NEDg | Description generation | batch_69bdfb37b1448190a4001b9ed2b79012 |
completed | March 21, 2026, 1:58 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69bdfc0e456c81908efa3858d981ccc0 |
completed | March 21, 2026, 2:01 a.m. |
Created at: March 20, 2026, 1:11 p.m.