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 analysis and optimal filter design for sigma delta modulation via duality with dpcm"):
  Abstract: Sampling above the Nyquist rate is at the heart of sigma-delta modulation, where the increase in sampling rate is translated to a reduction in the overall (mean-squared-error) reconstruction distortion. This is attained by using a feedback filter at the encoder, in conjunction with a low-pass filter at the decoder. The goal of this work is to characterize the optimal trade-off between the per-sample quantization rate and the resulting mean-squared-error distortion, under various restrictions on the feedback filter. To this end, we establish a duality relation between the performance of sigma-delta modulation, and that of differential pulse-code modulation when applied to (discrete-time) band-limited inputs. As the optimal trade-off for the latter scheme is fully understood, the full characterization for sigma-delta modulation, as well as the optimal feedback filters, immediately follow.

Includes members:
  Member "interactive schemes for the awgn channel with noisy feedback":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "feedback channel communication with low precision arithmetic")
  Member "the gaussian channel with noisy feedback near capacity performance via simple interaction":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "multi rate control over awgn channels via analog joint source channel coding")
  Member "precoded integer forcing universally achieves the mimo capacity to within a constant gap":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "semantically secure lattice codes for compound mimo channels")
  Member "improved upper bounds to the causal quadratic rate distortion function for gaussian stationary sources":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a converse bound characterization on zero delay indirect rdf for vector gauss markov sources")
  Member "achieving the gaussian rate distortion function by prediction":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the rate distortion function of asynchronously sampled memoryless cyclostationary gaussian processes")
  Member "multiple description coding by dithered delta sigma quantization":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "multi tenant c ran with spectrum pooling downlink optimization under privacy constraints")

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.IT(Information Theory)