Triple

T24806755
Position Surface form Disambiguated ID Type / Status
Subject Rellich–Kondrachov compactness theorem E620675 entity
Predicate relatedTo P37 FINISHED
Object Aubin–Lions lemma
The Aubin–Lions lemma is a fundamental compactness result in functional analysis and the theory of partial differential equations, used to extract strongly convergent subsequences from bounded sequences of time-dependent functions under suitable space-time regularity conditions.
E1654952 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: Aubin–Lions lemma | Statement: [Rellich–Kondrachov compactness theorem, relatedTo, Aubin–Lions lemma]
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: Aubin–Lions lemma
Triple: [Rellich–Kondrachov compactness theorem, relatedTo, Aubin–Lions lemma]
Generated description
The Aubin–Lions lemma is a fundamental compactness result in functional analysis and the theory of partial differential equations, used to extract strongly convergent subsequences from bounded sequences of time-dependent functions under suitable space-time regularity conditions.

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_69e2fabf26bc8190b191faac8f67065b completed April 18, 2026, 3:30 a.m.
NER Named-entity recognition batch_69f42206efcc81908d4b512bd4ae899a completed May 1, 2026, 3:46 a.m.
NED1 Entity disambiguation (via context triple) batch_6a101c362434819088f7ca3399bbb14f completed May 22, 2026, 9:04 a.m.
NEDg Description generation batch_6a102814f838819094ed41d653039f72 completed May 22, 2026, 9:55 a.m.
NED2 Entity disambiguation (via description) batch_6a102955a7548190b17a2240f080e5ca completed May 22, 2026, 10 a.m.
Created at: April 18, 2026, 4:50 a.m.