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: "is computational complexity a barrier to manipulation"
  Abstract: When agents are acting together, they may need a simple mechanism to decide on joint actions. One possibility is to have the agents express their preferences in the form of a ballot and use a voting rule to decide the winning action(s). Unfortunately, agents may try to manipulate such an election by misreporting their preferences. Fortunately, it has been shown that it is NP-hard to compute how to manipulate a number of different voting rules. However, NP-hardness only bounds the worst-case complexity. Recent theoretical results suggest that manipulation may often be easy in practice. To address this issue, I suggest studying empirically if computational complexity is in practice a barrier to manipulation. The basic tool used in my investigations is the identification of computational "phase transitions". Such an approach has been fruitful in identifying hard instances of propositional satisfiability and other NP-hard problems. I show that phase transition behaviour gives insight into the hardness of manipulating voting rules, increasing concern that computational complexity is indeed any sort of barrier. Finally, I look at the problem of computing manipulation of other, related problems like stable marriage and tournament problems.

Connected through hyperedge HE-1 (induced by source paper "detecting possible manipulators in elections"):
  with members:
    - "asymptotic collusion proofness of voting rules the case of large number of candidates"
    - "coalitional manipulation for schulze s rule"
    - "complexity of manipulation bribery and campaign management in bucklin and fallback voting"
    - "weighted electoral control"
    - "determining possible and necessary winners under common voting rules given partial orders"
    - "manipulation of nanson s and baldwin s rules"
    - "complexity of and algorithms for borda manipulation"
    - "an empirical study of the manipulability of single transferable voting"

Connected through hyperedge HE-2 (induced by source paper "election attacks with few candidates"):
  with members:
    - "coalitional manipulation for schulze s rule"
    - "weighted electoral control"
    - "schulze and ranked pairs voting are fixed parameter tractable to bribe manipulate and control"
    - "a smooth transition from powerlessness to absolute power"
    - "multimode control attacks on elections"
    - "multivariate complexity analysis of swap bribery"
    - "sincere strategy preference based approval voting fully resists constructive control and broadly resists destructive control"

Connected through hyperedge HE-3 (induced by source paper "solving hard control problems in voting systems via integer programming"):
  with members:
    - "schulze and ranked pairs voting are fixed parameter tractable to bribe manipulate and control"
    - "control complexity in bucklin fallback and plurality voting an experimental approach"
    - "cloning in elections finding the possible winners"
    - "multimode control attacks on elections"
    - "anyone but him the complexity of precluding an alternative"

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)