Triple
T13652992
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | TCC |
E326784
|
entity |
| Predicate | relatedTo |
P37
|
FINISHED |
| Object | STOC |
E100034
|
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: STOC | Statement: [TCC, relatedTo, STOC]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: STOC Context triple: [TCC, relatedTo, STOC]
-
A.
ACM Symposium on Theory of Computing
chosen
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.
-
B.
ACM SODA
ACM SODA is a premier annual research conference focused on algorithms and discrete mathematics, jointly sponsored by the ACM and SIAM.
-
C.
FOCS
FOCS is a premier annual theoretical computer science conference, formally known as the IEEE Symposium on Foundations of Computer Science.
-
D.
Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing
Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing is a 1985 ACM conference volume collecting influential research papers in theoretical computer science, including foundational work on topics such as interactive proof systems and computational complexity.
-
E.
SIGACT
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.
- 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_69d8076d8270819092afc2f0e9c359a8 |
completed | April 9, 2026, 8:09 p.m. |
| NER | Named-entity recognition | batch_69dbc609676c8190b5b1cabe6b315142 |
completed | April 12, 2026, 4:19 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69f79d46c48c81908d64f1a32cf08c5b |
completed | May 3, 2026, 7:08 p.m. |
Created at: April 9, 2026, 9:52 p.m.