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: "collaborative high accuracy localization in mobile multipath environments"
  Abstract: We study the problem of high accuracy localization of mobile nodes in a multipath-rich environment where sub-meter accuracies are required. We employ a peer-to-peer framework where the vehicles/nodes can get pairwise multipath-degraded ranging estimates in local neighborhoods together with a fixed number of anchor nodes. The challenge is to overcome the multipath-barrier with redundancy in order to provide the desired accuracies especially under severe multipath conditions when the fraction of received signals corrupted by multipath is dominating. We invoke a analytical graphical model framework based on particle filtering and reveal its high accuracy localization promise through simulations. We also address design questions such as "How many anchors and what fraction of line-of-sight (LOS) measurements are needed to achieve a specified target accuracy?", by analytically characterizing the performance improvement in localization accuracy as a function of the number of nodes in the network and the fraction of LOS measurements. In particular, for a static node placement, we show that the Cramer-Rao Lower Bound (CRLB), a fundamental lower bound on the localization accuracy, can be expressed as a product of two factors - a scalar function that depends only on the parameters of the noise distribution and a matrix that depends only on the geometry of node locations and the underlying connectivity graph. Further, a simplified expression is obtained for the CRLB that helps deduce the scaling behavior of the estimation error as a function of the number of agents and anchors in the network. The bound suggests that even a small fraction of LOS measurements can provide significant improvements. Conversely, a small fraction of NLOS measurements can significantly degrade the performance. The analysis is extended to the mobile setting and the performance is compared with the derived CRLB.

Connected through hyperedge HE-1 (induced by source paper "cooperative joint localization and clock synchronization based on gaussian message passing in asynchronous wireless networks"):
  with members:
    - "cooperative synchronization in wireless networks"
    - "merging belief propagation and the mean field approximation a free energy approach"
    - "operations for learning with graphical models"

Connected through hyperedge HE-2 (induced by source paper "distributed localization of a rf target in nlos environments"):
  with members:
    - "cooperative and distributed localization for wireless sensor networks in multipath environments"

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.NI(Networking and Internet Architecture)