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 network coding for wiretap networks of type ii"
  Abstract: We consider the problem of securing a multicast network against a wiretapper that can intercept the packets on a limited number of arbitrary network edges of its choice. We assume that the network employs the network coding technique to simultaneously deliver the packets available at the source to all the receivers. #R##N#We show that this problem can be looked at as a network generalization of the wiretap channel of type II introduced in a seminal paper by Ozarow and Wyner. In particular, we show that the transmitted information can be secured by using the Ozarow-Wyner approach of coset coding at the source on top of the existing network code. This way, we quickly and transparently recover some of the results available in the literature on secure network coding for wiretap networks. Moreover, we derive new bounds on the required alphabet size that are independent of the network size and devise an algorithm for the construction of secure network codes. We also look at the dual problem and analyze the amount of information that can be gained by the wiretapper as a function of the number of wiretapped edges.

Connected through hyperedge HE-1 (induced by source paper "relative generalized rank weight of linear codes and its applications to network coding"):
  with members:
    - "generalized rank weights a duality statement"
    - "new parameters of linear codes expressing security performance of universal secure network coding"
    - "universal secure network coding via rank metric codes"
    - "secure multiplex network coding"
    - "vulnerability of mrd code based universal secure network coding against stronger eavesdroppers"
    - "on metrics for error correction in network coding"
    - "mds codes on the erasure erasure wiretap channel"
    - "a rank metric approach to error control in random network coding"

Connected through hyperedge HE-2 (induced by source paper "data secrecy in distributed storage systems under exact repair"):
  with members:
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "xoring elephants novel erasure codes for big data"
    - "zigzag codes mds array codes with optimal rebuilding"
    - "an improved sub packetization bound for minimum storage regenerating codes"
    - "distributed storage codes with repair by transfer and nonachievability of interior points on the storage bandwidth tradeoff"
    - "regenerating codes for errors and erasures in distributed storage"
    - "interference alignment in regenerating codes for distributed storage necessity and code constructions"
    - "access vs bandwidth in codes for storage"

Connected through hyperedge HE-3 (induced by source paper "routing for security in networks with adversarial nodes"):
  with members:
    - "universal secure network coding via rank metric codes"
    - "network codes resilient to jamming and eavesdropping"
    - "a rank metric approach to error control in random network coding"
    - "information inequalities for joint distributions with interpretations and applications"

Connected through hyperedge HE-4 (induced by source paper "new parameters of linear codes expressing security performance of universal secure network coding"):
  with members:
    - "universal secure network coding via rank metric codes"
    - "secure multiplex network coding"
    - "on metrics for error correction in network coding"
    - "mds codes on the erasure erasure wiretap channel"

Connected through hyperedge HE-5 (induced by source paper "lists that are smaller than their parts a coding approach to tunable secrecy"):
  with members:
    - "universal secure network coding via rank metric codes"
    - "source coding with side information using list decoding"
    - "random linear network coding a free cipher"

Connected through hyperedge HE-6 (induced by source paper "universal strongly secure network coding with dependent and non uniform messages"):
  with members:
    - "universal secure network coding via rank metric codes"
    - "exponential decreasing rate of leaked information in universal random privacy amplification"
    - "secure multiplex coding with a common message"
    - "secure multiplex network coding"
    - "on wiretap networks ii"
    - "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)