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 "spatial and social paradigms for interference and coverage analysis in underlay d2d network"):
  Abstract: The homogeneous Poisson point process (PPP) is widely used to model spatial distribution of base stations and mobile terminals. The same process can be used to model underlay device-to-device (D2D) network, however, neglecting homophilic relation for D2D pairing presents underestimated system insights. In this paper, we model both spatial and social distributions of interfering D2D nodes as proximity based independently marked homogeneous Poisson point process. The proximity considers physical distance between D2D nodes whereas social relationship is modeled as Zipf based marks. We apply these two paradigms to analyze the effect of interference on coverage probability of distance-proportional power-controlled cellular user. Effectively, we apply two type of functional mappings (physical distance, social marks) to Laplace functional of PPP. The resulting coverage probability has no closed-form expression, however for a subset of social marks, the mark summation converges to digamma and polygamma functions. This subset constitutes the upper and lower bounds on coverage probability. We present numerical evaluation of these bounds on coverage probability by varying number of different parameters. The results show that by imparting simple power control on cellular user, ultra-dense underlay D2D network can be realized without compromising the coverage probability of cellular user.

Includes members:
  Member "capacity of cellular networks with femtocache":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "optimal scheduling of content caching subject to deadline")
  Member "coverage gain and device to device user density stochastic geometry modeling and analysis":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "intracell interference characterization and cluster inference for d2d communication")
  Member "cognitive and energy harvesting based d2d communication in cellular networks stochastic geometry modeling and analysis":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "analysis of d2d communication with rf energy harvesting and interference management")
  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 "power control for d2d underlaid cellular networks modeling algorithms and analysis":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "analysis of d2d communication with rf energy harvesting and interference management")
  Member "analytical modeling of uplink cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "dynamic tdd interference analysis in macro cell and small cell deployments")
  Member "modeling heterogeneous network interference using poisson point processes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "towards reliable uav swarm communication in d2d enhanced cellular network")
  Member "a tractable approach to coverage and rate in cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (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)