Triple
T10462064
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Selberg sieve |
E246699
|
entity |
| Predicate | relatedTo |
P37
|
FINISHED |
| Object |
sieve of Eratosthenes
The sieve of Eratosthenes is an ancient and efficient algorithm for finding all prime numbers up to a given limit by iteratively eliminating multiples of each prime.
|
E865104
|
NE FINISHED |
Provenance (5 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69d381c16c248190a2fe5b471e584e9c |
elicitation | completed |
| NER | batch_69d50884fac48190af22e181b1492557 |
ner | completed |
| NED1 | batch_69d89fcc84b48190a39de0d9b9111ebd |
ned_source_triple | completed |
| NED2 | batch_69d8a2b82bb48190899f37a967fef444 |
ned_description | completed |
| NEDg | batch_69d8a1656b348190ba932d03402d6a4d |
nedg | completed |
Created at: April 6, 2026, 12:19 p.m.