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: "hybrid digital analog codes for source channel broadcast of gaussian sources over gaussian channels"
  Abstract: The problem of broadcasting a parallel Gaussian source over an additive white Gaussian noise broadcast channel under the mean-squared error distortion criterion is studied. A hybrid digital-analog coding strategy which combines source coding with side information, channel coding with side information, layered source coding, and superposition broadcast channel coding is presented. When specialized to the open problem of broadcasting a white Gaussian source over an additive white Gaussian noise broadcast channel with bandwidth mismatch which has been the subject of several previous investigations, this coding scheme strictly improves on the state-of-the-art.

Connected through hyperedge HE-1 (induced by source paper "joint state estimation and communication over a state dependent gaussian multiple access channel"):
  with members:
    - "broadcasting information subject to state masking"
    - "hybrid analog digital channel estimation and beamforming training throughput tradeoff"
    - "causal state communication"
    - "state amplification subject to masking constraints"

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"
    - "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"
    - "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:
    - "outer bounds on the admissible source region for broadcast channels with correlated sources"
    - "broadcasting correlated vector gaussians"
    - "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 "joint source channel secrecy using uncoded schemes towards secure source broadcast"):
  with members:
    - "f divergence inequalities"
    - "source channel secrecy for shannon cipher system"
    - "distortion bounds for source broadcast over degraded channel"
    - "distortion bounds for source broadcast problem"
    - "the henchman problem measuring secrecy by the minimum distortion in a list"
    - "transmitting an analog gaussian source over a gaussian wiretap channel under snr mismatch"
    - "approximate characterizations for the gaussian source broadcast distortion region"

Connected through hyperedge HE-5 (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"
    - "outer bounds on the admissible source region for broadcast channels with correlated sources"
    - "achievability proof via output statistics of random binning"
    - "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 "broadcasting correlated vector gaussians"):
  with members:
    - "a source channel separation theorem with application to the source broadcast problem"
    - "joint unitary triangularization for mimo networks"
    - "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-7 (induced by source paper "on the minimum energy of sending gaussian multiterminal sources over the gaussian mac"):
  with members:
    - "the achievable distortion region of bivariate gaussian source on gaussian broadcast channel"
    - "rate region of the quadratic gaussian two encoder source coding problem"

Connected through hyperedge HE-8 (induced by source paper "joint unitary triangularization for mimo networks"):
  with members:
    - "physical layer mimo relaying"
    - "analog matching of colored sources to colored channels"
    - "robust joint source channel coding for delay limited applications"
    - "a framework for designing mimo systems with decision feedback equalization or tomlinson harashima precoding"

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)