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: "construction of wiretap codes from ordinary channel codes"
  Abstract: From an arbitrary given channel code over a discrete or Gaussian memoryless channel, we construct a wiretap code with the strong security. Our construction can achieve the wiretap capacity under mild assumptions. The key tool is the new privacy amplification theorem bounding the eavesdropped information in terms of the Gallager function.

Connected through hyperedge HE-1 (induced by source paper "explicit codes for the wiretap channel a unified design framework"):
  with members:
    - "a new wiretap channel model and its strong secrecy capacity"
    - "empirical and strong coordination via soft covering with polar codes"
    - "coding schemes for achieving strong secrecy at negligible cost"
    - "semantic security capacity for wiretap channels of type ii"
    - "achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component"
    - "polar coding for the broadcast channel with confidential messages a random binning analogy"
    - "how to achieve the capacity of asymmetric channels"
    - "an information theoretic approach to secret sharing"

Connected through hyperedge HE-2 (induced by source paper "physical layer security for rf satellite channels in the finite length regime"):
  with members:
    - "two way physical layer security protocol for gaussian channels"
    - "free space optical channel estimation for physical layer security"
    - "secure multiplex coding with dependent and non uniform multiple messages"
    - "information theoretic physical layer security for satellite channels"
    - "empirical and strong coordination via soft covering with polar codes"
    - "quantum inspired secure wireless communication protocol under spatial and local gaussian noise assumptions"
    - "secure wireless communication under spatial and local gaussian noise assumptions"
    - "joint power control in wiretap interference channels"

Connected through hyperedge HE-3 (induced by source paper "on secure communication using rf energy harvesting two way untrusted relay"):
  with members:
    - "interference aided energy harvesting cognitive relaying with multiple primary transceivers"
    - "secure communication via a wireless energy harvesting untrusted relay"
    - "joint power splitting and secure beamforming design in the wireless powered untrusted relay networks"
    - "secure communication via an untrusted non regenerative relay in fading channels"
    - "relaying protocols for wireless energy harvesting and information processing"
    - "wireless information and power transfer in two way amplify and forward relaying channels"
    - "wireless information and power transfer architecture design and rate energy tradeoff"
    - "robust beamforming for wireless information and power transmission"

Connected through hyperedge HE-4 (induced by source paper "secure multiplex coding with dependent and non uniform multiple messages"):
  with members:
    - "operational interpretation of renyi information measures via composite hypothesis testing against product and markov distributions"
    - "tight exponential analysis of universally composable privacy amplification and its applications"
    - "exponential decreasing rate of leaked information in universal random privacy amplification"
    - "secure multiplex coding with a common message"
    - "universal strongly secure network coding with dependent and non uniform messages"
    - "universally attainable error and information exponents and equivocation rate for the broadcast channels with confidential messages"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "information spectrum approach to second order coding rate in channel coding"

Connected through hyperedge HE-5 (induced by source paper "achieving secrecy capacity of the gaussian wiretap channel with polar lattices"):
  with members:
    - "covert communication over noisy channels a resolvability perspective"
    - "polar lattices for lossy compression"
    - "construction of capacity achieving lattice codes polar lattices"
    - "achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component"
    - "polar coding for the general wiretap channel"
    - "semantically secure lattice codes for the gaussian wiretap channel"
    - "how to achieve the capacity of asymmetric channels"
    - "achieving awgn channel capacity with lattice gaussian coding"

Connected through hyperedge HE-6 (induced by source paper "the mimo wiretap channel decomposed"):
  with members:
    - "optimal signaling for secure communications over gaussian mimo wiretap channels"
    - "an algorithm for global maximization of secrecy rates in gaussian mimo wiretap channels"
    - "joint unitary triangularization for gaussian multi user mimo networks"
    - "semantically secure coding scheme achieving the capacity of a gaussian wiretap channel"
    - "joint unitary triangularization for mimo networks"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "strong secrecy from channel resolvability"
    - "the secrecy capacity of the mimo wiretap channel"

Connected through hyperedge HE-7 (induced by source paper "on mmse properties of codes for the gaussian broadcast and wiretap channels"):
  with members:
    - "polar coding for the broadcast channel with confidential messages and constrained randomization"
    - "polynomial time semantically secure encryption achieving the secrecy capacity"
    - "mmse of bad codes"
    - "statistical physics of signal estimation in gaussian noise theory and examples of phase transitions"
    - "estimation in gaussian noise properties of the minimum mean square error"
    - "the secrecy capacity of the mimo wiretap channel"
    - "mutual information and minimum mean square error in gaussian channels"

Connected through hyperedge HE-8 (induced by source paper "universal hashing for information theoretic security"):
  with members:
    - "secure multiplex coding with dependent and non uniform multiple messages"
    - "equivocations exponents and second order coding rates under various r enyi information measures"
    - "converses for secret key agreement and secure computing"
    - "secret key agreement general capacity and second order asymptotics"
    - "achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component"
    - "a new upperbound for the oblivious transfer capacity of discrete memoryless channels"
    - "strong converse for a degraded wiretap channel via active hypothesis testing"
    - "semantically secure lattice codes for the gaussian wiretap 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)