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: "superimposed coded and uncoded transmissions of a gaussian source over the gaussian channel"
  Abstract: We propose to send a Gaussian source over an average-power limited additive white Gaussian noise channel by transmitting a linear combination of the source sequence and the result of its quantization using a high dimensional Gaussian vector quantizer. We show that, irrespective of the rate of the vector quantizer (assumed to be fixed and smaller than the channel's capacity), this transmission scheme is asymptotically optimal (as the quantizer's dimension tends to infinity) under the mean squared-error fidelity criterion. This generalizes the classical result of Goblick about the optimality of scaled uncoded transmission, which corresponds to choosing the rate of the vector quantizer as zero, and the classical source-channel separation approach, which corresponds to choosing the rate of the vector quantizer arbitrarily close to the capacity of the channel.

Connected through hyperedge HE-1 (induced by source paper "secure hybrid digital analog coding with side information at the receiver"):
  with members:
    - "secure joint source channel coding with side information"
    - "the secrecy capacity region of the degraded vector gaussian broadcast channel"
    - "transmitting an analog gaussian source over a gaussian wiretap channel under snr mismatch"
    - "on the secrecy capacity of fading channels"

Connected through hyperedge HE-2 (induced by source paper "hybrid digital analog codes for source channel broadcast of gaussian sources over gaussian channels"):
  with members:
    - "approximate characterizations for the gaussian source broadcast distortion region"

Connected through hyperedge HE-3 (induced by source paper "joint source channel coding with correlated interference"):
  with members:
    - "inner and outer bounds for the gaussian cognitive interference channel and new capacity results"
    - "the achievable distortion region of bivariate gaussian source on gaussian broadcast channel"
    - "hybrid coding for gaussian broadcast channels with gaussian sources"
    - "approximate characterizations for the gaussian source broadcast distortion region"
    - "joint source channel coding with side information using hybrid digital analog codes"
    - "broadcasting correlated gaussians"
    - "cognitive radio an information theoretic perspective"

Connected through hyperedge HE-4 (induced by source paper "secure joint source channel coding with side information"):
  with members:
    - "the secrecy capacity region of the degraded vector gaussian broadcast channel"
    - "transmitting an analog gaussian source over a gaussian wiretap channel under snr mismatch"
    - "on the secrecy capacity of fading channels"

Connected through hyperedge HE-5 (induced by source paper "joint source channel coding with side information using hybrid digital analog codes"):
  with members:
    - "analog matching of colored sources to colored channels"
    - "joint wyner ziv dirty paper coding by modulo lattice modulation"
    - "on the distortion snr exponent of some layered transmission schemes"
    - "joint source and channel coding for mimo systems is it better to be robust or quick"

Connected through hyperedge HE-6 (induced by source paper "sending a bi variate gaussian source over a gaussian mac"):
  with members:
    - "on the gaussian mac with imperfect feedback"
    - "a single letter upper bound for the sum rate of multiple access channels with correlated sources"
    - "rate region of the quadratic gaussian two encoder source coding problem"

Connected through hyperedge HE-7 (induced by source paper "sending a bi variate gaussian source over a gaussian mac"):
  with members:
    - "on the gaussian mac with imperfect feedback"
    - "a single letter upper bound for the sum rate of multiple access channels with correlated sources"
    - "rate region of the quadratic gaussian two encoder source coding problem"

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)