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 "what do multiwinner voting rules do an experiment over the two dimensional euclidean domain"):
  Abstract: We visualize aggregate outputs of popular multiwinner voting rules--SNTV, STV, Bloc, k-Borda, Monroe, Chamberlin--Courant, and HarmonicBorda--for elections generated according to the two-dimensional Euclidean model. We consider three applications of multiwinner voting, namely, parliamentary elections, portfolio/movie selection, and shortlisting, and use our results to understand which of our rules seem to be best suited for each application. In particular, we show that STV (one of the few nontrivial rules used in real high-stake elections) exhibits excellent performance, whereas the Bloc rule (also often used in practice) performs poorly.

Includes members:
  Member "committee scoring rules axiomatic characterization and hierarchy":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on computing centroids according to the p norms of hamming distance vectors")
  Member "consistent approval based multi winner rules":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "evaluating approval based multiwinner voting in terms of robustness to noise")
  Member "properties of multiwinner voting rules":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "who is in your top three optimizing learning in elections with many candidates")
  Member "finding a collective set of items from proportional multirepresentation to group recommendation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "evaluating approval based multiwinner voting in terms of robustness to noise")
  Member "on the computation of fully proportional representation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the complexity of constructive control under nearly single peaked preferences")
  Member "cloning in elections finding the possible winners":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "attacking power indices by manipulating player reliability")

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)