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 "optimal energy consumption with communication computation caching and qoi guarantee"):
  Abstract: Energy efficiency is a fundamental requirement of modern data communication systems, and its importance is reflected in much recent work on performance analysis of system energy consumption. However, most works have only focused on communication and computation costs, but do not account for caching costs. Given the increasing interest in cache networks, this is a serious deficiency. {In this paper, we consider the problem of energy consumption in data communication, compression and caching (C$3$) with a Quality of Information (QoI) guarantee in a communication network. {Our goal is to identify the optimal data compression rate and data placement over the network to minimize the overall energy consumption in the network.} he formulated problem is a \emph{Mixed Integer Non-Linear Programming} (MINLP) problem with non-convex functions, which is NP-hard in general. } {We} propose a variant of spatial branch and bound algorithm (V-SBB), that can {provide} the $\epsilon$-global optimal solution to {our problem}. {We numerically show that our C3 optimization framework can improve the energy efficiency up to 88\% compared to any C2 optimization between communication and computation or caching. Furthermore, for our energy consumption problem, V-SBB {provides comparatively better solution than some other MINLP solvers.}}

Includes members:
  Member "joint data compression and caching approaching optimality with guarantees":
    also connected through other hyperedges:
      (none)
  Member "accurate learning or fast mixing dynamic adaptability of caching algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "cache optimization models and algorithms")
  Member "adaptive caching networks with optimality guarantees":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a ttl based approach for content placement in edge networks")

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