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 "on secure network coding for multiple unicast traffic"):
  Abstract: This paper investigates the problem of secure communication in a wireline noiseless scenario where a source wishes to communicate to a number of destinations in the presence of a passive external adversary. Different from the multicast scenario, where all destinations are interested in receiving the same message, in this setting different destinations are interested in different messages. The main focus of this paper is on characterizing the secure capacity region, when the adversary has unbounded computational capabilities, but limited network presence. First, an outer bound on the secure capacity region is derived for arbitrary network topologies and general number of destinations. Then, secure transmission schemes are designed and analyzed in terms of achieved rate performance. In particular, for the case of two destinations, it is shown that the designed scheme matches the outer bound, hence characterizing the secure capacity region. It is also numerically verified that the designed scheme matches the outer bound for a special class of networks with general number of destinations, referred to as combination network. Finally, for an arbitrary network topology with general number of destinations, a two-phase polynomial time in the network size scheme is designed and its rate performance {is} compared with the capacity-achieving scheme for networks with two destinations.

Includes members:
  Member "coding across unicast sessions can increase the secure message capacity":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "secure network code for adaptive and active attacks with no randomness in intermediate nodes")
  Member "on secure network coding for two unicast sessions studying butterflies":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "secure network code for adaptive and active attacks with no randomness in intermediate nodes")
  Member "lp formulations for secrecy over erasure networks with feedback":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on secure network coding for two unicast sessions studying butterflies")
  Member "secret message capacity of a line network":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "coding across unicast sessions can increase the secure message capacity")
  Member "on secure network coding with nonuniform or restricted wiretap sets":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "network information theoretic security")
  Member "the single source two terminal network with network coding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "capacity results for multicasting nested message sets over combination 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)