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: "integral approximations for coverage probability"
  Abstract: This letter gives approximations to an integral appearing in the formula for downlink coverage probability of a typical user in Poisson point process (PPP) based stochastic geometry frameworks of the form $\int_0^\infty \exp\{ - (Ax + B x^{\alpha/2}) \} \ud x$. Four different approximations are studied. For systems that are interference-limited or noise-limited, conditions are identified when the approximations are valid. For intermediate cases, we recommend the use of Laplace approximation. Numerical results validate the accuracy of the approximations.

Connected through hyperedge HE-1 (induced by source paper "edge caching in delay constrained virtualized cellular networks analysis and market"):
  with members:
    - "inter operator infrastructure sharing trade offs and market"
    - "infrastructure sharing for mobile network operators analysis of trade offs and market"
    - "pricing and resource allocation via game theory for a small cell video caching system"
    - "caching incentive design in wireless d2d networks a stackelberg game approach"
    - "a stackelberg game for incentive proactive caching mechanisms in wireless networks"
    - "virtualization of 5g cellular networks as a hierarchical combinatorial auction"
    - "a tractable approach to coverage and rate in cellular networks"

Connected through hyperedge HE-2 (induced by source paper "edge caching for cache intensity under probabilistic delay constraint"):
  with members:
    - "edge caching in delay constrained virtualized cellular networks analysis and market"
    - "infrastructure sharing for mobile network operators analysis of trade offs and market"
    - "caching as a service small cell caching mechanism design for service providers"

Connected through hyperedge HE-3 (induced by source paper "on spectrum sharing among micro operators in 5g"):
  with members:
    - "inter operator infrastructure sharing trade offs and market"
    - "a tractable approach to coverage and rate in cellular networks"

Connected through hyperedge HE-4 (induced by source paper "inter operator infrastructure sharing trade offs and market"):
  with members:
    - "on spectrum and infrastructure sharing in multi operator cellular networks"
    - "a tractable approach to coverage and rate in cellular networks"

Connected through hyperedge HE-5 (induced by source paper "approximation of meta distribution and its moments for poisson cellular networks"):
  with members:
    - "the meta distribution of the sir in poisson bipolar and cellular networks"

Connected through hyperedge HE-6 (induced by source paper "infrastructure sharing for mobile network operators analysis of trade offs and market"):
  with members:
    - "on spectrum sharing among micro operators in 5g"
    - "inter operator infrastructure sharing trade offs and market"
    - "designing and implementing future aerial communication networks"
    - "on spectrum and infrastructure sharing in multi operator cellular networks"
    - "soaran a service oriented architecture for radio access network sharing in evolving mobile networks"
    - "a tractable approach to coverage and rate in cellular networks"

Connected through hyperedge HE-7 (induced by source paper "sinr outage evaluation in cellular networks saddle point approximation spa using normal inverse gaussian nig distribution"):
  with members:
    - "saddle point approximation for outage probability using cumulant generating functions"
    - "a tractable model for noncoherent joint transmission base station cooperation"
    - "effect of spatial interference correlation on the performance of maximum ratio combining"

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)