Triple
T736642
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Minkowski sum |
E14947
|
entity |
| Predicate | relatedConcept |
P37
|
FINISHED |
| Object | Minkowski functional |
E14948
|
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: Minkowski functional | Statement: [Minkowski sum, relatedConcept, Minkowski functional]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Minkowski functional Context triple: [Minkowski sum, relatedConcept, Minkowski functional]
-
A.
Minkowski functional
chosen
The Minkowski functional is a mathematical tool in functional analysis that assigns a nonnegative real number to each vector in a vector space based on its position relative to a given convex, balanced, absorbing set, generalizing the notion of a norm.
-
B.
Minkowski inequality
The Minkowski inequality is a fundamental result in functional analysis and measure theory that generalizes the triangle inequality to L^p spaces, providing a key tool for studying norms and integrable functions.
-
C.
Minkowski sum
The Minkowski sum is a fundamental operation in geometry and convex analysis that combines two sets by adding every vector in one set to every vector in the other, widely used in areas such as optimization, robotics, and computational geometry.
-
D.
Cameron–Martin theorem
The Cameron–Martin theorem is a fundamental result in probability theory and functional analysis that characterizes how Gaussian measures on infinite-dimensional spaces change under shifts by elements of a special Hilbert subspace (the Cameron–Martin space).
-
E.
Lebesgue integration
Lebesgue integration is a foundational measure-theoretic framework for defining and analyzing integrals, particularly suited to handling limits, convergence, and more general functions than those allowed by Riemann integration.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
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_69a4934d9930819099eed80096b0597d |
completed | March 1, 2026, 7:28 p.m. |
| NER | Named-entity recognition | batch_69a4a5da30b88190afbd12ae6109cc1b |
completed | March 1, 2026, 8:47 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69a64a618c248190ab1bcecba04d3da8 |
completed | March 3, 2026, 2:41 a.m. |
Created at: March 1, 2026, 7:37 p.m.