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: "on wiretap networks 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 links of his choice. We assume that the network implements network coding techniques to simultaneously deliver all the packets available at the source to all the destinations. We show how this problem can be looked at as a network generalization of the Ozarow-Wyner Wiretap Channel of type II. In particular, we show that network security can be achieved by using the Ozarow-Wyner approach of coset coding at the source on top of the implemented network code. This way, we quickly and transparently recover some of the results available in the literature on secure network coding for wiretapped networks. We also derive new bounds on the required secure code alphabet size and an algorithm for code construction.

Connected through hyperedge HE-1 (induced by source paper "universally weakly secure coset coding schemes for minimum storage regenerating msr codes"):
  with members:
    - "a note on secure minimum storage regenerating codes"
    - "an explicit coupled layer construction of a high rate msr code with low sub packetization level small field size and all node repair"
    - "explicit constructions of high rate mds array codes with optimal repair bandwidth"
    - "security in locally repairable storage"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "weakly secure regenerating codes for distributed storage"
    - "on block security of regenerating codes at the mbr point for distributed storage systems"
    - "an improved sub packetization bound for minimum storage regenerating codes"

Connected through hyperedge HE-2 (induced by source paper "weakly secure regenerating codes for distributed storage"):
  with members:
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "on block security of regenerating codes at the mbr point for distributed storage systems"
    - "universal secure network coding via rank metric codes"
    - "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction"
    - "information theoretically secure regenerating codes for distributed storage"
    - "a survey on network codes for distributed storage"
    - "on secure distributed data storage under repair dynamics"
    - "explicit construction of optimal exact regenerating codes for distributed storage"

Connected through hyperedge HE-3 (induced by source paper "on secure network coding with nonuniform or restricted wiretap sets"):
  with members:
    - "universal secure network coding via rank metric codes"
    - "mission impossible computing the network coding capacity region"

Connected through hyperedge HE-4 (induced by source paper "performance bounds on a wiretap network"):
  with members:
    - "on secure network coding with nonuniform or restricted wiretap sets"
    - "information inequalities for joint distributions with interpretations and applications"
    - "security for wiretap networks via rank metric codes"
    - "random linear network coding a free cipher"

Connected through hyperedge HE-5 (induced by source paper "multi terminal secrecy in a linear non coherent packetized networks"):
  with members:
    - "subspace properties of network coding and their applications"
    - "universal secure network coding via rank metric codes"
    - "communication over finite field matrix channels"

Connected through hyperedge HE-6 (induced by source paper "universal secure network coding via rank metric codes"):
  with members:
    - "network codes resilient to jamming and eavesdropping"
    - "universal secure error correcting schemes for network coding"
    - "fast encoding and decoding of gabidulin codes"
    - "on metrics for error correction in network coding"
    - "invertible extractors and wiretap protocols"
    - "a rank metric approach to error control in random network coding"
    - "security for wiretap networks via rank metric codes"
    - "coding for errors and erasures in random network coding"

Connected through hyperedge HE-7 (induced by source paper "lattice codes for the gaussian wiretap channel"):
  with members:
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "secrecy achieving polar coding for binary input memoryless symmetric wire tap channels"
    - "unimodular lattices for the gaussian wiretap channel"
    - "secrecy gain a wiretap lattice code design"
    - "providing secrecy with structured codes tools and applications to two user gaussian channels"
    - "golden space time trellis coded modulation"
    - "applications of ldpc codes to the wiretap channel"

Connected through hyperedge HE-8 (induced by source paper "on the security of index coding with side information"):
  with members:
    - "index coding and error correction"
    - "universal secure error correcting schemes for network coding"
    - "on the index coding problem and its relation to network coding and matroid theory"
    - "broadcasting with side information"
    - "non linear index coding outperforming the linear optimum"
    - "on the relation between the index coding and the network coding problems"

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)