Triple
T36467566
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | algorithmic number theory |
E898460
|
entity |
| Predicate | notableAlgorithm |
—
|
GENERATED |
| Object | AKS primality test |
—
|
UNRECOGNIZED GENERATED |
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.
PD
Predicate disambiguation
gpt-5-mini-2025-08-07
Target predicate: notableAlgorithm Context triple: [algorithmic number theory, notableAlgorithm, AKS primality test]
-
A.
relatedAlgorithm
chosen
Indicates that one algorithm has a meaningful connection or association with another algorithm, such as similarity, dependency, or complementary function.
-
B.
notableProgramming
Indicates that an entity is notably associated with programming, such as being recognized for significant work, skill, or contributions in the field of programming.
-
C.
notableStable
Indicates that the subject is a notable or historically significant stable associated with the object.
-
D.
notableCode
Indicates that the subject is associated with a code (e.g., identifier, standard, or classification) that is considered notable or significant in some context.
-
E.
notableScheme
Indicates that an entity is particularly recognized or prominent within a specific scheme, system, or organizational framework.
- 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_69f76e58ebd88190b75d9b169b59d793 |
completed | May 3, 2026, 3:48 p.m. |
Created at: May 3, 2026, 4:10 p.m.