Triple
T9838951
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Hendrik Lenstra |
E239172
|
entity |
| Predicate | familyName |
P18
|
FINISHED |
| Object | Lenstra |
E239172
|
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: Lenstra | Statement: [Hendrik Lenstra, familyName, Lenstra]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Lenstra Context triple: [Hendrik Lenstra, familyName, Lenstra]
-
A.
Pollard
Pollard is an English-language surname borne by various notable individuals across sports, politics, science, and the arts.
-
B.
Hendrik Lenstra
chosen
Hendrik Lenstra is a Dutch mathematician renowned for his influential work in number theory and computational algebra, including the development of the Lenstra elliptic-curve factorization method.
-
C.
Cantor–Zassenhaus algorithm
The Cantor–Zassenhaus algorithm is a probabilistic method used to factor polynomials over finite fields efficiently, widely employed in computational algebra and cryptography.
-
D.
Adleman–Pomerance–Rumely primality test
The Adleman–Pomerance–Rumely primality test is an early deterministic algorithm in computational number theory used to determine whether a given number is prime, notable for its theoretical importance in the development of modern primality testing methods.
-
E.
Victor Shoup
Victor Shoup is a prominent computer scientist and cryptographer known for his foundational work in public-key cryptography, provable security, and the development of widely used cryptographic libraries.
- 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_69ca84e314108190978324a4bdb959f8 |
completed | March 30, 2026, 2:12 p.m. |
| NER | Named-entity recognition | batch_69cdb34921b881909836ba0f5b42a27b |
completed | April 2, 2026, 12:07 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69d1d5d145ac8190ad10a4328216ef54 |
completed | April 5, 2026, 3:24 a.m. |
Created at: March 30, 2026, 8:33 p.m.