Triple
T5854065
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Arnt Eliassen |
E130106
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object |
Eliassen–Palm theorem
The Eliassen–Palm theorem is a fundamental result in atmospheric dynamics that relates wave activity and mean-flow interaction, providing a framework for understanding how atmospheric waves transport momentum and energy.
|
E549980
|
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: Eliassen–Palm theorem | Statement: [Arnt Eliassen, notableWork, Eliassen–Palm theorem]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Eliassen–Palm theorem Context triple: [Arnt Eliassen, notableWork, Eliassen–Palm theorem]
-
A.
Euler’s theorem
Euler’s theorem is a fundamental result in number theory stating that for any integer a coprime to n, a raised to the power of φ(n) is congruent to 1 modulo n.
-
B.
de Bruijn–van Aardenne–Ehrenfest theorem
The de Bruijn–van Aardenne–Ehrenfest theorem is a fundamental result in combinatorics that characterizes the number of Eulerian circuits in directed graphs, particularly de Bruijn graphs, and underpins constructions in coding theory and discrete mathematics.
-
C.
Milanković calendar
The Milanković calendar is a 20th-century reform of the Julian calendar, designed by Serbian scientist Milutin Milanković to more accurately align the civil year with the solar year and used by some Eastern Orthodox churches.
-
D.
Lusser's law
Lusser's law is a reliability engineering principle that states the overall reliability of a system is the product of the reliabilities of its individual components, highlighting how system reliability decreases as more components are added in series.
-
E.
Osthoff's law
Osthoff's law is a sound change in Indo-European linguistics describing the shortening of long vowels before resonant consonants followed by another consonant.
- 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: Eliassen–Palm theorem Triple: [Arnt Eliassen, notableWork, Eliassen–Palm theorem]
Generated description
The Eliassen–Palm theorem is a fundamental result in atmospheric dynamics that relates wave activity and mean-flow interaction, providing a framework for understanding how atmospheric waves transport momentum and energy.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Eliassen–Palm theorem Target entity description: The Eliassen–Palm theorem is a fundamental result in atmospheric dynamics that relates wave activity and mean-flow interaction, providing a framework for understanding how atmospheric waves transport momentum and energy.
-
A.
Euler’s theorem
Euler’s theorem is a fundamental result in number theory stating that for any integer a coprime to n, a raised to the power of φ(n) is congruent to 1 modulo n.
-
B.
de Bruijn–van Aardenne–Ehrenfest theorem
The de Bruijn–van Aardenne–Ehrenfest theorem is a fundamental result in combinatorics that characterizes the number of Eulerian circuits in directed graphs, particularly de Bruijn graphs, and underpins constructions in coding theory and discrete mathematics.
-
C.
Milanković calendar
The Milanković calendar is a 20th-century reform of the Julian calendar, designed by Serbian scientist Milutin Milanković to more accurately align the civil year with the solar year and used by some Eastern Orthodox churches.
-
D.
Lusser's law
Lusser's law is a reliability engineering principle that states the overall reliability of a system is the product of the reliabilities of its individual components, highlighting how system reliability decreases as more components are added in series.
-
E.
Osthoff's law
Osthoff's law is a sound change in Indo-European linguistics describing the shortening of long vowels before resonant consonants followed by another consonant.
- 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_69c0084de39081909eb34e6bed74215a |
completed | March 22, 2026, 3:18 p.m. |
| NER | Named-entity recognition | batch_69c035529cf88190acc547ae839950e7 |
completed | March 22, 2026, 6:30 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69c0a1bc58d081908568294278cbf3a9 |
completed | March 23, 2026, 2:13 a.m. |
| NEDg | Description generation | batch_69c0a2ab17f481908f2d492e4d9d90fb |
completed | March 23, 2026, 2:17 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69c0a323d9248190aa803c27be3d5eec |
completed | March 23, 2026, 2:19 a.m. |
Created at: March 22, 2026, 3:55 p.m.