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: "universal voting protocol tweaks to make manipulation hard"
  Abstract: Voting is a general method for preference aggregation in multiagent settings, but seminal results have shown that all (nondictatorial) voting protocols are manipulable. One could try to avoid manipulation by using voting protocols where determining a beneficial manipulation is hard computationally. A number of recent papers study the complexity of manipulating existing protocols. This paper is the first work to take the next step of designing new protocols that are especially hard to manipulate. Rather than designing these new protocols from scratch, we instead show how to tweak existing protocols to make manipulation hard, while leaving much of the original nature of the protocol intact. The tweak studied consists of adding one elimination preround to the election. Surprisingly, this extremely simple and universal tweak makes typical protocols hard to manipulate! The protocols become NP-hard, #P-hard, or PSPACE-hard to manipulate, depending on whether the schedule of the preround is determined before the votes are collected, after the votes are collected, or the scheduling and the vote collecting are interleaved, respectively. We prove general sufficient conditions on the protocols for this tweak to introduce the hardness, and show that the most common voting protocols satisfy those conditions. These are the first results in voting settings where manipulation is in a higher complexity class than NP (presuming PSPACE $\neq$ NP).

Connected through hyperedge HE-1 (induced by source paper "secure voting protocols with perfect ballot secrecy"):
  with members:
    - "protecting privacy through distributed computation in multi agent decision making"
    - "complexity of manipulation bribery and campaign management in bucklin and fallback voting"
    - "equilibria of plurality voting with abstentions"
    - "rational secret sharing and multiparty computation extended abstract"

Connected through hyperedge HE-2 (induced by source paper "x then x manipulation of same system runoff elections"):
  with members:
    - "search versus decision for election manipulation problems"
    - "an atypical survey of typical case heuristic algorithms"
    - "eliminating the weakest link making manipulation intractable"
    - "where are the really hard manipulation problems the phase transition in manipulating the veto rule"
    - "a richer understanding of the complexity of election systems"
    - "dichotomy for voting systems"
    - "anyone but him the complexity of precluding an alternative"

Connected through hyperedge HE-3 (induced by source paper "how hard is it to control an election by breaking ties"):
  with members:
    - "control complexity in bucklin fallback and plurality voting an experimental approach"
    - "eliminating the weakest link making manipulation intractable"
    - "determining possible and necessary winners under common voting rules given partial orders"
    - "manipulation of nanson s and baldwin s rules"
    - "an empirical study of the manipulability of single transferable voting"
    - "where are the really hard manipulation problems the phase transition in manipulating the veto rule"

Connected through hyperedge HE-4 (induced by source paper "is it ever safe to vote strategically"):
  with members:
    - "a smooth transition from powerlessness to absolute power"

Connected through hyperedge HE-5 (induced by source paper "how many vote operations are needed to manipulate a voting system"):
  with members:
    - "combining voting rules together"
    - "eliminating the weakest link making manipulation intractable"
    - "a smooth transition from powerlessness to absolute power"
    - "dominating manipulations in voting with partial information"
    - "multimode control attacks on elections"
    - "where are the really hard manipulation problems the phase transition in manipulating the veto rule"
    - "how hard is bribery in elections"

Connected through hyperedge HE-6 (induced by source paper "eliminating the weakest link making manipulation intractable"):
  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"
    - "complexity of terminating preference elicitation"
    - "where are the really hard manipulation problems the phase transition in manipulating the veto rule"

Connected through hyperedge HE-7 (induced by source paper "common voting rules as maximum likelihood estimators"):
  with members:
    - "how many candidates are needed to make elections hard to manipulate"
    - "vote elicitation complexity and strategy proofness"
    - "complexity of manipulating elections with few candidates"

Connected through hyperedge HE-8 (induced by source paper "combining voting rules together"):
  with members:
    - "complexity of and algorithms for borda manipulation"
    - "dichotomy for voting systems"

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.GT(Computer Science and Game Theory)