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: "an empirical study of borda manipulation"
  Abstract: We study the problem of coalitional manipulation in elections using the unweighted Borda rule. We provide empirical evidence of the manipulability of Borda elections in the form of two new greedy manipulation algorithms based on intuitions from the bin-packing and multiprocessor scheduling domains. Although we have not been able to show that these algorithms beat existing methods in the worst-case, our empirical evaluation shows that they significantly outperform the existing method and are able to find optimal manipulations in the vast majority of the randomly generated elections that we tested. These empirical results provide further evidence that the Borda rule provides little defense against coalitional manipulation.

Connected through hyperedge HE-1 (induced by source paper "control complexity in bucklin fallback and plurality voting an experimental approach"):
  with members:
    - "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"
    - "the shield that never was societies with single peaked preferences are more open to manipulation and control"
    - "where are the really hard manipulation problems the phase transition in manipulating the veto rule"
    - "a richer understanding of the complexity of election systems"
    - "anyone but him the complexity of precluding an alternative"

Connected through hyperedge HE-2 (induced by source paper "manipulation of nanson s and baldwin s rules"):
  with members:
    - "complexity of and algorithms for borda manipulation"
    - "an empirical study of the manipulability of single transferable voting"

Connected through hyperedge HE-3 (induced by source paper "complexity of and algorithms for borda manipulation"):
  with members:
    - "an empirical study of the manipulability of single transferable voting"

Connected through hyperedge HE-4 (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"
    - "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"
    - "the shield that never was societies with single peaked preferences are more open to manipulation and control"

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)