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 "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$.

Includes members:
  Member "sequential empirical coordination under an output entropy constraint":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "empirical coordination with multiple descriptions")
  Member "a source channel separation theorem with application to the source broadcast problem":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "low density majority codes and the problem of graceful degradation")
  Member "outer bounds on the admissible source region for broadcast channels with correlated sources":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "distortion bounds for source broadcast over degraded channel")
  Member "wasserstein continuity of entropy and outer bounds for interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "unifying the brascamp lieb inequality and the entropy power inequality")
  Member "quasi static multiple antenna fading channels at finite blocklength":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "robust urllc packet scheduling of ofdm systems")
  Member "moderate deviations in channel coding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "optimal resolution of change point detection with empirically observed statistics and erasures")
  Member "lossy joint source channel coding in the finite blocklength regime":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "finite sample analysis of image registration")
  Member "the dispersion of joint source channel coding":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "the dispersion of the gauss markov source")

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)