human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "group fairness in committee selection"
  Abstract: In this paper, we study fairness in committee selection problems. We consider a general notion of fairness via stability: A committee is \em stable if no coalition of voters can deviate and choose a committee of proportional size, so that all these voters strictly prefer the new committee to the existing one. Our main contribution is to extend this definition to stability of a distribution (or lottery) over committees. We consider two canonical voter preference models: the Approval Set setting where each voter approves a set of candidates and prefers committees with larger intersection with this set; and the Ranking setting where each voter ranks committees based on how much she likes her favorite candidate in a committee. Our main result is to show that stable lotteries always exist for these canonical preference models. Interestingly, given preferences of voters over committees, the procedure for computing an approximately stable lottery is the same for both models and therefore extends to the setting where some voters have the former preference structure and others have the latter. Our existence proof uses the probabilistic method and a new large deviation inequality that may be of independent interest.

Connected through hyperedge HE-1 (induced by source paper "approximately stable committee selection"):
  with members:
    - "proportionally fair clustering"
    - "fair knapsack"
    - "fair allocation of indivisible public goods"
    - "proportionally representative participatory budgeting axioms and algorithms"
    - "the expanding approvals rule improving proportional representation and monotonicity"
    - "the core of the participatory budgeting problem"
    - "properties of multiwinner voting rules"
    - "an improved approximation for k median and positive correlation in budgeted optimization"

Connected through hyperedge HE-2 (induced by source paper "approval based apportionment"):
  with members:
    - "fair allocation of indivisible public goods"
    - "monotonicity axioms in approval based multi winner voting rules"
    - "fair mixing the case of dichotomous preferences"
    - "committees providing ejr can be computed efficiently"
    - "multiwinner approval rules as apportionment methods"
    - "finding a collective set of items from proportional multirepresentation to group recommendation"
    - "justified representation in approval based committee voting"
    - "computational aspects of multi winner approval voting"

Connected through hyperedge HE-3 (induced by source paper "proportionality and the limits of welfarism"):
  with members:
    - "approximately stable committee selection"
    - "proportionality degree of multiwinner rules"
    - "fair allocation of indivisible public goods"
    - "consistent approval based multi winner rules"
    - "justified representation in approval based committee voting"
    - "computational aspects of multi winner approval voting"

Connected through hyperedge HE-4 (induced by source paper "a quantitative analysis of multi winner rules"):
  with members:
    - "what do multiwinner voting rules do an experiment over the two dimensional euclidean domain"
    - "proportionality and the limits of welfarism"
    - "fair allocation of indivisible public goods"
    - "the condorcet principle for multiwinner elections from shortlisting to proportionality"
    - "consistent approval based multi winner rules"
    - "robustness among multiwinner voting rules"
    - "what do we elect committees for a voting committee model for multi winner rules"
    - "metric distortion of social choice rules lower bounds and fairness properties"

Question: Please tell me which class the center node 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)