Triple
T9838808
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | de Bruijn–Newman constant |
E239168
|
entity |
| Predicate | knownLowerBound |
P17139
|
FINISHED |
| Object | Λ ≥ 0 |
—
|
LITERAL 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: Λ ≥ 0 | Statement: [de Bruijn–Newman constant, knownLowerBound, Λ ≥ 0]
PD
Predicate disambiguation
gpt-5-mini-2025-08-07
Target predicate: knownLowerBound Context triple: [de Bruijn–Newman constant, knownLowerBound, Λ ≥ 0]
-
A.
isBoundedBelow
Indicates that every value in a set or function is greater than or equal to some fixed lower bound.
-
B.
hasLowerBoundaryDefinedBy
Indicates that one entity’s lower limit, edge, or boundary is specified or determined by another entity.
-
C.
lowerLimit
chosen
Indicates that one value serves as the minimum or smallest allowable bound or threshold for another value or range.
-
D.
isUpperBoundFor
Indicates that one value is greater than or equal to every element in a given set or collection, serving as an upper limit for them.
-
E.
boundedByApprox
Indicates that one quantity is constrained by another within an approximate or tolerance-based bound, rather than an exact strict limit.
- F. None of above.
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_69ca84e314108190978324a4bdb959f8 |
completed | March 30, 2026, 2:12 p.m. |
| NER | Named-entity recognition | batch_69cdb34921b881909836ba0f5b42a27b |
completed | April 2, 2026, 12:07 a.m. |
| PD | Predicate disambiguation | batch_69cd03e30bc08190816c0a6d29c21b0f |
completed | April 1, 2026, 11:39 a.m. |
Created at: March 30, 2026, 8:33 p.m.