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 "kernelization complexity of possible winner and coalitional manipulation problems in voting"):
  Abstract: In the Possible Winner problem in computational social choice theory, we are given a set of partial preferences and the question is whether a distinguished candidate could be made winner by extending the partial preferences to linear preferences. Previous work has provided, for many common voting rules, fixed parameter tractable algorithms for the Possible Winner problem, with number of candidates as the parameter. However, the corresponding kernelization question is still open and in fact, has been mentioned as a key research challenge. In this paper, we settle this open question for many common voting rules. #R##N#We show that the Possible Winner problem for maximin, Copeland, Bucklin, ranked pairs, and a class of scoring rules that include the Borda voting rule do not admit a polynomial kernel with the number of candidates as the parameter. We show however that the Coalitional Manipulation problem which is an important special case of the Possible Winner problem does admit a polynomial kernel for maximin, Copeland, ranked pairs, and a class of scoring rules that includes the Borda voting rule, when the number of manipulators is polynomial in the number of candidates. A significant conclusion of our work is that the Possible Winner problem is harder than the Coalitional Manipulation problem since the Coalitional Manipulation problem admits a polynomial kernel whereas the Possible Winner problem does not admit a polynomial kernel.

Includes members:
  Member "prices matter for the parameterized complexity of shift bribery":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "optimal bribery in voting")
  Member "election attacks with few candidates":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the complexity of destructive bribery in approval based multi winner voting")
  Member "parameterized algorithmics for computational social choice nine research challenges":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "stable marriage with multi modal preferences")
  Member "exact algorithms for weighted and unweighted borda manipulation problems":
    also connected through other hyperedges:
      (none)
  Member "complexity of manipulation bribery and campaign management in bucklin and fallback voting":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "optimal bribery in voting")
  Member "determining possible and necessary winners under common voting rules given partial orders":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the complexity of possible winners on partial chains")
  Member "multivariate complexity analysis of swap bribery":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "optimal bribery in voting")
  Member "towards a dichotomy of finding possible winners in elections based on scoring rules":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "complexity of manipulation with partial information in voting")

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)