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: "a deterministic analysis of decimation for sigma delta quantization of bandlimited functions"
  Abstract: We study Sigma-Delta ($\Sigma\Delta$) quantization of oversampled bandlimited functions. We prove that digitally integrating blocks of bits and then down-sampling, a process known as decimation, can efficiently encode the associated $\Sigma\Delta$ bit-stream. It allows a large reduction in the bit-rate while still permitting good approximation of the underlying bandlimited function via an appropriate reconstruction kernel. Specifically, in the case of stable $r$th order $\Sigma\Delta$ schemes we show that the reconstruction error decays exponentially in the bit-rate. For example, this result applies to the 1-bit, greedy, first-order $\Sigma\Delta$ scheme.

Connected through hyperedge HE-1 (induced by source paper "adapted decimation on finite frames for arbitrary orders of sigma delta quantization"):
  with members:
    - "analysis of decimation on finite frames with sigma delta quantization"
    - "fast binary embeddings and quantized compressed sensing with structured matrices"
    - "distributed noise shaping quantization i beta duals of finite frames and near optimal quantization of random measurements"
    - "exact reconstruction of signals in evolutionary systems via spatiotemporal trade off"
    - "noise shaping quantization methods for frame based and compressive sampling systems"
    - "near optimal encoding for sigma delta quantization of finite frame expansions"

Connected through hyperedge HE-2 (induced by source paper "analysis of decimation on finite frames with sigma delta quantization"):
  with members:
    - "distributed noise shaping quantization i beta duals of finite frames and near optimal quantization of random measurements"
    - "exact reconstruction of signals in evolutionary systems via spatiotemporal trade off"
    - "noise shaping quantization methods for frame based and compressive sampling systems"

Connected through hyperedge HE-3 (induced by source paper "quantized compressed sensing for partial random circulant matrices"):
  with members:
    - "improved bounds for sparse recovery from subsampled random convolutions"
    - "from compressed sensing to compressed bit streams practical encoders tractable decoders"
    - "sigma delta quantization with harmonic frames and partial fourier ensembles"
    - "quantization of compressive samples with stable and robust recovery"
    - "an rip based approach to sigma delta quantization for compressed sensing"
    - "sigma delta quantization of sub gaussian frame expansions and its application to compressed sensing"
    - "one bit compressed sensing by linear programming"
    - "lower bounds for the error decay incurred by coarse quantization schemes"

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)