Triple
T4279387
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | GiST |
E97113
|
entity |
| Predicate | abbreviationOf |
P590
|
FINISHED |
| Object | Generalized Search Tree |
E427689
|
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: Generalized Search Tree | Statement: [GiST, abbreviationOf, Generalized Search Tree]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Generalized Search Tree Context triple: [GiST, abbreviationOf, Generalized Search Tree]
-
A.
Generalized Search Tree
chosen
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.
-
B.
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.
-
C.
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.
-
D.
Boyer–Moore string-search algorithm
The Boyer–Moore string-search algorithm is a highly efficient pattern-matching algorithm that scans text from right to left and uses precomputed shift rules to skip sections of the text, making it one of the fastest practical algorithms for substring search.
-
E.
Tree That Owns Itself
The Tree That Owns Itself is a famous white oak in Athens, Georgia, reputedly granted legal ownership of itself and the land immediately surrounding it.
- 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_69b34544be3c819084d1ab82d29f90c5 |
completed | March 12, 2026, 10:59 p.m. |
| NER | Named-entity recognition | batch_69b350367da48190b735deef9b5d2d2e |
completed | March 12, 2026, 11:45 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69b5c7237b608190ab5aca56027344c4 |
completed | March 14, 2026, 8:37 p.m. |
Created at: March 12, 2026, 11:07 p.m.