human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "serving distance and coverage in a closed access php based heterogeneous cellular network"
  Abstract: Heterogeneous cellular networks (HCNs) usually exhibit spatial separation amongst base stations (BSs) of different types (termed tiers in this paper). For instance, operators will usually not deploy a picocell in close proximity to a macrocell, thus inducing separation amongst the locations of pico and macrocells. This separation has recently been captured by modeling the small cell locations by a Poisson Hole Process (PHP) with the hole centers being the locations of the macrocells. Due to the presence of exclusion zones, the analysis of the resulting model is significantly more complex compared to the more popular Poisson Point Process (PPP) based models. In this paper, we derive a tight bound on the distribution of the distance of a typical user to the closest point of a PHP. Since the exact distribution of this distance is not known, it is often approximated in the literature. For this model, we then provide tight characterization of the downlink coverage probability for a typical user in a two-tier closed-access HCN under two cases: (i) typical user is served by the closest macrocell, and (ii) typical user is served by its closest small cell. The proposed approach can be extended to analyze other relevant cases of interest, e.g., coverage in a PHP-based open access HCN.

Connected through hyperedge HE-1 (induced by source paper "tight lower bounds on the contact distance distribution in poisson hole process"):
  with members:
    - "poisson hole process theory and applications to wireless networks"
    - "d2d enhanced heterogeneous cellular networks with dynamic tdd"

Question: Please tell me which class the center node 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)