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: "the secrecy capacity region of the degraded vector gaussian broadcast channel"
  Abstract: In this paper, we consider a scenario where a source node wishes to broadcast two confidential messages for two respective receivers via a Gaussian MIMO broadcast channel. A wire-tapper also receives the transmitted signal via another MIMO channel. It is assumed that the channels are degraded and the wire-tapper has the worst channel. We establish the capacity region of this scenario. Our achievability scheme is a combination of the superposition of Gaussian codes and randomization within the layers which we will refer to as Secret Superposition Coding. For the outerbound, we use the notion of enhanced channel to show that the secret superposition of Gaussian codes is optimal. It is shown that we only need to enhance the channels of the legitimate receivers, and the channel of the eavesdropper remains unchanged.

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"
    - "transmitting an analog gaussian source over a gaussian wiretap channel under snr mismatch"
    - "superimposed coded and uncoded transmissions of a gaussian source over the gaussian channel"
    - "on the secrecy capacity of fading channels"

Connected through hyperedge HE-2 (induced by source paper "on the secure degrees of freedom of the multiple access channel"):
  with members:
    - "real interference alignment exploiting the potential of single antenna systems"
    - "on the secure dof of the single antenna mac"
    - "cooperation with an untrusted relay a secrecy perspective"
    - "secure transmission with multiple antennas ii the mimome wiretap channel"
    - "the secrecy capacity region of the gaussian mimo multi receiver wiretap channel"
    - "real interference alignment with real numbers"
    - "providing secrecy with structured codes tools and applications to two user gaussian channels"
    - "cooperative binning and channel prefixing for secrecy in interference channels"

Connected through hyperedge HE-3 (induced by source paper "secure joint source channel coding with side information"):
  with members:
    - "transmitting an analog gaussian source over a gaussian wiretap channel under snr mismatch"
    - "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 "the secrecy capacity region of the gaussian mimo broadcast channel"):
  with members:
    - "an extremal inequality motivated by multiterminal information theoretic problems"

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)