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 "secure multi source multicast"):
  Abstract: The principal mission of Multi-Source Multicast (MSM) is to disseminate all messages from all sources in a network to all destinations. MSM is utilized in numerous applications. In many of them, securing the messages disseminated is critical. A common secure model is to consider a network where there is an eavesdropper which is able to observe a subset of the network links, and seek a code which keeps the eavesdropper ignorant regarding all the messages. While this is solved when all messages are located at a single source, Secure MSM (SMSM) is an open problem, and the rates required are hard to characterize in general. In this paper, we consider Individual Security, which promises that the eavesdropper has zero mutual information with each message individually. We completely characterize the rate region for SMSM under individual security, and show that such a security level is achievable at the full capacity of the network, that is, the cut-set bound is the matching converse, similar to non-secure MSM. Moreover, we show that the field size is similar to non-secure MSM and does not have to be larger due to the security constraint.

Includes members:
  Member "universal secure multiplex network coding with dependent and non uniform messages":
    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 "sufficiently myopic adversaries are blind":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "authentication against a myopic adversary")
  Member "probability of partially solving random linear systems in network coding":
    also connected through other hyperedges:
      (none)
  Member "probability of partially decoding network coded messages":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the probability of partial decoding in sparse network coding")
  Member "can network coding bridge the digital divide in the pacific":
    also connected through other hyperedges:
      (none)
  Member "weakly secure regenerating codes for distributed storage":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "low complexity secure code lcsc design for big data in cloud storage systems")
  Member "network coding capacity regions via entropy functions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a local perspective on the edge removal problem")
  Member "universal secure network coding via rank metric codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "roos bound for skew cyclic codes in hamming and rank metric")

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)