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 "selecting voting locations for fun and profit"):
  Abstract: While manipulative attacks on elections have been well-studied, only recently has attention turned to attacks that account for geographic information, which are extremely common in the real world. The most well known in the media is gerrymandering, in which district border-lines are changed to increase a party's chance to win, but a different geographical manipulation involves influencing the election by selecting the location of polling places, as many people are not willing to go to any distance to vote. In this paper we initiate the study of this manipulation. We find that while it is easy to manipulate the selection of polling places on the line, it becomes difficult already on the plane or in the case of more than two candidates. Moreover, we show that for more than two candidates the problem is inapproximable. However, we find a few restricted cases on the plane where some algorithms perform well. Finally, we discuss how existing results for standard control actions hold in the geographic setting, consider additional control actions in the geographic setting, and suggest directions for future study.

Includes members:
  Member "a partisan districting protocol with provably nonpartisan outcomes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on partisan bias in redistricting computational complexity meets the science of gerrymandering")
  Member "network based vertex dissolution":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "star partitions of perfect graphs")
  Member "on voting and facility location":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "peeking behind the ordinal curtain improving distortion via cardinal queries")
  Member "more natural models of electoral control by partition":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a parameterized perspective on protecting elections")
  Member "combinatorial voter control in elections":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a parameterized perspective on protecting elections")
  Member "weighted electoral control":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a parameterized perspective on protecting elections")
  Member "how hard is bribery in elections":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "aggregating votes with local differential privacy usefulness soundness vs indistinguishability")
  Member "anyone but him the complexity of precluding an alternative":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "manipulating districts to win elections fine grained complexity")

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)