Triple
T25097522
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | double exponential distribution |
E628629
|
entity |
| Predicate | isSubexponential |
P157644
|
FINISHED |
| Object | false |
—
|
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: false | Statement: [double exponential distribution, isSubexponential, false]
PD
Predicate disambiguation
gpt-5-mini-2025-08-07
Target predicate: isSubexponential Context triple: [double exponential distribution, isSubexponential, false]
-
A.
hasExponentialFactor
Indicates that one entity serves as an exponential factor or exponent applied to another entity in a mathematical or computational expression.
-
B.
isExponentialDistribution
Indicates that a given random variable or dataset follows an exponential probability distribution, typically characterized by a constant hazard rate and memoryless property.
-
C.
isUnconditionalPolynomialTime
Indicates that an algorithm or computation runs in polynomial time without relying on any unproven assumptions or conjectures.
-
D.
hasPolynomialTimeAlgorithm
Indicates that there exists an algorithm for the given problem or task whose running time is bounded by a polynomial function of the size of its input.
-
E.
isLogarithmicallyConvexOn
Indicates that a function defined on a given domain has a logarithm that is convex, meaning the log of the function lies below or on every chord between any two points in that domain.
- F. None of above. chosen
Provenance (4 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_69e2ff3071548190b62d1ac237397197 |
completed | April 18, 2026, 3:49 a.m. |
| NER | Named-entity recognition | batch_69f464ba4e148190a8169ac91b2f85b6 |
completed | May 1, 2026, 8:30 a.m. |
| PD | Predicate disambiguation | batch_69f442c861188190967655c6d8012380 |
completed | May 1, 2026, 6:06 a.m. |
| PDg | Predicate description generation | batch_69f448fe11f08190bdd53ca7ba2d51e4 |
completed | May 1, 2026, 6:32 a.m. |
Created at: April 18, 2026, 6:25 a.m.