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 "on the complexity of constructive control under nearly single peaked preferences"):
  Abstract: We investigate the complexity of {\sc{Constructive Control by Adding/Deleting Votes}} (CCAV/CCDV) for $r$-approval, Condorcet, Maximin and Copeland$^{\alpha}$ in $k$-axes and $k$-candidates partition single-peaked elections. In general, we prove that CCAV and CCDV for most of the voting correspondences mentioned above are NP-hard even when~$k$ is a very small constant. Exceptions are CCAV and CCDV for Condorcet and CCAV for $r$-approval in $k$-axes single-peaked elections, which we show to be fixed-parameter tractable with respect to~$k$. In addition, we give a polynomial-time algorithm for recognizing $2$-axes elections, resolving an open problem. Our work leads to a number of dichotomy results. To establish an NP-hardness result, we also study a property of $3$-regular bipartite graphs which may be of independent interest. In particular, we prove that for every $3$-regular bipartite graph, there are two linear orders of its vertices such that the two endpoints of every edge are consecutive in at least one of the two orders.

Includes members:
  Member "computational aspects of nearly single peaked electorates":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "incomplete preferences in single peaked electorates")
  Member "reinstating combinatorial protections for manipulation and bribery in single peaked and nearly single peaked electorates":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "incomplete preferences in single peaked electorates")
  Member "structure in dichotomous preferences":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the complexity of destructive bribery in approval based multi winner voting")
  Member "the control complexity of r approval from the single peaked case to the general case":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "approval voting with intransitive preferences")
  Member "on the computation of fully proportional representation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "incomplete preferences in single peaked electorates")
  Member "the complexity of fully proportional representation for single crossing electorates":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "single crossing implementation")
  Member "the complexity of manipulative attacks in nearly single peaked electorates":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "manipulating districts to win elections fine grained complexity")
  Member "multimode control attacks on elections":
    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)