Triple
T15977100
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Cauchy functional equation |
E387476
|
entity |
| Predicate | hasPathologicalSolutions |
P121124
|
FINISHED |
| Object | non-measurable additive functions |
—
|
LITERAL FINISHED |
Named-entity recognition
Before disambiguation, gpt-5-mini classified whether the object phrase is a named entity — the step behind the object's LITERAL type shown above.
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: non-measurable additive functions | Statement: [Cauchy functional equation, hasPathologicalSolutions, non-measurable additive functions]
Disambiguation candidates (1 decision)
The exact options the model was shown at each disambiguation step, with the option it chose highlighted — the evidence behind this triple's disambiguated ids.
PD
Predicate disambiguation
gpt-5-mini-2025-08-07
Target predicate: hasPathologicalSolutions Context triple: [Cauchy functional equation, hasPathologicalSolutions, non-measurable additive functions]
-
A.
admitsSolution
Indicates that a problem, system, or situation allows for or possesses at least one valid solution.
-
B.
hasFiniteNumberOfSolutions
Indicates that the related equation, system, or problem has only a limited, countable set of distinct solutions, rather than infinitely many or none.
-
C.
requiresSolvingAlgebraicEquations
Indicates that performing or completing an action depends on solving algebraic equations.
-
D.
isSolutionOf
Indicates that one entity is a correct answer or satisfies the conditions of a given problem, equation, or task.
-
E.
isExactlySolvable
Indicates that a problem, model, or equation can be solved completely and exactly (without approximation) using known analytical or algorithmic methods.
- F. None of above. chosen
Provenance (4 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69d86da94ccc819083d187f5dc6a123e |
elicitation | completed |
| NER | batch_69e17d4d08f481909f38b75e3f42d9ab |
ner | completed |
| PD | batch_69e142d9d8e881909b559a3e3ca21d24 |
pd | completed |
| PDg | batch_69e17d48cc9c8190b03fd07ae2e9dfd8 |
pdg | completed |
Created at: April 10, 2026, 4:54 a.m.