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 "control complexity in bucklin and fallback voting"):
  Abstract: Electoral control models ways of changing the outcome of an election via such actions as adding/deleting/partitioning either candidates or vot ers. These actions modify an election’s participation structure and aim at either making a favorite candidate win (“constructive control”) or prevent a despised candidate from winning (“destructive control”). To protect elections from such control attempts, computational complexity has been used to show that electoral control, though not impossible, is computationally prohibitive. We show that fallback voting, an election system proposed by Brams and Sanver [BS09] to combine Bucklin with approval voting, is resistant to each of the common types of control except to destructive control by either adding or deleting voters. Thus fallback voting displays the broadest control resistance currently known to hold among natural election systems with a polynomial-time winner problem. We also study the control complexity of Bucklin voting itself and show that it behaves almost as good (possibly even as good) as fallback voting in terms of control resistance. As Bucklin voting is a special case of fa llback voting, each resistance shown for Bucklin voting strengthens the corresponding resistance for fallback voting. Finally, we study the parameterized control complexity of Bucklin and fallback voting.

Includes members:
  Member "control complexity in bucklin fallback and plurality voting an experimental approach":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "complexity dichotomies for unweighted scoring rules")
  Member "online voter control in sequential elections":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "computational social choice and computational complexity bffs")
  Member "the complexity of online manipulation of sequential elections":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the complexity of online bribery in sequential elections extended abstract")
  Member "complexity of and algorithms for borda manipulation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the complexity of possible winners on partial chains")
  Member "multimode control attacks on elections":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the complexity of constructive control under nearly single peaked preferences")
  Member "bucklin voting is broadly resistant to control":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the complexity of manipulative attacks in nearly single peaked electorates")
  Member "normalized range voting broadly resists control":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a parameterized perspective on protecting elections")
  Member "control complexity in fallback voting":
    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.CC(Computational Complexity)