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 lower bound on the expected distortion of joint source channel coding"
  Abstract: We consider the classic joint source-channel coding problem of transmitting a memoryless source over a memoryless channel. The focus of this work is on the long-standing open problem of finding the rate of convergence of the smallest attainable expected distortion to its asymptotic value, as a function of blocklength $n$. Our main result is that in general the convergence rate is not faster than $n^{-1/2}$. In particular, we show that for the problem of transmitting i.i.d uniform bits over a binary symmetric channels with Hamming distortion, the smallest attainable distortion (bit error rate) is at least $\Omega(n^{-1/2})$ above the asymptotic value, if the ``bandwidth expansion ratio'' is above $1$.

Connected through hyperedge HE-1 (induced by source paper "low density majority codes and the problem of graceful degradation"):
  with members:
    - "low complexity concatenated ldpc staircase codes"
    - "comparison of channels criteria for domination by a symmetric channel"
    - "deep joint source channel coding for wireless image transmission"
    - "strong data processing inequalities for channels and bayesian networks"
    - "a source channel separation theorem with application to the source broadcast problem"
    - "protograph based raptor like ldpc codes"
    - "intermediate performance of rateless codes"
    - "lossy source encoding via message passing and decimation over generalized codewords of ldgm codes"

Connected through hyperedge HE-2 (induced by source paper "on low density majority codes"):
  with members:
    - "low complexity concatenated ldpc staircase codes"
    - "deep joint source channel coding for wireless image transmission"
    - "a source channel separation theorem with application to the source broadcast problem"
    - "protograph based raptor like ldpc codes"
    - "intermediate performance of rateless codes"
    - "lossy source encoding via message passing and decimation over generalized codewords of ldgm codes"

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)