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 "equivalence for networks with adversarial state"):
  Abstract: We address the problem of finding the capacity of noisy networks with either independent point-to-point compound channels (CC) or arbitrarily varying channels (AVC). These channels model the presence of a Byzantine adversary which controls a subset of links or nodes in the network. We derive equivalence results showing that these point-to-point channels with state can be replaced by noiseless bit-pipes without changing the network capacity region. Exact equivalence results are found for the CC model, and for some instances of the AVC, including all nonsymmetrizable AVCs. These results show that a feedback path between the output and input of a CC can increase the equivalent capacity, and that if common randomness can be established between the terminals of an AVC (either by feedback, a forward path, or via a third-party node), then again the equivalent capacity can increase. This leads to an observation that deleting an edge of arbitrarily small capacity can cause a significant change in network capacity. We also analyze an example involving an AVC for which no fixed-capacity bit-pipe is equivalent.

Includes members:
  Member "on the impact of a single edge on the network coding capacity":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a local perspective on the edge removal problem")
  Member "the arbitrarily varying wiretap channel secret randomness stability and super activation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the arbitrarily varying channel with colored gaussian noise")
  Member "on the continuity of the secrecy capacity of compound and arbitrarily varying wiretap channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the arbitrarily varying channel with colored gaussian noise")
  Member "network coding is zero error always possible":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "lossless source coding in the point to point multiple access and random access scenarios")
  Member "polytope codes against adversaries in networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "byzantine multiple access")
  Member "network error correction with unequal link capacities":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "arbitrarily varying networks capacity achieving computationally efficient codes")

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)