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 "forming diverse teams from sequentially arriving people"):
  Abstract: Collaborative work often benefits from having teams or organizations with heterogeneous members. In this paper, we present a method to form such diverse teams from people arriving sequentially over time. We define a monotone submodular objective function that combines the diversity and quality of a team and propose an algorithm to maximize the objective while satisfying multiple constraints. This allows us to balance both how diverse the team is and how well it can perform the task at hand. Using crowd experiments, we show that, in practice, the algorithm leads to large gains in team diversity. Using simulations, we show how to quantify the additional cost of forming diverse teams and how to address the problem of simultaneously maximizing diversity for several attributes (e.g., country of origin, gender). Our method has applications in collaborative work ranging from team formation, the assignment of workers to teams in crowdsourcing, and reviewer allocation to journal papers arriving sequentially. Our code is publicly accessible for further research.

Includes members:
  Member "an algorithm for multi attribute diverse matching":
    also connected through other hyperedges:
      (none)
  Member "algorithms for optimal diverse matching":
    also connected through other hyperedges:
      (none)
  Member "diverse weighted bipartite b matching":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "finding fair and efficient allocations when valuations don t add up")
  Member "streaming non monotone submodular maximization personalized video summarization on the fly":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "optimal streaming algorithms for submodular maximization with cardinality constraints")
  Member "ranking ideas for diversity and quality":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "padgan a generative adversarial network for performance augmented diverse designs")
  Member "fast algorithms for online stochastic convex programming":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "simple and fast algorithm for binary integer and online linear programming")
  Member "learning mixtures of submodular shells with application to document summarization":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "robust submodular minimization with applications to cooperative modeling")

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.AI(Artificial Intelligence)