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: "polytope codes against adversaries in networks"
  Abstract: Network coding is studied when an adversary controls a subset of nodes in the network of limited quantity but unknown location. This problem is shown to be more difficult than when the adversary controls a given number of edges in the network, in that linear codes are insufficient. To solve the node problem, the class of Polytope Codes is introduced. Polytope Codes are constant composition codes operating over bounded polytopes in integer vector fields. The polytope structure creates additional complexity, but it induces properties on marginal distributions of code vectors so that validities of codewords can be checked by internal nodes of the network. It is shown that Polytope Codes achieve a cut-set bound for a class of planar networks. It is also shown that this cut-set bound is not always tight, and a tighter bound is given for an example network.

Connected through hyperedge HE-1 (induced by source paper "byzantine multiple access"):
  with members:
    - "the capacity region of the arbitrarily varying mac with and without constraints"
    - "the arbitrarily varying multiple access channel with conferencing encoders"
    - "robust network coding in the presence of untrusted nodes"
    - "strong secrecy and reliable byzantine detection in the presence of an untrusted relay"

Connected through hyperedge HE-2 (induced by source paper "the capacity of private information retrieval from byzantine and colluding databases"):
  with members:
    - "a general private information retrieval scheme for mds coded databases with colluding servers"
    - "multi file private information retrieval from mds coded databases with colluding servers"
    - "private information retrieval from mds coded data with colluding servers settling a conjecture by freij hollanti et al"
    - "private information retrieval schemes for coded data with arbitrary collusion patterns"
    - "multi message private information retrieval capacity results and near optimal schemes"
    - "blind interference alignment for private information retrieval"
    - "multiround private information retrieval capacity and storage overhead"
    - "the capacity of robust private information retrieval with colluding databases"

Connected through hyperedge HE-3 (induced by source paper "secure symmetric private information retrieval from colluding databases with adversaries"):
  with members:
    - "the capacity of private information retrieval from byzantine and colluding databases"
    - "multi message private information retrieval capacity results and near optimal schemes"
    - "the capacity of robust private information retrieval with colluding databases"
    - "the capacity of symmetric private information retrieval"
    - "private information retrieval from coded databases with colluding servers"
    - "the capacity of private information retrieval"
    - "the capacity of private information retrieval from coded databases"
    - "symmetric private information retrieval for mds coded distributed storage"

Connected through hyperedge HE-4 (induced by source paper "adversarial network coding"):
  with members:
    - "equivalence for networks with adversarial state"
    - "multiple access network information flow and correction codes"
    - "on metrics for error correction in network coding"
    - "adversarial models and resilient schemes for network coding"
    - "a rank metric approach to error control in random network coding"
    - "coding for errors and erasures in random network coding"
    - "construction algorithm for network error correcting codes attaining the singleton bound"

Connected through hyperedge HE-5 (induced by source paper "variable packet error coding"):
  with members:
    - "regenerating codes for errors and erasures in distributed storage"
    - "error resilience in distributed storage via rank metric codes"
    - "erasure multiple descriptions"
    - "byzantine fault tolerance of regenerating codes"
    - "network codes resilient to jamming and eavesdropping"
    - "security in distributed storage systems by communicating a logarithmic number of bits"
    - "a survey on network codes for distributed storage"

Connected through hyperedge HE-6 (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"
    - "routing for security in networks with adversarial nodes"
    - "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-7 (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"
    - "routing for security in networks with adversarial nodes"
    - "on network coding for sum 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-8 (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"
    - "on secure network coding with uniform wiretap sets"
    - "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)