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 "electing a committee with dominance constraints"):
  Abstract: We consider the problem of electing a committee of $k$ candidates, subject to some constraints as to what this committee is supposed to look like. In our framework, the candidates are given labels as an abstraction of gender, religion, ethnicity, and other attributes, and the election outcome is constrained by interval constraints -- of the form "Between 3 and 5 candidates with label X" -- and dominance constraints -- "At least as many candidates with label X as with label Y". While in general this problem would require us to rethink how we determine which election outcomes are good, in the case of a committee scoring rule this becomes a constrained optimisation problem -- simply find a valid committee with the highest score. In the case of weakly separable rules we show the existence of a polynomial time solution in the case of tree-like constraints, and a fixed-parameter tractable algorithm for the general case, which is otherwise NP-hard.

Includes members:
  Member "a rule for committee selection with soft diversity constraints":
    also connected through other hyperedges:
      (none)
  Member "multiwinner elections with diversity constraints":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "algorithmic fairness")
  Member "multiwinner voting with fairness constraints":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "algorithmic fairness")
  Member "multi attribute proportional representation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "committee selection with attribute level preferences")
  Member "properties of multiwinner voting rules":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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-5 (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-6 (induced by source paper "on the complexity of constructive control under nearly single peaked preferences")

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)