Triple

T26919906
Position Surface form Disambiguated ID Type / Status
Subject Armand Borel E677614 entity
Predicate knownFor P22 FINISHED
Object Borel fixed-point theorem
The Borel fixed-point theorem is a fundamental result in algebraic geometry and group theory stating that a connected solvable algebraic group acting regularly on a complete variety over an algebraically closed field must have a fixed point.
E1747031 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: Borel fixed-point theorem | Statement: [Armand Borel, knownFor, Borel fixed-point theorem]
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: Borel fixed-point theorem
Triple: [Armand Borel, knownFor, Borel fixed-point theorem]
Generated description
The Borel fixed-point theorem is a fundamental result in algebraic geometry and group theory stating that a connected solvable algebraic group acting regularly on a complete variety over an algebraically closed field must have a fixed point.

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_69eee9bdebc48190ba90a12a63e09c73 completed April 27, 2026, 4:44 a.m.
NER Named-entity recognition batch_69f6200cee788190ba32d1379b50ba57 completed May 2, 2026, 4:02 p.m.
NED1 Entity disambiguation (via context triple) batch_6a121eb8f0488190a81cc7c7647426b2 completed May 23, 2026, 9:40 p.m.
NEDg Description generation batch_6a121ffdc9548190bd0d216c3a7c3bcd completed May 23, 2026, 9:45 p.m.
NED2 Entity disambiguation (via description) batch_6a122078a0508190b8f96fdd942595bc completed May 23, 2026, 9:47 p.m.
Created at: April 27, 2026, 6:06 a.m.