Triple

T14334250
Position Surface form Disambiguated ID Type / Status
Subject manuscripts of Isaac Newton E355429 entity
Predicate containsWorkOn P44667 FINISHED
Object binomial theorem E4686 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: binomial theorem | Statement: [manuscripts of Isaac Newton, containsWorkOn, binomial theorem]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: binomial theorem
Context triple: [manuscripts of Isaac Newton, containsWorkOn, binomial theorem]
  • A. binomial theorem chosen
    The binomial theorem is a fundamental algebraic formula that provides a systematic way to expand powers of binomial expressions, playing a key role in combinatorics and mathematical analysis.
  • B. multinomial theorem
    The multinomial theorem is a fundamental algebraic formula that generalizes the binomial theorem to express powers of sums with any number of terms using multinomial coefficients.
  • C. generalized binomial theorem
    The generalized binomial theorem extends the classical binomial theorem by allowing real or complex exponents, expressing powers of a binomial as an infinite series using generalized binomial coefficients.
  • D. Pascal's triangle
    Pascal's triangle is a triangular array of numbers in which each entry is the sum of the two directly above it, widely used in combinatorics, algebra, and probability.
  • E. Vandermonde's identity
    Vandermonde's identity is a fundamental combinatorial formula that expresses a binomial coefficient with a sum index as a sum of products of binomial coefficients, often visualized via counting arguments or generating functions.
  • 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_69d8278fa2108190bc0d0e7939c1eb03 completed April 9, 2026, 10:26 p.m.
NER Named-entity recognition batch_69de8c20d2148190bb534bef338e871d completed April 14, 2026, 6:49 p.m.
NED1 Entity disambiguation (via context triple) batch_69fd469634688190980df59ee482b792 completed May 8, 2026, 2:12 a.m.
Created at: April 10, 2026, 1:13 a.m.