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 "low complexity secure code lcsc design for big data in cloud storage systems"):
  Abstract: In the era of big data, reducing the computational complexity of servers in data centers will be an important goal. We propose Low Complexity Secure Codes (LCSCs) that are specifically designed to provide information theoretic security in cloud distributed storage systems. Unlike traditional coding schemes that are designed for error correction capabilities, these codes are only designed to provide security with low decoding complexity. These sparse codes are able to provide (asymptotic) perfect secrecy similar to Shannon cipher. The simultaneous promise of low decoding complexity and perfect secrecy make these codes very desirable for cloud storage systems with large amount of data. The design is particularly suitable for large size archival data such as movies and pictures. The complexity of these codes are compared with traditional encryption techniques.

Includes members:
  Member "secure and private cloud storage systems with random linear fountain codes":
    also connected through other hyperedges:
      (none)
  Member "cloud based deep learning of big eeg data for epileptic seizure prediction":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a survey on deep learning based brain computer interface recent advances and new frontiers")
  Member "a secure approach for caching contents in wireless ad hoc networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "edge cache assisted secure low latency millimeter wave transmission")
  Member "multihop caching aided coded multicasting for the next generation of cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "full characterization of optimal uncoded placement for the structured clique cover delivery of nonuniform demands")
  Member "secure repairable fountain codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "secure and private cloud storage systems with random linear fountain codes")
  Member "throughput analysis of decentralized coded content caching in cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "secure and private cloud storage systems with random linear fountain codes")
  Member "capacity of cellular networks with femtocache":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "optimal scheduling of content caching subject to deadline")
  Member "optimal locally repairable and secure codes for distributed storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on optimal locally repairable codes and generalized sector disk codes")

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)