Triple
T24806758
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Rellich–Kondrachov compactness theorem |
E620675
|
entity |
| Predicate | ensures |
P2194
|
FINISHED |
| Object | precompactness of bounded sets in certain Sobolev spaces |
—
|
LITERAL FINISHED |
How this triple was built (1 step)
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: precompactness of bounded sets in certain Sobolev spaces | Statement: [Rellich–Kondrachov compactness theorem, ensures, precompactness of bounded sets in certain Sobolev spaces]
Provenance (2 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. |
Created at: April 18, 2026, 4:50 a.m.