Triple
T7329727
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Wirth’s law |
E168966
|
entity |
| Predicate | relatedTo |
P37
|
FINISHED |
| Object | Amdahl’s law |
E219378
|
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: Amdahl’s law | Statement: [Wirth’s law, relatedTo, Amdahl’s law]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Amdahl’s law Context triple: [Wirth’s law, relatedTo, Amdahl’s law]
-
A.
Amdahl's law
chosen
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.
-
B.
Dennard scaling
Dennard scaling is a principle in microelectronics stating that as transistors shrink, their power density stays constant, allowing higher clock speeds and more transistors per chip without increasing overall power consumption.
-
C.
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.
-
D.
Amdahl
Amdahl is the surname of Gene Amdahl, a pioneering computer architect best known for formulating Amdahl's Law and contributing to the design of IBM mainframe systems.
-
E.
speedup theorem
The speedup theorem is a result in computational complexity theory showing that for certain problems, no single algorithm is asymptotically optimal because there always exists another algorithm that solves the problem significantly faster according to a given complexity measure.
- 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_69c68a54cacc81908e3b773441f19566 |
completed | March 27, 2026, 1:47 p.m. |
| NER | Named-entity recognition | batch_69c6f0a9c0f081909218560d8a4f4995 |
completed | March 27, 2026, 9:03 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69c7ef16f35881909fffba1df072f0d6 |
completed | March 28, 2026, 3:09 p.m. |
Created at: March 27, 2026, 3:03 p.m.