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 "approval based apportionment"):
  Abstract: In the apportionment problem, a fixed number of seats must be distributed among parties in proportion to the number of voters supporting each party. We study a generalization of this setting, in which voters cast approval ballots over parties, such that each voter can support multiple parties. This approval-based apportionment setting generalizes traditional apportionment and is a natural restriction of approval-based multiwinner elections, where approval ballots range over individual candidates. Using techniques from both apportionment and multiwinner elections, we are able to provide representation guarantees that are currently out of reach in the general setting of multiwinner elections: First, we show that core-stable committees are guaranteed to exist and can be found in polynomial time. Second, we demonstrate that extended justified representation is compatible with committee monotonicity.

Includes members:
  Member "group fairness in committee selection":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "approximately stable committee selection")
  Member "fair allocation of indivisible public goods":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "participatory budgeting models and approaches")
  Member "monotonicity axioms in approval based multi winner voting rules":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the complexity of destructive bribery in approval based multi winner voting")
  Member "fair mixing the case of dichotomous preferences":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "participatory budgeting models and approaches")
  Member "committees providing ejr can be computed efficiently":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the expanding approvals rule improving proportional representation and monotonicity")
  Member "multiwinner approval rules as apportionment methods":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "evaluating approval based multiwinner voting in terms of robustness to noise")
  Member "finding a collective set of items from proportional multirepresentation to group recommendation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "evaluating approval based multiwinner voting in terms of robustness to noise")
  Member "justified representation in approval based committee voting":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "participatory budgeting models and approaches")

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)