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 source channel separation theorem with application to the source broadcast problem"
  Abstract: A converse method is developed for the source broadcast problem. Specifically, it is shown that the separation architecture is optimal for a variant of the source broadcast problem and the associated source-channel separation theorem can be leveraged, via a reduction argument, to establish a necessary condition for the original problem, which unifies several existing results in the literature. Somewhat surprisingly, this method, albeit based on the source-channel separation theorem, can be used to prove the optimality of non-separation based schemes and determine the performance limits in certain scenarios where the separation architecture is suboptimal.

Connected through hyperedge HE-1 (induced by source paper "low density majority codes and the problem of graceful degradation"):
  with members:
    - "a lower bound on the expected distortion of joint source channel coding"
    - "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"
    - "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 "a lower bound on the expected distortion of joint source channel coding"):
  with members:
    - "sequential empirical coordination under an output entropy constraint"
    - "outer bounds on the admissible source region for broadcast channels with correlated sources"
    - "wasserstein continuity of entropy and outer bounds for interference channels"
    - "quasi static multiple antenna fading channels at finite blocklength"
    - "moderate deviations in channel coding"
    - "lossy joint source channel coding in the finite blocklength regime"
    - "the dispersion of joint source channel coding"

Connected through hyperedge HE-3 (induced by source paper "on low density majority codes"):
  with members:
    - "a lower bound on the expected distortion of joint source channel coding"
    - "low complexity concatenated ldpc staircase codes"
    - "deep joint source channel coding for wireless image transmission"
    - "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-4 (induced by source paper "communicating correlated sources over an interference channel"):
  with members:
    - "communicating correlated sources over a mac in the absence of a g acs k orner common part"
    - "on joint source channel coding for correlated sources over multiple access relay channels"
    - "interference channels with arbitrarily correlated sources"

Connected through hyperedge HE-5 (induced by source paper "distortion bounds for source broadcast over degraded channel"):
  with members:
    - "comments on approximate characterizations for the gaussian source broadcast distortion region"
    - "outer bounds on the admissible source region for broadcast channels with correlated sources"
    - "hybrid coding an interface for joint source channel coding and network communication"
    - "achievability proof via output statistics of random binning"
    - "hybrid digital analog codes for source channel broadcast of gaussian sources over gaussian channels"
    - "the achievable distortion region of bivariate gaussian source on gaussian broadcast channel"
    - "on the capacity of the discrete memoryless broadcast channel with feedback"
    - "wyner ziv coding over broadcast channels digital schemes"

Connected through hyperedge HE-6 (induced by source paper "distortion bounds for source broadcast problem"):
  with members:
    - "comments on approximate characterizations for the gaussian source broadcast distortion region"
    - "distortion bounds for source broadcast over degraded channel"
    - "outer bounds on the admissible source region for broadcast channels with correlated sources"
    - "achievability proof via output statistics of random binning"
    - "hybrid digital analog codes for source channel broadcast of gaussian sources over gaussian channels"
    - "on the capacity of the discrete memoryless broadcast channel with feedback"
    - "wyner ziv coding over broadcast channels digital schemes"

Connected through hyperedge HE-7 (induced by source paper "broadcasting correlated vector gaussians"):
  with members:
    - "joint unitary triangularization for mimo networks"
    - "hybrid digital analog codes for source channel broadcast of gaussian sources over gaussian channels"
    - "hybrid coding for gaussian broadcast channels with gaussian sources"
    - "broadcasting correlated gaussians"
    - "vector gaussian multiple description with individual and central receivers"

Connected through hyperedge HE-8 (induced by source paper "matched multiuser gaussian source channel communications via uncoded schemes"):
  with members:
    - "outer bounds on the admissible source region for broadcast channels with correlated sources"
    - "optimality and approximate optimality of source channel separation in networks"
    - "approximate characterizations for the gaussian source broadcast distortion region"
    - "broadcasting correlated gaussians"

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)