Triple
T11098707
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Fano plane |
E262444
|
entity |
| Predicate | hasAssociatedMatroid |
P97258
|
FINISHED |
| Object |
Fano matroid
The Fano matroid is a fundamental rank-3 binary matroid derived from the Fano plane, notable as the smallest non-regular matroid and a key example in matroid theory.
|
E262444
|
NE FINISHED |
How this triple was built (5 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: Fano matroid | Statement: [Fano plane, hasAssociatedMatroid, Fano matroid]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Fano matroid Context triple: [Fano plane, hasAssociatedMatroid, Fano matroid]
-
A.
Fano plane
The Fano plane is the smallest finite projective plane, consisting of seven points and seven lines with rich symmetrical and combinatorial properties.
-
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.
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.
-
D.
Erdős–Ko–Rado theorem
The Erdős–Ko–Rado theorem is a fundamental result in extremal combinatorics that determines the maximum size of a family of subsets of a finite set in which every pair of subsets has a non-empty intersection.
-
E.
Birkhoff–von Neumann theorem
The Birkhoff–von Neumann theorem is a fundamental result in matrix theory and combinatorics stating that every doubly stochastic matrix can be expressed as a convex combination of permutation matrices.
- 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: Fano matroid Triple: [Fano plane, hasAssociatedMatroid, Fano matroid]
Generated description
The Fano matroid is a fundamental rank-3 binary matroid derived from the Fano plane, notable as the smallest non-regular matroid and a key example in matroid theory.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Fano matroid Target entity description: The Fano matroid is a fundamental rank-3 binary matroid derived from the Fano plane, notable as the smallest non-regular matroid and a key example in matroid theory.
-
A.
Fano plane
chosen
The Fano plane is the smallest finite projective plane, consisting of seven points and seven lines with rich symmetrical and combinatorial properties.
-
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.
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.
-
D.
Erdős–Ko–Rado theorem
The Erdős–Ko–Rado theorem is a fundamental result in extremal combinatorics that determines the maximum size of a family of subsets of a finite set in which every pair of subsets has a non-empty intersection.
-
E.
Birkhoff–von Neumann theorem
The Birkhoff–von Neumann theorem is a fundamental result in matrix theory and combinatorics stating that every doubly stochastic matrix can be expressed as a convex combination of permutation matrices.
- F. None of above.
PD
Predicate disambiguation
gpt-5-mini-2025-08-07
Target predicate: hasAssociatedMatroid Context triple: [Fano plane, hasAssociatedMatroid, Fano matroid]
-
A.
hasAssociatedPolynomial
Indicates that one entity is linked to another entity that serves as its associated polynomial, typically representing or characterizing some of its properties or behavior.
-
B.
hasBasisIn
Indicates that one entity is founded, derived, or justified on the grounds of another entity.
-
C.
isAssociative
Indicates that the grouping of operands does not affect the result of the operation (i.e., (a * b) * c = a * (b * c)).
-
D.
hasHomomorphism
Indicates that there exists a structure-preserving map (homomorphism) from one mathematical structure to another.
-
E.
hasCombinatorialNature
Indicates that something possesses properties or behavior fundamentally based on combinations, arrangements, or discrete configurations of elements.
- F. None of above. chosen
Provenance (7 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_69d6aa9a40d88190a373e2c7e48285db |
completed | April 8, 2026, 7:20 p.m. |
| NER | Named-entity recognition | batch_69d79a0c46308190889b94c23ebaca62 |
completed | April 9, 2026, 12:22 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69e3e7eca9bc8190b43bae081d97d804 |
completed | April 18, 2026, 8:22 p.m. |
| NEDg | Description generation | batch_69e3f2cbb4708190a328cff473104d14 |
completed | April 18, 2026, 9:08 p.m. |
| NED2 | Entity disambiguation (via description) | batch_69e3f497a01881909d1dae70a02e5f97 |
completed | April 18, 2026, 9:16 p.m. |
| PD | Predicate disambiguation | batch_69d7441aa3548190b92dbde57841c135 |
completed | April 9, 2026, 6:15 a.m. |
| PDg | Predicate description generation | batch_69d750ca52ec8190a559432a5de106fd |
completed | April 9, 2026, 7:10 a.m. |
Created at: April 8, 2026, 9:27 p.m.