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: "universal secure error correcting schemes for network coding"
  Abstract: This paper considers the problem of securing a linear network coding system against an adversary that is both an eavesdropper and a jammer. The network is assumed to transport n packets from source to each receiver, and the adversary is allowed to eavesdrop on μ arbitrarily chosen links and also to inject up to t erroneous packets into the network. The goal of the system is to achieve zero-error communication that is information-theoretically secure from the adversary. Moreover, this goal must be attained in a universal fashion, i.e., regardless of the network topology or the underlying network code. An upper bound on the achievable rate under these requirements is shown to be n - μ - 2t packets per transmission. A scheme is proposed that can achieve this maximum rate, for any n and any field size q, provided the packet length m is at least n symbols. The scheme is based on rank-metric codes and admits low-complexity encoding and decoding. In addition, the scheme is shown to be optimal in the sense that the required packet length is the smallest possible among all universal schemes that achieve the maximum rate.

Connected through hyperedge HE-1 (induced by source paper "universal secure network coding via rank metric codes"):
  with members:
    - "network codes resilient to jamming and eavesdropping"
    - "fast encoding and decoding of gabidulin codes"
    - "on metrics for error correction in network coding"
    - "invertible extractors and wiretap protocols"
    - "on wiretap networks ii"
    - "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-2 (induced by source paper "on the security of index coding with side information"):
  with members:
    - "index coding and error correction"
    - "on wiretap networks ii"
    - "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"

Connected through hyperedge HE-3 (induced by source paper "network codes resilient to jamming and eavesdropping"):
  with members:
    - "universal secure network coding via rank metric codes"
    - "on wiretap networks ii"
    - "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"
    - "construction algorithm for network error correcting codes attaining the singleton bound"

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)