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 "fundamentals of modeling finite wireless networks using binomial point process"):
  Abstract: Modeling the locations of nodes as a uniform binomial point process (BPP), we present a generic mathematical framework to characterize the performance of an arbitrarily-located reference receiver in a finite wireless network. Different from most of the prior works where the serving transmitter (TX) node is located at the fixed distance from the reference receiver, we consider two general TX-selection policies: i) uniform TX-selection: the serving node is chosen uniformly at random amongst transmitting nodes, and ii) k-closest TX-selection: the serving node is the k-th closest node out of transmitting nodes to the reference receiver. The key intermediate step in our analysis is the derivation of a new set of distance distributions that lead not only to the tractable analysis of coverage probability but also enable the analyses of wide range of classical and currently trending problems in wireless networks. Using this new set of distance distributions, we first investigate the diversity loss due to SIR correlation in a finite network. We then obtain the optimal number of links that can be simultaneously activated to maximize network spectral efficiency. Finally, we evaluate optimal caching probability to maximize the total hit probability in cache-enabled finite networks.

Includes members:
  Member "a primer on cellular network analysis using stochastic geometry":
    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 "fundamentals of cluster centric content placement in cache enabled device to device networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "stochastic design and analysis of wireless cloud caching networks")
  Member "optimal geographic caching in finite wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "stochastic geometry modeling and analysis of single and multi cluster wireless networks")
  Member "modeling and performance analysis of clustered device to device networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "optimizing joint probabilistic caching and channel access for clustered d2d networks")
  Member "performance analysis of arbitrarily shaped underlay cognitive networks effects of secondary user activity protocols":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "stochastic geometry modeling and analysis of single and multi cluster wireless networks")
  Member "optimal geographic caching in cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "online convex optimization for caching networks")
  Member "analyzing the impact of access point density on the performance of finite area networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "temporal correlation of interference and outage in mobile networks over one dimensional finite regions")
  Member "analysis of millimeter wave networked wearables in crowded environments":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "iot technologies for augmented human a survey")

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)