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: "weakly secure regenerating codes for distributed storage"
  Abstract: We consider the problem of secure distributed data storage under the paradigm of \emph{weak security}, in which no \emph{meaningful information} is leaked to the eavesdropper. More specifically, the eavesdropper cannot get any information about any individual message file or a small group of files. The key benefit of the weak security paradigm is that it incurs no loss in the storage capacity, which makes it practically appealing. #R##N#In this paper, we present a coding scheme, using a coset coding based outer code and a Product-Matrix Minimum Bandwidth Regenerating code (proposed by Rashmi et al.) as an inner code, that achieves weak security when the eavesdropper can observe any single storage node. We show that the proposed construction has good security properties and requires small finite field size.

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"
    - "secure repairable fountain codes"
    - "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"

Connected through hyperedge HE-2 (induced by source paper "universally weakly secure coset coding schemes for minimum storage regenerating msr codes"):
  with members:
    - "a note on secure minimum storage regenerating codes"
    - "an explicit coupled layer construction of a high rate msr code with low sub packetization level small field size and all node repair"
    - "explicit constructions of high rate mds array codes with optimal repair bandwidth"
    - "security in locally repairable storage"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "on block security of regenerating codes at the mbr point for distributed storage systems"
    - "an improved sub packetization bound for minimum storage regenerating codes"
    - "locally repairable codes"

Connected through hyperedge HE-3 (induced by source paper "secure multi source multicast"):
  with members:
    - "universal secure multiplex network coding with dependent and non uniform messages"
    - "sufficiently myopic adversaries are blind"
    - "probability of partially solving random linear systems in network coding"
    - "probability of partially decoding network coded messages"
    - "can network coding bridge the digital divide in the pacific"
    - "network coding capacity regions via entropy functions"
    - "universal secure network coding via rank metric codes"
    - "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction"

Connected through hyperedge HE-4 (induced by source paper "generic secure repair for distributed storage"):
  with members:
    - "toward optimal secure distributed storage systems with exact repair"
    - "on secrecy capacity of minimum storage regenerating codes"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "secure cooperative regenerating codes for distributed storage systems"
    - "information theoretically secure regenerating codes for distributed storage"

Connected through hyperedge HE-5 (induced by source paper "achieving both positive secrecy rates of the users in two way wiretap channel by individual secrecy"):
  with members:
    - "multiple access relay wiretap channel"
    - "strongly secure communications over the two way wiretap channel"
    - "the role of feedback in two way secure communications"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"

Connected through hyperedge HE-6 (induced by source paper "secure partial repair in wireless caching networks with broadcast channels"):
  with members:
    - "wireless device to device caching networks basic principles and system performance"
    - "distributed storage codes with repair by transfer and nonachievability of interior points on the storage bandwidth tradeoff"
    - "regenerating codes for errors and erasures in distributed storage"
    - "fundamental limits of caching"
    - "cooperative regenerating codes for distributed storage systems"
    - "information theoretically secure regenerating codes for distributed storage"
    - "femtocaching wireless video content delivery through distributed caching helpers"
    - "explicit construction of optimal exact regenerating codes for distributed storage"

Connected through hyperedge HE-7 (induced by source paper "securing data against limited knowledge adversaries in distributed storage systems"):
  with members:
    - "toward optimal secure distributed storage systems with exact repair"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "xoring elephants novel erasure codes for big data"
    - "regenerating codes for errors and erasures in distributed storage"
    - "error resilience in distributed storage via rank metric codes"
    - "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction"
    - "information theoretically secure regenerating codes for distributed storage"
    - "security in distributed storage systems by communicating a logarithmic number of bits"

Connected through hyperedge HE-8 (induced by source paper "secure erasure codes with partial decodability"):
  with members:
    - "on block security of regenerating codes at the mbr point for distributed storage systems"
    - "mds codes on the erasure erasure wiretap channel"
    - "strongly secure ramp secret sharing schemes for general access structures"

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)