Triple
T8006538
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Miao people |
E186375
|
entity |
| Predicate | writingSystemUse |
P454
|
FINISHED |
| Object | Pollard script |
E704488
|
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: Pollard script | Statement: [Miao people, writingSystemUse, Pollard script]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Pollard script Context triple: [Miao people, writingSystemUse, Pollard script]
-
A.
Pollard script
chosen
Pollard script is an alphabetic writing system originally devised in the early 20th century for transcribing various Miao (Hmongic) languages of China.
-
B.
Pollard
Pollard is an English-language surname borne by various notable individuals across sports, politics, science, and the arts.
-
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.
Berlekamp–Massey algorithm
The Berlekamp–Massey algorithm is a key algorithm in coding theory and cryptography used to efficiently determine the shortest linear feedback shift register that generates a given binary sequence.
-
E.
Selfridge–Conway primality test
The Selfridge–Conway primality test is a probabilistic algorithm in number theory used to determine whether a given integer is prime.
- 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_69ca82abaffc8190ab8af79cdbc31ab3 |
completed | March 30, 2026, 2:03 p.m. |
| NER | Named-entity recognition | batch_69cb3cf8a6048190970685a83fd2f59d |
completed | March 31, 2026, 3:18 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69cc5697ac9081909fe7ca06d0c3ef38 |
completed | March 31, 2026, 11:19 p.m. |
Created at: March 30, 2026, 5:18 p.m.