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: "transmitting an analog gaussian source over a gaussian wiretap channel under snr mismatch"
  Abstract: In this work we study encoding/decoding schemes for the transmission of a discrete time analog Gaussian source over a Gaussian wiretap channel. The intended receiver is assumed to have a certain minimum signal to noise ratio (SNR) and the eavesdropper is assumed to have a strictly lower SNR compared to the intended receiver. For a fixed information leakage to the eavesdropper, we are interested in minimizing the distortion in source reconstruction at the intended receiver, and we propose joint source channel coding (JSCC) schemes for this setup. For a fixed information leakage to the eavesdropper, we also show that the schemes considered give a graceful degradation of distortion with SNR under SNR mismatch, i.e., when the actual channel SNR is observed to be different from the design SNR.

Connected through hyperedge HE-1 (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"
    - "approximate characterizations for the gaussian source broadcast distortion region"

Connected through hyperedge HE-2 (induced by source paper "source channel secrecy for shannon cipher system"):
  with members:
    - "joint source channel secrecy using uncoded schemes towards secure source broadcast"
    - "joint source channel secrecy using hybrid coding"
    - "the henchman problem measuring secrecy by the minimum distortion in a list"
    - "secure transmission of sources over noisy channels with side information at the receivers"
    - "information spectrum approach to strong converse theorems for degraded wiretap channels"
    - "information spectrum approach to the source channel separation theorem"
    - "lossy joint source channel coding in the finite blocklength regime"

Connected through hyperedge HE-3 (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"
    - "superimposed coded and uncoded transmissions of a gaussian source over the gaussian channel"
    - "on the secrecy capacity of fading channels"

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"
    - "superimposed coded and uncoded transmissions of a gaussian source over the gaussian channel"
    - "on the secrecy capacity of fading channels"

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)