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: "a matrix analytic solution for randomized load balancing models with phase type service times"
  Abstract: In this paper, we provide a matrix-analytic solution for randomized load balancing models (also known as \emph{supermarket models}) with phase-type (PH) service times. Generalizing the service times to the phase-type distribution makes the analysis of the supermarket models more difficult and challenging than that of the exponential service time case which has been extensively discussed in the literature. We first describe the supermarket model as a system of differential vector equations, and provide a doubly exponential solution to the fixed point of the system of differential vector equations. Then we analyze the exponential convergence of the current location of the supermarket model to its fixed point. Finally, we present numerical examples to illustrate our approach and show its effectiveness in analyzing the randomized load balancing schemes with non-exponential service requirements.

Connected through hyperedge HE-1 (induced by source paper "reward processes and performance simulation in supermarket models with different servers"):
  with members:
    - "block structured supermarket models"
    - "the supermarket game"
    - "the chaos of propagation in a retrial supermarket model"
    - "super exponential solution in markovian supermarket models framework and challenge"
    - "doubly exponential solution for randomized load balancing models with markovian arrival processes and ph service times"

Connected through hyperedge HE-2 (induced by source paper "block structured supermarket models"):
  with members:
    - "the chaos of propagation in a retrial supermarket model"
    - "super exponential solution in markovian supermarket models framework and challenge"
    - "doubly exponential solution for randomized load balancing models with markovian arrival processes and ph service times"

Connected through hyperedge HE-3 (induced by source paper "the chaos of propagation in a retrial supermarket model"):
  with members:
    - "a retrial system with two input streams and two orbit queues"
    - "super exponential solution in markovian supermarket models framework and challenge"
    - "mean field for markov decision processes from discrete to continuous optimization"

Connected through hyperedge HE-4 (induced by source paper "super exponential solution in markovian supermarket models framework and challenge"):
  with members:
    - "doubly exponential solution for randomized load balancing models with general service times"
    - "doubly exponential solution for randomized load balancing models with markovian arrival processes and ph service times"

Connected through hyperedge HE-5 (induced by source paper "doubly exponential solution for randomized load balancing models with markovian arrival processes and ph service times"):
  with members:
    - "doubly exponential solution for randomized load balancing models with general service times"

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.NI(Networking and Internet Architecture)