Triple
T15989171
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | David A. Huffman |
E387777
|
entity |
| Predicate | knownFor |
P22
|
FINISHED |
| Object | Huffman coding |
E387777
|
NE FINISHED |
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: Huffman coding | Statement: [David A. Huffman, knownFor, Huffman coding]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Huffman coding Context triple: [David A. Huffman, knownFor, Huffman coding]
-
A.
Huffman
chosen
Huffman is a surname most commonly associated with the American computer scientist David A. Huffman, known for developing Huffman coding in information theory and data compression.
-
B.
Lloyd’s algorithm
Lloyd’s algorithm is an iterative clustering method that partitions data into k groups by repeatedly assigning points to the nearest cluster center and updating those centers to minimize within-cluster variance.
-
C.
Hamming code
Hamming code is a family of error-detecting and error-correcting binary codes that enable the automatic detection and correction of single-bit errors in transmitted or stored data.
-
D.
LZ77
LZ77 is a foundational lossless data compression algorithm that uses a sliding window to replace repeated occurrences of data with references to a single copy.
-
E.
Burrows–Wheeler transform
The Burrows–Wheeler transform is a reversible text transformation used in data compression to rearrange a string into runs of similar characters, enabling more efficient encoding by subsequent algorithms.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Provenance (3 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_69d86daa562c81908aacc179c0fe8fb5 |
completed | April 10, 2026, 3:25 a.m. |
| NER | Named-entity recognition | batch_69e157829ec08190aa4a683e29a0148a |
completed | April 16, 2026, 9:41 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69ffcf1cb1388190b1ebccc6705e5974 |
completed | May 10, 2026, 12:19 a.m. |
Created at: April 10, 2026, 4:54 a.m.