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 "jointly optimal routing and caching for arbitrary network topologies"):
  Abstract: We study a problem of fundamental importance to ICNs, namely, minimizing routing costs by jointly optimizing caching and routing decisions over an arbitrary network topology. We consider both source routing and hop-by-hop routing settings. The respective offline problems are NP-hard. Nevertheless, we show that there exist polynomial time approximation algorithms producing solutions within a constant approximation from the optimal. We also produce distributed, adaptive algorithms with the same approximation guarantees. We simulate our adaptive algorithms over a broad array of different topologies. Our algorithms reduce routing costs by several orders of magnitude compared to prior art, including algorithms optimizing caching under fixed routing.

Includes members:
  Member "a utility optimization approach to network cache design":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "online convex optimization for caching networks")
  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")
  Member "optimal geographic caching in cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "online convex optimization for caching networks")
  Member "exact analysis of ttl cache networks the case of caching policies driven by stopping times":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "practical bounds on optimal caching with variable object sizes")
  Member "on the complexity of optimal routing and content caching in heterogeneous networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a ttl based approach for content placement in edge networks")
  Member "a unified approach to the performance analysis of caching systems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the design of dynamic probabilistic caching with time varying content popularity")
  Member "vip a framework for joint dynamic forwarding and caching in named data networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "cache version selection and content placement for adaptive video streaming in wireless edge networks")
  Member "a versatile and accurate approximation for lru cache performance":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "online convex optimization for caching 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)