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 "information theoretically secure erasure codes for distributed storage"):
  Abstract: Repair operations in distributed storage systems potentially expose the data to malicious acts of passive eavesdroppers or active adversaries, which can be detrimental to the security of the system. This paper presents erasure codes and repair algorithms that ensure security of the data in the presence of passive eavesdroppers and active adversaries, while maintaining high availability, reliability and efficiency in the system. Our codes are optimal in that they meet previously proposed lower bounds on the storage, network-bandwidth, and reliability requirements for a wide range of system parameters. Our results thus establish the capacity of such systems. Our codes for security from active adversaries provide an additional appealing feature of `on-demand security' where the desired level of security can be chosen separately for each instance of repair, and our algorithms remain optimal simultaneously for all possible levels. The paper also provides necessary and sufficient conditions governing the transformation of any (non-secure) code into one providing on-demand security.

Includes members:
  Member "toward optimal secure distributed storage systems with exact repair":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the capacity of secure distributed matrix multiplication")
  Member "the storage repair bandwidth trade off of exact repair linear regenerating codes for the case d k n 1":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "cascade codes for distributed storage systems")
  Member "a framework of constructions of minimal storage regenerating codes with the optimal access update property":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a systematic construction of mds codes with small sub packetization level and near optimal repair bandwidth")
  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 "an improved outer bound on the storage repair bandwidth tradeoff of exact repair regenerating codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the achievability region of regenerating codes for multiple erasures")
  Member "a framework of constructions of minimum storage regenerating codes with the optimal update access property for distributed storage systems based on invariant subspace technique":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "explicit mds codes for optimal repair bandwidth")
  Member "novel repair by transfer codes and systematic exact mbr codes with lower complexities and smaller field sizes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "an overflow problem in network coding for secure cloud storage")
  Member "generalization of rashmi shah kumar minimum storage regenerating codes":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "optimal systematic distributed storage codes with fast encoding")

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)