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: "implementing an optimal rate allocation tuned to the user quality of experience"
  Abstract: Optimal resource allocation elegantly kaizens bandwidth utilization in present-day communications systems carrying distinctive traffic types with specific quality of service (QoS) requirements, whose fulfillment may elevate users' quality of Experience (QoE). This paper investigates the QoE of users running real-life real-time and delay-tolerant applications by implementing an Internet-connected real-world mobile network which hosts a node with a centralized convex resource allocation optimization algorithm to calculate and enforce an optimal bandwidth distribution. The experiments show that leveraging the rate assignment approach escalates the real-life network traffic QoE through a fine-grained temporal resource allocation pattern which plummets the total bandwidth consumption and the cost of employing the services.

Connected through hyperedge HE-1 (induced by source paper "optimal resource allocation for cellular networks with matlab instructions"):
  with members:
    - "position estimation of robotic mobile nodes in wireless testbed using geni"
    - "a delay optimal packet scheduler for m2m uplink"
    - "network mimo with partial cooperation between radar and cellular systems"
    - "optimal context aware resource allocation in cellular networks"
    - "resource allocation in cellular systems for applications with random parameters"
    - "optimal downlink power allocation in cellular networks"
    - "an efficient multi carrier resource allocation with user discrimination framework for 5g wireless systems"
    - "application aware resource block and power allocation for lte"

Connected through hyperedge HE-2 (induced by source paper "optimal radio resource allocation for hybrid traffic in cellular networks centralized and distributed architecture"):
  with members:
    - "optimal context aware resource allocation in cellular networks"
    - "optimal downlink power allocation in cellular networks"
    - "an optimal application aware resource block scheduling in lte"
    - "multi application resource allocation with users discrimination in cellular networks"

Connected through hyperedge HE-3 (induced by source paper "optimal radio resource allocation for hybrid traffic in cellular networks traffic analysis and implementation"):
  with members:
    - "an optimal application aware resource block scheduling in lte"
    - "optimal radio resource allocation for hybrid traffic in cellular networks centralized and distributed architecture"
    - "multi application resource allocation with users discrimination in cellular networks"

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)