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: "multiple description coding by dithered delta sigma quantization"
  Abstract: We address the connection between the multiple-description (MD) problem and Delta-Sigma quantization. The inherent redundancy due to oversampling in Delta-Sigma quantization, and the simple linear-additive noise model resulting from dithered lattice quantization, allow us to construct a symmetric and time-invariant MD coding scheme. We show that the use of a noise shaping filter makes it possible to trade off central distortion for side distortion. Asymptotically as the dimension of the lattice vector quantizer and order of the noise shaping filter approach infinity, the entropy rate of the dithered Delta-Sigma quantization scheme approaches the symmetric two-channel MD rate-distortion function for a memoryless Gaussian source and MSE fidelity criterion, at any side-to-central distortion ratio and any resolution. In the optimal scheme, the infinite-order noise shaping filter must be minimum phase and have a piece-wise flat power spectrum with a single jump discontinuity. An important advantage of the proposed design is that it is symmetric in rate and distortion by construction, so the coding rates of the descriptions are identical and there is therefore no need for source splitting.

Connected through hyperedge HE-1 (induced by source paper "multi tenant c ran with spectrum pooling downlink optimization under privacy constraints"):
  with members:
    - "optimization of massive full dimensional mimo for positioning and communication"
    - "inter operator base station coordination in spectrum shared millimeter wave cellular networks"
    - "cross layer design for downlink multihop cloud radio access networks with network coding"
    - "joint base station clustering and beamforming for non orthogonal multicast and unicast transmission with backhaul constraints"
    - "on the optimal fronthaul compression and decoding strategies for uplink cloud radio access networks"
    - "multivariate fronthaul quantization for downlink c ran"
    - "content centric sparse multicast beamforming for cache enabled cloud ran"
    - "robust group sparse beamforming for multicast green cloud ran with imperfect csi"

Connected through hyperedge HE-2 (induced by source paper "performance analysis and optimal filter design for sigma delta modulation via duality with dpcm"):
  with members:
    - "interactive schemes for the awgn channel with noisy feedback"
    - "the gaussian channel with noisy feedback near capacity performance via simple interaction"
    - "precoded integer forcing universally achieves the mimo capacity to within a constant gap"
    - "improved upper bounds to the causal quadratic rate distortion function for gaussian stationary sources"
    - "achieving the gaussian rate distortion function by prediction"

Connected through hyperedge HE-3 (induced by source paper "on constrained randomized quantization"):
  with members:
    - "scalar quantization with random thresholds"
    - "gossip algorithms for distributed signal processing"
    - "distributed consensus algorithms in sensor networks quantized data and random link failures"
    - "achieving the gaussian rate distortion function by prediction"

Connected through hyperedge HE-4 (induced by source paper "sampling versus random binning for multiple descriptions of a bandlimited source"):
  with members:
    - "achieving the gaussian rate distortion function by prediction"

Connected through hyperedge HE-5 (induced by source paper "frequency domain min max optimization of noise shaping delta sigma modulators"):
  with members:
    - "min max design of fir digital filters by semidefinite programming"
    - "signal reconstruction via h infty sampled data control theory beyond the shannon paradigm"
    - "lower bounds for the error decay incurred by coarse quantization schemes"

Connected through hyperedge HE-6 (induced by source paper "n channel asymmetric entropy constrained multiple description lattice vector quantization"):
  with members:
    - "approximating the gaussian multiple description rate region under symmetric distortion constraints"
    - "lattices for distributed source coding jointly gaussian sources and reconstruction of a linear function"
    - "multiple description lattice vector quantization"
    - "n channel entropy constrained multiple description lattice vector quantization"
    - "multiple description quantization via gram schmidt orthogonalization"
    - "vector gaussian multiple description with individual and central receivers"
    - "index assignment for multichannel communication under failure"

Connected through hyperedge HE-7 (induced by source paper "colored gaussian multiple descriptions spectral domain characterization and time domain design"):
  with members:
    - "achieving the gaussian rate distortion function by prediction"
    - "multiple description quantization via gram schmidt orthogonalization"
    - "on the role of mmse estimation in approaching the information theoretic limits of linear gaussian channels shannon meets wiener"

Connected through hyperedge HE-8 (induced by source paper "colored gaussian multiple descriptions spectral and time domain forms"):
  with members:
    - "achieving the gaussian rate distortion function by prediction"
    - "on the role of mmse estimation in approaching the information theoretic limits of linear gaussian channels shannon meets wiener"

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)