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: "approximate characterizations for the gaussian source broadcast distortion region"
  Abstract: We consider the joint source-channel coding problem of sending a Gaussian source on a K-user Gaussian broadcast channel with bandwidth mismatch. A new outer bound to the achievable distortion region is derived using the technique of introducing more than one additional auxiliary random variable, which was previously used to derive sum-rate lower bound for the symmetric Gaussian multiple description problem. By combining this outer bound with the achievability result based on source-channel separation, we provide approximate characterizations of the achievable distortion region within constant multiplicative factors. Furthermore, we show that the results can be extended to general broadcast channels, and the performance of the source-channel separation based approach is also within the same constant multiplicative factors of the optimum.

Connected through hyperedge HE-1 (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"
    - "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"

Connected through hyperedge HE-2 (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"
    - "hybrid digital analog codes for source channel broadcast of gaussian sources over gaussian channels"
    - "optimality and approximate optimality of source channel separation in networks"
    - "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-3 (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"
    - "hybrid digital analog codes for source channel broadcast of gaussian sources over gaussian channels"
    - "transmitting an analog gaussian source over a gaussian wiretap channel under snr mismatch"

Connected through hyperedge HE-4 (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"
    - "outer bounds on the admissible source region for broadcast channels with correlated sources"

Connected through hyperedge HE-5 (induced by source paper "outer bounds on the admissible source region for broadcast channels with correlated sources"):
  with members:
    - "evaluation of marton s inner bound for the general broadcast channel"
    - "a note on outer bounds for broadcast channel"
    - "the capacity region of classes of product broadcast channels"
    - "optimality and approximate optimality of source channel separation in networks"
    - "evaluation of marton s inner bound for the general broadcast channel"
    - "correlated sources over broadcast channels"
    - "outer bounds on the admissible source region for broadcast channels with dependent sources"
    - "comments on broadcast channels with arbitrarily correlated sources"

Connected through hyperedge HE-6 (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"
    - "outer bounds on the admissible source region for broadcast channels with correlated sources"
    - "optimality and approximate optimality of source channel separation in networks"
    - "broadcasting correlated gaussians"

Connected through hyperedge HE-7 (induced by source paper "an achievable rate region for the broadcast channel with feedback"):
  with members:
    - "feedback can double the prelog of some memoryless gaussian networks"
    - "on the capacity of the discrete memoryless broadcast channel with feedback"
    - "correlated sources over broadcast channels"
    - "comments on broadcast channels with arbitrarily correlated sources"
    - "a new achievable rate region for the discrete memoryless multiple access channel with noiseless feedback"
    - "broadcasting correlated gaussians"
    - "a graph based framework for transmission of correlated sources over broadcast channels"

Connected through hyperedge HE-8 (induced by source paper "hybrid digital analog codes for source channel broadcast of gaussian sources over gaussian channels"):
  with members:
    - "superimposed coded and uncoded transmissions of a gaussian source over the gaussian channel"

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)