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: "routing for security in networks with adversarial nodes"
  Abstract: We consider the problem of secure unicast transmission between two nodes in a directed graph, where an adversary eavesdrops/jams a subset of nodes. This adversarial setting is in contrast to traditional ones where the adversary controls a subset of links. In particular, we study, in the main, the class of routing-only schemes (as opposed to those allowing coding inside the network). Routing-only schemes usually have low implementation complexity, yet a characterization of the rates achievable by such schemes was open prior to this work. We first propose an LP based solution for secure communication against eavesdropping, and show that it is information-theoretically rate-optimal among all routing-only schemes. The idea behind our design is to balance information flow in the network so that no subset of nodes observe "too much" information. Interestingly, we show that the rates achieved by our routing-only scheme are always at least as good as, and sometimes better, than those achieved by "na\"ive" network coding schemes (i.e. the rate-optimal scheme designed for the traditional scenario where the adversary controls links in a network rather than nodes.) We also demonstrate non-trivial network coding schemes that achieve rates at least as high as (and again sometimes better than) those achieved by our routing schemes, but leave open the question of characterizing the optimal rate-region of the problem under all possible coding schemes. We then extend these routing-only schemes to the adversarial node-jamming scenarios and show similar results. During the journey of our investigation, we also develop a new technique that has the potential to derive non-trivial bounds for general secure-communication schemes.

Connected through hyperedge HE-1 (induced by source paper "arbitrarily varying networks capacity achieving computationally efficient codes"):
  with members:
    - "coding against a limited view adversary the effect of causality and feedback"
    - "connecting multiple unicast and network error correction reduction and unachievability"
    - "polytope codes against adversaries in networks"
    - "network codes resilient to jamming and eavesdropping"
    - "network error correction with unequal link capacities"
    - "adversarial models and resilient schemes for network coding"
    - "coding for errors and erasures in random network coding"

Connected through hyperedge HE-2 (induced by source paper "connecting multiple unicast and network error correction reduction and unachievability"):
  with members:
    - "single source sink network error correction is as hard as multiple unicast"
    - "on network coding for sum networks"
    - "polytope codes against adversaries in networks"
    - "robust network coding in the presence of untrusted nodes"
    - "network error correction with unequal link capacities"
    - "a rank metric approach to error control in random network coding"
    - "coding for errors and erasures in random network coding"

Connected through hyperedge HE-3 (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"
    - "an equivalence between network coding and index coding"
    - "on secure network coding with uniform wiretap sets"
    - "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"

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)