human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "arbitrarily varying networks capacity achieving computationally efficient codes"):
  Abstract: We consider the problem of communication over a network containing a hidden and malicious adversary that can control a subset of network resources, and aims to disrupt communications. We focus on omniscient node-based adversaries, i.e., the adversaries can control a subset of nodes, and know the message, network code and packets on all links. Characterizing information-theoretically optimal communication rates as a function of network parameters and bounds on the adversarially controlled network is in general open, even for unicast (single source, single destination) problems. In this work we characterize the information-theoretically optimal randomized capacity of such problems, i.e., under the assumption that the source node shares (an asymptotically negligible amount of) independent common randomness with each network node a priori (for instance, as part of network design). We propose a novel computationally-efficient communication scheme whose rate matches a natural information-theoretically "erasure outer bound" on the optimal rate. Our schemes require no prior knowledge of network topology, and can be implemented in a distributed manner as an overlay on top of classical distributed linear network coding.

Includes members:
  Member "coding against a limited view adversary the effect of causality and feedback":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "stealthy communication over adversarially jammed multipath networks")
  Member "connecting multiple unicast and network error correction reduction and unachievability":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a numerical study on the wiretap network with a simple network topology")
  Member "routing for security in networks with adversarial nodes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "connecting multiple unicast and network error correction reduction and unachievability")
  Member "polytope codes against adversaries in networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "byzantine multiple access")
  Member "network codes resilient to jamming and eavesdropping":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "communication efficient secret sharing in the presence of malicious adversary")
  Member "network error correction with unequal link capacities":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "connecting multiple unicast and network error correction reduction and unachievability")
  Member "adversarial models and resilient schemes for network coding":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "adversarial network coding")
  Member "coding for errors and erasures in random network coding":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "on the gap between scalar and vector solutions of generalized combination networks")

Question: Please tell me which class the source paper 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)