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 "fairness of exposure in rankings"):
  Abstract: Rankings are ubiquitous in the online world today. As we have transitioned from finding books in libraries to ranking products, jobs, job applicants, opinions and potential romantic partners, there is a substantial precedent that ranking systems have a responsibility not only to their users but also to the items being ranked. To address these often conflicting responsibilities, we propose a conceptual and computational framework that allows the formulation of fairness constraints on rankings in terms of exposure allocation. As part of this framework, we develop efficient algorithms for finding rankings that maximize the utility for the user while provably satisfying a specifiable notion of fairness. Since fairness goals can be application specific, we show how a broad range of fairness constraints can be implemented using our framework, including forms of demographic parity, disparate treatment, and disparate impact constraints. We illustrate the effect of these constraints by providing empirical results on two ranking problems.

Includes members:
  Member "equity of attention amortizing individual fairness in rankings":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fairsight visual analytics for fairness in decision making")
  Member "ranking with fairness constraints":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fair correlation clustering")
  Member "learning non discriminatory predictors":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "algorithmic fairness")
  Member "fa ir a fair top k ranking algorithm":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "fairsight visual analytics for fairness in decision making")
  Member "designing fair ranking schemes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "fairsight visual analytics for fairness in decision making")
  Member "unbiased learning to rank with biased feedback":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "safe exploration for optimizing contextual bandits")
  Member "equality of opportunity in supervised learning":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "algorithmic fairness")
  Member "measuring fairness in ranked outputs":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "fair correlation clustering")

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.IR(Information Retrieval)