Triple
T13507010
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | The Complexity of Theorem-Proving Procedures |
E321037
|
entity |
| Predicate | publishedIn |
P309
|
FINISHED |
| Object |
Proceedings of the Third Annual ACM Symposium on Theory of Computing
Proceedings of the Third Annual ACM Symposium on Theory of Computing is a conference volume collecting influential early research papers in theoretical computer science, particularly in computational complexity and the foundations of computation.
|
E1045587
|
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: Proceedings of the Third Annual ACM Symposium on Theory of Computing | Statement: [The Complexity of Theorem-Proving Procedures, publishedIn, Proceedings of the Third Annual ACM Symposium on Theory of Computing]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Proceedings of the Third Annual ACM Symposium on Theory of Computing Context triple: [The Complexity of Theorem-Proving Procedures, publishedIn, Proceedings of the Third Annual ACM Symposium on Theory of Computing]
-
A.
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.
-
B.
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.
-
C.
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms is a classic computer science textbook that systematically presents fundamental techniques and theoretical foundations for designing and analyzing efficient algorithms.
-
D.
SIAM Journal on Computing
SIAM Journal on Computing is a leading peer-reviewed scientific journal that publishes research in theoretical computer science, including algorithms, complexity theory, and related areas of computation.
-
E.
Elements of the Theory of Computation
Elements of the Theory of Computation is a foundational textbook that introduces the mathematical and theoretical principles underlying computer science, including automata, formal languages, and computability.
- 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: Proceedings of the Third Annual ACM Symposium on Theory of Computing Triple: [The Complexity of Theorem-Proving Procedures, publishedIn, Proceedings of the Third Annual ACM Symposium on Theory of Computing]
Generated description
Proceedings of the Third Annual ACM Symposium on Theory of Computing is a conference volume collecting influential early research papers in theoretical computer science, particularly in computational complexity and the foundations of computation.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Proceedings of the Third Annual ACM Symposium on Theory of Computing Target entity description: Proceedings of the Third Annual ACM Symposium on Theory of Computing is a conference volume collecting influential early research papers in theoretical computer science, particularly in computational complexity and the foundations of computation.
-
A.
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.
-
B.
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.
-
C.
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms is a classic computer science textbook that systematically presents fundamental techniques and theoretical foundations for designing and analyzing efficient algorithms.
-
D.
SIAM Journal on Computing
SIAM Journal on Computing is a leading peer-reviewed scientific journal that publishes research in theoretical computer science, including algorithms, complexity theory, and related areas of computation.
-
E.
Elements of the Theory of Computation
Elements of the Theory of Computation is a foundational textbook that introduces the mathematical and theoretical principles underlying computer science, including automata, formal languages, and computability.
- 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_69d807629d6c8190998f1b9bb12d2ed0 |
completed | April 9, 2026, 8:09 p.m. |
| NER | Named-entity recognition | batch_69dbaf8259a08190ada13c4a3078f07d |
completed | April 12, 2026, 2:43 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69f7548e51b881909a3384812556bc3d |
completed | May 3, 2026, 1:58 p.m. |
| NEDg | Description generation | batch_69f757108e088190aeec031eccc9aca3 |
completed | May 3, 2026, 2:09 p.m. |
| NED2 | Entity disambiguation (via description) | batch_69f757e7322c8190b0e36e8373d42ac4 |
completed | May 3, 2026, 2:12 p.m. |
Created at: April 9, 2026, 9:43 p.m.