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: "cooperative simultaneous localization and synchronization in mobile agent networks"
  Abstract: Cooperative localization in agent networks based on interagent time-of-flight measurements is closely related to synchronization. To leverage this relation, we propose a Bayesian factor graph framework for  cooperative simultaneous localization and synchronization  (CoSLAS). This framework is suited to mobile agents and time-varying local clock parameters. Building on the CoSLAS factor graph, we develop a distributed (decentralized) belief propagation algorithm for CoSLAS in the practically important case of an affine clock model and asymmetric time stamping. Our algorithm is compatible with real-time operation and a time-varying network connectivity. To achieve high accuracy at reduced complexity and communication cost, the algorithm combines particle implementations with parametric message representations and takes advantage of a conditional independence property. Simulation results demonstrate the good performance of the proposed algorithm in a challenging scenario with time-varying network connectivity.

Connected through hyperedge HE-1 (induced by source paper "a belief propagation algorithm for multipath based slam"):
  with members:
    - "generalized optimal sub pattern assignment metric"
    - "a scalable algorithm for tracking an unknown number of targets using multiple sensors"
    - "variational bayesian inference of line spectra"
    - "marginal multi bernoulli filters rfs derivation of mht jipda and association based member"
    - "approximate evaluation of marginal association probabilities with belief propagation"
    - "evaluation of position related information in multipath components for indoor positioning"

Connected through hyperedge HE-2 (induced by source paper "cooperative network synchronization asymptotic analysis"):
  with members:
    - "on the outage probability of localization in randomly deployed wireless networks"
    - "a scalable algorithm for tracking an unknown number of targets using multiple sensors"
    - "modeling and analysis of cellular networks using stochastic geometry a tutorial"
    - "cooperative joint localization and clock synchronization based on gaussian message passing in asynchronous wireless networks"
    - "performance limits and geometric properties of array localization"
    - "distributed clock skew and offset estimation in wireless sensor networks asynchronous algorithm and convergence analysis"
    - "on stochastic geometry modeling of cellular uplink transmission with truncated channel inversion power control"
    - "power optimization for network localization"

Connected through hyperedge HE-3 (induced by source paper "a bayesian algorithm for distributed network localization using distance and direction data"):
  with members:
    - "joint device positioning and clock synchronization in 5g ultra dense networks"
    - "localization in mobile networks via virtual convex hulls"
    - "cooperative localization for mobile networks a distributed belief propagation mean field message passing algorithm"
    - "a tractable analysis of the improvement in unique localizability through collaboration"
    - "sub nanosecond time of flight on commercial wi fi cards"
    - "loopy belief propagation for approximate inference an empirical study"
    - "convergent message passing algorithms a unifying view"
    - "cooperative and distributed localization for wireless sensor networks in multipath environments"

Connected through hyperedge HE-4 (induced by source paper "cooperative network localization using hybrid range and angle measurements"):
  with members:
    - "a tractable analysis of the improvement in unique localizability through collaboration"
    - "loopy belief propagation for approximate inference an empirical study"
    - "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.DC(Distributed, Parallel, and Cluster Computing)