human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "performance limits in sensor localization"):
  Abstract: In this paper, we study the Cramer-Rao Lower Bound (CRLB) in single-hop sensor localization using measurements derived from received signal strength (RSS), time of arrival (TOA) and bearing, respectively, from a novel perspective. Differently from the existing work, we use a statistical sensor-anchor geometry modeling method, with the result that the trace of the associated CRLB matrix, as a scalar metric for performance limits of sensor localization, becomes a random variable. Given a probability measure for the sensor-anchor geometry, the statistical properties of the metric are analyzed to demonstrate properties of sensor localization. Using the Central Limit Theorems for U-statistics, we show that as the number of anchors increases, the metric is asymptotically normal in the RSS/bearing case, and converges to a random variable which is an affine transformation of a chi-square random variable of degree 2 in the TOA case. We provide formulas quantitatively describing the relationship among the mean and standard deviation of the metric, the number of the anchors, the parameters of communication channels, the noise statistics in measurements and the spatial distribution of the anchors. These formulas, though asymptotic in the number of the anchors, in many cases turn out to be remarkably accurate in predicting performance limits, even if the number is small. Simulations are carried out to confirm our results.

Includes members:
  Member "diland an algorithm for distributed sensor localization with noisy distance measurements":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "localization in internets of mobile agents a linear approach")
  Member "distributed sensor localization in random environments using minimal number of anchor nodes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "distributed joint sensor registration and multitarget tracking via sensor network")

Question: Please tell me which class the source paper 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.SY(Systems and Control)