Triple
T17028103
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Bennett's logical reversibility |
E413119
|
entity |
| Predicate | instanceOf |
P0
|
FINISHED |
| Object | concept in computation theory |
C7186
|
CONCEPT FINISHED |
How this triple was built (1 step)
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.
CD
Concept disambiguation
gpt-5-mini-2025-08-07
Target class: concept in computation theory Context triple: [Bennett's logical reversibility, instanceOf, concept in computation theory]
-
A.
foundational principle in theoretical computer science
chosen
A foundational principle in theoretical computer science is a core, abstract concept or rule—such as computability, complexity, or formal language theory—that underlies and unifies the study of algorithms, computation models, and their inherent limits.
-
B.
model of computation
A model of computation is an abstract mathematical framework that defines how algorithms are represented and executed, specifying the rules, operations, and resources available for performing computations.
-
C.
concept in number theory
A concept in number theory is an abstract idea or construct that describes properties, relationships, or structures involving integers and related numerical systems.
-
D.
concept in group theory
A class in group theory is a subset of group elements that are equivalent under conjugation, meaning each element can be written as g⁻¹ag for some fixed a and varying g in the group.
-
E.
concept in finite group theory
A class in finite group theory is a subset of group elements that are equivalent under conjugation, meaning each element can be transformed into any other in the subset by an inner automorphism of the group.
- F. None of above.
Provenance (1 batch)
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. |
Created at: April 10, 2026, 5:33 a.m.