Triple
T13660491
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Picard theorem |
E326981
|
entity |
| Predicate | hasAlternativeName |
P39
|
FINISHED |
| Object | Great Picard theorem |
E326981
|
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: Great Picard theorem | Statement: [Picard theorem, hasAlternativeName, Great Picard theorem]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Great Picard theorem Context triple: [Picard theorem, hasAlternativeName, Great Picard theorem]
-
A.
Picard theorem
chosen
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.
-
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.
Mittag-Leffler theorem
The Mittag-Leffler theorem is a fundamental result in complex analysis that characterizes meromorphic functions by allowing the construction of such functions with prescribed principal parts at given poles.
-
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.
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.
- 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_69d8076d8270819092afc2f0e9c359a8 |
completed | April 9, 2026, 8:09 p.m. |
| NER | Named-entity recognition | batch_69dbc620df208190afaccf3ddd10aa60 |
completed | April 12, 2026, 4:19 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69f78b08d27c8190badc612c26423c0e |
completed | May 3, 2026, 5:51 p.m. |
Created at: April 9, 2026, 9:52 p.m.