Triple
T9838899
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | de Bruijn–van Aardenne–Ehrenfest theorem |
E239170
|
entity |
| Predicate | relatedTo |
P37
|
FINISHED |
| Object | de Bruijn sequence |
E239166
|
NE FINISHED |
How this triple was built (2 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: de Bruijn sequence | Statement: [de Bruijn–van Aardenne–Ehrenfest theorem, relatedTo, de Bruijn sequence]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: de Bruijn sequence Context triple: [de Bruijn–van Aardenne–Ehrenfest theorem, relatedTo, de Bruijn sequence]
-
A.
de Bruijn sequence
chosen
A de Bruijn sequence is a cyclic sequence over a given alphabet in which every possible subsequence of a fixed length appears exactly once.
-
B.
Look-and-say sequence
The look-and-say sequence is a famous integer sequence where each term is generated by verbally describing the digits of the previous term, studied for its surprising combinatorial and growth properties.
-
C.
de Bruijn graph
A de Bruijn graph is a directed graph structure that compactly represents overlaps between sequences of symbols, widely used in combinatorics, coding theory, and genome assembly algorithms.
-
D.
de Bruijn–van Aardenne–Ehrenfest theorem
The de Bruijn–van Aardenne–Ehrenfest theorem is a fundamental result in combinatorics that characterizes the number of Eulerian circuits in directed graphs, particularly de Bruijn graphs, and underpins constructions in coding theory and discrete mathematics.
-
E.
Berlekamp–Massey algorithm
The Berlekamp–Massey algorithm is a key algorithm in coding theory and cryptography used to efficiently determine the shortest linear feedback shift register that generates a given binary sequence.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Provenance (3 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_69ca84e314108190978324a4bdb959f8 |
completed | March 30, 2026, 2:12 p.m. |
| NER | Named-entity recognition | batch_69cdb34921b881909836ba0f5b42a27b |
completed | April 2, 2026, 12:07 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69d1ead061388190abbed7eb29e8ea52 |
completed | April 5, 2026, 4:53 a.m. |
Created at: March 30, 2026, 8:33 p.m.