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: "on the secure dof of the single antenna mac"
  Abstract: A new achievability rate region for the secure discrete memoryless Multiple-Access-Channel (MAC) is presented. Thereafter, a novel secure coding scheme is proposed to achieve a positive Secure Degrees-of-Freedom (S-DoF) in the single-antenna MAC. This scheme converts the single-antenna system into a multiple-dimension system with fractional dimensions. The achievability scheme is based on the alignment of signals into a small sub-space at the eavesdropper, and the simultaneous separation of the signals at the intended receiver. Tools from the field of Diophantine Approximation in number theory are used to analyze the probability of error in the coding scheme.

Connected through hyperedge HE-1 (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-2 (induced by source paper "expanding the compute and forward framework unequal powers signal levels and multiple linear combinations"):
  with members:
    - "an achievable rate region for the three user interference channel based on coset codes"
    - "a joint typicality approach to algebraic network information theory"
    - "secure compute and forward in a bidirectional relay"
    - "secure degrees of freedom of one hop wireless networks"
    - "real interference alignment exploiting the potential of single antenna systems"
    - "multiple access via compute and forward"
    - "lattices over eisenstein integers for compute and forward"
    - "uplink downlink duality for integer forcing"

Connected through hyperedge HE-3 (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 regions of multiple access and interference channels the polytope structure"
    - "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"
    - "ergodic secret alignment"
    - "real interference alignment with real numbers"

Connected through hyperedge HE-4 (induced by source paper "resource allocation in a mac with and without security via game theoretic learning"):
  with members:
    - "learning equilibria of a stochastic game on gaussian interference channels with incomplete information"
    - "distributed learning policies for power allocation in multiple access channels"
    - "achievable secrecy sum rate in a fading mac wt with power control and without csi of eavesdropper"

Connected through hyperedge HE-5 (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"
    - "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"
    - "the secrecy capacity region of the degraded vector gaussian broadcast channel"
    - "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-6 (induced by source paper "on the secrecy degress of freedom of the multi antenna block fading wiretap channels"):
  with members:
    - "interference alignment for the multi antenna compound wiretap channel"
    - "exploiting channel correlations simple interference alignment schemes with no csit"
    - "on the degrees of freedom of the compound mimo broadcast channels with finite states"
    - "on the compound mimo broadcast channels with confidential messages"
    - "on the degrees of freedom of finite state compound wireless networks settling a conjecture by weingarten et al"
    - "on the secure degrees of freedom in the k user gaussian interference 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)