human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "manipulating tournaments in cup and round robin competitions"
  Abstract: In sports competitions, teams can manipulate the result by, for instance, throwing games. We show that we can decide how to manipulate round robin and cup competitions, two of the most popular types of sporting competitions in polynomial time. In addition, we show that finding the minimal number of games that need to be thrown to manipulate the result can also be determined in polynomial time. Finally, we show that there are several different variations of standard cup competitions where manipulation remains polynomial.

Connected through hyperedge HE-1 (induced by source paper "refining tournament solutions via margin of victory"):
  with members:
    - "query complexity of tournament solutions"
    - "estimating the margin of victory of an election using sampling"

Connected through hyperedge HE-2 (induced by source paper "determining possible and necessary winners under common voting rules given partial orders"):
  with members:
    - "common voting rules as maximum likelihood estimators"
    - "new candidates welcome possible winners with respect to the addition of new candidates"
    - "taking the final step to a full dichotomy of the possible winner problem in pure scoring rules"
    - "towards a dichotomy for the possible winner problem in elections based on scoring rules"
    - "the complexity of probabilistic lobbying"
    - "eliciting single peaked preferences using comparison queries"
    - "dichotomy for voting systems"
    - "cp nets a tool for representing and reasoning with conditional ceteris paribus preference statements"

Connected through hyperedge HE-3 (induced by source paper "is computational complexity a barrier to manipulation"):
  with members:
    - "dominating manipulations in voting with partial information"
    - "manipulation of nanson s and baldwin s rules"
    - "complexity of and algorithms for borda manipulation"
    - "an empirical study of borda manipulation"
    - "multimode control attacks on elections"
    - "an empirical study of the manipulability of single transferable voting"
    - "where are the hard manipulation problems"
    - "manipulation and gender neutrality in stable marriage procedures"

Connected through hyperedge HE-4 (induced by source paper "where are the hard manipulation problems"):
  with members:
    - "complexity of and algorithms for borda manipulation"
    - "an empirical study of the manipulability of single transferable voting"
    - "manipulation and gender neutrality in stable marriage procedures"
    - "the shield that never was societies with single peaked preferences are more open to manipulation and control"
    - "complexity of terminating preference elicitation"
    - "where are the really hard manipulation problems the phase transition in manipulating the veto rule"
    - "dealing with incomplete agents preferences and an uncertain agenda in group decision making via sequential majority voting"
    - "eliciting single peaked preferences using comparison queries"

Question: Please tell me which class the center node belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.AI(Artificial Intelligence)