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 "fa ir a fair top k ranking algorithm"):
  Abstract: We present a formal problem definition and an algorithm to solve the Fair Top-k Ranking problem. The problem consists of creating a ranking of k elements out of a pool of n >> k candidates. The objective is to maximize utility, and maximization is subject to a ranked group fairness constraint. Our definition of ranked group fairness uses the standard notion of protected group to extend the concept of group fairness. It ensures that every prefix of the rank contains a number of protected candidates that is statistically indistinguishable from a given target proportion, or exceeds it. The utility objective favors rankings in which every candidate included in the ranking is more qualified than any candidate not included, and rankings in which candidates are sorted by decreasing qualifications. We describe an efficient algorithm for this problem, which is tested on a series of existing datasets, as well as new datasets. Experimentally, this approach yields a ranking that is similar to the so-called "color-blind" ranking, while respecting the fairness criteria. To the best of our knowledge, FA*IR is the first algorithm grounded in statistical tests that can be used to mitigate biases in ranking against an under-represented group.

Includes members:
  Member "quantifying search bias investigating sources of bias for political searches in social media":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "mining disinformation and fake news concepts methods and recent advancements")
  Member "ranking with fairness constraints":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fair correlation clustering")
  Member "algorithmic decision making and the cost of fairness":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "algorithmic fairness")
  Member "exposing the probabilistic causal structure of discrimination":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "understanding agent incentives using causal influence diagrams part i single action settings")
  Member "fairness in reinforcement learning":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "algorithmic fairness")
  Member "equality of opportunity in supervised learning":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "algorithmic fairness")
  Member "measuring fairness in ranked outputs":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "fair correlation clustering")
  Member "how to be fair and diverse":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "representation learning with statistical independence to mitigate bias")

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.CY(Computers and Society)