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: "security in locally repairable storage"
  Abstract: In this paper we extend the notion of {\em locally repairable} codes to {\em secret sharing} schemes. The main problem that we consider is to find optimal ways to distribute shares of a secret among a set of storage-nodes (participants) such that the content of each node (share) can be recovered by using contents of only few other nodes, and at the same time the secret can be reconstructed by only some allowable subsets of nodes. As a special case, an eavesdropper observing some set of specific nodes (such as less than certain number of nodes) does not get any information. In other words, we propose to study a locally repairable distributed storage system that is secure against a {\em passive eavesdropper} that can observe some subsets of nodes. #R##N#We provide a number of results related to such systems including upper-bounds and achievability results on the number of bits that can be securely stored with these constraints.

Connected through hyperedge HE-1 (induced by source paper "secrecy and accessibility in distributed storage"):
  with members:
    - "erasure coding for distributed storage an overview"

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"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "weakly secure regenerating codes for distributed storage"
    - "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 "an overflow problem in network coding for secure cloud storage"):
  with members:
    - "toward optimal secure distributed storage systems with exact repair"
    - "on secrecy capacity of minimum storage regenerating codes"
    - "batched sparse codes"
    - "novel repair by transfer codes and systematic exact mbr codes with lower complexities and smaller field sizes"
    - "data secrecy in distributed storage systems under exact repair"
    - "capacity and security of heterogeneous distributed storage systems"
    - "simple regenerating codes network coding for cloud storage"
    - "information theoretically secure regenerating codes for distributed storage"

Connected through hyperedge HE-4 (induced by source paper "introduction of improved repairing locality into secret sharing schemes with perfect security"):
  with members:
    - "binary cyclic codes that are locally repairable"
    - "repairable threshold secret sharing schemes"
    - "optimal locally repairable codes 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-5 (induced by source paper "a note on secure minimum storage regenerating codes"):
  with members:
    - "progress on high rate msr codes enabling arbitrary number of helper nodes"
    - "minimum storage regenerating codes for all parameters"
    - "explicit constructions of high rate mds array codes with optimal repair bandwidth"
    - "toward optimal secure distributed storage systems with exact repair"
    - "explicit constructions of optimal access mds codes with nearly optimal sub packetization"
    - "security concerns in minimum storage cooperative regenerating codes"
    - "a high rate msr code with polynomial sub packetization level"
    - "characterization of secrecy capacity for general msr codes under passive eavesdropping model"

Connected through hyperedge HE-6 (induced by source paper "bounds on the rate of linear locally repairable codes over small alphabets"):
  with members:
    - "constructions and properties of linear locally repairable codes"
    - "optimal linear and cyclic locally repairable codes over small fields"
    - "cooperative local repair in distributed storage"
    - "bounds on the parameters of locally recoverable codes"
    - "an integer programming based bound for locally repairable codes"
    - "a family of optimal locally recoverable codes"
    - "on coset leader graphs of ldpc codes"
    - "an upper bound on the size of locally recoverable codes"

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)