Triple

T18282753
Position Surface form Disambiguated ID Type / Status
Subject David Bressoud E437902 entity
Predicate notableWork P4 FINISHED
Object Proofs and Confirmations: The Story of the Alternating Sign Matrix Conjecture
"Proofs and Confirmations: The Story of the Alternating Sign Matrix Conjecture" is a mathematical monograph by David Bressoud that explores the history, ideas, and eventual proof of the alternating sign matrix conjecture, illustrating how modern combinatorics and proof techniques develop in practice.
E1316088 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: Proofs and Confirmations: The Story of the Alternating Sign Matrix Conjecture | Statement: [David Bressoud, notableWork, Proofs and Confirmations: The Story of the Alternating Sign Matrix Conjecture]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Proofs and Confirmations: The Story of the Alternating Sign Matrix Conjecture
Context triple: [David Bressoud, notableWork, Proofs and Confirmations: The Story of the Alternating Sign Matrix Conjecture]
  • A. Sylvester’s theorem on partitions
    Sylvester’s theorem on partitions is a result in number theory that provides a systematic way to count integer partitions subject to certain congruence or restriction conditions, forming part of the foundational work in partition theory.
  • B. Alon–Tarsi conjecture
    The Alon–Tarsi conjecture is a prominent open problem in combinatorics and graph theory concerning orientations and colorings of graphs, with deep connections to Latin squares and polynomial method techniques.
  • C. Rogers–Ramanujan identities
    The Rogers–Ramanujan identities are two famous q-series equalities in number theory and combinatorics that relate infinite series to infinite products and have deep connections to partition theory and modular forms.
  • D. Foundations of Combinatorial Theory
    Foundations of Combinatorial Theory is a seminal mathematical work by Gian-Carlo Rota that helped establish modern combinatorics as a rigorous and unified field of study.
  • E. Fellini–Rota collaborations
    The Fellini–Rota collaborations are the celebrated series of film projects in which Italian director Federico Fellini worked closely with composer Nino Rota to create some of the most iconic and influential soundtracks in cinema history.
  • 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: Proofs and Confirmations: The Story of the Alternating Sign Matrix Conjecture
Triple: [David Bressoud, notableWork, Proofs and Confirmations: The Story of the Alternating Sign Matrix Conjecture]
Generated description
"Proofs and Confirmations: The Story of the Alternating Sign Matrix Conjecture" is a mathematical monograph by David Bressoud that explores the history, ideas, and eventual proof of the alternating sign matrix conjecture, illustrating how modern combinatorics and proof techniques develop in practice.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Proofs and Confirmations: The Story of the Alternating Sign Matrix Conjecture
Target entity description: "Proofs and Confirmations: The Story of the Alternating Sign Matrix Conjecture" is a mathematical monograph by David Bressoud that explores the history, ideas, and eventual proof of the alternating sign matrix conjecture, illustrating how modern combinatorics and proof techniques develop in practice.
  • A. Sylvester’s theorem on partitions
    Sylvester’s theorem on partitions is a result in number theory that provides a systematic way to count integer partitions subject to certain congruence or restriction conditions, forming part of the foundational work in partition theory.
  • B. Alon–Tarsi conjecture
    The Alon–Tarsi conjecture is a prominent open problem in combinatorics and graph theory concerning orientations and colorings of graphs, with deep connections to Latin squares and polynomial method techniques.
  • C. Rogers–Ramanujan identities
    The Rogers–Ramanujan identities are two famous q-series equalities in number theory and combinatorics that relate infinite series to infinite products and have deep connections to partition theory and modular forms.
  • D. Foundations of Combinatorial Theory
    Foundations of Combinatorial Theory is a seminal mathematical work by Gian-Carlo Rota that helped establish modern combinatorics as a rigorous and unified field of study.
  • E. Fellini–Rota collaborations
    The Fellini–Rota collaborations are the celebrated series of film projects in which Italian director Federico Fellini worked closely with composer Nino Rota to create some of the most iconic and influential soundtracks in cinema history.
  • 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_69d8b914530c8190b4474d862a2b2a1b completed April 10, 2026, 8:47 a.m.
NER Named-entity recognition batch_69e50057c5c881909fcda72f4a98c8c3 completed April 19, 2026, 4:18 p.m.
NED1 Entity disambiguation (via context triple) batch_6a03b4029cb88190963ae33570455c2d completed May 12, 2026, 11:13 p.m.
NEDg Description generation batch_6a03b501b630819094c77aebf62081a2 completed May 12, 2026, 11:17 p.m.
NED2 Entity disambiguation (via description) batch_6a03b5c09f4881909fb0ead5fc48895c completed May 12, 2026, 11:20 p.m.
Created at: April 10, 2026, 10:35 a.m.