Triple
T11090201
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Satisfiability Modulo Theories |
E262229
|
entity |
| Predicate | relatedTo |
P37
|
FINISHED |
| Object |
Shostak combination method
The Shostak combination method is a decision procedure framework in automated reasoning that efficiently combines theories with disjoint signatures to solve satisfiability problems in Satisfiability Modulo Theories (SMT).
|
E904164
|
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: Shostak combination method | Statement: [Satisfiability Modulo Theories, relatedTo, Shostak combination method]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Shostak combination method Context triple: [Satisfiability Modulo Theories, relatedTo, Shostak combination method]
-
A.
Bailey chain method
The Bailey chain method is a powerful technique in the theory of basic hypergeometric series that systematically generates infinite families of q-series and partition identities, including generalizations of Rogers–Ramanujan-type identities.
-
B.
Gundersen method
The Gundersen method is a timing-based system in Nordic combined that converts ski jumping results into staggered start times for the cross-country race so that the first athlete to finish wins overall.
-
C.
O’Connor Method
The O’Connor Method is a string instrument teaching system that emphasizes American folk, jazz, and classical styles to develop musicality and improvisation in students.
-
D.
Darwin–Fowler method
The Darwin–Fowler method is a statistical mechanics technique that uses complex analysis and generating functions to derive distribution laws for systems of many particles.
-
E.
Gregory method
The Gregory method is a numerical integration technique that approximates definite integrals using a series expansion based on finite differences.
- 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: Shostak combination method Triple: [Satisfiability Modulo Theories, relatedTo, Shostak combination method]
Generated description
The Shostak combination method is a decision procedure framework in automated reasoning that efficiently combines theories with disjoint signatures to solve satisfiability problems in Satisfiability Modulo Theories (SMT).
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Shostak combination method Target entity description: The Shostak combination method is a decision procedure framework in automated reasoning that efficiently combines theories with disjoint signatures to solve satisfiability problems in Satisfiability Modulo Theories (SMT).
-
A.
Bailey chain method
The Bailey chain method is a powerful technique in the theory of basic hypergeometric series that systematically generates infinite families of q-series and partition identities, including generalizations of Rogers–Ramanujan-type identities.
-
B.
Gundersen method
The Gundersen method is a timing-based system in Nordic combined that converts ski jumping results into staggered start times for the cross-country race so that the first athlete to finish wins overall.
-
C.
O’Connor Method
The O’Connor Method is a string instrument teaching system that emphasizes American folk, jazz, and classical styles to develop musicality and improvisation in students.
-
D.
Darwin–Fowler method
The Darwin–Fowler method is a statistical mechanics technique that uses complex analysis and generating functions to derive distribution laws for systems of many particles.
-
E.
Gregory method
The Gregory method is a numerical integration technique that approximates definite integrals using a series expansion based on finite differences.
- 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_69d6aa9a40d88190a373e2c7e48285db |
completed | April 8, 2026, 7:20 p.m. |
| NER | Named-entity recognition | batch_69d799e96ca08190838c8a04d1eb2a16 |
completed | April 9, 2026, 12:22 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69e3e7c586808190a576803b7406a49e |
completed | April 18, 2026, 8:21 p.m. |
| NEDg | Description generation | batch_69e3f2cafc008190a3504999297f1e4e |
completed | April 18, 2026, 9:08 p.m. |
| NED2 | Entity disambiguation (via description) | batch_69e3f488819081908f9a4225279cde6b |
completed | April 18, 2026, 9:15 p.m. |
Created at: April 8, 2026, 9:27 p.m.