Triple

T21712457
Position Surface form Disambiguated ID Type / Status
Subject second fundamental theorem of welfare economics E535938 entity
Predicate mathematicalTool P12675 FINISHED
Object separating hyperplane theorem NE NERFINISHED

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: separating hyperplane theorem | Statement: [second fundamental theorem of welfare economics, mathematicalTool, separating hyperplane theorem]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: separating hyperplane theorem
Context triple: [second fundamental theorem of welfare economics, mathematicalTool, separating hyperplane theorem]
  • A. Vapnik–Chervonenkis theory
    Vapnik–Chervonenkis theory is a foundational framework in statistical learning that characterizes the capacity and generalization ability of learning algorithms through concepts like VC dimension.
  • B. Fisher's linear discriminant
    Fisher's linear discriminant is a classic statistical technique for dimensionality reduction and classification that projects data onto a line to maximize separation between classes.
  • C. Support Vector Machines
    Support Vector Machines are a class of supervised learning algorithms used primarily for classification and regression tasks, which work by finding the optimal separating hyperplane between data classes in a high-dimensional feature space.
  • D. Hahn–Banach theorem chosen
    The Hahn–Banach theorem is a fundamental result in functional analysis that guarantees the extension of bounded linear functionals from a subspace to the whole space without increasing their norm.
  • E. Slater’s condition
    Slater’s condition is a regularity condition in convex optimization that guarantees strong duality and the validity of the Karush–Kuhn–Tucker optimality conditions by requiring the existence of a strictly feasible point.
  • F. None of above.
  • G. Unsure - the case is ambiguous/there is not enough information to decide.

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_69e0c46c6dd88190a595375fa6ebd701 completed April 16, 2026, 11:13 a.m.
NER Named-entity recognition batch_69efb53573a08190ad73576d27e8094f completed April 27, 2026, 7:12 p.m.
Created at: April 16, 2026, 6:46 p.m.