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: "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.

Connected through hyperedge HE-1 (induced by source paper "online convex optimization for caching networks"):
  with members:
    - "learning to cache with no regrets"
    - "introduction to online convex optimization"
    - "learning to cooperate in d2d caching networks"
    - "cache optimization models and algorithms"
    - "optimal and scalable caching for 5g using reinforcement learning of space time popularities"
    - "competitive caching with machine learned advice"
    - "a reinforcement learning approach to proactive caching in wireless networks"
    - "a low complexity approach to distributed cooperative caching with geographic constraints"

Connected through hyperedge HE-2 (induced by source paper "a ttl based approach for content placement in edge networks"):
  with members:
    - "cache version selection and content placement for adaptive video streaming in wireless edge networks"
    - "a utility optimization approach to network cache design"
    - "adaptive caching networks with optimality guarantees"
    - "on the complexity of optimal routing and content caching in heterogeneous networks"
    - "a unified approach to the performance analysis of caching systems"

Connected through hyperedge HE-3 (induced by source paper "cache optimization models and algorithms"):
  with members:
    - "learning to cache with no regrets"
    - "introduction to online convex optimization"
    - "cabaret leveraging recommendation systems for mobile edge caching"
    - "optimal and scalable caching for 5g using reinforcement learning of space time popularities"
    - "competitive caching with machine learned advice"
    - "online convex optimization and no regret learning algorithms guarantees and applications"
    - "show me the cache optimizing cache friendly recommendations for sequential content access"
    - "a reinforcement learning approach to proactive caching in wireless networks"

Connected through hyperedge HE-4 (induced by source paper "learning to cache with no regrets"):
  with members:
    - "optimal and scalable caching for 5g using reinforcement learning of space time popularities"
    - "competitive caching with machine learned advice"
    - "online convex optimization and no regret learning algorithms guarantees and applications"
    - "a reinforcement learning approach to proactive caching in wireless networks"
    - "spatial multi lru distributed caching for wireless networks with coverage overlaps"
    - "placing dynamic content in caches with small population"
    - "optimal geographic caching in cellular networks"
    - "adapting caching to audience retention rate which video chunk to store"

Connected through hyperedge HE-5 (induced by source paper "gain more for less the surprising benefits of qos management in constrained ndn networks"):
  with members:
    - "content delivery latency of caching strategies for information centric iot"
    - "connecting the world of embedded mobiles the riot approach to ubiquitous networking for the internet of things"
    - "ndn coap and mqtt a comparative measurement study in the iot"
    - "information centric networking in the iot experiments with ndn in the wild"
    - "backscatter from the data plane threats to stability and security in information centric network infrastructure"

Connected through hyperedge HE-6 (induced by source paper "cache version selection and content placement for adaptive video streaming in wireless edge networks"):
  with members:
    - "mobile edge computing a survey on architecture and computation offloading"
    - "centralized network utility maximization over aggregate flows"
    - "collaborative multi bitrate video caching and processing in mobile edge computing networks"
    - "adaptive video streaming for wireless networks with multiple users and helpers"
    - "vip a framework for joint dynamic forwarding and caching in named data networks"

Connected through hyperedge HE-7 (induced by source paper "kelly cache networks"):
  with members:
    - "adaptive caching networks with optimality guarantees"
    - "on the complexity of optimal routing and content caching in heterogeneous networks"
    - "vip a framework for joint dynamic forwarding and caching in named data networks"

Connected through hyperedge HE-8 (induced by source paper "reversing the meaning of node connectivity for content placement in networks of caches"):
  with members:
    - "maximizing coverage centrality via network design extended version"
    - "adaptive caching networks with optimality guarantees"
    - "fundamental limits on throughput capacity in information centric 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)