Triple
T4596115
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Quicksort |
E100207
|
entity |
| Predicate | partitionScheme |
P58206
|
FINISHED |
| Object |
Hoare partition scheme
The Hoare partition scheme is a classic in-place array partitioning method used in quicksort that employs two indices moving toward each other to rearrange elements around a pivot.
|
E462227
|
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: Hoare partition scheme | Statement: [Quicksort, partitionScheme, Hoare partition scheme]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Hoare partition scheme Context triple: [Quicksort, partitionScheme, Hoare partition scheme]
-
A.
Lomuto partition scheme
The Lomuto partition scheme is a simple, commonly taught method for partitioning arrays in the Quicksort algorithm by using a single index to separate elements less than a chosen pivot from those greater or equal.
-
B.
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.
-
C.
Heapsort
Heapsort is a comparison-based sorting algorithm that uses a binary heap data structure to sort elements in-place with O(n log n) time complexity and O(1) auxiliary space.
-
D.
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.
-
E.
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.
- 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: Hoare partition scheme Triple: [Quicksort, partitionScheme, Hoare partition scheme]
Generated description
The Hoare partition scheme is a classic in-place array partitioning method used in quicksort that employs two indices moving toward each other to rearrange elements around a pivot.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Hoare partition scheme Target entity description: The Hoare partition scheme is a classic in-place array partitioning method used in quicksort that employs two indices moving toward each other to rearrange elements around a pivot.
-
A.
Lomuto partition scheme
The Lomuto partition scheme is a simple, commonly taught method for partitioning arrays in the Quicksort algorithm by using a single index to separate elements less than a chosen pivot from those greater or equal.
-
B.
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.
-
C.
Heapsort
Heapsort is a comparison-based sorting algorithm that uses a binary heap data structure to sort elements in-place with O(n log n) time complexity and O(1) auxiliary space.
-
D.
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.
-
E.
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.
- 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_69bd6234e8108190b985270b9ddd1f3a |
completed | March 20, 2026, 3:05 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69be0345e4688190abfbb55d60339e83 |
completed | March 21, 2026, 2:32 a.m. |
| NEDg | Description generation | batch_69be05269de48190849a76b5fbd24b4a |
completed | March 21, 2026, 2:40 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69be05d277248190bf675151eca07247 |
completed | March 21, 2026, 2:43 a.m. |
Created at: March 20, 2026, 1:11 p.m.