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: "imperfect secrecy in wiretap channel ii"
  Abstract: In a point-to-point communication system which consists of a sender, a receiver and a set of noiseless channels, the sender wishes to transmit a private message to the receiver through the channels which may be eavesdropped by a wiretapper. The set of wiretap sets is arbitrary. The wiretapper can access any one but not more than one wiretap set. From each wiretap set, the wiretapper can obtain some partial information about the private message which is measured by the equivocation of the message given the symbols obtained by the wiretapper. The security strategy is to encode the message with some random key at the sender. Only the message is required to be recovered at the receiver. Under this setting, we define an achievable rate tuple consisting of the size of the message, the size of the key, and the equivocation for each wiretap set. We first prove a tight rate region when both the message and the key are required to be recovered at the receiver. Then we extend the result to the general case when only the message is required to be recovered at the receiver. Moreover, we show that even if stochastic encoding is employed at the sender, the message rate cannot be increased.

Connected through hyperedge HE-1 (induced by source paper "active secure coding based on eavesdropper behavior learning"):
  with members:
    - "a new wiretap channel model and its strong secrecy capacity"
    - "arbitrarily varying wiretap channels with type constrained states"
    - "polar coding for the general wiretap channel"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"

Connected through hyperedge HE-2 (induced by source paper "toward optimal secure distributed storage systems with exact repair"):
  with members:
    - "layered exact repair regenerating codes via embedded error correction and block designs"
    - "outer bounds for exact repair codes"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "new codes and inner bounds for exact repair in distributed storage systems"
    - "characterizing the rate region of the 4 3 3 exact repair regenerating codes"
    - "an improved outer bound on the storage repair bandwidth tradeoff of exact repair regenerating codes"
    - "data secrecy in distributed storage systems under exact repair"
    - "a solution to the network challenges of data recovery in erasure coded distributed storage systems a study on the facebook warehouse cluster"

Connected through hyperedge HE-3 (induced by source paper "correlated source coded sequences with compromised channel and source symbols using shannon s cipher system"):
  with members:
    - "secure transmission of sources over noisy channels with side information at the receivers"
    - "secure multiterminal source coding with side information at the eavesdropper"
    - "the shannon cipher system with a guessing wiretapper general sources"
    - "shannon s secrecy system with informed receivers and its application to systematic coding for wiretapped 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)