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: "security for wiretap networks via rank metric codes"
  Abstract: The problem of securing a network coding communication system against a wiretapper adversary is considered. The network implements linear network coding to deliver n packets from source to each receiver, and the wiretapper can eavesdrop on mu arbitrarily chosen links. A coding scheme is proposed that can achieve the maximum possible rate of k = n - mu packets that are information-theoretically secure from the adversary. A distinctive feature of our scheme is that it is universal: it can be applied on top of any communication network without requiring knowledge of or any modifications on the underlying network code. In fact, even a randomized network code can be used. Our approach is based on Rouayheb-Soljaninpsilas formulation of a wiretap network as a generalization of the Ozarow-Wyner wiretap channel of type II. Essentially, the linear MDS code in Ozarow-Wynerpsilas coset coding scheme is replaced by a maximum-rank-distance code over an extension of the field in which linear network coding operations are performed.

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 "on the equivalency of reliability and security metrics for wireline networks"):
  with members:
    - "perfectly secure index coding"
    - "graph theory versus minimum rank for index coding"
    - "using feedback for secrecy over graphs"
    - "on the capacity region for index coding"
    - "on secure network coding with nonuniform or restricted wiretap sets"
    - "on secure network coding with uniform wiretap sets"
    - "achievability proof via output statistics of random binning"
    - "performance bounds on a wiretap network with arbitrary wiretap sets"

Connected through hyperedge HE-3 (induced by source paper "perfectly secure message transmission in two rounds"):
  with members:
    - "universal secure network coding via rank metric codes"
    - "on coding for reliable communication over packet networks"

Connected through hyperedge HE-4 (induced by source paper "on secure network coding for two unicast sessions studying butterflies"):
  with members:
    - "coding across unicast sessions can increase the secure message capacity"
    - "lp formulations for secrecy over erasure networks with feedback"

Connected through hyperedge HE-5 (induced by source paper "secure partial repair in wireless caching networks with broadcast channels"):
  with members:
    - "wireless device to device caching networks basic principles and system performance"
    - "weakly secure regenerating codes for distributed storage"
    - "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"
    - "fundamental limits of caching"
    - "cooperative regenerating codes for distributed storage systems"
    - "information theoretically secure regenerating codes for distributed storage"
    - "femtocaching wireless video content delivery through distributed caching helpers"

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

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

Connected through hyperedge HE-8 (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"
    - "on wiretap networks ii"
    - "a rank metric approach to error control in random network coding"
    - "coding for errors and erasures in random network coding"

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)