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 "secrecy and robustness for active attack in secure network coding and its application to network quantum key distribution"):
  Abstract: In the network coding, we discuss the effect of sequential error injection on information leakage. We show that there is no improvement when the network is composed of linear operations. However, when the network contains non-linear operations, we find a counterexample to improve Eve's obtained information. Furthermore, we discuss the asymptotic rate in a linear network under the secrecy and robustness conditions as well as under the secrecy condition alone. Finally, we apply our results to network quantum key distribution, which clarifies the type of network that enables us to realize secure long distance communication via short distance quantum key distribution.

Includes members:
  Member "secure network code for adaptive and active attacks with no randomness in intermediate nodes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on secure capacity of multiple unicast traffic over separable networks")
  Member "universal construction of cheater identifiable secret sharing against rushing cheaters without honest majority":
    also connected through other hyperedges:
      (none)
  Member "universal secure multiplex network coding with dependent and non uniform messages":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "secure multi source multicast")
  Member "secure multi source multicast":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "secrecy rates for a channel with two senders and two receivers")
  Member "quantum inspired secure wireless communication protocol under spatial and local gaussian noise assumptions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "two way physical layer security protocol for gaussian channels")
  Member "secure wireless communication under spatial and local gaussian noise assumptions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "two way physical layer security protocol for gaussian channels")
  Member "relative generalized rank weight of linear codes and its applications to network coding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "reliable and secure multishot network coding using linearized reed solomon codes")
  Member "coding against a limited view adversary the effect of causality and feedback":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "stealthy communication over adversarially jammed multipath 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)