Triple
T6397174
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Page curve |
E143968
|
entity |
| Predicate | relatedTo |
P37
|
FINISHED |
| Object |
Page theorem
The Page theorem is a result in quantum information theory and black hole physics that predicts how the entanglement entropy of a subsystem typically evolves, underpinning the characteristic "Page curve" behavior in discussions of the black hole information paradox.
|
E590896
|
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: Page theorem | Statement: [Page curve, relatedTo, Page theorem]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Page theorem Context triple: [Page curve, relatedTo, Page theorem]
-
A.
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.
-
B.
Teorema
Teorema is a 1968 Italian art-house drama film directed by Pier Paolo Pasolini, known for its enigmatic, allegorical exploration of sexuality, faith, and bourgeois emptiness.
-
C.
Szekeres–Lindström theorem
The Szekeres–Lindström theorem is a result in combinatorics that characterizes the maximum size of intersecting families of subsets, serving as a precursor to and special case of the Erdős–Ko–Rado theorem.
-
D.
Euler’s theorem
Euler’s theorem is a fundamental result in number theory stating that for any integer a coprime to n, a raised to the power of φ(n) is congruent to 1 modulo n.
-
E.
Eliassen–Palm theorem
The Eliassen–Palm theorem is a fundamental result in atmospheric dynamics that relates wave activity and mean-flow interaction, providing a framework for understanding how atmospheric waves transport momentum and energy.
- 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: Page theorem Triple: [Page curve, relatedTo, Page theorem]
Generated description
The Page theorem is a result in quantum information theory and black hole physics that predicts how the entanglement entropy of a subsystem typically evolves, underpinning the characteristic "Page curve" behavior in discussions of the black hole information paradox.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Page theorem Target entity description: The Page theorem is a result in quantum information theory and black hole physics that predicts how the entanglement entropy of a subsystem typically evolves, underpinning the characteristic "Page curve" behavior in discussions of the black hole information paradox.
-
A.
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.
-
B.
Teorema
Teorema is a 1968 Italian art-house drama film directed by Pier Paolo Pasolini, known for its enigmatic, allegorical exploration of sexuality, faith, and bourgeois emptiness.
-
C.
Szekeres–Lindström theorem
The Szekeres–Lindström theorem is a result in combinatorics that characterizes the maximum size of intersecting families of subsets, serving as a precursor to and special case of the Erdős–Ko–Rado theorem.
-
D.
Euler’s theorem
Euler’s theorem is a fundamental result in number theory stating that for any integer a coprime to n, a raised to the power of φ(n) is congruent to 1 modulo n.
-
E.
Eliassen–Palm theorem
The Eliassen–Palm theorem is a fundamental result in atmospheric dynamics that relates wave activity and mean-flow interaction, providing a framework for understanding how atmospheric waves transport momentum and energy.
- 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_69c008db906c819096f3597d55d95432 |
completed | March 22, 2026, 3:20 p.m. |
| NER | Named-entity recognition | batch_69c06896d180819091548a728e903184 |
completed | March 22, 2026, 10:09 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69c6389bd9f48190af9811cf8cee124e |
completed | March 27, 2026, 7:58 a.m. |
| NEDg | Description generation | batch_69c63beaa5408190b4421f49634f3df1 |
completed | March 27, 2026, 8:12 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69c63c5f7d508190bd263822cea1b782 |
completed | March 27, 2026, 8:14 a.m. |
Created at: March 22, 2026, 4:35 p.m.