Triple
T3037556
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Andrei Kolmogorov |
E83045
|
entity |
| Predicate | notableIdea |
P4
|
FINISHED |
| Object | algorithmic randomness |
E183589
|
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: algorithmic randomness | Statement: [Andrei Kolmogorov, notableIdea, algorithmic randomness]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: algorithmic randomness Context triple: [Andrei Kolmogorov, notableIdea, algorithmic randomness]
-
A.
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.
-
B.
Kolmogorov complexity
chosen
Kolmogorov complexity is a measure of the amount of information in an object, defined as the length of the shortest computer program that can produce it.
-
C.
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.
-
D.
Blum complexity measures
Blum complexity measures are a formal framework in computational complexity theory that rigorously define and compare the resource usage (such as time or space) of algorithms via axiomatic conditions.
-
E.
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.
- 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_69ad8b2298908190a7cb4e9bdbf064d0 |
completed | March 8, 2026, 2:43 p.m. |
| NER | Named-entity recognition | batch_69ad9b2e03c88190b4e2f01f07c9303a |
completed | March 8, 2026, 3:52 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69b1dec8778c8190a5e06a29a0218404 |
completed | March 11, 2026, 9:29 p.m. |
Created at: March 8, 2026, 3:01 p.m.