Triple
T17020397
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Closed Graph Theorem |
E412931
|
entity |
| Predicate | relatedTo |
P37
|
FINISHED |
| Object | Open Mapping Theorem |
E518476
|
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: Open Mapping Theorem | Statement: [Closed Graph Theorem, relatedTo, Open Mapping Theorem]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Open Mapping Theorem Context triple: [Closed Graph Theorem, relatedTo, Open Mapping Theorem]
-
A.
open mapping theorem
chosen
The open mapping theorem is a fundamental result in functional analysis stating that any surjective continuous linear operator between Banach spaces maps open sets to open sets.
-
B.
Riemann mapping theorem
The Riemann mapping theorem is a fundamental result in complex analysis stating that any non-empty simply connected open subset of the complex plane (other than the whole plane) can be conformally mapped onto the open unit disk.
-
C.
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.
-
D.
Lindelöf theorem in complex analysis
The Lindelöf theorem in complex analysis is a result that refines the maximum modulus principle by controlling the boundary growth of analytic functions, particularly along paths approaching boundary points of their domain.
-
E.
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.
- 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_69d886cc4170819093deddc7b8b4b6a7 |
completed | April 10, 2026, 5:12 a.m. |
| NER | Named-entity recognition | batch_69e3d482c3a0819099e6ea4acb0a08ee |
completed | April 18, 2026, 6:59 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_6a011b4f9dfc819085639edb5cda1cca |
completed | May 10, 2026, 11:57 p.m. |
Created at: April 10, 2026, 5:33 a.m.