Triple
T4681196
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Nikolay Bogolyubov |
E103805
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object |
Bogoliubov–Parasyuk theorem
The Bogoliubov–Parasyuk theorem is a fundamental result in quantum field theory that rigorously establishes a systematic procedure for renormalizing divergent Feynman diagrams.
|
E461418
|
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: Bogoliubov–Parasyuk theorem | Statement: [Nikolay Bogolyubov, notableWork, Bogoliubov–Parasyuk theorem]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Bogoliubov–Parasyuk theorem Context triple: [Nikolay Bogolyubov, notableWork, Bogoliubov–Parasyuk theorem]
-
A.
Gell-Mann–Low theorem
The Gell-Mann–Low theorem is a fundamental result in quantum field theory that rigorously connects interacting quantum fields to free fields via the adiabatic switching-on of interactions, underpinning the use of perturbation theory and the Dyson series.
-
B.
Faddeev’s axioms
Faddeev’s axioms are a set of conditions characterizing Shannon entropy in information theory, providing an alternative but equivalent axiomatization to the Shannon–Khinchin framework.
-
C.
Wick’s theorem
Wick’s theorem is a fundamental result in quantum field theory that expresses time-ordered products of field operators as sums of normal-ordered products with all possible contractions, forming the basis for deriving Feynman rules and diagrammatic expansions.
-
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.
Feynman–Hellmann theorem
The Feynman–Hellmann theorem is a result in quantum mechanics that relates the derivative of an energy eigenvalue with respect to a parameter in the Hamiltonian to the expectation value of the corresponding derivative of the Hamiltonian.
- 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: Bogoliubov–Parasyuk theorem Triple: [Nikolay Bogolyubov, notableWork, Bogoliubov–Parasyuk theorem]
Generated description
The Bogoliubov–Parasyuk theorem is a fundamental result in quantum field theory that rigorously establishes a systematic procedure for renormalizing divergent Feynman diagrams.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Bogoliubov–Parasyuk theorem Target entity description: The Bogoliubov–Parasyuk theorem is a fundamental result in quantum field theory that rigorously establishes a systematic procedure for renormalizing divergent Feynman diagrams.
-
A.
Gell-Mann–Low theorem
The Gell-Mann–Low theorem is a fundamental result in quantum field theory that rigorously connects interacting quantum fields to free fields via the adiabatic switching-on of interactions, underpinning the use of perturbation theory and the Dyson series.
-
B.
Faddeev’s axioms
Faddeev’s axioms are a set of conditions characterizing Shannon entropy in information theory, providing an alternative but equivalent axiomatization to the Shannon–Khinchin framework.
-
C.
Wick’s theorem
Wick’s theorem is a fundamental result in quantum field theory that expresses time-ordered products of field operators as sums of normal-ordered products with all possible contractions, forming the basis for deriving Feynman rules and diagrammatic expansions.
-
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.
Feynman–Hellmann theorem
The Feynman–Hellmann theorem is a result in quantum mechanics that relates the derivative of an energy eigenvalue with respect to a parameter in the Hamiltonian to the expectation value of the corresponding derivative of the Hamiltonian.
- 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_69bd43debbf08190b4bc372e286ec234 |
completed | March 20, 2026, 12:55 p.m. |
| NER | Named-entity recognition | batch_69bd636d306081908ff512896f54cb10 |
completed | March 20, 2026, 3:10 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69be03ac44d481908ecb1fe84184a886 |
completed | March 21, 2026, 2:34 a.m. |
| NEDg | Description generation | batch_69be048d53d08190a72fb6d2e788e3c9 |
completed | March 21, 2026, 2:38 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69be0529868c8190b20e8966315b263a |
completed | March 21, 2026, 2:40 a.m. |
Created at: March 20, 2026, 1:16 p.m.