Triple
T7337934
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Moore neighborhood |
E169176
|
entity |
| Predicate | fieldOfStudy |
P3
|
FINISHED |
| Object | theoretical computer science |
E238251
|
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: theoretical computer science | Statement: [Moore neighborhood, fieldOfStudy, theoretical computer science]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: theoretical computer science Context triple: [Moore neighborhood, fieldOfStudy, theoretical computer science]
-
A.
Theoretical Computer Science
chosen
Theoretical Computer Science is a branch of computer science that focuses on mathematical and abstract foundations of computation, including algorithms, complexity, automata, and formal languages.
-
B.
Mathematical Theory of Computation
Mathematical Theory of Computation is a foundational textbook in theoretical computer science that systematically develops formal models of computation, computability, and complexity.
-
C.
Foundations of Computer Science
Foundations of Computer Science is a widely used introductory textbook that presents the fundamental concepts and theoretical underpinnings of computer science, including algorithms, data structures, automata, and complexity.
-
D.
Complexity Theory
Complexity Theory is a branch of theoretical computer science that studies the resources, such as time and space, required to solve computational problems and classifies these problems based on their inherent difficulty.
-
E.
Computability Theory
Computability Theory is a branch of theoretical computer science and mathematical logic that studies which problems can be solved by algorithms and how efficiently they can be computed.
- 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_69c68a57710481909f0c1f3c6ebdb6f2 |
completed | March 27, 2026, 1:47 p.m. |
| NER | Named-entity recognition | batch_69c6f0d599c88190875514eae7084f8d |
completed | March 27, 2026, 9:04 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69c7ef266fd0819096cf3ece3fff6b90 |
completed | March 28, 2026, 3:09 p.m. |
Created at: March 27, 2026, 3:04 p.m.