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 "towards a dichotomy for the possible winner problem in elections based on scoring rules"):
  Abstract: To make a joint decision, agents (or voters) are often required to provide their preferences as linear orders. To determine a winner, the given linear orders can be aggregated according to a voting protocol. However, in realistic settings, the voters may often only provide partial orders. This directly leads to the Possible Winner problem that asks, given a set of partial votes, whether a distinguished candidate can still become a winner. In this work, we consider the computational complexity of Possible Winner for the broad class of voting protocols defined by scoring rules. A scoring rule provides a score value for every position which a candidate can have in a linear order. Prominent examples include plurality, k-approval, and Borda. Generalizing previous NP-hardness results for some special cases, we settle the computational complexity for all but one scoring rule. More precisely, for an unbounded number of candidates and unweighted voters, we show that Possible Winner is NP-complete for all pure scoring rules except plurality, veto, and the scoring rule defined by the scoring vector (2,1,...,1,0), while it is solvable in polynomial time for plurality and veto.

Includes members:
  Member "determining possible and necessary winners under common voting rules given partial orders":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the complexity of possible winners on partial chains")
  Member "taking the final step to a full dichotomy of the possible winner problem in pure scoring rules":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the complexity of possible winners on partial chains")
  Member "the shield that never was societies with single peaked preferences are more open to manipulation and control":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the complexity of constructive control under nearly single peaked preferences")
  Member "a richer understanding of the complexity of election systems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "computational social choice and computational complexity bffs")
  Member "dichotomy for voting systems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the complexity of online bribery in sequential elections")
  Member "vote elicitation complexity and strategy proofness":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "communication distortion and randomness in metric 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.CC(Computational Complexity)