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: "robust joint source channel coding for delay limited applications"
  Abstract: In this paper, we consider the problem of robust joint source-channel coding over an additive white Gaussian noise channel. We propose a new scheme which achieves the optimal slope of the signal-to-distortion (SDR) curve (unlike the previously known coding schemes). Also, we propose a family of robust codes which together maintain a bounded gap with the optimum SDR curve (in terms of dB). To show the importance of this result, we drive some theoretical bounds on the asymptotic performance of delay-limited hybrid digital-analog (HDA) coding schemes. We show that, unlike the delay-unlimited case, for any family of delay-limited HDA codes, the asymptotic performance loss is unbounded (in terms of dB).

Connected through hyperedge HE-1 (induced by source paper "joint unitary triangularization for mimo networks"):
  with members:
    - "physical layer mimo relaying"
    - "hybrid digital analog codes for source channel broadcast of gaussian sources over gaussian channels"
    - "analog matching of colored sources to colored channels"
    - "a framework for designing mimo systems with decision feedback equalization or tomlinson harashima precoding"

Connected through hyperedge HE-2 (induced by source paper "analog matching of colored sources to colored channels"):
  with members:
    - "compute and forward harnessing interference through structured codes"
    - "joint wyner ziv dirty paper coding by modulo lattice modulation"
    - "joint source channel coding with side information using hybrid digital analog codes"
    - "achieving the gaussian rate distortion function by prediction"
    - "shannon meets wiener ii on mmse estimation in successive decoding schemes"

Connected through hyperedge HE-3 (induced by source paper "a tight bound on the performance of a minimal delay joint source channel coding scheme"):
  with members:
    - "asymptotically optimal joint source channel coding with minimal delay"

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)