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 regions of multiple access and interference channels the polytope structure"
  Abstract: In this paper, we determine the entire secure degrees of freedom (s.d.o.f.) regions of the K -user Gaussian multiple access (MAC) wiretap channel and the K -user interference chan- nel (IC) with secrecy constraints. For the IC, we consider three secrecy constraints: K-user IC with an external eavesdropper (IC- EE), K-user IC with confidential messages (IC-CM), and their combination Kuser IC with confidential messages and external eavesdropper (IC-CM-EE). The converse for the IC includes constraints both due to secrecy as well as due to interference. For the IC, although the portion of the region close to the optimum sum s.d.o.f. point is governed by the upper bounds due to secrecy constraints, the other portions of the region are governed by the upper bounds due to interference constraints. Different from the existing literature, in order to fully understand the characterization of the s.d.o.f. region of the IC, one has to study the four-user case, i.e., the two- or three-user cases do not illustrate the full generality of the problem. In order to prove the achievability, we use the polytope structure of the converse region. In both MAC and IC cases, we develop explicit schemes that achieve the extreme points of the polytope region given by the converse. In particular, the extreme points of the MAC region are achieved by an m-user MAC wiretap channel with K − m helpers, i.e., by setting K − m users' secure rates to zero and utilizing them as pure (structured) cooperative jammers. The extreme points of the IC region are achieved by a (K − m)-user IC with confidential messages, m helpers, and N external eavesdroppers, for m ≥ 1 and a finite N. A byproduct of our results in this paper is that the sum s.d.o.f. is achieved only at one extreme point of the s.d.o.f. region, which is the symmetric-rate extreme point, for both MAC and IC channel models.

Connected through hyperedge HE-1 (induced by source paper "mimo secret communications against an active eavesdropper"):
  with members:
    - "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"
    - "secure degrees of freedom of k user gaussian interference channels a unified view"

Connected through hyperedge HE-2 (induced by source paper "secure degrees of freedom of the multiple access wiretap channel with multiple antennas"):
  with members:
    - "secure degrees of freedom of one hop wireless networks with no eavesdropper csit"
    - "secure degrees of freedom for the mimo wire tap channel with a multi antenna cooperative jammer"
    - "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"
    - "on the secure dof of the single antenna mac"
    - "ergodic secret alignment"
    - "real interference alignment with real numbers"

Connected through hyperedge HE-3 (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 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"
    - "secure transmission with multiple antennas ii the mimome wiretap channel"

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)