Triple

T17661149
Position Surface form Disambiguated ID Type / Status
Subject Bailey lemma E440253 entity
Predicate relatedTo P37 FINISHED
Object Andrews–Gordon identities 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: Andrews–Gordon identities | Statement: [Bailey lemma, relatedTo, Andrews–Gordon identities]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Andrews–Gordon identities
Context triple: [Bailey lemma, relatedTo, Andrews–Gordon identities]
  • A. Rogers–Ramanujan-type identities chosen
    Rogers–Ramanujan-type identities are a class of deep q-series and partition identities generalizing the classical Rogers–Ramanujan identities, with rich connections to combinatorics, number theory, and modular forms.
  • B. Macdonald polynomials
    Macdonald polynomials are a family of orthogonal symmetric functions depending on two parameters that generalize several classical symmetric polynomials, such as Schur and Jack polynomials, and play a central role in algebraic combinatorics and representation theory.
  • C. Jack polynomials
    Jack polynomials are a family of symmetric polynomials depending on a continuous parameter that generalize several classical symmetric functions and play a key role in algebraic combinatorics, representation theory, and mathematical physics.
  • D. Gelfand–Tsetlin algebra
    The Gelfand–Tsetlin algebra is a commutative subalgebra of the universal enveloping algebra of a Lie algebra that acts diagonally in the Gelfand–Tsetlin basis and plays a central role in the explicit description of representations.
  • E. Gelfand–Tsetlin basis
    The Gelfand–Tsetlin basis is a canonical, combinatorially defined basis for representations of certain Lie algebras and groups, particularly used in the representation theory of GL(n) and related structures.
  • 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_69d8b9e87e18819087104a44dc4dc5b1 completed April 10, 2026, 8:50 a.m.
NER Named-entity recognition batch_69e46ea67f8081909da164ca21a98675 completed April 19, 2026, 5:56 a.m.
Created at: April 10, 2026, 9:43 a.m.