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: "optimal locally repairable and secure codes for distributed storage systems"
  Abstract: This paper aims to go beyond resilience into the study of security and local-repairability for distributed storage systems (DSSs). Security and local-repairability are both important as features of an efficient storage system, and this paper aims to understand the trade-offs between resilience, security, and local-repairability in these systems. In particular, this paper first investigates security in the presence of colluding eavesdroppers, where eavesdroppers are assumed to work together in decoding the stored information. Second, this paper focuses on coding schemes that enable optimal local repairs. It further brings these two concepts together to develop locally repairable coding schemes for DSS that are secure against eavesdroppers. The main results of this paper include: 1) an improved bound on the secrecy capacity for minimum storage regenerating codes; 2) secure coding schemes that achieve the bound for some special cases; 3) a new bound on minimum distance for locally repairable codes; 4) code construction for locally repairable codes that attain the minimum distance bound; and 5) repair-bandwidth-efficient locally repairable codes with and without security constraints.

Connected through hyperedge HE-1 (induced by source paper "on optimal locally repairable codes and generalized sector disk codes"):
  with members:
    - "array codes with local properties"
    - "universal and dynamic locally repairable codes with maximal recoverability via sum rank codes"
    - "how long can optimal locally repairable codes be"
    - "explicit construction of optimal locally recoverable codes of distance 5 and 6 via binary constant weight codes"
    - "on optimal locally repairable codes with super linear length"
    - "explicit optimal length locally repairable codes of distance 5"
    - "locality and availability of array codes constructed from subspaces"
    - "optimal locally repairable codes via elliptic curves"

Connected through hyperedge HE-2 (induced by source paper "roos bound for skew cyclic codes in hamming and rank metric"):
  with members:
    - "skew polynomial rings and skew cyclic codes"
    - "random construction of partial mds codes"
    - "generalized gabidulin codes over fields of any characteristic"
    - "a sugiyama like decoding algorithm for convolutional codes"
    - "vector network coding based on subspace codes outperforms scalar linear network coding"
    - "on the roots and minimum rank distance of skew cyclic codes"
    - "generalization of gabidulin codes over fields of rational functions"
    - "universal secure network coding via rank metric codes"

Connected through hyperedge HE-3 (induced by source paper "partial mds codes with local regeneration"):
  with members:
    - "on error decoding of locally repairable and partial mds codes"
    - "locally repairable and locally regenerating codes obtained by parity splitting of hashtag codes"
    - "explicit constructions of high rate mds array codes with optimal repair bandwidth"
    - "explicit maximally recoverable codes with locality"
    - "optimal locally repairable codes and connections to matroid theory"
    - "partial mds codes and their application to raid type of architectures"
    - "on the locality of codeword symbols"

Connected through hyperedge HE-4 (induced by source paper "private information retrieval from locally repairable databases with colluding servers"):
  with members:
    - "maximally recoverable codes with hierarchical locality"
    - "one shot pir refinement and lifting"
    - "private information retrieval over networks"
    - "private information retrieval from mds coded data in distributed storage systems"
    - "a general private information retrieval scheme for mds coded databases with colluding servers"
    - "skew and linearized reed solomon codes and maximum sum rank distance codes over any division ring"
    - "private information retrieval from mds coded data with colluding servers settling a conjecture by freij hollanti et al"
    - "bounds and constructions of codes with multiple localities"

Connected through hyperedge HE-5 (induced by source paper "equivalence and characterizations of linear rank metric codes based on invariants"):
  with members:
    - "on the security of a loidreau s rank metric code based encryption scheme"
    - "invariants and inequivalence of linear rank metric codes"
    - "random construction of partial mds codes"
    - "systematic encoders for generalized gabidulin codes and the q analogue of cauchy matrices"
    - "on the genericity of maximum rank distance and gabidulin codes"
    - "generalized gabidulin codes over fields of any characteristic"
    - "new criteria for mrd and gabidulin codes and some rank metric code constructions"
    - "further generalisations of twisted gabidulin codes"

Connected through hyperedge HE-6 (induced by source paper "locally repairable convolutional codes with sliding window repair"):
  with members:
    - "reliable and secure multishot network coding using linearized reed solomon codes"
    - "universal and dynamic locally repairable codes with maximal recoverability via sum rank codes"
    - "locally repairable codes with unequal local erasure correction"
    - "skew and linearized reed solomon codes and maximum sum rank distance codes over any division ring"
    - "bounds and constructions of codes with multiple localities"
    - "codes with unequal locality"
    - "superregular matrices and applications to convolutional codes"
    - "convolutional codes in rank metric with application to random network coding"

Connected through hyperedge HE-7 (induced by source paper "the complete hierarchical locality of the punctured simplex code"):
  with members:
    - "codes with hierarchical locality from covering maps of curves"
    - "combinatorial alphabet dependent bounds for locally recoverable codes"
    - "matroid theory and storage codes bounds and constructions"
    - "alphabet dependent bounds for linear locally repairable codes based on residual codes"
    - "optimal linear and cyclic locally repairable codes over small fields"
    - "codes with hierarchical locality"
    - "locality and availability in distributed storage"
    - "a family of optimal locally recoverable codes"

Connected through hyperedge HE-8 (induced by source paper "achieving secrecy capacity of minimum storage regenerating codes for all feasible n k d parameter values"):
  with members:
    - "minimum storage regenerating codes for all parameters"
    - "explicit constructions of high rate mds array codes with optimal repair bandwidth"
    - "on secrecy capacity of minimum storage regenerating codes"
    - "data secrecy in distributed storage systems under exact repair"
    - "distributed storage codes with repair by transfer and nonachievability of interior points on the storage bandwidth tradeoff"
    - "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"
    - "on secure distributed data storage under repair dynamics"

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)