Triple

T10803780
Position Surface form Disambiguated ID Type / Status
Subject Raj Chandra Bose E254909 entity
Predicate notableWork P4 FINISHED
Object Bose–Mesner algebra
The Bose–Mesner algebra is a commutative matrix algebra arising from association schemes in algebraic combinatorics, fundamental for studying symmetric relations and distance-regular graphs.
E886600 NE FINISHED

How this triple was built (4 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: Bose–Mesner algebra | Statement: [Raj Chandra Bose, notableWork, Bose–Mesner algebra]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Bose–Mesner algebra
Context triple: [Raj Chandra Bose, notableWork, Bose–Mesner algebra]
  • A. Racah algebra
    Racah algebra is a mathematical structure in representation theory and quantum mechanics that encodes the symmetries and coupling properties of angular momenta, particularly through Racah coefficients and related special functions.
  • B. Schur–Weyl duality
    Schur–Weyl duality is a fundamental result in representation theory that links representations of the symmetric group and the general linear group via their commuting actions on tensor powers of a vector space.
  • C. Hadamard matrices
    Hadamard matrices are square matrices with entries ±1 whose rows are mutually orthogonal, playing a key role in combinatorics, coding theory, and signal processing.
  • D. Pólya enumeration theorem
    The Pólya enumeration theorem is a fundamental result in combinatorics that counts distinct configurations of objects under group actions by using cycle index polynomials and generating functions.
  • E. Graham–Pollak theorem
    The Graham–Pollak theorem is a result in graph theory that states the edges of a complete graph on n vertices cannot be partitioned into fewer than n−1 complete bipartite subgraphs.
  • F. None of above. chosen
  • G. Unsure - the case is ambiguous/there is not enough information to decide.
NEDg Description generation gpt-5.1
Instruction
Generate a one-sentence description of the target entity. 
You are given a context triple in the form (subject, predicate, object), where the object is the target entity. 
# Instructions
Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. 
Avoid repeating the information from the triple, unless really essential.
# Response Format
Return only the sentence: "Description: [one-sentence description of the target entity]"
Input
Entity: Bose–Mesner algebra
Triple: [Raj Chandra Bose, notableWork, Bose–Mesner algebra]
Generated description
The Bose–Mesner algebra is a commutative matrix algebra arising from association schemes in algebraic combinatorics, fundamental for studying symmetric relations and distance-regular graphs.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Bose–Mesner algebra
Target entity description: The Bose–Mesner algebra is a commutative matrix algebra arising from association schemes in algebraic combinatorics, fundamental for studying symmetric relations and distance-regular graphs.
  • A. Racah algebra
    Racah algebra is a mathematical structure in representation theory and quantum mechanics that encodes the symmetries and coupling properties of angular momenta, particularly through Racah coefficients and related special functions.
  • B. Schur–Weyl duality
    Schur–Weyl duality is a fundamental result in representation theory that links representations of the symmetric group and the general linear group via their commuting actions on tensor powers of a vector space.
  • C. Hadamard matrices
    Hadamard matrices are square matrices with entries ±1 whose rows are mutually orthogonal, playing a key role in combinatorics, coding theory, and signal processing.
  • D. Pólya enumeration theorem
    The Pólya enumeration theorem is a fundamental result in combinatorics that counts distinct configurations of objects under group actions by using cycle index polynomials and generating functions.
  • E. Graham–Pollak theorem
    The Graham–Pollak theorem is a result in graph theory that states the edges of a complete graph on n vertices cannot be partitioned into fewer than n−1 complete bipartite subgraphs.
  • F. None of above. chosen

Provenance (5 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_69d6aa61c15c8190a1839550c56e75e1 completed April 8, 2026, 7:20 p.m.
NER Named-entity recognition batch_69d73370e7388190885b104fc883456e completed April 9, 2026, 5:04 a.m.
NED1 Entity disambiguation (via context triple) batch_69de567a7ea0819088a2fa10f8367d89 completed April 14, 2026, 3 p.m.
NEDg Description generation batch_69de5eaf3cc08190935cb6ddf2020166 completed April 14, 2026, 3:35 p.m.
NED2 Entity disambiguation (via description) batch_69de63a902f4819089845bc6d7469c6b completed April 14, 2026, 3:56 p.m.
Created at: April 8, 2026, 9:18 p.m.