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 "reward processes and performance simulation in supermarket models with different servers"):
  Abstract: Supermarket models with different servers become a key in modeling resource management of stochastic networks, such as, computer networks, manufacturing systems and transportation networks. While these different servers always make analysis of such a supermarket model more interesting, difficult and challenging. This paper provides a new novel method for analyzing the supermarket model with different servers through a multi-dimensional continuous-time Markov reward processes. Firstly, the utility functions are constructed for expressing a routine selection mechanism that depends on queue lengths, on service rates, and on some probabilities of individual preference. Then applying the continuous-time Markov reward processes, some segmented stochastic integrals of the random reward function are established by means of an event-driven technique. Based on this, the mean of the random reward function in a finite time period is effectively computed by means of the state jump points of the Markov reward process, and also the mean of the discounted random reward function in an infinite time period can be calculated through the same event-driven technique. Finally, some simulation experiments are given to indicate how the expected queue length of each server depends on the main parameters of this supermarket model.

Includes members:
  Member "block structured supermarket models":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "groups of repairmen and repair based load balancing in supermarket models with repairable servers")
  Member "the supermarket game":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "collaboratively learning the best option on graphs using bounded local memory")
  Member "a matrix analytic solution for randomized load balancing models with phase type service times":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "block structured supermarket models")
  Member "the chaos of propagation in a retrial supermarket model":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "block structured supermarket models")
  Member "super exponential solution in markovian supermarket models framework and challenge":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "block structured supermarket models")
  Member "doubly exponential solution for randomized load balancing models with markovian arrival processes and ph service times":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "block structured supermarket models")

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.PF(Performance)