Triple
T25310963
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Robert M. Fano |
E634605
|
entity |
| Predicate | knownFor |
P22
|
FINISHED |
| Object |
Shannon–Fano coding
Shannon–Fano coding is an early entropy-based source coding technique that assigns variable-length binary codes to symbols according to their probabilities, serving as a precursor to more efficient methods like Huffman coding.
|
E1676272
|
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: Shannon–Fano coding | Statement: [Robert M. Fano, knownFor, Shannon–Fano coding]
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: Shannon–Fano coding Triple: [Robert M. Fano, knownFor, Shannon–Fano coding]
Generated description
Shannon–Fano coding is an early entropy-based source coding technique that assigns variable-length binary codes to symbols according to their probabilities, serving as a precursor to more efficient methods like Huffman coding.
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_69e75a972c6481909bc11710e8d30a6c |
completed | April 21, 2026, 11:08 a.m. |
| NER | Named-entity recognition | batch_69f4939e84dc8190bef761d9bfee08a6 |
completed | May 1, 2026, 11:50 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_6a1075e1030c8190a6dfc36164d8c0d8 |
completed | May 22, 2026, 3:27 p.m. |
| NEDg | Description generation | batch_6a10771a5a648190844a509e6ac507be |
completed | May 22, 2026, 3:32 p.m. |
| NED2 | Entity disambiguation (via description) | batch_6a1077bbf9448190bee4351dcb985c0c |
completed | May 22, 2026, 3:35 p.m. |
Created at: April 21, 2026, 1:26 p.m.