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 "robustness among multiwinner voting rules"):
  Abstract: We investigate how robust the results of committee elections are to small changes in the input preference orders, depending on the voting rules used. We find that for typical rules the effect of making a single swap of adjacent candidates in a single preference order is either that (1) at most one committee member might be replaced, or (2) it is possible that the whole committee will be replaced. We also show that the problem of computing the smallest number of swaps that lead to changing the election outcome is typically NP-hard, but there are natural FPT algorithms. Finally, for a number of rules we assess experimentally the average number of random swaps necessary to change the election result.

Includes members:
  Member "what do multiwinner voting rules do an experiment over the two dimensional euclidean domain":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "favorite candidate voting for eliminating the least popular candidate in metric spaces")
  Member "very hard electoral control problems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "election score can be harder than winner")
  Member "distributed monitoring of election winners":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "proportional representation in vote streams")
  Member "committee scoring rules axiomatic characterization and hierarchy":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "what do multiwinner voting rules do an experiment over the two dimensional euclidean domain")
  Member "algorithms for destructive shift bribery":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "local distance restricted bribery in voting")
  Member "the condorcet principle for multiwinner elections from shortlisting to proportionality":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "proportionally representative participatory budgeting with ordinal preferences")
  Member "towards computing victory margins in stv elections":
    also connected through other hyperedges:
      (none)
  Member "voting and bribing in single exponential time":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "n fold integer programming via lp rounding")

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)