Triple
T17022636
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Princeton architecture |
E412983
|
entity |
| Predicate | limitation |
P99
|
FINISHED |
| Object | von Neumann bottleneck |
E14971
|
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: von Neumann bottleneck | Statement: [Princeton architecture, limitation, von Neumann bottleneck]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: von Neumann bottleneck Context triple: [Princeton architecture, limitation, von Neumann bottleneck]
-
A.
von Neumann architecture
chosen
The von Neumann architecture is a foundational computer design model in which a single memory stores both program instructions and data, executed sequentially by a central processing unit.
-
B.
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.
-
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.
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.
-
E.
Gustafson's law
Gustafson's law is a principle in parallel computing that argues overall speedup can scale with the number of processors by increasing problem size, challenging the fixed-workload limitation implied by Amdahl's law.
- 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_69d886cc4170819093deddc7b8b4b6a7 |
completed | April 10, 2026, 5:12 a.m. |
| NER | Named-entity recognition | batch_69e3d5d1d2e48190bbcba129247c6c2e |
completed | April 18, 2026, 7:04 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_6a011b4f9dfc819085639edb5cda1cca |
completed | May 10, 2026, 11:57 p.m. |
Created at: April 10, 2026, 5:33 a.m.