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 "gibbsian on line distributed content caching strategy for cellular networks"):
  Abstract: We develop Gibbs sampling based techniques for learning the optimal content placement in a cellular network. A collection of base stations are scattered on the space, each having a cell (possibly overlapping with other cells). Mobile users request for downloads from a finite set of contents according to some popularity distribution. Each base station can store only a strict subset of the contents at a time; if a requested content is not available at any serving base station, it has to be downloaded from the backhaul. Thus, there arises the problem of optimal content placement which can minimize the download rate from the backhaul, or equivalently maximize the cache hit rate. Using similar ideas as Gibbs sampling, we propose simple sequential content update rules that decide whether to store a content at a base station based on the knowledge of contents in neighbouring base stations. The update rule is shown to be asymptotically converging to the optimal content placement for all nodes. Next, we extend the algorithm to address the situation where content popularities and cell topology are initially unknown, but are estimated as new requests arrive to the base stations. Finally, improvement in cache hit rate is demonstrated numerically.

Includes members:
  Member "caching policy toward maximal success probability and area spectral efficiency of cache enabled hetnets":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the design of dynamic probabilistic caching with time varying content popularity")
  Member "a low complexity approach to distributed cooperative caching with geographic constraints":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "online convex optimization for caching networks")
  Member "on optimal geographical caching in heterogeneous cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "private information retrieval from a cellular network with caching at the edge")
  Member "a learning based approach to caching in heterogenous small cell networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "online convex optimization for caching networks")
  Member "edge caching for coverage and capacity aided heterogeneous networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "reinforcement learning based cooperative coded caching under dynamic popularities in ultra dense networks")
  Member "on the delay of geographical caching methods in two tiered heterogeneous networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "wireless caching helper system with heterogeneous traffic and random availability")
  Member "placing dynamic content in caches with small population":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "online convex optimization for caching networks")
  Member "optimization of caching devices with geometric constraints":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "online learning models for content popularity prediction in wireless edge 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)