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 secure network coding with uniform wiretap sets"
  Abstract: This paper shows determining the secrecy capacity of a unicast network with uniform wiretap sets is at least as difficult as the k-unicast problem. In particular, we show that a general k-unicast problem can be reduced to the problem of finding the secrecy capacity of a corresponding single unicast network with uniform link capacities and one arbitrary wiretap link.

Connected through hyperedge HE-1 (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"
    - "achievability proof via output statistics of random binning"
    - "performance bounds on a wiretap network with arbitrary wiretap sets"
    - "dynamic index coding for wireless broadcast networks"

Connected through hyperedge HE-2 (induced by source paper "an equivalence between secure network and index coding"):
  with members:
    - "secure index coding existence and construction"
    - "perfectly secure index coding"
    - "a rate distortion approach to index coding"
    - "an equivalence between network coding and index coding"
    - "on the security of index coding with side information"
    - "on the index coding problem and its relation to network coding and matroid theory"

Connected through hyperedge HE-3 (induced by source paper "a numerical study on the wiretap network with a simple network topology"):
  with members:
    - "connecting multiple unicast and network error correction reduction and unachievability"
    - "characterizing the rate region of the 4 3 3 exact repair regenerating codes"
    - "on secure network coding with nonuniform or restricted wiretap sets"
    - "network coding capacity regions via entropy functions"
    - "performance bounds on a wiretap network with arbitrary wiretap sets"
    - "linear rank inequalities on five or more variables"

Connected through hyperedge HE-4 (induced by source paper "single source sink network error correction is as hard as multiple unicast"):
  with members:
    - "rateless resilient network coding against byzantine adversaries"
    - "routing for security in networks with adversarial nodes"
    - "an equivalence between network coding and index coding"
    - "polytope codes against adversaries in networks"
    - "robust network coding in the presence of untrusted nodes"
    - "network error correction with unequal link capacities"
    - "adversarial models and resilient schemes for network coding"
    - "on the index coding problem and its relation to network coding and matroid theory"

Connected through hyperedge HE-5 (induced by source paper "reverse edge cut set bounds for secure network coding"):
  with members:
    - "on secure network coding with nonuniform or restricted wiretap sets"
    - "on capacity region of wiretap networks"
    - "universal secure network coding via rank metric codes"
    - "mission impossible computing the network coding capacity region"

Connected through hyperedge HE-6 (induced by source paper "beyond the cut set bound uncertainty computations in network coding with correlated sources"):
  with members:
    - "beyond the cut set bound uncertainty computations in network coding with correlated sources"
    - "multishot codes for network coding using rank metric codes"
    - "network coding capacity a functional dependence bound"
    - "packing and covering properties of subspace codes for error control in random linear network coding"
    - "a rank metric approach to error control in random network coding"
    - "coding for errors and erasures in random network coding"
    - "packing and covering properties of rank metric codes"
    - "on coding for reliable communication over packet networks"

Connected through hyperedge HE-7 (induced by source paper "beyond the cut set bound uncertainty computations in network coding with correlated sources"):
  with members:
    - "beyond the cut set bound uncertainty computations in network coding with correlated sources"
    - "multishot codes for network coding using rank metric codes"
    - "network coding capacity a functional dependence bound"
    - "packing and covering properties of subspace codes for error control in random linear network coding"
    - "a rank metric approach to error control in random network coding"
    - "coding for errors and erasures in random network coding"
    - "packing and covering properties of rank metric codes"
    - "on coding for reliable communication over packet networks"

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)