Triple
T4596114
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Quicksort |
E100207
|
entity |
| Predicate | partitionScheme |
P58206
|
FINISHED |
| Object |
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.
|
E459514
|
NE FINISHED |
How this triple was built (5 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: [Quicksort, partitionScheme, Lomuto partition scheme]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Lomuto partition scheme Context triple: [Quicksort, partitionScheme, Lomuto partition scheme]
-
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.
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.
-
C.
Partition
"Partition" is a 2013 Beyoncé song from her self-titled visual album, known for its sensual lyrics, bass-heavy production, and provocative music video.
-
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.
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.
- 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: Lomuto partition scheme Triple: [Quicksort, partitionScheme, Lomuto partition scheme]
Generated description
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.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Lomuto partition scheme Target entity description: 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.
-
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.
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.
-
C.
Partition
"Partition" is a 2013 Beyoncé song from her self-titled visual album, known for its sensual lyrics, bass-heavy production, and provocative music video.
-
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.
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.
- F. None of above. chosen
PD
Predicate disambiguation
gpt-5-mini-2025-08-07
Target predicate: partitionScheme Context triple: [Quicksort, partitionScheme, Lomuto partition scheme]
-
A.
parallelDivision
Indicates that one entity is divided or partitioned in a way that runs parallel to the division or partitioning of another entity.
-
B.
standardNumberingScheme
Indicates that there is a specific, commonly accepted numbering system or convention being applied to identify or order the related entities.
-
C.
panelDivision
Indicates a relationship where a larger panel or board is divided into smaller sections or segments.
-
D.
divisionPlacement
Indicates that one entity is assigned or positioned within a particular division or subgroup of another entity.
-
E.
distributionPattern
Indicates the characteristic way in which something is spread, arranged, or allocated across a space, group, or set.
- F. None of above. chosen
Provenance (7 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. |
| PD | Predicate disambiguation | batch_69bd522c811c81909aae4feadae33174 |
completed | March 20, 2026, 1:57 p.m. |
| PDg | Predicate description generation | batch_69bd56b4a9508190acdb888eef18f1ee |
completed | March 20, 2026, 2:16 p.m. |
Created at: March 20, 2026, 1:11 p.m.