Triple

T33320267
Position Surface form Disambiguated ID Type / Status
Subject Stiefel–Whitney classes E853116 entity
Predicate additivity P4232 FINISHED
Object w(E ⊕ F) = w(E) ∪ w(F) 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: w(E ⊕ F) = w(E) ∪ w(F) | Statement: [Stiefel–Whitney classes, additivity, w(E ⊕ F) = w(E) ∪ w(F)]
PD Predicate disambiguation gpt-5-mini-2025-08-07
Target predicate: additivity
Context triple: [Stiefel–Whitney classes, additivity, w(E ⊕ F) = w(E) ∪ w(F)]
  • A. isAdditiveFor chosen
    Indicates that one entity can be combined with another in a way that their effects or quantities sum together to produce a cumulative result.
  • B. additiveNotation
    Indicates that something is expressed or represented using addition-based mathematical notation (e.g., using “+” and sums) rather than another form of representation.
  • C. nonAdditivityNote
    Indicates that there is a note explaining that the combined effect of multiple factors is not simply the sum of their individual effects.
  • D. isAdditivelyIndecomposable
    Indicates that an entity (typically an ordinal or algebraic object) cannot be expressed as a nontrivial sum of two smaller entities of the same kind.
  • E. isCountablyAdditive
    Indicates that a measure or function preserves additivity over countable collections, meaning the value on a countable union of disjoint sets equals the sum of its values on each set.
  • 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_69f349685f088190b8fda44083a018a9 completed April 30, 2026, 12:22 p.m.
NER Named-entity recognition batch_69f6f38159d08190980ad639e08f00f4 completed May 3, 2026, 7:04 a.m.
PD Predicate disambiguation batch_69f6e3d7bee48190b94e0beb48a1d7fa completed May 3, 2026, 5:57 a.m.
Created at: May 1, 2026, 1:33 a.m.