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 cooperative relay broadcast channels"
  Abstract: We investigate the effects of user cooperation on the secrecy of broadcast channels by considering a cooperative relay broadcast channel. We show that user cooperation can increase the achievable secrecy region. We propose an achievable scheme that combines Marton's coding scheme for broadcast channels and Cover and El Gamal's compress-and-forward scheme for relay channels. We derive outer bounds for the rate-equivocation region using auxiliary random variables for single-letterization. Finally, we consider a Gaussian channel and show that both users can have positive secrecy rates, which is not possible for scalar Gaussian broadcast channels without cooperation.

Connected through hyperedge HE-1 (induced by source paper "broadcast channels with privacy leakage constraints"):
  with members:
    - "fourier motzkin elimination software for information theoretic inequalities"
    - "the likelihood encoder for lossy compression"
    - "wiretap channels with random states non causally available at the encoder"
    - "strong secrecy for cooperative broadcast channels"
    - "semantic security capacity for wiretap channels of type ii"
    - "secrecy capacity region of some classes of wiretap broadcast channels"
    - "a technique for deriving one shot achievability results in network information theory"
    - "effective secrecy reliability confusion and stealth"

Connected through hyperedge HE-2 (induced by source paper "secure communications for the two user broadcast channel with random traffic"):
  with members:
    - "wiretap channels nonasymptotic fundamental limits"
    - "exploiting full duplex receivers for achieving secret communications in multiuser miso networks"
    - "on secrecy metrics for physical layer security over quasi static fading channels"
    - "probabilistic cooperation of a full duplex relay in random access networks"
    - "finite blocklength bounds for wiretap channels"
    - "stable throughput region of the two user broadcast channel"
    - "the stability region of the two user broadcast channel"
    - "throughput analysis for full duplex wireless networks with imperfect self interference cancellation"

Connected through hyperedge HE-3 (induced by source paper "physical layer security of generalised pre coded spatial modulation with antenna scrambling"):
  with members:
    - "localisation communication and networking with vlc challenges and opportunities"
    - "adaptive coding and modulation for large scale antenna array based aeronautical communications in the presence of co channel interference"

Connected through hyperedge HE-4 (induced by source paper "strong secrecy for cooperative broadcast channels"):
  with members:
    - "broadcast channels with privacy leakage constraints"
    - "fourier motzkin elimination software for information theoretic inequalities"
    - "the likelihood encoder for lossy compression"
    - "duality of a source coding problem and the semi deterministic broadcast channel with rate limited cooperation"
    - "semantic security capacity for wiretap channels of type ii"
    - "secrecy capacity region of some classes of wiretap broadcast channels"
    - "on state dependent broadcast channels with cooperation"
    - "the henchman problem measuring secrecy by the minimum distortion in a list"

Connected through hyperedge HE-5 (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-6 (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"
    - "secrecy in the 2 user symmetric deterministic interference channel with 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"

Connected through hyperedge HE-7 (induced by source paper "the wiretapped diamond relay channel"):
  with members:
    - "secure degrees of freedom of one hop wireless networks with no eavesdropper csit"
    - "capacity bounds for diamond networks with an orthogonal broadcast channel"
    - "secure degrees of freedom of the gaussian diamond wiretap channel"
    - "secure degrees of freedom of one hop wireless networks"
    - "real interference alignment exploiting the potential of single antenna systems"
    - "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 the gaussian wiretap channel with helpers and no eavesdropper csi blind cooperative jamming"
    - "achievability proof via output statistics of random binning"

Connected through hyperedge HE-8 (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"
    - "secrecy in the 2 user symmetric deterministic interference channel with 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"

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)