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: "interference channels with strong secrecy"
  Abstract: It is known that given the real sum of two independent uniformly distributed lattice points from the same nested lattice codebook, the eavesdropper can obtain at most 1 bit of information per channel regarding the value of one of the lattice points. In this work, we study the effect of this 1 bit information on the equivocation expressed in three commonly used information theoretic measures, i.e., the Shannon entropy, the Renyi entropy and the min entropy. We then demonstrate its applications in an interference channel with a confidential message. In our previous work, we showed that nested lattice codes can outperform Gaussian codes for this channel when the achieved rate is measured with the weak secrecy notion. Here, with the Renyi entropy and the min entropy measure, we prove that the same secure degree of freedom is achievable with the strong secrecy notion as well. A major benefit of the new coding scheme is that the strong secrecy is generated from a single lattice point instead of a sequence of lattice points. Hence the mutual information between the confidential message and the observation of the eavesdropper decreases much faster with the number of channel uses than previously known strong secrecy coding methods for nested lattice codes.

Connected through hyperedge HE-1 (induced by source paper "perfect secrecy in physical layer network coding systems from structured interference"):
  with members:
    - "secure compute and forward in a bidirectional relay"
    - "secure degrees of freedom of one hop wireless networks"
    - "feasibility of interference alignment for the mimo interference channel"
    - "strong secrecy in wireless network coding systems with m qam modulators"
    - "five disruptive technology directions for 5g"
    - "degrees of freedom for the mimo multi way relay channel"
    - "reliable physical layer network coding"
    - "interference alignment for secrecy"

Connected through hyperedge HE-2 (induced by source paper "strong secrecy in wireless network coding systems with m qam modulators"):
  with members:
    - "reliable physical layer network coding"
    - "interference assisted secret communication"
    - "compute and forward harnessing interference through structured codes"

Connected through hyperedge HE-3 (induced by source paper "secure multiplex coding over interference channel with confidential messages"):
  with members:
    - "exponential decreasing rate of leaked information in universal random privacy amplification"
    - "secure multiplex coding with a common message"
    - "secure multiplex network coding"
    - "strong security and separated code constructions for the broadcast channels with confidential messages"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"
    - "secure multiplex coding to attain the channel capacity in wiretap 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)