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 "coverage gains from the static cooperation of mutually nearest neighbours"):
  Abstract: Cooperation in cellular networks has been recently suggested as a promising scheme to improve system performance. In this work, clusters are formed based on the Mutually Nearest Neighbour relation, which defines which stations cooperate in pair and which do not. When node positions follow a Poisson Point Process (PPP) the performance of the original clustering model can be approximated by another one, formed by the superposition of two PPPs (one for the singles and one for the pairs) equipped with adequate marks. This allows to derive exact expressions for the network coverage probability under two user-cluster association rules. Numerical evaluation shows coverage gains from different signal cooperation schemes that can reach up to 15% compared to the standard non- cooperative network coverage. The analysis is general and can be applied to any type of cooperation or coordination between pairs of transmitting nodes.

Includes members:
  Member "fundamentals of cluster centric content placement in cache enabled device to device networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "stochastic design and analysis of wireless cloud caching networks")
  Member "a stochastic geometry framework for analyzing pairwise cooperative cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "area spectral efficiency and sinr scaling laws in multi antenna cellular networks")
  Member "analyzing interference from static cellular cooperation using the nearest neighbour model":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "wireless node cooperation with resource availability constraints")
  Member "a tractable model for noncoherent joint transmission base station cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "edge computing enabled cell free massive mimo systems")
  Member "interference coordination random clustering and adaptive limited feedback":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "provisioning energy efficiency and qos for multi carrier comp with limited feedback")
  Member "a tractable approach to coverage and rate in cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "area spectral efficiency and sinr scaling laws in multi antenna cellular 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)