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: "interference alignment for secrecy"
  Abstract: This paper studies the frequency/time selective K-user Gaussian interference channel with secrecy constraints. Two distinct models, namely the interference channel with confidential messages and the interference channel with an external eavesdropper, are analyzed. The key difference between the two models is the lack of channel state information (CSI) of the external eavesdropper. Using interference alignment along with secrecy precoding, it is shown that each user can achieve non-zero secure degrees of freedom (DoF) for both cases. More precisely, the proposed coding scheme achieves [(K-2)/(2K-2)] secure DoF with probability one per user in the confidential messages model. For the external eavesdropper scenario, on the other hand, it is shown that each user can achieve [(K-2)/(2K)] secure DoF in the ergodic setting. Remarkably, these results establish the positive impact of interference on the secrecy capacity region of wireless networks.

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"
    - "secure degrees of freedom of k user gaussian interference channels a unified view"
    - "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"
    - "secure degrees of freedom of k user gaussian interference channels a unified view"
    - "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"
    - "secure degrees of freedom of k user gaussian interference channels a unified view"
    - "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 "adding a helper can totally remove the secrecy constraints in interference channel"):
  with members:
    - "secure communication over interference channel to jam or not to jam"
    - "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"
    - "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"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-7 (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"
    - "secure degrees of freedom of k user gaussian interference channels a unified view"
    - "wireless network information flow a deterministic approach"
    - "interference assisted secret communication"
    - "ergodic secret alignment"

Connected through hyperedge HE-8 (induced by source paper "on the optimality of secure communication without using cooperative jamming"):
  with members:
    - "secure degrees of freedom of one hop wireless networks with no eavesdropper csit"
    - "secure degrees of freedom of one hop wireless networks"
    - "principles of physical layer security in multiuser wireless networks a survey"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"
    - "gaussian interference channel capacity to within one bit"

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)