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: "cooperative binning and channel prefixing for secrecy in interference channels"
  Abstract: This paper investigates the fundamental performance limits of the two-user interference channel in the presence of an external eavesdropper. In this setting, we construct a n inner bound, to the secrecy capacity region, based on the idea of cooperative binning and channel prefixing in whic h the two users cooperatively design their binning codebooks and jointly optimize their channel prefixing distributions. Our achiev ability scheme also utilizes messagesplitting in order to allow for partial decoding of the inter ference at the non-intended receiver. Outer bounds are then derived and used to establish the optimality of the proposed scheme in certain cases. In the Gaussian case, the previously proposed cooperative jamming and noise-forwarding techniques are shown to be special cases of our proposed approach. Overall, our results provide structural insights on how the interference can be exploited to increase the secrecy capacity of wireless networks.

Connected through hyperedge HE-1 (induced by source paper "the two way wiretap channel achievable regions and experimental results"):
  with members:
    - "strongly secure communications over the two way wiretap channel"
    - "cooperation with an untrusted relay a secrecy perspective"
    - "lecture notes on network information theory"
    - "the wiretap channel with feedback encryption over the channel"
    - "achievable rates for two way wire tap channels"

Connected through hyperedge HE-2 (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"
    - "k user interference channels achievable secrecy rate and degrees of freedom"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"

Connected through hyperedge HE-3 (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"
    - "on the secure dof of the single antenna mac"
    - "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"

Connected through hyperedge HE-4 (induced by source paper "providing secrecy with structured codes tools and applications to two user gaussian channels"):
  with members:
    - "interference alignment for secrecy"
    - "the approximate capacity of the many to one and one to many gaussian interference channels"
    - "cooperation with an untrusted relay a secrecy perspective"
    - "the secrecy capacity region of the gaussian mimo multi receiver wiretap channel"
    - "on the degrees of freedom of the k user gaussian interference channel"
    - "providing secrecy with lattice codes"
    - "interference alignment with asymmetric complex signaling settling the host madsen nosratinia conjecture"
    - "compute and forward harnessing interference through structured codes"

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)