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: "search versus decision for election manipulation problems"
  Abstract: Most theoretical definitions about the complexity of manipulating elections focus on the decision problem of recognizing which instances can be successfully manipulated, rather than the search problem of finding the successful manipulative actions. Since the latter is a far more natural goal for manipulators, that definitional focus may be misguided if these two complexities can differ. Our main result is that they probably do differ: If integer factoring is hard, then for election manipulation, election bribery, and some types of election control, there are election systems for which recognizing which instances can be successfully manipulated is in polynomial time but producing the successful manipulations cannot be done in polynomial time.

Connected through hyperedge HE-1 (induced by source paper "the power of self reducibility selectivity information and approximation"):
  with members:
    - "existence versus exploitation the opacity of backbones and backdoors under a weak assumption"
    - "the opacity of backbones"

Connected through hyperedge HE-2 (induced by source paper "the opacity of backbones"):
  with members:
    - "existence versus exploitation the opacity of backbones and backdoors under a weak assumption"

Connected through hyperedge HE-3 (induced by source paper "possible winners in noisy elections"):
  with members:
    - "weighted electoral control"
    - "control complexity in bucklin fallback and plurality voting an experimental approach"
    - "fully proportional representation as resource allocation approximability results"
    - "the complexity of manipulative attacks in nearly single peaked electorates"
    - "determining possible and necessary winners under common voting rules given partial orders"
    - "cloning in elections finding the possible winners"
    - "multimode control attacks on elections"
    - "control complexity in fallback voting"

Connected through hyperedge HE-4 (induced by source paper "more natural models of electoral control by partition"):
  with members:
    - "elections with few voters candidate control can be easy"
    - "combinatorial voter control in elections"
    - "weighted electoral control"
    - "an atypical survey of typical case heuristic algorithms"
    - "normalized range voting broadly resists control"
    - "where are the hard manipulation problems"
    - "sincere strategy preference based approval voting fully resists constructive control and broadly resists destructive control"
    - "anyone but him the complexity of precluding an alternative"

Connected through hyperedge HE-5 (induced by source paper "x then x manipulation of same system runoff elections"):
  with members:
    - "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"
    - "universal voting protocol tweaks to make manipulation hard"

Connected through hyperedge HE-6 (induced by source paper "schulze and ranked pairs voting are fixed parameter tractable to bribe manipulate and control"):
  with members:
    - "coalitional manipulation for schulze s rule"
    - "weighted electoral control"
    - "manipulation and control complexity of schulze voting"
    - "the complexity of manipulative attacks in nearly single peaked electorates"
    - "multimode control attacks on elections"
    - "multivariate complexity analysis of swap bribery"
    - "how hard is bribery in elections"
    - "anyone but him the complexity of precluding an alternative"

Connected through hyperedge HE-7 (induced by source paper "complexity of judgment aggregation"):
  with members:
    - "where are the hard manipulation problems"
    - "the strategy proofness landscape of merging"
    - "the dlv system for knowledge representation and reasoning"
    - "a richer understanding of the complexity of election systems"
    - "exact complexity of the winner problem for young elections"
    - "exact analysis of dodgson elections lewis carroll s 1876 voting system is complete for parallel access to np"

Connected through hyperedge HE-8 (induced by source paper "manipulation and control complexity of schulze voting"):
  with members:
    - "coalitional manipulation for schulze s rule"
    - "control complexity in fallback voting"
    - "how hard is bribery in elections"
    - "hybrid elections broaden complexity theoretic resistance to control"
    - "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.GT(Computer Science and Game Theory)