Triple

T11085909
Position Surface form Disambiguated ID Type / Status
Subject Hurwitz bound on automorphism groups of curves E262119 entity
Predicate givesUpperBoundFor P96513 FINISHED
Object order of the automorphism group of a compact Riemann surface LITERAL 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: order of the automorphism group of a compact Riemann surface | Statement: [Hurwitz bound on automorphism groups of curves, givesUpperBoundFor, order of the automorphism group of a compact Riemann surface]
PD Predicate disambiguation gpt-5-mini-2025-08-07
Target predicate: givesUpperBoundFor
Context triple: [Hurwitz bound on automorphism groups of curves, givesUpperBoundFor, order of the automorphism group of a compact Riemann surface]
  • A. isUpperBoundFor
    Indicates that one value is greater than or equal to every element in a given set or collection, serving as an upper limit for them.
  • B. givesBoundOn chosen
    Indicates that one quantity provides an upper or lower limit (a bound) on the value or behavior of another quantity.
  • C. hasCommonWorkingDefinitionUpperBound
    Indicates that two or more entities share the same maximum value or limit in their commonly accepted working definition.
  • D. isBoundedBelow
    Indicates that every value in a set or function is greater than or equal to some fixed lower bound.
  • E. boundedByApprox
    Indicates that one quantity is constrained by another within an approximate or tolerance-based bound, rather than an exact strict limit.
  • F. None of above.

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_69d6aa9983c08190b0ef61603b69feac completed April 8, 2026, 7:20 p.m.
NER Named-entity recognition batch_69d799c2c7d4819087ac793153340178 completed April 9, 2026, 12:21 p.m.
PD Predicate disambiguation batch_69d744185a5881909ba4cf151d1798ec completed April 9, 2026, 6:15 a.m.
Created at: April 8, 2026, 9:27 p.m.