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: "secure nested codes for type ii wiretap channels"
  Abstract: This paper considers the problem of secure coding design for a type II wiretap channel, where the main channel is noiseless and the eavesdropper channel is a general binary-input symmetric-output memoryless channel. The proposed secure error-correcting code has a nested code structure. Two secure nested coding schemes are studied for a type II Gaussian wiretap channel. The nesting is based on cosets of a good code sequence for the first scheme and on cosets of the dual of a good code sequence for the second scheme. In each case, the corresponding achievable rate-equivocation pair is derived based on the threshold behavior of good code sequences. The two secure coding schemes together establish an achievable rate-equivocation region, which almost covers the secrecy capacity-equivocation region in this case study. The proposed secure coding scheme is extended to a type II binary symmetric wiretap channel. A new achievable perfect secrecy rate, which improves upon the previously reported result by Thangaraj et al., is derived for this channel.

Connected through hyperedge HE-1 (induced by source paper "generalizing multiple access wiretap and wiretap ii channel models achievable rates and cost of strong secrecy"):
  with members:
    - "a new wiretap channel model and its strong secrecy capacity"
    - "semantic security capacity for wiretap channels of type ii"
    - "causal erasure channels"
    - "achievability proof via output statistics of random binning"
    - "information theoretically secure regenerating codes for distributed storage"
    - "the gaussian many to one interference channel with confidential messages"
    - "the role of feedback in two way secure communications"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"

Connected through hyperedge HE-2 (induced by source paper "a new wiretap channel model and its strong secrecy capacity"):
  with members:
    - "semantic security capacity for wiretap channels of type ii"
    - "distributed channel synthesis"
    - "achievability proof via output statistics of random binning"
    - "the gaussian many to one interference channel with confidential messages"
    - "capacity region of gaussian mimo broadcast channels with common and confidential messages"
    - "the role of feedback in two way secure communications"
    - "the gaussian multiple access wire tap channel"
    - "applications of ldpc codes to the wiretap channel"

Connected through hyperedge HE-3 (induced by source paper "arbitrarily varying wiretap channels with type constrained states"):
  with members:
    - "a new wiretap channel model and its strong secrecy capacity"
    - "a channel under simultaneous jamming and eavesdropping attack correlated random coding capacities under strong secrecy criteria"
    - "strong secrecy for cooperative broadcast channels"
    - "the arbitrarily varying wiretap channel secret randomness stability and super activation"
    - "on the continuity of the secrecy capacity of compound and arbitrarily varying wiretap channels"
    - "semantic security capacity for wiretap channels of type ii"
    - "the arbitrarily varying wiretap channel deterministic and correlated random coding capacities under the strong secrecy criterion"
    - "secrecy results for compound wiretap channels"

Connected through hyperedge HE-4 (induced by source paper "dynamic network control for confidential multi hop communications"):
  with members:
    - "on secure network coding with nonuniform or restricted wiretap sets"
    - "message passing for maximum weight independent set"
    - "towards the secrecy capacity of the gaussian mimo wire tap channel the 2 2 1 channel"

Connected through hyperedge HE-5 (induced by source paper "semantic security capacity for wiretap channels of type ii"):
  with members:
    - "secure multiplex coding with dependent and non uniform multiple messages"
    - "the likelihood encoder for lossy compression"
    - "soft covering with high probability"
    - "the henchman problem measuring secrecy by the minimum distortion in a list"
    - "a rate distortion based secrecy system with side information at the decoders"
    - "semantically secure coding scheme achieving the capacity of a gaussian wiretap channel"
    - "semantically secure lattice codes for the gaussian wiretap channel"
    - "the likelihood encoder for lossy source compression"

Connected through hyperedge HE-6 (induced by source paper "secure multiterminal source coding with side information at the eavesdropper"):
  with members:
    - "rate distortion with side information at many decoders"
    - "information theoretic proofs of entropy power inequalities"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "rate region of the gaussian scalar help vector source coding problem"
    - "secure lossy source coding with side information at the decoders"
    - "construction of wiretap codes from ordinary channel codes"
    - "lecture notes on network information theory"
    - "secure source coding with a helper"

Connected through hyperedge HE-7 (induced by source paper "control of wireless networks with secrecy"):
  with members:
    - "a secure communication game with a relay helping the eavesdropper"
    - "interference assisted secret communication"
    - "on cooperative relaying schemes for wireless physical layer security"
    - "joint relay and jammer selection for secure two way relay networks"
    - "the secrecy capacity region of the gaussian mimo multi receiver wiretap channel"
    - "optimal scheduling for fair resource allocation in ad hoc networks with elastic and inelastic traffic"
    - "towards the secrecy capacity of the gaussian mimo wire tap channel the 2 2 1 channel"
    - "robust rate adaptive wireless communication using ack nak feedback"

Connected through hyperedge HE-8 (induced by source paper "wireless secrecy in large scale networks"):
  with members:
    - "continuum percolation in the intrinsically secure communications graph"
    - "secure communication in stochastic wireless networks"
    - "techniques for enhanced physical layer security"
    - "on the relationship between the multi antenna secrecy communications and cognitive radio communications"
    - "on secrecy capacity scaling in wireless networks"
    - "secrecy in cooperative relay broadcast channels"
    - "the secrecy graph and some of its properties"
    - "secure communication over fading 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)