Triple
T13444216
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Per Martin-Löf |
E320437
|
entity |
| Predicate | hasConceptNamedAfter |
P3325
|
FINISHED |
| Object | Martin-Löf test of randomness |
E700156
|
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: Martin-Löf test of randomness | Statement: [Per Martin-Löf, hasConceptNamedAfter, Martin-Löf test of randomness]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Martin-Löf test of randomness Context triple: [Per Martin-Löf, hasConceptNamedAfter, Martin-Löf test of randomness]
-
A.
Martin-Löf randomness
chosen
Martin-Löf randomness is a rigorous mathematical notion of randomness for infinite binary sequences, defined via effectively null sets and closely connected to algorithmic information theory.
-
B.
Yao’s next-bit test
Yao’s next-bit test is a foundational cryptographic criterion that characterizes pseudorandomness by requiring that no efficient algorithm can predict the next bit of a sequence significantly better than random guessing, given all previous bits.
-
C.
Blum–Micali pseudorandom number generator
The Blum–Micali pseudorandom number generator is a foundational cryptographic algorithm that produces provably secure pseudorandom bits based on number-theoretic hardness assumptions.
-
D.
In a World of Pseudorandomness
"In a World of Pseudorandomness" is a theoretical computer science work exploring the foundations, constructions, and implications of pseudorandomness in computation and cryptography.
-
E.
Randomness and Computation
"Randomness and Computation" is Shafi Goldwasser's influential doctoral thesis that helped lay the foundations of modern complexity theory and cryptography by rigorously exploring the role of randomness in efficient computation.
- 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_69d80761e6cc8190a90c844589998ecc |
completed | April 9, 2026, 8:09 p.m. |
| NER | Named-entity recognition | batch_69dbaee881888190811ddf01bc699864 |
completed | April 12, 2026, 2:40 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69f75d8892a88190b4a32865b32c8883 |
completed | May 3, 2026, 2:36 p.m. |
Created at: April 9, 2026, 9:40 p.m.