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 "distribution of cell size in bounded voronoi tesselations with application to secure local connectivity"):
  Abstract: Poisson Voronoi tessellations have been used in modeling many types of systems across different sciences, from geography and astronomy to telecommunications. The existing literature on the statistical properties of Poisson Voronoi cells is vast, however, little is known about the properties of Voronoi cells located close to the boundaries of a compact domain. In a domain with boundaries, some Voronoi cells would be naturally clipped by the boundary, and the cell area falling inside the deployment domain would have different statistical properties as compared to those of non-clipped Voronoi cells located in the bulk of the domain. In this paper, we consider the planar Voronoi tessellation induced by a homogeneous Poisson point process of intensity $\lambda\!>\!0$ in a quadrant, where the two half-axes represent boundaries. We show that the mean cell area is less than $\lambda^{-1}$ when the seed is located exactly at the boundary, and it can be larger than $\lambda^{-1}$ when the seed lies close to the boundary. In addition, we calculate the second moment of cell area at two locations for the seed: (i) at the corner of a quadrant, and (ii) at the boundary of the half-plane. We illustrate that the two-parameter Gamma distribution, with location-dependent parameters calculated using the method of moments, can be of use in approximating the distribution of cell area. As a potential application, we use the Gamma approximations to study the degree distribution for secure connectivity in wireless sensor networks deployed over a domain with boundaries.

Includes members:
  Member "a tractable approach to coverage and rate in 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 "the secrecy graph and some of its properties":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "secure communication in dynamic wireless ad hoc 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)