Triple

T11099198
Position Surface form Disambiguated ID Type / Status
Subject Camille Jordan E262458 entity
Predicate knownFor P22 FINISHED
Object Jordan–Hölder theorem E157402 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: Jordan–Hölder theorem | Statement: [Camille Jordan, knownFor, Jordan–Hölder theorem]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Jordan–Hölder theorem
Context triple: [Camille Jordan, knownFor, Jordan–Hölder theorem]
  • A. Jordan–Hölder theorem chosen
    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.
  • B. 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.
  • C. Noether's isomorphism theorems
    Noether's isomorphism theorems are fundamental results in abstract algebra that relate quotient structures and substructures of groups, rings, and modules, providing a unifying framework for understanding homomorphic images and factor structures.
  • D. Zassenhaus lemma
    The Zassenhaus lemma is a fundamental result in group theory that describes how subgroups in a group extension correspond and relate to each other, often used in the study of composition series and 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.
  • 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_69d6aa9a40d88190a373e2c7e48285db completed April 8, 2026, 7:20 p.m.
NER Named-entity recognition batch_69d79a0c46308190889b94c23ebaca62 completed April 9, 2026, 12:22 p.m.
NED1 Entity disambiguation (via context triple) batch_69e3e7eca9bc8190b43bae081d97d804 completed April 18, 2026, 8:22 p.m.
Created at: April 8, 2026, 9:27 p.m.