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 "analyzing interference from static cellular cooperation using the nearest neighbour model"):
  Abstract: The problem of base station cooperation has recently been set within the framework of Stochastic Geometry. Existing works consider that a user dynamically chooses the set of stations that cooperate for his/her service. However, this assumption often does not hold. Cooperation groups could be predefined and static, with nodes connected by fixed infrastructure. To analyse such a potential network, in this work we propose a grouping method based on proximity. It is a variation of the so called Nearest Neighbour Model. We restrict ourselves to the simplest case where only singles and pairs of base stations are allowed to be formed. For this, two new point processes are defined from the dependent thinning of a Poisson Point Process, one for the singles and one for the pairs. Structural characteristics for the two are provided, including their density, Voronoi surface, nearest neighbour, empty space and J-function. We further make use of these results to analyse their interference fields and give explicit formulas to their expected value and their Laplace transform. The results constitute a novel toolbox towards the performance evaluation of networks with static cooperation.

Includes members:
  Member "a stochastic geometry framework for analyzing pairwise cooperative cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "area spectral efficiency and sinr scaling laws in multi antenna cellular networks")
  Member "backhaul constrained multi cell cooperation leveraging sparsity and spectral clustering":
    also connected through other hyperedges:
      (none)
  Member "studying the sinr process of the typical user in poisson networks by using its factorial moment measures":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "wireless network signals with moderately correlated shadowing still appear poisson")
  Member "coalitional games in miso interference channels epsilon core and coalition structure stable set":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "distributed clustering for multiuser networks through coalition formation")
  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 "modeling and analysis of k tier downlink heterogeneous cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "reinforcement learning based cooperative coded caching under dynamic popularities in ultra dense networks")
  Member "a tractable approach to coverage and rate in cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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.IT(Information Theory)