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: "a mathematical justification for exponentially distributed nlos bias"
  Abstract: In the past few decades, the localization literature has seen many models attempting to characterize the non-line-of-sight (NLOS) bias error commonly experienced in range measurements. These models have either been based on specific measurement data or chosen due to attractive features of a particular distribution, yet to date, none have been backed by rigorous analysis. Leveraging tools from stochastic geometry, this paper attempts to fill this void by providing the first analytical backing for an NLOS bias error model. Using a Boolean model to statistically characterize the random locations, orientations, and sizes of reflectors, and assuming first-order (i.e., single-bounce) reflections, the distance traversed by the first-arriving NLOS path is characterized. Under these assumptions, this analysis reveals that NLOS bias exhibits an exponential form and can in fact be well approximated by an exponential distribution -- a result consistent with previous NLOS bias error models in the literature. This analytically derived distribution is then compared to a common exponential model from the literature, revealing this distribution to be a close match in some cases and a lower bound in others. Lastly, the assumptions under which these results were derived suggest this model is aptly suited to characterize NLOS bias in 5G millimeter wave systems as well.

Connected through hyperedge HE-1 (induced by source paper "exploiting randomly located blockages for large scale deployment of intelligent surfaces"):
  with members:
    - "intelligent reflecting surface versus decode and forward how large surfaces are needed to beat relaying"
    - "joint active and passive beamforming optimization for intelligent reflecting surface assisted swipt under qos constraints"
    - "holographic mimo surfaces for 6g wireless networks opportunities challenges and trends"
    - "a novel communication paradigm for high capacity and security via programmable indoor wireless environments in next generation wireless systems"
    - "large intelligent surface antennas lisa making reflective radios smart"
    - "secure wireless communication via intelligent reflecting surface"
    - "reflection probability in wireless networks with metasurface coated environmental objects an approach based on random spatial processes"
    - "resource allocation for secure irs assisted multiuser miso systems"

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)