Triple

T13909166
Position Surface form Disambiguated ID Type / Status
Subject John G. Thompson E334437 entity
Predicate knownFor P22 FINISHED
Object Feit–Thompson theorem
The Feit–Thompson theorem is a landmark result in group theory that proves every finite group of odd order is solvable, marking the first major classification of a broad class of finite simple groups.
E1067769 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: Feit–Thompson theorem | Statement: [John G. Thompson, knownFor, Feit–Thompson theorem]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Feit–Thompson theorem
Context triple: [John G. Thompson, knownFor, Feit–Thompson theorem]
  • A. Zassenhaus conjecture
    The Zassenhaus conjecture is a prominent open problem in group theory concerning the structure of units in integral group rings and their relation to the underlying finite group.
  • B. Cauchy's theorem in group theory
    Cauchy's theorem in group theory is a fundamental result stating that if a finite group’s order is divisible by a prime p, then the group contains an element (and hence a subgroup) of order p.
  • C. Jordan–Hölder theorem
    The Jordan–Hölder theorem is a fundamental result in group theory stating that any two composition series of a finite group have the same length and the same (up to order and isomorphism) simple factor groups.
  • D. Schreier refinement theorem
    The Schreier refinement theorem is a result in group theory stating that any two subnormal series of a group admit equivalent refinements, serving as a precursor and companion to the Jordan–Hölder theorem.
  • E. Sylow theorems
    The Sylow theorems are fundamental results in finite group theory that describe the existence, conjugacy, and number of subgroups whose orders are powers of a prime dividing the group order.
  • 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: Feit–Thompson theorem
Triple: [John G. Thompson, knownFor, Feit–Thompson theorem]
Generated description
The Feit–Thompson theorem is a landmark result in group theory that proves every finite group of odd order is solvable, marking the first major classification of a broad class of finite simple groups.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Feit–Thompson theorem
Target entity description: The Feit–Thompson theorem is a landmark result in group theory that proves every finite group of odd order is solvable, marking the first major classification of a broad class of finite simple groups.
  • A. Zassenhaus conjecture
    The Zassenhaus conjecture is a prominent open problem in group theory concerning the structure of units in integral group rings and their relation to the underlying finite group.
  • B. Cauchy's theorem in group theory
    Cauchy's theorem in group theory is a fundamental result stating that if a finite group’s order is divisible by a prime p, then the group contains an element (and hence a subgroup) of order p.
  • C. Jordan–Hölder theorem
    The Jordan–Hölder theorem is a fundamental result in group theory stating that any two composition series of a finite group have the same length and the same (up to order and isomorphism) simple factor groups.
  • D. Schreier refinement theorem
    The Schreier refinement theorem is a result in group theory stating that any two subnormal series of a group admit equivalent refinements, serving as a precursor and companion to the Jordan–Hölder theorem.
  • E. Sylow theorems
    The Sylow theorems are fundamental results in finite group theory that describe the existence, conjugacy, and number of subgroups whose orders are powers of a prime dividing the group order.
  • 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_69d81c5eaa9c819083b1ff8689179565 completed April 9, 2026, 9:38 p.m.
NER Named-entity recognition batch_69de2721ec6c8190888f4a9d004eb8e0 completed April 14, 2026, 11:38 a.m.
NED1 Entity disambiguation (via context triple) batch_69f7c726b7388190b557f4c41622460d completed May 3, 2026, 10:07 p.m.
NEDg Description generation batch_69f7c807e70c8190b15a7d4608a17591 completed May 3, 2026, 10:11 p.m.
NED2 Entity disambiguation (via description) batch_69f7c8f2b5588190b6143d676eb648a0 completed May 3, 2026, 10:15 p.m.
Created at: April 9, 2026, 10:16 p.m.