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: "secrecy in the 2 user symmetric deterministic interference channel with transmitter cooperation"
  Abstract: This work presents novel achievable schemes for the 2-user symmetric linear deterministic interference channel with limited-rate transmitter cooperation and perfect secrecy constraints at the receivers. The proposed achievable scheme consists of a combination of interference cancelation, relaying of the other user's data bits, time sharing, and transmission of random bits, depending on the rate of the cooperative link and the relative strengths of the signal and the interference. The results show, for example, that the proposed scheme achieves the same rate as the capacity without the secrecy constraints, in the initial part of the weak interference regime. Also, sharing random bits through the cooperative link can achieve a higher secrecy rate compared to sharing data bits, in the very high interference regime. The results highlight the importance of limited transmitter cooperation in facilitating secure communications over 2-user interference channels.

Connected through hyperedge HE-1 (induced by source paper "on the gaussian multiple access wiretap channel and the gaussian wiretap channel with a helper achievable schemes and upper bounds"):
  with members:
    - "secure degrees of freedom of one hop wireless networks with no eavesdropper csit"
    - "on the deterministic sum capacity of the multiple access wiretap channel"
    - "on multiuser gain and the constant gap sum capacity of the gaussian interfering multiple access channel"
    - "secure degrees of freedom of the multiple access wiretap channel with multiple antennas"
    - "towards a constant gap sum capacity result for the gaussian wiretap channel with a helper"
    - "secure degrees of freedom of the gaussian diamond wiretap 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 "on the secrecy capacity region of the 2 user z interference channel with unidirectional transmitter cooperation"):
  with members:
    - "outer bounds on the secrecy capacity region of the 2 user z interference channel with unidirectional transmitter cooperation"
    - "topological interference management through index coding"
    - "multiaccess channel with partially cooperating encoders and security constraints"
    - "interference alignment for secrecy"
    - "interference assisted secret communication"
    - "interference channels with source cooperation"
    - "interference mitigation through limited transmitter cooperation"
    - "the approximate capacity region of the gaussian z interference channel with conferencing encoders"

Connected through hyperedge HE-3 (induced by source paper "outer bounds on the secrecy capacity region of the 2 user z interference channel with unidirectional transmitter cooperation"):
  with members:
    - "on the secrecy capacity region of the 2 user z interference channel with unidirectional transmitter cooperation"
    - "multiaccess channel with partially cooperating encoders and security constraints"
    - "interference alignment for secrecy"
    - "interference assisted secret communication"
    - "interference channels with source cooperation"
    - "interference mitigation through limited transmitter cooperation"
    - "the approximate capacity region of the gaussian z interference channel with conferencing encoders"
    - "gaussian z interference channel with a relay link achievability region and asymptotic sum capacity"

Connected through hyperedge HE-4 (induced by source paper "joint power control in wiretap interference channels"):
  with members:
    - "secure degrees of freedom of one hop wireless networks"
    - "outage constrained robust secure transmission for miso wiretap channels"
    - "spectrum leasing via cooperation for enhanced physical layer secrecy"
    - "interference assisted secret communication"
    - "the gaussian many to one interference channel with confidential messages"
    - "cooperative secret communication with artificial noise in symmetric interference channel"
    - "on the relationship between the multi antenna secrecy communications and cognitive radio communications"
    - "on the secrecy rate of interference networks using structured codes"

Connected through hyperedge HE-5 (induced by source paper "on the capacity of the 2 user interference channel with transmitter cooperation and secrecy constraints"):
  with members:
    - "multiaccess channel with partially cooperating encoders and security constraints"
    - "interference alignment for secrecy"
    - "secret writing on dirty paper a deterministic view"
    - "interference assisted secret communication"
    - "interference mitigation through limited transmitter cooperation"
    - "interference mitigation through limited receiver cooperation"
    - "secrecy capacity of a class of orthogonal relay eavesdropper channels"
    - "secrecy in cooperative relay broadcast channels"

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)