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 "an overflow problem in network coding for secure cloud storage"):
  Abstract: In this paper we define the overflow problem of a network coding storage system in which the encoding parameter and the storage parameter are mismatched. Through analyses and experiments, we first show the impacts of the overflow problem in a network coding scheme, which not only waste storage spaces, but also degrade coding efficiency. To avoid the overflow problem, we then develop the network coding based secure storage (NCSS) scheme. Thanks to considering both security and storage requirements in encoding procedures and distributed architectures, the NCSS can improve the performance of a cloud storage system from both the aspects of storage cost and coding processing time. We analyze the maximum allowable stored encoded data under the perfect secrecy criterion, and provide the design guidelines for the secure cloud storage system to enhance coding efficiency and achieve the minimal storage cost.

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 "on secrecy capacity of minimum storage regenerating codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "achieving secrecy capacity of minimum storage regenerating codes for all feasible n k d parameter values")
  Member "security in locally repairable storage":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "secrecy and accessibility in distributed storage")
  Member "batched sparse codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "upper bound scalability on achievable rates of batched codes for line networks")
  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-5 (induced by source paper "asymptotically optimal regenerating codes over any field")
  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 "capacity and security of heterogeneous distributed storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "capacity of distributed storage systems with clusters and separate nodes")
  Member "simple regenerating codes network coding for cloud storage":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "new bounds on the field size for maximally recoverable codes instantiating grid like topologies")

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.CR(Cryptography and Security)