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 "high multiplicity election problems"):
  Abstract: The computational study of elections generally assumes that the preferences of the electorate come in as a list of votes. Depending on the context, it may be much more natural to represent the list succinctly, as the distinct votes of the electorate and their counts, i.e., high-multiplicity representation. We consider how this representation affects the complexity of election problems. High-multiplicity representation may be exponentially smaller than standard representation, and so many polynomial-time algorithms for election problems in standard representation become exponential-time. Surprisingly, for polynomial-time election problems, we are often able to either adapt the same approach or provide new algorithms to show that these problems remain polynomial-time in the high-multiplicity case; this is in sharp contrast to the case where each voter has a weight, where the complexity usually increases. In the process we explore the relationship between high-multiplicity scheduling and manipulation of high-multiplicity elections. And we show that for any fixed set of job lengths, high-multiplicity scheduling on uniform parallel machines is in P, which was previously known for only two job lengths. We did not find any natural case where a polynomial-time election problem does not remain in P when moving to high-multiplicity representation. However, we found one natural NP-hard election problem where the complexity does increase, namely winner determination for Kemeny elections.

Includes members:
  Member "the complexity of succinct elections":
    also connected through other hyperedges:
      (none)
  Member "complexity dichotomies for unweighted scoring rules":
    also connected through other hyperedges:
      (none)
  Member "a control dichotomy for pure scoring rules":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "complexity dichotomies for unweighted scoring rules")
  Member "polynomiality for bin packing with a constant number of item types":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "an optimal algorithm for 1 d cutting stock problem")
  Member "weighted electoral control":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "selecting voting locations for fun and profit")
  Member "the complexity of online manipulation of sequential elections":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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-5 (induced by source paper "the complexity of possible winners on partial chains")
  Member "towards a dichotomy for the possible winner problem in elections based on scoring rules":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the complexity of possible winners on partial chains")

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)