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: "cache aware qoe traffic optimization in mobile edge assisted adaptive video streaming"
  Abstract: Multi-access edge computing (MEC) enables placing video content at the edge of the network aiming to improve the quality of experience (QoE) of the mobile clients. Video content caching at edge servers also reduces traffic in the backhaul of the mobile network, hence reducing operational costs for mobile network operators (MNOs). However, minimizing the rate of cache misses and maximizing the average video quality may sometimes be at odds with each other, particularly when the cache size is constrained. Our objective in this article is two fold: First, we explore the impact of fixed video content caching on the optimal QoE of mobile clients in a setup where servers at mobile network edge handle bitrate selection. Second, we want to investigate the effect of cache replacement on QoE-traffic trade-off. An integer nonlinear programming (INLP) optimization model is formulated for the problem of jointly maximizing the QoE, the fairness as well as minimizing overall data traffic on the origin video server. Due to its NP-Hardness, we then present a low complexity greedy-based algorithm with minimum need for parameter tuning which can be easily deployed. We show through simulations that the joint optimization indeed enables striking a desired trade-off between traffic reduction and QoE. The results also reveal that with fixed cached contents, the impact of caching on the QoE is proportional to the desired operational point of MNO. Furthermore, the effect of cache replacement on QoE is less noticeable compared to its effect on backhaul traffic when cache size is constrained.

Connected through hyperedge HE-1 (induced by source paper "edgedash exploiting network assisted adaptive video streaming for edge caching"):
  with members:
    - "tfdash a fairness stability and efficiency aware rate control approach for multiple clients over dash"

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)