Triple
T14704226
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Émile Borel |
E345382
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object |
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.
|
E1116060
|
NE FINISHED |
How this triple was built (4 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: Borel–Carathéodory theorem | Statement: [Émile Borel, notableWork, Borel–Carathéodory theorem]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Borel–Carathéodory theorem Context triple: [Émile Borel, notableWork, Borel–Carathéodory theorem]
-
A.
Schwarz–Pick theorem
The Schwarz–Pick theorem is a fundamental result in complex analysis that characterizes holomorphic self-maps of the unit disk by showing they are distance-decreasing with respect to the hyperbolic (Poincaré) metric.
-
B.
Montel theorem
Montel's theorem is a fundamental result in complex analysis stating that a family of holomorphic functions that is uniformly bounded on every compact subset of a domain is a normal family, meaning every sequence in it has a subsequence that converges uniformly on compact sets.
-
C.
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.
-
D.
Rouché's theorem
Rouché's theorem is a result in complex analysis that provides conditions under which two holomorphic functions have the same number of zeros inside a given contour.
-
E.
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."
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NEDg
Description generation
gpt-5.1
Instruction
Generate a one-sentence description of the target entity. You are given a context triple in the form (subject, predicate, object), where the object is the target entity. # Instructions Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. Avoid repeating the information from the triple, unless really essential. # Response Format Return only the sentence: "Description: [one-sentence description of the target entity]"
Input
Entity: Borel–Carathéodory theorem Triple: [Émile Borel, notableWork, Borel–Carathéodory theorem]
Generated description
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.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Borel–Carathéodory theorem Target entity description: 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.
-
A.
Schwarz–Pick theorem
The Schwarz–Pick theorem is a fundamental result in complex analysis that characterizes holomorphic self-maps of the unit disk by showing they are distance-decreasing with respect to the hyperbolic (Poincaré) metric.
-
B.
Montel theorem
Montel's theorem is a fundamental result in complex analysis stating that a family of holomorphic functions that is uniformly bounded on every compact subset of a domain is a normal family, meaning every sequence in it has a subsequence that converges uniformly on compact sets.
-
C.
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.
-
D.
Rouché's theorem
Rouché's theorem is a result in complex analysis that provides conditions under which two holomorphic functions have the same number of zeros inside a given contour.
-
E.
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."
- F. None of above. chosen
Provenance (5 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_69d822e4a8c08190a155df736bb7bc13 |
completed | April 9, 2026, 10:06 p.m. |
| NER | Named-entity recognition | batch_69deb6071e5c8190bb5509c859135c2d |
completed | April 14, 2026, 9:47 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69fdf087ce8c819081a7186df67bcf1f |
completed | May 8, 2026, 2:17 p.m. |
| NEDg | Description generation | batch_69fdf2a63cc88190b3670378c54c96b6 |
completed | May 8, 2026, 2:26 p.m. |
| NED2 | Entity disambiguation (via description) | batch_69fdf31fcb4081908a88cf4d4c5ddced |
completed | May 8, 2026, 2:28 p.m. |
Created at: April 10, 2026, 1:28 a.m.