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: "outer bounds on the admissible source region for broadcast channels with correlated sources"
  Abstract: Two outer bounds on the admissible source region for broadcast channels with correlated sources are presented: the first one is strictly tighter than the existing outer bound by Gohari and Anantharam while the second one provides a complete characterization of the admissible source region in the case where the two sources are conditionally independent given the common part. These outer bounds are deduced from the general necessary conditions established for the lossy source broadcast problem via suitable comparisons between the virtual broadcast channel (induced by the source and the reconstructions) and the physical broadcast channel.

Connected through hyperedge HE-1 (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"
    - "a source channel separation theorem with application to the source broadcast problem"
    - "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-2 (induced by source paper "distortion bounds for source broadcast over degraded channel"):
  with members:
    - "a source channel separation theorem with application to the source broadcast problem"
    - "comments on approximate characterizations for the gaussian source broadcast distortion region"
    - "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-3 (induced by source paper "a source channel separation theorem with application to the source broadcast problem"):
  with members:
    - "broadcasting correlated vector gaussians"
    - "hybrid digital analog codes for source channel broadcast of gaussian sources over gaussian channels"
    - "optimality and approximate optimality of source channel separation in networks"
    - "approximate characterizations for the gaussian source broadcast distortion region"
    - "broadcasting correlated gaussians"
    - "an extremal inequality motivated by multiterminal information theoretic problems"
    - "vector gaussian multiple description with individual and central receivers"

Connected through hyperedge HE-4 (induced by source paper "distortion bounds for source broadcast problem"):
  with members:
    - "a source channel separation theorem with application to the source broadcast problem"
    - "comments on approximate characterizations for the gaussian source broadcast distortion region"
    - "distortion bounds for source broadcast over degraded channel"
    - "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-5 (induced by source paper "distortion bounds for transmitting correlated sources with common part over mac"):
  with members:
    - "distortion bounds for source broadcast over degraded channel"
    - "distortion bounds for source broadcast problem"
    - "a new data processing inequality and its applications in distributed source and channel coding"
    - "rate region of the quadratic gaussian two encoder source coding problem"

Connected through hyperedge HE-6 (induced by source paper "comments on approximate characterizations for the gaussian source broadcast distortion region"):
  with members:
    - "distortion bounds for source broadcast over degraded channel"
    - "distortion bounds for source broadcast problem"
    - "approximate characterizations for the gaussian source broadcast distortion region"

Connected through hyperedge HE-7 (induced by source paper "matched multiuser gaussian source channel communications via uncoded schemes"):
  with members:
    - "a source channel separation theorem with application to the source broadcast problem"
    - "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)