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: "secure degrees of freedom of k user gaussian interference channels a unified view"
  Abstract: We determine the exact sum secure degrees of freedom (d.o.f.) of the K-user Gaussian interference channel. We consider three different secrecy constraints: 1) K-user interference channel with one external eavesdropper (IC-EE), 2) K-user interference channel with confidential messages (IC-CM), and 3) K-user interference channel with confidential messages and one external eavesdropper (IC-CM-EE). We show that for all of these three cases, the exact sum secure d.o.f. is K(K-1)/(2K-1). We show converses for IC-EE and IC-CM, which imply a converse for IC-CM-EE. We show achievability for IC-CM-EE, which implies achievability for IC-EE and IC-CM. We develop the converses by relating the channel inputs of interfering users to the reliable rates of the interfered users, and by quantifying the secrecy penalty in terms of the eavesdroppers' observations. Our achievability uses structured signaling, structured cooperative jamming, channel prefixing, and asymptotic real interference alignment. While the traditional interference alignment provides some amount of secrecy by mixing unintended signals in a smaller sub-space at every receiver, in order to attain the optimum sum secure d.o.f., we incorporate structured cooperative jamming into the achievable scheme, and intricately design the structure of all of the transmitted signals jointly.

Connected through hyperedge HE-1 (induced by source paper "adding common randomness can remove the secrecy constraints in communication networks"):
  with members:
    - "secure communication over interference channel to jam or not to jam"
    - "adding a helper can totally remove the secrecy constraints in interference channel"
    - "optimal secure gdof of symmetric gaussian wiretap channel with a helper"
    - "secure degrees of freedom of one hop wireless networks with no eavesdropper csit"
    - "towards a constant gap sum capacity result for the gaussian wiretap channel with a helper"
    - "finite snr regime analysis of the gaussian wiretap multiple access channel"
    - "secure degrees of freedom of one hop wireless networks"
    - "real interference alignment exploiting the potential of single antenna systems"

Connected through hyperedge HE-2 (induced by source paper "secure retrospective interference alignment"):
  with members:
    - "secrecy in mimo networks with no eavesdropper csit"
    - "secure degrees of freedom region of the two user miso broadcast channel with alternating csit"
    - "secure degrees of freedom of one hop wireless networks"
    - "ergodic interference alignment with delayed feedback"
    - "on the degrees of freedom of k user siso interference and x channels with delayed csit"
    - "interference alignment for secrecy"
    - "completely stale transmitter channel state information is still very useful"
    - "ergodic secret alignment"

Connected through hyperedge HE-3 (induced by source paper "optimal secure gdof of symmetric gaussian wiretap channel with a helper"):
  with members:
    - "secure communication over interference channel to jam or not to jam"
    - "adding a helper can totally remove the secrecy constraints in interference channel"
    - "secure degrees of freedom of one hop wireless networks with no eavesdropper csit"
    - "on the optimality of secure communication without using cooperative jamming"
    - "towards a constant gap sum capacity result for the gaussian wiretap channel with a helper"
    - "the wiretapped diamond relay channel"
    - "finite snr regime analysis of the gaussian wiretap multiple access channel"
    - "secure degrees of freedom of one hop wireless networks"

Connected through hyperedge HE-4 (induced by source paper "on the secure degrees of freedom of the k user interference channel with delayed csit"):
  with members:
    - "secure retrospective interference alignment"
    - "secure degrees of freedom of one hop wireless networks with no eavesdropper csit"
    - "secrecy in mimo networks with no eavesdropper csit"
    - "ergodic interference alignment with delayed feedback"
    - "on the degrees of freedom of k user siso interference and x channels with delayed csit"
    - "interference alignment for secrecy"
    - "completely stale transmitter channel state information is still very useful"
    - "ergodic secret alignment"

Connected through hyperedge HE-5 (induced by source paper "secure communication over interference channel to jam or not to jam"):
  with members:
    - "secure degrees of freedom of one hop wireless networks with no eavesdropper csit"
    - "secure degrees of freedom of one hop wireless networks"
    - "real interference alignment exploiting the potential of single antenna systems"
    - "principles of physical layer security in multiuser wireless networks a survey"
    - "interference alignment for secrecy"
    - "interference alignment from degrees of freedom to constant gap capacity approximations"
    - "capacity bounds for broadcast channels with confidential messages"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"

Connected through hyperedge HE-6 (induced by source paper "secure degrees of freedom of one hop wireless networks with no eavesdropper csit"):
  with members:
    - "secure degrees of freedom of one hop wireless networks"
    - "real interference alignment exploiting the potential of single antenna systems"
    - "mimo broadcast channel with an unknown eavesdropper secrecy degrees of freedom"
    - "aligned image sets under channel uncertainty settling a conjecture by lapidoth shamai and wigger on the collapse of degrees of freedom under finite precision csit"
    - "wireless network information flow a deterministic approach"
    - "interference alignment for secrecy"
    - "interference assisted secret communication"
    - "ergodic secret alignment"

Connected through hyperedge HE-7 (induced by source paper "preserving confidentiality in the gaussian broadcast channel using compute and forward"):
  with members:
    - "security in the gaussian interference channel weak and moderately weak interference regimes"
    - "compute and forward can buy secrecy cheap"
    - "finite snr regime analysis of the gaussian wiretap multiple access channel"
    - "secure degrees of freedom of one hop wireless networks"
    - "real interference alignment exploiting the potential of single antenna systems"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "secure degrees of freedom for gaussian channels with interference structured codes outperform gaussian signaling"
    - "compute and forward harnessing interference through structured codes"

Connected through hyperedge HE-8 (induced by source paper "mimo secret communications against an active eavesdropper"):
  with members:
    - "secure degrees of freedom regions of multiple access and interference channels the polytope structure"
    - "linear precoding of data and artificial noise in secure massive mimo systems"
    - "improving wireless physical layer security via exploiting co channel interference"
    - "secure massive mimo transmission with an active eavesdropper"
    - "physical layer security for massive mimo an overview on passive eavesdropping and active attacks"
    - "secure massive mimo transmission in the presence of an active eavesdropper"
    - "secure degrees of freedom of one hop wireless networks"
    - "improving physical layer secrecy using full duplex jamming receivers"

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)