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 "new results on multilevel diversity coding with secure regeneration"):
  Abstract: The problem of multilevel diversity coding with secure regeneration is revisited. Under the assumption that the eavesdropper can access the repair data for all compromised storage nodes, Shao el al. provided a precise characterization of the minimum-bandwidth-regeneration (MBR) point of the achievable normalized storage-capacity repair-bandwidth tradeoff region. In this paper, it is shown that the MBR point of the achievable normalized storage-capacity repair-bandwidth tradeoff region remains the same even if we assume that the eavesdropper can access the repair data for some compromised storage nodes (type 2 compromised nodes) but only the data contents of the remaining compromised nodes (type 1 compromised nodes), as long as the number of type 1 compromised nodes is no greater than that of type 2 compromised nodes.

Includes members:
  Member "multilevel diversity coding with secure regeneration separate coding achieves the mbr point":
    also connected through other hyperedges:
      (none)
  Member "on the tradeoff region of secure exact repair regenerating codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "multilevel diversity coding with secure regeneration separate coding achieves the mbr point")
  Member "toward optimal secure distributed storage systems with exact repair":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the capacity of secure distributed matrix multiplication")
  Member "multilevel diversity coding with regeneration":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "an open source toolbox for computer aided investigation on the fundamental limits of information systems version 0 1")
  Member "optimal locally repairable and secure codes for distributed storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on optimal locally repairable codes and generalized sector disk codes")
  Member "characterizing the rate region of the 4 3 3 exact repair regenerating codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "towards practical private information retrieval from mds array codes")
  Member "data secrecy in distributed storage systems under exact repair":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "achieving secrecy capacity of minimum storage regenerating codes for all feasible n k d parameter values")
  Member "information theoretically secure regenerating codes for distributed storage":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "private and rateless adaptive coded matrix vector multiplication")

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)