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: "diland an algorithm for distributed sensor localization with noisy distance measurements"
  Abstract: We present an algorithm for distributed sensor localization with noisy distance measurements (DILAND) that extends and makes the DLRE more robust. DLRE is a distributed sensor localization algorithm in Rm (m ? 1) introduced in our previous work (IEEE Trans. Signal Process., vol. 57, no. 5, pp. 2000-2016, May 2009). DILAND operates when: 1) the communication among the sensors is noisy; 2) the communication links in the network may fail with a nonzero probability; and 3) the measurements performed to compute distances among the sensors are corrupted with noise. The sensors (which do not know their locations) lie in the convex hull of at least m + 1 anchors (nodes that know their own locations). Under minimal assumptions on the connectivity and triangulation of each sensor in the network, we show that, under the broad random phenomena described above, DILAND converges almost surely (a.s.) to the exact sensor locations.

Connected through hyperedge HE-1 (induced by source paper "localization in internets of mobile agents a linear approach"):
  with members:
    - "an opportunistic linear convex algorithm for localization in mobile robot networks"
    - "localization in mobile networks via virtual convex hulls"
    - "higher dimensional consensus learning in large scale networks"
    - "fundamental limits of wideband localization part i a general framework"
    - "distributed sensor localization in random environments using minimal number of anchor nodes"
    - "distributed consensus algorithms in sensor networks quantized data and random link failures"

Connected through hyperedge HE-2 (induced by source paper "a bayesian algorithm for distributed network localization using distance and direction data"):
  with members:
    - "cooperative simultaneous localization and synchronization in mobile agent networks"
    - "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"

Connected through hyperedge HE-3 (induced by source paper "locdyn robust distributed localization for mobile underwater networks"):
  with members:
    - "distributed maximum likelihood sensor network localization"
    - "a spectral learning approach to range only slam"

Connected through hyperedge HE-4 (induced by source paper "cloud k svd a collaborative dictionary learning algorithm for big distributed data"):
  with members:
    - "dictionary learning over distributed models"
    - "multitask diffusion adaptation over networks"
    - "perturbation analysis of orthogonal matching pursuit"
    - "generalized principal component analysis gpca"
    - "hybrid linear modeling via local best fit flats"
    - "diffusion strategies outperform consensus strategies for distributed estimation over adaptive networks"
    - "distributed sensor localization in random environments using minimal number of anchor nodes"

Connected through hyperedge HE-5 (induced by source paper "mobile node localization via pareto optimization algorithm and fundamental performance limitations"):
  with members:
    - "fundamental limits of wideband localization part ii cooperative networks"
    - "fundamental limits of wideband localization part i a general framework"
    - "distributed sensor localization in random environments using minimal number of anchor nodes"

Connected through hyperedge HE-6 (induced by source paper "localization and tracking in mobile networks virtual convex hulls and beyond"):
  with members:
    - "asymptotic stability of stochastic ltv systems with applications to distributed dynamic fusion"
    - "a new distributed localization method for sensor networks"

Connected through hyperedge HE-7 (induced by source paper "large scale sensor network localization via rigid subnetwork registration"):
  with members:
    - "global registration of multiple point clouds using semidefinite programming"

Connected through hyperedge HE-8 (induced by source paper "distributed maximum likelihood sensor network localization"):
  with members:
    - "asynchronous distributed optimization using a randomized alternating direction method of multipliers"
    - "stochastic admm for nonsmooth optimization"

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)