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 "multi agent learning for cooperative large scale caching networks"):
  Abstract: Caching networks are designed to reduce traffic load at backhaul links, by serving demands from edge-nodes. In the past decades, many studies have been done to address the caching problem. However, in practice, finding an optimal caching policy is still challenging due to dynamicity of traffic and scalability caused by complex impact of caching strategy chosen by each individual cache on other parts of network. In this paper, we focus on cache placement to optimize the performance metrics such as hit ratio in cooperative large-scale caching networks. Our proposed solution, cooperative multi-agent based cache placement (CoM-Cache) is based on multi-agent reinforcement learning framework and can seamlessly track the content popularity dynamics in an on-line fashion. CoM-Cache is enable to solve the problems over a spectrum from isolated to interconnected caches and is designed flexibly to fit any caching networks. To deal with dimensionality issue, CoM-Cache exploits the property of locality of interactions among caches. The experimental results report CoM-Cache outperforms base-line schemes, however at the expense of reasonable additional complexity.

Includes members:
  Member "a low complexity approach to distributed cooperative caching with geographic constraints":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "online convex optimization for caching networks")
  Member "spatial multi lru caching for wireless networks with coverage overlaps":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a swiss army knife for dynamic caching in small cell networks")
  Member "content caching and delivery over heterogeneous wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "adding transmitters dramatically boosts coded caching gains for finite file sizes")
  Member "learning based optimization of cache content in a small cell base station":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "optimal scheduling of content caching subject to deadline")
  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 "analyzing the performance of lru caches under non stationary traffic patterns":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a deep reinforcement learning based framework for content caching")

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)