Triple

T10991873
Position Surface form Disambiguated ID Type / Status
Subject Koebe quarter theorem E259770 entity
Predicate extremalFunction P96514 FINISHED
Object Koebe function E898494 NE FINISHED

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: Koebe function | Statement: [Koebe quarter theorem, extremalFunction, Koebe function]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Koebe function
Context triple: [Koebe quarter theorem, extremalFunction, Koebe function]
  • A. Koebe function chosen
    The Koebe function is a specific univalent holomorphic function on the unit disk that extremizes several classical bounds in geometric function theory, notably serving as the extremal example in the Koebe quarter theorem.
  • B. Koebe quarter theorem
    The Koebe quarter theorem is a fundamental result in complex analysis stating that any univalent holomorphic function on the unit disk maps it onto a domain containing a disk of radius one quarter, providing a sharp bound on the size of the image.
  • C. Bieberbach conjecture
    The Bieberbach conjecture, now a theorem, is a landmark result in complex analysis that characterizes the size of Taylor coefficients of normalized univalent (injective) holomorphic functions on the unit disk.
  • D. 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.
  • E. Schwarz lemma
    Schwarz lemma is a fundamental result in complex analysis that constrains holomorphic self-maps of the unit disk, particularly bounding their magnitude and derivative at the origin.
  • F. None of above.
  • G. Unsure - the case is ambiguous/there is not enough information to decide.
PD Predicate disambiguation gpt-5-mini-2025-08-07
Target predicate: extremalFunction
Context triple: [Koebe quarter theorem, extremalFunction, Koebe function]
  • A. isExtremalWhen
    Indicates that a given entity or configuration attains an extreme value (such as a maximum or minimum) of some specified quantity or property under certain conditions.
  • B. hasExtremePoint
    Indicates that one entity possesses or includes another entity that is an extreme (e.g., maximum or minimum) point within its structure or boundary.
  • C. EuclideanFunction
    Indicates a relationship defined by a Euclidean distance–based function, typically mapping entities or their attributes to values derived from Euclidean metric properties.
  • D. hasAsymptotics
    Indicates that one entity describes or determines the asymptotic behavior or growth rate of another entity, typically in a limiting or large-scale sense.
  • E. functionalEquationPartProvedBy
    Indicates that a specific part or component of a functional equation has been proven or established by a particular proof, method, or agent.
  • 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_69d6aa8a6a548190a750f944ccdc8064 completed April 8, 2026, 7:20 p.m.
NER Named-entity recognition batch_69d795d1e918819090c71f5a077fa15a completed April 9, 2026, 12:04 p.m.
NED1 Entity disambiguation (via context triple) batch_69e374639f1481908ea372b81a834f6f completed April 18, 2026, 12:09 p.m.
PD Predicate disambiguation batch_69d72e93ac648190b46c5d12bf3eb1e9 completed April 9, 2026, 4:44 a.m.
PDg Predicate description generation batch_69d732242fdc8190be77d1f730a42935 completed April 9, 2026, 4:59 a.m.
Created at: April 8, 2026, 9:24 p.m.