Triple
T18495149
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Hardy space |
E451925
|
entity |
| Predicate | relatedConcept |
P37
|
FINISHED |
| Object | Nevanlinna class |
—
|
NE NERFINISHED |
How this triple was built (3 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: Nevanlinna class | Statement: [Hardy space, relatedConcept, Nevanlinna class]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Nevanlinna class Context triple: [Hardy space, relatedConcept, Nevanlinna class]
-
A.
Nevanlinna theory
Nevanlinna theory is a branch of complex analysis that studies the value distribution of meromorphic functions, quantifying how often they take or omit certain values.
-
B.
Picard theorem
Picard theorem is a fundamental result in complex analysis stating that entire non-constant functions take on all possible complex values, with at most one exception.
-
C.
Borel–Carathéodory theorem
The Borel–Carathéodory theorem is a result in complex analysis that provides bounds on the modulus of a holomorphic function inside a disk in terms of the maximum of its real part on a larger concentric disk.
-
D.
Corona theorem
The Corona theorem is a fundamental result in complex analysis that characterizes when bounded analytic functions on the unit disk can be solved in a certain type of division problem, showing that the maximal ideal space of the disk algebra has no "corona."
-
E.
Casorati–Weierstrass theorem
The Casorati–Weierstrass theorem is a fundamental result in complex analysis stating that near an essential singularity, a complex function attains values arbitrarily close to every complex number.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Nevanlinna class Target entity description: The Nevanlinna class is a collection of holomorphic functions on the unit disk (or upper half-plane) whose logarithmic modulus has a harmonic majorant, playing a central role in complex analysis and function theory alongside Hardy spaces.
-
A.
Nevanlinna theory
Nevanlinna theory is a branch of complex analysis that studies the value distribution of meromorphic functions, quantifying how often they take or omit certain values.
-
B.
Picard theorem
Picard theorem is a fundamental result in complex analysis stating that entire non-constant functions take on all possible complex values, with at most one exception.
-
C.
Borel–Carathéodory theorem
The Borel–Carathéodory theorem is a result in complex analysis that provides bounds on the modulus of a holomorphic function inside a disk in terms of the maximum of its real part on a larger concentric disk.
-
D.
Corona theorem
The Corona theorem is a fundamental result in complex analysis that characterizes when bounded analytic functions on the unit disk can be solved in a certain type of division problem, showing that the maximal ideal space of the disk algebra has no "corona."
-
E.
Casorati–Weierstrass theorem
The Casorati–Weierstrass theorem is a fundamental result in complex analysis stating that near an essential singularity, a complex function attains values arbitrarily close to every complex number.
- F. None of above. chosen
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_69d8d3855d50819097fc8561b0299dd9 |
completed | April 10, 2026, 10:40 a.m. |
| NER | Named-entity recognition | batch_69e532bfeef4819096b2fa28abb662b9 |
completed | April 19, 2026, 7:53 p.m. |
Created at: April 10, 2026, 11:35 a.m.