human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "secure repairable fountain codes"
  Abstract: In this letter, we provide the construction of repairable fountain codes (RFCs) for distributed storage systems that are information-theoretically secure against an eavesdropper that has access to the data stored in a subset of the storage nodes and the data downloaded to repair an additional subset of storage nodes. The security is achieved by adding random symbols to the message, which is then encoded by the concatenation of a Gabidulin code and an RFC. We compare the achievable code rates of the proposed codes with those of secure minimum storage regenerating codes and secure locally repairable codes.

Connected through hyperedge HE-1 (induced by source paper "low complexity secure code lcsc design for big data in cloud storage systems"):
  with members:
    - "secure and private cloud storage systems with random linear fountain codes"
    - "cloud based deep learning of big eeg data for epileptic seizure prediction"
    - "a secure approach for caching contents in wireless ad hoc networks"
    - "multihop caching aided coded multicasting for the next generation of cellular networks"
    - "throughput analysis of decentralized coded content caching in cellular networks"
    - "capacity of cellular networks with femtocache"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "weakly secure regenerating codes for distributed storage"

Connected through hyperedge HE-2 (induced by source paper "secure and private cloud storage systems with random linear fountain codes"):
  with members:
    - "private information retrieval from mds coded data in distributed storage systems"
    - "cloud based deep learning of big eeg data for epileptic seizure prediction"
    - "a secure approach for caching contents in wireless ad hoc networks"
    - "multihop caching aided coded multicasting for the next generation of cellular networks"
    - "optimizing pilot overhead for ultra reliable short packet transmission"
    - "distributed vector estimation for power and bandwidth constrained wireless sensor networks"
    - "throughput analysis of decentralized coded content caching in cellular networks"
    - "capacity of cellular networks with femtocache"

Question: Please tell me which class the center node 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)