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: "network codes resilient to jamming and eavesdropping"
  Abstract: We consider the problem of communicating information over a network secretly and reliably in the presence of a hidden adversary who can eavesdrop and inject malicious errors. We provide polynomial-time, rate-optimal distributed network codes for this scenario, improving on the rates achievable in previous work. Our main contribution shows that as long as the sum of the adversary's jamming rate Zo and his eavesdropping rate Zi is less than the network capacity C, (i.e., Zo+Zi<C), our codes can communicate (with vanishingly small error probability) a single bit correctly and without leaking any information to the adversary. We then use this to design codes that allow communication at the optimal source rate of C-Zo-Zi, while keeping the communicated message secret from the adversary. Interior nodes are oblivious to the presence of adversaries and perform random linear network coding; only the source and destination need to be tweaked. In proving our results we correct an error in prior work by a subset of the authors in this work.

Connected through hyperedge HE-1 (induced by source paper "communication efficient secret sharing in the presence of malicious adversary"):
  with members:
    - "staircase codes for secret sharing with optimal communication and read overheads"
    - "securing data against limited knowledge adversaries in distributed storage systems"

Connected through hyperedge HE-2 (induced by source paper "local encoding preserving secure network coding part i fixed security level"):
  with members:
    - "alphabet size reduction for secure network coding a graph theoretic approach"
    - "on the optimality of secure network coding"
    - "variable rate linear network error correction mds codes"
    - "on secure network coding with nonuniform or restricted wiretap sets"
    - "performance bounds on a wiretap network with arbitrary wiretap sets"
    - "universal secure network coding via rank metric codes"

Connected through hyperedge HE-3 (induced by source paper "the epsilon error capacity of symmetric pir with byzantine adversaries"):
  with members:
    - "the capacity of private information retrieval from byzantine and colluding databases"
    - "secure symmetric private information retrieval from colluding databases with adversaries"
    - "linear symmetric private information retrieval for mds coded distributed storage with colluding servers"
    - "the capacity of symmetric private information retrieval"

Connected through hyperedge HE-4 (induced by source paper "secure network code for adaptive and active attacks with no randomness in intermediate nodes"):
  with members:
    - "secrecy and robustness for active attack in secure network coding and its application to network quantum key distribution"
    - "universal secure multiplex network coding with dependent and non uniform messages"
    - "secure multi source multicast"
    - "coding across unicast sessions can increase the secure message capacity"
    - "quantum inspired secure wireless communication protocol under spatial and local gaussian noise assumptions"
    - "secure wireless communication under spatial and local gaussian noise assumptions"
    - "on secure network coding for two unicast sessions studying butterflies"
    - "relative generalized rank weight of linear codes and its applications to network coding"

Connected through hyperedge HE-5 (induced by source paper "secrecy and robustness for active attack in secure network coding and its application to network quantum key distribution"):
  with members:
    - "secure network code for adaptive and active attacks with no randomness in intermediate nodes"
    - "universal construction of cheater identifiable secret sharing against rushing cheaters without honest majority"
    - "universal secure multiplex network coding with dependent and non uniform messages"
    - "secure multi source multicast"
    - "quantum inspired secure wireless communication protocol under spatial and local gaussian noise assumptions"
    - "secure wireless communication under spatial and local gaussian noise assumptions"
    - "relative generalized rank weight of linear codes and its applications to network coding"
    - "coding against a limited view adversary the effect of causality and feedback"

Connected through hyperedge HE-6 (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"
    - "polytope codes against adversaries in networks"
    - "security in distributed storage systems by communicating a logarithmic number of bits"
    - "a survey on network codes for distributed storage"

Connected through hyperedge HE-7 (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"
    - "polytope codes against adversaries in networks"
    - "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-8 (induced by source paper "information theoretically secure erasure codes for distributed storage"):
  with members:
    - "toward optimal secure distributed storage systems with exact repair"
    - "the storage repair bandwidth trade off of exact repair linear regenerating codes for the case d k n 1"
    - "a framework of constructions of minimal storage regenerating codes with the optimal access update property"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "an improved outer bound on the storage repair bandwidth tradeoff of exact repair regenerating codes"
    - "a framework of constructions of minimum storage regenerating codes with the optimal update access property for distributed storage systems based on invariant subspace technique"
    - "novel repair by transfer codes and systematic exact mbr codes with lower complexities and smaller field sizes"
    - "generalization of rashmi shah kumar minimum storage regenerating codes"

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.NI(Networking and Internet Architecture)