Triple
T26966723
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | RP |
E679190
|
entity |
| Predicate | computationModel |
P37649
|
FINISHED |
| Object | Turing machine with access to random bits |
—
|
LITERAL 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: Turing machine with access to random bits | Statement: [RP, computationModel, Turing machine with access to random bits]
PD
Predicate disambiguation
gpt-5-mini-2025-08-07
Target predicate: computationModel Context triple: [RP, computationModel, Turing machine with access to random bits]
-
A.
computingModel
chosen
Indicates the computational framework, paradigm, or formal system used to perform or describe a computation.
-
B.
computationInput
Indicates that an entity serves as input data or parameters consumed by a computation or processing activity.
-
C.
computes
Indicates that one entity performs a calculation or processing operation to produce a result from given data or inputs.
-
D.
computationalClass
Indicates that two entities share the same computational complexity class or that one entity is categorized within a specified computational complexity class.
-
E.
computabilityRequirement
Indicates that something must be capable of being computed or effectively carried out by an algorithm or computational process.
- F. None of above.
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_69eeeb4f3a448190b1e94b2d4776c16e |
completed | April 27, 2026, 4:51 a.m. |
| NER | Named-entity recognition | batch_69f621cbc48881908d104c648c91c715 |
completed | May 2, 2026, 4:09 p.m. |
| PD | Predicate disambiguation | batch_69f620e0b37481909a280574decbd443 |
completed | May 2, 2026, 4:05 p.m. |
Created at: April 27, 2026, 6:36 a.m.