Triple
T7423331
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | SHACL |
E171301
|
entity |
| Predicate | acronymFor |
P590
|
FINISHED |
| Object | Shapes Constraint Language |
E171301
|
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: Shapes Constraint Language | Statement: [SHACL, acronymFor, Shapes Constraint Language]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Shapes Constraint Language Context triple: [SHACL, acronymFor, Shapes Constraint Language]
-
A.
CFG
CFG is the stock ticker symbol for Citizens Financial Group, a major U.S.-based regional bank holding company.
-
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.
TLA+
TLA+ is a formal specification language developed by Leslie Lamport for modeling and verifying concurrent and distributed systems using mathematical logic.
-
D.
Mathematical Structures of Language
Mathematical Structures of Language is a foundational work in mathematical linguistics that applies formal and algebraic methods to analyze the structure of natural languages.
-
E.
SHACL
chosen
SHACL is a W3C standard language for validating RDF data against a set of constraints or shapes.
- 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_69c68a625d048190af70eb8b63bec5a0 |
completed | March 27, 2026, 1:47 p.m. |
| NER | Named-entity recognition | batch_69c6f2eece588190905774e7151edcb8 |
completed | March 27, 2026, 9:13 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69c8277f749c8190a91f620c71c48433 |
completed | March 28, 2026, 7:09 p.m. |
Created at: March 27, 2026, 3:12 p.m.