Triple
T4765389
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Dijkstra Prize in Distributed Computing |
E105796
|
entity |
| Predicate | sponsor |
P67
|
FINISHED |
| Object | ACM Special Interest Group on Algorithms and Computation Theory |
E363684
|
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: ACM Special Interest Group on Algorithms and Computation Theory | Statement: [Dijkstra Prize in Distributed Computing, sponsor, ACM Special Interest Group on Algorithms and Computation Theory]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: ACM Special Interest Group on Algorithms and Computation Theory Context triple: [Dijkstra Prize in Distributed Computing, sponsor, ACM Special Interest Group on Algorithms and Computation Theory]
-
A.
ACM Special Interest Group
An ACM Special Interest Group (SIG) is a professional community within the Association for Computing Machinery that focuses on advancing a specific area of computing research, practice, or education.
-
B.
SIGACT
chosen
SIGACT is the Association for Computing Machinery's Special Interest Group on Algorithms and Computation Theory, focusing on research and community-building in theoretical computer science.
-
C.
ACM Symposium on Theory of Computing
The ACM Symposium on Theory of Computing (STOC) is a premier annual research conference in theoretical computer science, featuring groundbreaking work in algorithms, complexity theory, cryptography, and related areas.
-
D.
European Association for Theoretical Computer Science
The European Association for Theoretical Computer Science is a professional organization that promotes research, education, and collaboration in theoretical computer science across Europe and beyond.
-
E.
Association for Computing Machinery
The Association for Computing Machinery is a leading international scientific and educational society dedicated to advancing computing as a science and profession.
- 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_69bd43f226fc8190b867cc249c2a9042 |
completed | March 20, 2026, 12:56 p.m. |
| NER | Named-entity recognition | batch_69bd6534d6b48190911c295b5601a762 |
completed | March 20, 2026, 3:18 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69be3a87741081909380c51ba4efed92 |
completed | March 21, 2026, 6:28 a.m. |
Created at: March 20, 2026, 1:21 p.m.