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: "k user interference channels achievable secrecy rate and degrees of freedom"
  Abstract: In this work, we consider achievable secrecy rates for symmetric K-user (K ≥ 3) interference channels with confidential messages. We find that nested lattice codes and layered coding are useful in providing secrecy for these channels. Achievable secrecy rates are derived for very strong interference. In addition, we derive the secure degrees of freedom for a range of channel parameters. As a by-product of our approach, we also demonstrate that nested lattice codes are useful for K-user symmetric interference channels without secrecy constraints in that they yield higher degrees of freedom than previous results.

Connected through hyperedge HE-1 (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"
    - "interference alignment for secrecy"
    - "completely stale transmitter channel state information is still very useful"

Connected through hyperedge HE-2 (induced by source paper "secure degrees of freedom regions of multiple access and interference channels the polytope structure"):
  with members:
    - "secure degrees of freedom of one hop wireless networks"
    - "real interference alignment exploiting the potential of single antenna systems"
    - "secure degrees of freedom of the gaussian wiretap channel with helpers and no eavesdropper csi blind cooperative jamming"
    - "secure degrees of freedom of k user gaussian interference channels a unified view"
    - "interference alignment for secrecy"
    - "on the secure degrees of freedom of the multiple access channel"
    - "ergodic secret alignment"
    - "cooperation with an untrusted relay a secrecy perspective"

Connected through hyperedge HE-3 (induced by source paper "secure degrees of freedom of multi user networks one time pads in the air via alignment"):
  with members:
    - "secure degrees of freedom of one hop wireless networks"
    - "real interference alignment exploiting the potential of single antenna systems"
    - "secure degrees of freedom of the gaussian wiretap channel with helpers and no eavesdropper csi blind cooperative jamming"
    - "new results on multiple input multiple output broadcast channels with confidential messages"
    - "interference alignment for secrecy"
    - "strongly secure communications over the two way wiretap channel"
    - "on the secure degrees of freedom of the multiple access channel"
    - "ergodic secret alignment"

Connected through hyperedge HE-4 (induced by source paper "secure degrees of freedom for the mimo wire tap channel with a multi antenna cooperative jammer"):
  with members:
    - "secure degrees of freedom of one hop wireless networks with no eavesdropper csit"
    - "secure degrees of freedom regions of multiple access and interference channels the polytope structure"
    - "secure degrees of freedom of one hop wireless networks"
    - "real interference alignment exploiting the potential of single antenna systems"
    - "secure degrees of freedom of k user gaussian interference channels a unified view"
    - "interference assisted secret communication"
    - "strong secrecy from channel resolvability"
    - "cooperation with an untrusted relay a secrecy perspective"

Connected through hyperedge HE-5 (induced by source paper "secure degrees of freedom of one hop wireless networks"):
  with members:
    - "real interference alignment exploiting the potential of single antenna systems"
    - "secure degrees of freedom of the gaussian wiretap channel with helpers and no eavesdropper csi blind cooperative jamming"
    - "interference alignment for secrecy"
    - "mimo wiretap channels with arbitrarily varying eavesdropper channel states"
    - "on the secure degrees of freedom of the multiple access channel"
    - "ergodic secret alignment"
    - "cooperation with an untrusted relay a secrecy perspective"
    - "real interference alignment with real numbers"

Connected through hyperedge HE-6 (induced by source paper "secure degrees of freedom of k user gaussian interference channels a unified view"):
  with members:
    - "secure degrees of freedom of one hop wireless networks"
    - "real interference alignment exploiting the potential of single antenna systems"
    - "secure degrees of freedom of the gaussian wiretap channel with helpers and no eavesdropper csi blind cooperative jamming"
    - "interference alignment for secrecy"
    - "on the secure degrees of freedom of the multiple access channel"
    - "ergodic secret alignment"
    - "cooperation with an untrusted relay a secrecy perspective"
    - "real interference alignment with real numbers"

Connected through hyperedge HE-7 (induced by source paper "secure degrees of freedom of the gaussian wiretap channel with helpers and no eavesdropper csi blind cooperative jamming"):
  with members:
    - "secure degrees of freedom of one hop wireless networks"
    - "real interference alignment exploiting the potential of single antenna systems"
    - "artificial noise alignment for secure multicast using multiple antennas"
    - "interference alignment for secrecy"
    - "on the secure degrees of freedom of the multiple access channel"
    - "ergodic secret alignment"
    - "real interference alignment with real numbers"
    - "secure degrees of freedom for gaussian channels with interference structured codes outperform gaussian signaling"

Connected through hyperedge HE-8 (induced by source paper "the gaussian many to one interference channel with confidential messages"):
  with members:
    - "interference alignment for secrecy"
    - "interference assisted secret communication"
    - "the approximate capacity of the many to one and one to many gaussian interference channels"
    - "strong secrecy and reliable byzantine detection in the presence of an untrusted relay"
    - "providing secrecy with structured codes tools and applications to two user gaussian channels"
    - "providing secrecy with lattice codes"
    - "cooperative binning and channel prefixing for secrecy in interference channels"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"

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)