Triple
T18896757
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Hoare partition scheme |
E462227
|
entity |
| Predicate | comparedWith |
P278
|
FINISHED |
| Object | Lomuto partition scheme |
—
|
NE NERFINISHED |
How this triple was built (2 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: Lomuto partition scheme | Statement: [Hoare partition scheme, comparedWith, Lomuto partition scheme]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Lomuto partition scheme Context triple: [Hoare partition scheme, comparedWith, Lomuto partition scheme]
-
A.
Lomuto partition scheme
chosen
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.
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.
-
C.
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.
-
D.
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.
-
E.
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.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
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_69d8dcfd05bc819088903cca13cc2846 |
completed | April 10, 2026, 11:20 a.m. |
| NER | Named-entity recognition | batch_69e5c47f6c948190918ade08bb88f1fd |
completed | April 20, 2026, 6:15 a.m. |
Created at: April 10, 2026, 11:58 a.m.