Triple
T1961130
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Gene Amdahl |
E42388
|
entity |
| Predicate | knownFor |
P22
|
FINISHED |
| Object |
Amdahl's law
Amdahl's law is a formula in computer architecture and parallel computing that predicts the maximum performance improvement achievable by parallelizing parts of a system, given that some portion must remain serial.
|
E219378
|
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: Amdahl's law | Statement: [Gene Amdahl, knownFor, Amdahl's law]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Amdahl's law Context triple: [Gene Amdahl, knownFor, Amdahl's law]
-
A.
Moore's law
Moore's law is an observation and prediction that the number of transistors on an integrated circuit—and thus computing power—tends to roughly double at regular intervals, driving exponential growth in digital technology.
-
B.
Wirth’s law
Wirth’s law is the observation that software tends to become slower more quickly than hardware becomes faster, often negating the benefits of improved computing performance.
-
C.
"Computer Architecture: A Quantitative Approach"
"Computer Architecture: A Quantitative Approach" is a seminal textbook that rigorously explores modern computer architecture design and performance analysis, widely used in academia and industry as a definitive reference.
-
D.
"How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs"
"How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs" is a seminal paper by Leslie Lamport that introduced foundational concepts for ensuring correctness and consistency in concurrent and multiprocessor systems.
-
E.
Kluge's law
Kluge's law is a proposed sound law in Proto-Germanic historical linguistics that explains the development of certain geminate consonants from earlier consonant clusters.
- 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: Amdahl's law Triple: [Gene Amdahl, knownFor, Amdahl's law]
Generated description
Amdahl's law is a formula in computer architecture and parallel computing that predicts the maximum performance improvement achievable by parallelizing parts of a system, given that some portion must remain serial.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Amdahl's law Target entity description: Amdahl's law is a formula in computer architecture and parallel computing that predicts the maximum performance improvement achievable by parallelizing parts of a system, given that some portion must remain serial.
-
A.
Moore's law
Moore's law is an observation and prediction that the number of transistors on an integrated circuit—and thus computing power—tends to roughly double at regular intervals, driving exponential growth in digital technology.
-
B.
Wirth’s law
Wirth’s law is the observation that software tends to become slower more quickly than hardware becomes faster, often negating the benefits of improved computing performance.
-
C.
"Computer Architecture: A Quantitative Approach"
"Computer Architecture: A Quantitative Approach" is a seminal textbook that rigorously explores modern computer architecture design and performance analysis, widely used in academia and industry as a definitive reference.
-
D.
"How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs"
"How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs" is a seminal paper by Leslie Lamport that introduced foundational concepts for ensuring correctness and consistency in concurrent and multiprocessor systems.
-
E.
Kluge's law
Kluge's law is a proposed sound law in Proto-Germanic historical linguistics that explains the development of certain geminate consonants from earlier consonant clusters.
- 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_69a8870eea088190a38781990812a9bc |
completed | March 4, 2026, 7:25 p.m. |
| NER | Named-entity recognition | batch_69abb380bfc08190ae80f8e6570494b8 |
completed | March 7, 2026, 5:11 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69adfbcea048819091d705095f0d3f68 |
completed | March 8, 2026, 10:44 p.m. |
| NEDg | Description generation | batch_69adfc8efb0c81908bce5a4a13359801 |
completed | March 8, 2026, 10:47 p.m. |
| NED2 | Entity disambiguation (via description) | batch_69adfd8115d481909716e11b943cbf61 |
completed | March 8, 2026, 10:51 p.m. |
Created at: March 4, 2026, 7:36 p.m.