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 scalable belief propagation algorithm for radio signal based slam"
  Abstract: We present a simultaneous localization and mapping (SLAM) algorithm that is based on radio signals and the association of specular multipath components (MPCs) with geometric features. Especially in indoor scenarios, localization from radio signals is challenging due to diffuse multipath propagation and the unknown MPC-featureassociation. In our approach, specular reflections at flat surfaces (e.g., walls) are described in terms of virtual anchors (VAs). The positions of these VAs are unknown and possibly time-varying. We develop a Bayesian model of the SLAM problem including the unknown MPC-VA association. We represent this model by a factor graph, which enables the use of the belief propagation (BP) scheme for efficient marginalization of the joint posterior distribution. The resulting BP-based SLAM algorithm detects the VAs and estimates the time-varying position of the mobile agent and the possibly time-varying positions of the VAs, thereby leveraging the MPCs in the radio signal for improved accuracy and robustness of agent localization. A core aspect of the algorithm is BP-based probabilistic MPC-VA association. Moreover, for improved initialization of new VA positions, the states of unobserved potential VAs are modeled as a random finite set and propagated in time by means of a "zero-measurement" probability hypothesis density filter. The proposed BP-based SLAM algorithm has a low computational complexity and scales well in all relevant system parameters. Experimental results using both synthetically generated measurements and realultra-wideband radio signals demonstrate the excellent performance of the algorithm in challenging indoor environments.

Connected through hyperedge HE-1 (induced by source paper "shapes from echoes uniqueness from point to plane distance matrices"):
  with members:
    - "omnidirectional bats point to plane distances and the price of uniqueness"
    - "look no beacons optimal all in one echoslam"
    - "euclidean distance matrices essential theory algorithms and applications"

Connected through hyperedge HE-2 (induced by source paper "massive mimo based localization and mapping exploiting phase information of multipath components"):
  with members:
    - "a belief propagation algorithm for multipath based slam"
    - "direct localization for massive mimo"
    - "error bounds for uplink and downlink 3d localization in 5g mmwave systems"
    - "position and orientation estimation through millimeter wave mimo in 5g systems"
    - "measurement based wideband analysis of dynamic multipath propagation in vehicular communication scenarios"
    - "fingerprinting based positioning in distributed massive mimo systems"
    - "evaluation of position related information in multipath components for indoor positioning"
    - "scaling up mimo opportunities and challenges with very large arrays"

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)