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: "robust network coding in the presence of untrusted nodes"
  Abstract: While network coding can be an efficient means of information dissemination in networks, it is highly susceptible to “pollution attacks,” as the injection of even a single erroneous packet has the potential to corrupt each and every packet received by a given destination. Even when suitable error-control coding is applied, an adversary can, in many interesting practical situations, overwhelm the error-correcting capability of the code. To limit the power of potential adversaries, a broadcast transformation is introduced, in which nodes are limited to just a single (broadcast) transmission per generation. Under this broadcast transformation, the multicast capacity of a network is changed (in general reduced) from the number of edge-disjoint paths between source and sink to the number of internally disjoint paths. Exploiting this fact, a family of networks is proposed whose capacity is largely unaffected by a broadcast transformation. This results in a significant achievable transmission rate for such networks, even in the presence of adversaries.

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"
    - "polytope codes against adversaries in networks"
    - "strong secrecy and reliable byzantine detection in the presence of an untrusted relay"

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"
    - "routing for security in networks with adversarial nodes"
    - "on network coding for sum networks"
    - "polytope codes against adversaries in networks"
    - "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"
    - "routing for security in networks with adversarial nodes"
    - "an equivalence between network coding and index coding"
    - "on secure network coding with uniform wiretap sets"
    - "polytope codes against adversaries in networks"
    - "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-4 (induced by source paper "a coding approach to guarantee information integrity against a byzantine relay"):
  with members:
    - "detectability of symbol manipulation by an amplify and forward relay"

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)