Triple
T23507770
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Leonid Levin |
E572330
|
entity |
| Predicate | hasResearchInterest |
P934
|
FINISHED |
| Object | Kolmogorov complexity |
—
|
NE NERFINISHED |
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: Kolmogorov complexity | Statement: [Leonid Levin, hasResearchInterest, Kolmogorov complexity]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Kolmogorov complexity Context triple: [Leonid Levin, hasResearchInterest, Kolmogorov complexity]
-
A.
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.
-
B.
algorithmic information theory
Algorithmic information theory is a branch of theoretical computer science and mathematics that studies the complexity and information content of objects using concepts like Kolmogorov complexity and randomness.
-
C.
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.
-
D.
Solomonoff induction
Solomonoff induction is a formal theory of universal prediction that combines algorithmic information theory and Bayesian reasoning to define an idealized, incomputable method for inferring future data from past observations.
-
E.
Martin-Löf randomness
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.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Provenance (2 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_69e245b5e4208190bac8a6509867e394 |
completed | April 17, 2026, 2:37 p.m. |
| NER | Named-entity recognition | batch_69f1a901c9908190a781e79fe8b96743 |
completed | April 29, 2026, 6:45 a.m. |
Created at: April 17, 2026, 6:07 p.m.