Triple
T4207185
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Gian-Carlo Rota |
E93810
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object |
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.
|
E421308
|
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: Foundations of Combinatorial Theory | Statement: [Gian-Carlo Rota, notableWork, Foundations of Combinatorial Theory]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Foundations of Combinatorial Theory Context triple: [Gian-Carlo Rota, notableWork, Foundations of Combinatorial Theory]
-
A.
enumerative combinatorics
Enumerative combinatorics is a branch of mathematics focused on counting and characterizing discrete structures, often using generating functions, bijections, and algebraic techniques.
-
B.
The Twelvefold Way
The Twelvefold Way is a framework in combinatorics that systematically classifies twelve fundamental ways of counting functions between finite sets under various labeling and structural constraints.
-
C.
A Combinatorial Problem
"A Combinatorial Problem" is a classic mathematical paper by N. G. de Bruijn that introduces and analyzes a fundamental counting problem in combinatorics.
-
D.
Concrete Mathematics
Concrete Mathematics is a widely respected textbook by Ronald Graham, Donald Knuth, and Oren Patashnik that blends continuous and discrete mathematics with an emphasis on problem-solving and rigorous analysis, especially for computer science applications.
-
E.
Rogers–Ramanujan-type identities
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.
- 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: Foundations of Combinatorial Theory Triple: [Gian-Carlo Rota, notableWork, Foundations of Combinatorial Theory]
Generated description
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.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Foundations of Combinatorial Theory Target entity description: 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.
-
A.
enumerative combinatorics
Enumerative combinatorics is a branch of mathematics focused on counting and characterizing discrete structures, often using generating functions, bijections, and algebraic techniques.
-
B.
The Twelvefold Way
The Twelvefold Way is a framework in combinatorics that systematically classifies twelve fundamental ways of counting functions between finite sets under various labeling and structural constraints.
-
C.
A Combinatorial Problem
"A Combinatorial Problem" is a classic mathematical paper by N. G. de Bruijn that introduces and analyzes a fundamental counting problem in combinatorics.
-
D.
Concrete Mathematics
Concrete Mathematics is a widely respected textbook by Ronald Graham, Donald Knuth, and Oren Patashnik that blends continuous and discrete mathematics with an emphasis on problem-solving and rigorous analysis, especially for computer science applications.
-
E.
Rogers–Ramanujan-type identities
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.
- 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_69b3451743608190808f41d17ccf2650 |
completed | March 12, 2026, 10:58 p.m. |
| NER | Named-entity recognition | batch_69b3480cfacc81909a2705eb4e9ce8c1 |
completed | March 12, 2026, 11:11 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69b59628da008190ae0e458ed3a5890b |
completed | March 14, 2026, 5:08 p.m. |
| NEDg | Description generation | batch_69b596b7330081908c66a5a756531ffd |
completed | March 14, 2026, 5:11 p.m. |
| NED2 | Entity disambiguation (via description) | batch_69b59762105481908e3534600486b82d |
completed | March 14, 2026, 5:14 p.m. |
Created at: March 12, 2026, 11:03 p.m.