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: "on bandlimited field estimation from samples recorded by a location unaware mobile sensor"
  Abstract: Sampling of physical fields with mobile sensor is an emerging area. In this context, this work introduces and addresses some aspects of a  fundamental question : can a spatial field be estimated from samples taken at  unknown sampling locations ? In a field (signal) sampling setup, unknown sampling locations, sample quantization, unknown bandwidth of the field, and presence of measurement-noise present difficulties in the process of field estimation. In this work, except for quantization, the other three issues will be tackled together in a mobile-sampling framework. Spatially bandlimited fields are considered. It is assumed that  measurement-noise affected  field samples are collected on spatial locations obtained from an  unknown renewal process . That is, the samples are obtained on locations obtained from a renewal process, but the sampling locations and the renewal process distribution are unknown. In this challenging unknown sampling location setup, it is shown that the mean-squared error in field estimation decreases as    $O(1/n)$    where    $n$    is the average number of samples collected by the mobile sensor. The average number of samples collected is determined by the inter-sample spacing distribution in the renewal process. An algorithm to ascertain spatial field’s bandwidth is detailed, which works with high probability as the average number of samples    $n$    increases. This algorithm works in the same setup, i.e., in the presence of measurement-noise and unknown sampling locations.

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)