Triple
T3215760
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | France 4 |
E67390
|
entity |
| Predicate | satelliteService |
P19767
|
FINISHED |
| Object |
TNTSAT
TNTSAT is a French free-to-air satellite television platform that broadcasts the national digital terrestrial TV channels via satellite.
|
E337203
|
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: TNTSAT | Statement: [France 4, satelliteService, TNTSAT]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: TNTSAT Context triple: [France 4, satelliteService, TNTSAT]
-
A.
Z3 SMT solver
Z3 SMT solver is a high-performance Satisfiability Modulo Theories (SMT) solver developed at Microsoft Research, widely used in program verification, formal methods, and automated reasoning.
-
B.
Satisfiability Modulo Theories (SMT)
Satisfiability Modulo Theories (SMT) is a framework in computer science and mathematical logic for deciding the satisfiability of logical formulas with respect to background theories such as arithmetic, bit-vectors, arrays, and data types, widely used in verification, synthesis, and automated reasoning.
-
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.
GSAT
GSAT is a series of Indian communications satellites operated by ISRO to provide services such as telecommunication, broadcasting, and broadband connectivity.
-
E.
Z3: An Efficient SMT Solver
Z3: An Efficient SMT Solver is a high-performance satisfiability modulo theories (SMT) solver widely used in program verification, formal methods, and automated reasoning.
- 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: TNTSAT Triple: [France 4, satelliteService, TNTSAT]
Generated description
TNTSAT is a French free-to-air satellite television platform that broadcasts the national digital terrestrial TV channels via satellite.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: TNTSAT Target entity description: TNTSAT is a French free-to-air satellite television platform that broadcasts the national digital terrestrial TV channels via satellite.
-
A.
Z3 SMT solver
Z3 SMT solver is a high-performance Satisfiability Modulo Theories (SMT) solver developed at Microsoft Research, widely used in program verification, formal methods, and automated reasoning.
-
B.
Satisfiability Modulo Theories (SMT)
Satisfiability Modulo Theories (SMT) is a framework in computer science and mathematical logic for deciding the satisfiability of logical formulas with respect to background theories such as arithmetic, bit-vectors, arrays, and data types, widely used in verification, synthesis, and automated reasoning.
-
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.
GSAT
GSAT is a series of Indian communications satellites operated by ISRO to provide services such as telecommunication, broadcasting, and broadband connectivity.
-
E.
Z3: An Efficient SMT Solver
Z3: An Efficient SMT Solver is a high-performance satisfiability modulo theories (SMT) solver widely used in program verification, formal methods, and automated reasoning.
- 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_69ad858b8adc8190ad989712c87a476b |
completed | March 8, 2026, 2:19 p.m. |
| NER | Named-entity recognition | batch_69adab096b588190b22e41a76263ae92 |
completed | March 8, 2026, 4:59 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69b2623c90cc819085a94adfe3eb3f3f |
completed | March 12, 2026, 6:50 a.m. |
| NEDg | Description generation | batch_69b2630060288190b0cf236863a5bb69 |
completed | March 12, 2026, 6:53 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69b264cbe2a48190baad7f335cdc37ba |
completed | March 12, 2026, 7:01 a.m. |
Created at: March 8, 2026, 3:07 p.m.