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 "performance bounds on a wiretap network"):
  Abstract: Consider a communication network represented by a directed graph G = (V,E), where V is the set of nodes and E is the set of point-to-point channels in the network. On the network a secure message M is transmitted, and there may exist wiretappers who want to obtain information about the message. In secure network coding, we aim to find a network code which can protect the message against the wiretapper whose power is constrained. Cai and Yeung [6] studied the model in which the wiretapper can access any one but not more than one set of channels, called a wiretap set, out of a collection A of all possible wiretap sets. In order to protect the message, the message needs to be mixed with a random key K. They proved tight fundamental performance bounds when A consists of all subsets of E of a fixed size r. In this paper, we investigate the problem when A consists of arbitrary subsets of E and obtain the following results: 1) an upper bound on H(M); 2) a lower bound on H(K) in terms of H(M). The upper bound on H(M) is explicit, while the lower bound on H(K) can be computed in polynomial time. The tightness of the lower bound for the point-to-point communication system is also proved.

Includes members:
  Member "on secure network coding with nonuniform or restricted wiretap sets":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "network information theoretic security")
  Member "on wiretap networks ii":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "universally weakly secure coset coding schemes for minimum storage regenerating msr codes")
  Member "information inequalities for joint distributions with interpretations and applications":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "dual loomis whitney inequalities via information theory")
  Member "security for wiretap networks via rank metric codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "universally weakly secure coset coding schemes for minimum storage regenerating msr codes")
  Member "random linear network coding a free cipher":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "packet loss recovery in broadcast for real time applications in dense wireless 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)