Triple
T8672501
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Monte Carlo tree search |
E205830
|
entity |
| Predicate | relatedTo |
P37
|
FINISHED |
| Object |
alpha–beta pruning
Alpha–beta pruning is a search algorithm optimization that reduces the number of nodes evaluated in minimax-based game tree searches by eliminating branches that cannot affect the final decision.
|
E748469
|
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: alpha–beta pruning | Statement: [Monte Carlo tree search, relatedTo, alpha–beta pruning]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: alpha–beta pruning Context triple: [Monte Carlo tree search, relatedTo, alpha–beta pruning]
-
A.
Monte Carlo tree search
Monte Carlo tree search is a heuristic search algorithm that uses random sampling of game states to build and explore a search tree, enabling strong decision-making in complex domains like Go and other board games.
-
B.
Davis–Putnam algorithm
The Davis–Putnam algorithm is a pioneering procedure in automated theorem proving and propositional logic satisfiability that laid foundational groundwork for modern SAT solvers.
-
C.
Generalized Search Tree
Generalized Search Tree is a flexible, balanced tree data structure framework that supports building custom index types for complex data and queries, often used in database systems.
-
D.
AlphaZero
AlphaZero is a DeepMind-developed artificial intelligence system that mastered complex games like chess, shogi, and Go through self-play reinforcement learning without human-crafted strategies.
-
E.
Benettin algorithm
The Benettin algorithm is a numerical method used in dynamical systems theory to estimate Lyapunov exponents, which quantify the rate of separation of nearby trajectories and indicate chaos.
- 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: alpha–beta pruning Triple: [Monte Carlo tree search, relatedTo, alpha–beta pruning]
Generated description
Alpha–beta pruning is a search algorithm optimization that reduces the number of nodes evaluated in minimax-based game tree searches by eliminating branches that cannot affect the final decision.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: alpha–beta pruning Target entity description: Alpha–beta pruning is a search algorithm optimization that reduces the number of nodes evaluated in minimax-based game tree searches by eliminating branches that cannot affect the final decision.
-
A.
Monte Carlo tree search
Monte Carlo tree search is a heuristic search algorithm that uses random sampling of game states to build and explore a search tree, enabling strong decision-making in complex domains like Go and other board games.
-
B.
Davis–Putnam algorithm
The Davis–Putnam algorithm is a pioneering procedure in automated theorem proving and propositional logic satisfiability that laid foundational groundwork for modern SAT solvers.
-
C.
Generalized Search Tree
Generalized Search Tree is a flexible, balanced tree data structure framework that supports building custom index types for complex data and queries, often used in database systems.
-
D.
AlphaZero
AlphaZero is a DeepMind-developed artificial intelligence system that mastered complex games like chess, shogi, and Go through self-play reinforcement learning without human-crafted strategies.
-
E.
Benettin algorithm
The Benettin algorithm is a numerical method used in dynamical systems theory to estimate Lyapunov exponents, which quantify the rate of separation of nearby trajectories and indicate chaos.
- 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_69ca83529a9c8190b5c075b4f14636ed |
completed | March 30, 2026, 2:06 p.m. |
| NER | Named-entity recognition | batch_69cc491b807c81909563a34a947bc21a |
completed | March 31, 2026, 10:22 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69cecd3a3c5c8190940a61e7e7b3e887 |
completed | April 2, 2026, 8:10 p.m. |
| NEDg | Description generation | batch_69cece908adc8190b6ea8d971868cbf8 |
completed | April 2, 2026, 8:16 p.m. |
| NED2 | Entity disambiguation (via description) | batch_69cecf14eaa481908f8630872c21b3b3 |
completed | April 2, 2026, 8:18 p.m. |
Created at: March 30, 2026, 6:31 p.m.