SIGACT
E363684
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.
All labels observed (6)
How this entity was disambiguated
This entity first appeared as the object of triple T3507161 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
Target entity: SIGACT Context triple: [Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing, associatedWith, SIGACT]
-
A.
SIGPLAN
SIGPLAN is the ACM Special Interest Group on Programming Languages, focusing on research, development, and education in programming language design and implementation.
-
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.
ACM SODA
ACM SODA is a premier annual research conference focused on algorithms and discrete mathematics, jointly sponsored by the ACM and SIAM.
-
D.
Communications of the ACM
Communications of the ACM is a leading peer-reviewed magazine that publishes articles and research on computer science and information technology for the global computing community.
-
E.
Journal of the ACM
Journal of the ACM is a leading peer-reviewed scientific journal in computer science that publishes foundational research across the breadth of computing theory and practice.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Target entity: SIGACT Target entity description: 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.
-
A.
SIGPLAN
SIGPLAN is the ACM Special Interest Group on Programming Languages, focusing on research, development, and education in programming language design and implementation.
-
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.
ACM SODA
ACM SODA is a premier annual research conference focused on algorithms and discrete mathematics, jointly sponsored by the ACM and SIAM.
-
D.
Communications of the ACM
Communications of the ACM is a leading peer-reviewed magazine that publishes articles and research on computer science and information technology for the global computing community.
-
E.
Journal of the ACM
Journal of the ACM is a leading peer-reviewed scientific journal in computer science that publishes foundational research across the breadth of computing theory and practice.
- F. None of above. chosen
Statements (25)
| Predicate | Object |
|---|---|
| instanceOf |
ACM Special Interest Group
ⓘ
professional organization ⓘ |
| abbreviation | SIGACT self-link ⓘ |
| activity |
organizing conferences
ⓘ
publishing newsletters ⓘ recognizing research contributions ⓘ |
| affiliation | ACM ⓘ |
| country |
United States of America
ⓘ
surface form:
United States
|
| field |
algorithms
ⓘ
computation theory ⓘ computational complexity theory ⓘ theoretical computer science ⓘ |
| focus |
community-building in theoretical computer science
ⓘ
research in theoretical computer science ⓘ |
| fullName |
SIGACT
self-linksurface differs
ⓘ
surface form:
Special Interest Group on Algorithms and Computation Theory
|
| language | English ⓘ |
| organizationType | learned society subgroup ⓘ |
| parentOrganization | Association for Computing Machinery ⓘ |
| publicationType | newsletter ⓘ |
| publishes |
SIGACT
self-linksurface differs
ⓘ
surface form:
SIGACT News
|
| scope | international ⓘ |
| sponsors | ACM Symposium on Theory of Computing ⓘ |
| supports | theoretical computer science community ⓘ |
| topic | algorithms and computation theory ⓘ |
| website | https://www.sigact.org/ ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Subject: SIGACT Description of subject: 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.
Referenced by (24)
Full triples — surface form annotated when it differs from this entity's canonical label.