Triple
T12900647
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Clojure |
E308600
|
entity |
| Predicate | supports |
P516
|
FINISHED |
| Object | core.async |
E440673
|
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: core.async | Statement: [Clojure, supports, core.async]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: core.async Context triple: [Clojure, supports, core.async]
-
A.
Clojure core.async
chosen
Clojure core.async is a Clojure library that provides asynchronous programming primitives like channels and go blocks to enable CSP-style concurrent and parallel programming.
-
B.
Clojure
Clojure is a modern, functional, and dynamic dialect of Lisp that runs on the Java Virtual Machine and emphasizes immutability and concurrent programming.
-
C.
join-calculus
Join-calculus is a process calculus designed for specifying and reasoning about concurrent and distributed systems, emphasizing message-based synchronization and mobility.
-
D.
Jakarta Concurrency
Jakarta Concurrency is a Jakarta EE specification that defines standardized APIs and mechanisms for managing asynchronous and parallel execution in enterprise Java applications.
-
E.
Communication and Concurrency
Communication and Concurrency is a foundational book in theoretical computer science that introduces process calculi, particularly the Calculus of Communicating Systems (CCS), to model and reason about concurrent systems.
- 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_69d7bdf7c1f0819098102569a8d8cbf5 |
completed | April 9, 2026, 2:55 p.m. |
| NER | Named-entity recognition | batch_69d97180ee708190b60a3e58c42f764f |
completed | April 10, 2026, 9:54 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69f6a56189b081909ed838addcb6d265 |
completed | May 3, 2026, 1:31 a.m. |
Created at: April 9, 2026, 5:40 p.m.