human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "more natural models of electoral control by partition"):
  Abstract: Control studies attempts to set the outcome of elections through the addition, deletion, or partition of voters or candidates. The set of benchmark control types was largely set in the seminal 1992 paper by Bartholdi, Tovey, and Trick that introduced control, and there now is a large literature studying how many of the benchmark types various election systems are vulnerable to, i.e., have polynomial-time attack algorithms for. #R##N#However, although the longstanding benchmark models of addition and deletion model relatively well the real-world settings that inspire them, the longstanding benchmark models of partition model settings that are arguably quite distant from those they seek to capture. #R##N#In this paper, we introduce--and for some important cases analyze the complexity of--new partition models that seek to better capture many real-world partition settings. In particular, in many partition settings one wants the two parts of the partition to be of (almost) equal size, or is partitioning into more than two parts, or has groups of actors who must be placed in the same part of the partition. Our hope is that having these new partition types will allow studies of control attacks to include such models that more realistically capture many settings.

Includes members:
  Member "elections with few voters candidate control can be easy":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the complexity of destructive bribery in approval based multi winner voting")
  Member "combinatorial voter control in elections":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "selecting voting locations for fun and profit")
  Member "weighted electoral control":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "selecting voting locations for fun and profit")
  Member "search versus decision for election manipulation problems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the power of self reducibility selectivity information and approximation")
  Member "an atypical survey of typical case heuristic algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "discovering archipelagos of tractability for constraint satisfaction and counting")
  Member "normalized range voting broadly resists control":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a parameterized perspective on protecting elections")
  Member "where are the hard manipulation problems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "lie on the fly strategic voting in an iterative preference elicitation process")
  Member "sincere strategy preference based approval voting fully resists constructive control and broadly resists destructive control":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "a parameterized perspective on protecting elections")

Question: Please tell me which class the source paper 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)