Triple
T7011066
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Richard Dedekind |
E162579
|
entity |
| Predicate | hasConceptNamedAfter |
P3325
|
FINISHED |
| Object |
Dedekind number
A Dedekind number is the count of distinct monotone Boolean functions (or equivalently, antichains) on an n-element set, forming a rapidly growing sequence studied in combinatorics and lattice theory.
|
E634841
|
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: Dedekind number | Statement: [Richard Dedekind, hasConceptNamedAfter, Dedekind number]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Dedekind number Context triple: [Richard Dedekind, hasConceptNamedAfter, Dedekind number]
-
A.
Bell numbers
Bell numbers are a sequence in combinatorics that count the number of ways to partition a finite set into nonempty, unlabeled subsets.
-
B.
Sperner family
A Sperner family is a collection of subsets of a finite set in which no subset is contained within another, central in extremal set theory and combinatorics.
-
C.
Bernoulli numbers
Bernoulli numbers are a sequence of rational numbers that play a central role in number theory and analysis, especially in formulas for sums of powers of integers and in the study of special functions like the Riemann zeta function.
-
D.
Erdős–Kac theorem
The Erdős–Kac theorem is a fundamental result in probabilistic number theory stating that the number of distinct prime factors of a typical integer behaves like a normally distributed random variable.
-
E.
Catalan numbers
Catalan numbers are a sequence of natural numbers that count a wide variety of combinatorial structures, such as correctly matched parentheses, binary tree shapes, and lattice path configurations.
- 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: Dedekind number Triple: [Richard Dedekind, hasConceptNamedAfter, Dedekind number]
Generated description
A Dedekind number is the count of distinct monotone Boolean functions (or equivalently, antichains) on an n-element set, forming a rapidly growing sequence studied in combinatorics and lattice theory.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Dedekind number Target entity description: A Dedekind number is the count of distinct monotone Boolean functions (or equivalently, antichains) on an n-element set, forming a rapidly growing sequence studied in combinatorics and lattice theory.
-
A.
Bell numbers
Bell numbers are a sequence in combinatorics that count the number of ways to partition a finite set into nonempty, unlabeled subsets.
-
B.
Sperner family
A Sperner family is a collection of subsets of a finite set in which no subset is contained within another, central in extremal set theory and combinatorics.
-
C.
Bernoulli numbers
Bernoulli numbers are a sequence of rational numbers that play a central role in number theory and analysis, especially in formulas for sums of powers of integers and in the study of special functions like the Riemann zeta function.
-
D.
Erdős–Kac theorem
The Erdős–Kac theorem is a fundamental result in probabilistic number theory stating that the number of distinct prime factors of a typical integer behaves like a normally distributed random variable.
-
E.
Catalan numbers
Catalan numbers are a sequence of natural numbers that count a wide variety of combinatorial structures, such as correctly matched parentheses, binary tree shapes, and lattice path configurations.
- 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_69c6885a127c8190867b059bdccf13ff |
completed | March 27, 2026, 1:38 p.m. |
| NER | Named-entity recognition | batch_69c6dc5729448190af66dbd6f3e8936e |
completed | March 27, 2026, 7:36 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69c76a4bd424819097e1543ec59979ff |
completed | March 28, 2026, 5:42 a.m. |
| NEDg | Description generation | batch_69c76b1ef6f481908f4c4f610328f633 |
completed | March 28, 2026, 5:46 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69c76c01679c8190b61f642c23c25ed5 |
completed | March 28, 2026, 5:49 a.m. |
Created at: March 27, 2026, 2:34 p.m.