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 geographic caching in cellular networks"):
  Abstract: In this work we consider the problem of an optimal geographic placement of content in wireless cellular networks modelled by Poisson point processes. Specifically, for the typical user requesting some particular content and whose popularity follows a given law (e.g. Zipf), we calculate the probability of finding the content cached in one of the base stations. Wireless coverage follows the usual signal-to-interference-and noise ratio (SINR) model, or some variants of it. We formulate and solve the problem of an optimal randomized content placement policy, to maximize the user's hit probability. The result dictates that it is not always optimal to follow the standard policy “cache the most popular content, everywhere”. In fact, our numerical results regarding three different coverage scenarios, show that the optimal policy significantly increases the chances of hit under high-coverage regime, i.e., when the probabilities of coverage by more than just one station are high enough.

Includes members:
  Member "cache enabled small cell networks modeling and tradeoffs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "joint content delivery and caching placement via dynamic programming")
  Member "exploiting user mobility for wireless content delivery":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "optimal scheduling of content caching subject to deadline")
  Member "a unified approach to the performance analysis of caching systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the design of dynamic probabilistic caching with time varying content popularity")
  Member "sinr based k coverage probability in cellular networks with arbitrary shadowing":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "sir meta distribution of k tier downlink heterogeneous cellular networks with cell range expansion")
  Member "coverage by pairwise base station cooperation under adaptive geometric policies":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "how to group wireless nodes together")

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)