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: "codes between mbr and msr points with exact repair property"
  Abstract: In this paper, distributed storage systems with exact repair are studied. Constructions for exact-regenerating codes between the minimum storage regenerating (MSR) and the minimum bandwidth regenerating (MBR) points are given. To the best of our knowledge, no previous construction of exact-regenerating codes between MBR and MSR points is done except in the works by Tian et al. and Sasidharan et al. In contrast to their works, the methods used here are elementary. In this paper, it is shown that in the case that the parameters \(n\) , \(k\) , and \(d\) are close to each other, the given construction is close to optimal when comparing with the known functional repair capacity. This is done by showing that when the distances of the parameters \(n\) , \(k\) , and \(d\) are fixed but the actual values approach to infinity, the fraction of the performance of constructed codes with exact repair and the known capacity of codes with functional repair, approaches to one. Also, a simple variation of the constructed codes with almost the same performance is given. Also some bounds for the capacity of exact-repairing codes are given. These bounds illustrate the relationships between storage codes with different parameters.

Connected through hyperedge HE-1 (induced by source paper "explicit construction of mbr codes for clustered distributed storage"):
  with members:
    - "explicit constructions of msr codes for clustered distributed storage the rack aware storage model"
    - "the storage versus repair bandwidth trade off for clustered storage systems"
    - "a class of msr codes for clustered distributed storage"
    - "secure clustered distributed storage against eavesdroppers"
    - "optimal repair layering for erasure coded data centers from theory to practice"
    - "increasing availability in distributed storage systems via clustering"
    - "locality and availability of array codes constructed from subspaces"
    - "capacity of clustered distributed storage"

Connected through hyperedge HE-2 (induced by source paper "explicit constructions of mbr and msr codes for clustered distributed storage"):
  with members:
    - "explicit constructions of msr codes for clustered distributed storage the rack aware storage model"
    - "the storage versus repair bandwidth trade off for clustered storage systems"
    - "a class of msr codes for clustered distributed storage"
    - "secure clustered distributed storage against eavesdroppers"
    - "optimal repair layering for erasure coded data centers from theory to practice"
    - "increasing availability in distributed storage systems via clustering"
    - "locality and availability of array codes constructed from subspaces"
    - "capacity of clustered distributed storage"

Connected through hyperedge HE-3 (induced by source paper "a class of msr codes for clustered distributed storage"):
  with members:
    - "the storage versus repair bandwidth trade off for clustered storage systems"
    - "optimal repair layering for erasure coded data centers from theory to practice"
    - "increasing availability in distributed storage systems via clustering"
    - "capacity of clustered distributed storage"
    - "minimum storage regenerating codes for all parameters"
    - "explicit constructions of high rate mds array codes with optimal repair bandwidth"
    - "a family of optimal locally recoverable codes"
    - "optimal locally repairable codes and connections to matroid theory"

Connected through hyperedge HE-4 (induced by source paper "security concerns in minimum storage cooperative regenerating codes"):
  with members:
    - "on secrecy capacity of minimum storage regenerating codes"
    - "layered exact repair regenerating codes via embedded error correction and block designs"
    - "an alternate construction of an access optimal regenerating code with optimal sub packetization level"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "zigzag codes mds array codes with optimal rebuilding"
    - "data secrecy in distributed storage systems under exact repair"
    - "exact repair regenerating codes via layered erasure correction and block designs"
    - "distributed storage codes with repair by transfer and nonachievability of interior points on the storage bandwidth tradeoff"

Connected through hyperedge HE-5 (induced by source paper "a connection between locally repairable codes and exact regenerating codes"):
  with members:
    - "when locally repairable codes meet regenerating codes what if some helpers are unavailable"
    - "layered exact repair regenerating codes via embedded error correction and block designs"
    - "locally repairable codes and matroid theory"
    - "when and by how much can helper node selection improve regenerating codes"
    - "outer bounds for exact repair codes"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "new codes and inner bounds for exact repair in distributed storage systems"
    - "a family of optimal locally recoverable codes"

Connected through hyperedge HE-6 (induced by source paper "improved upper bounds on systematic length for linear 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 optimal access mds codes with nearly optimal sub packetization"
    - "on secrecy capacity of minimum storage regenerating codes"
    - "a high rate msr code with polynomial sub packetization level"
    - "a framework of constructions of minimal storage regenerating codes with the optimal access update property"
    - "layered exact repair regenerating codes via embedded error correction and block designs"
    - "an alternate construction of an access optimal regenerating code with optimal sub packetization level"

Connected through hyperedge HE-7 (induced by source paper "constructions and properties of linear locally repairable codes"):
  with members:
    - "constructions of optimal and almost optimal locally repairable codes"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "a family of optimal locally recoverable codes"
    - "binary cyclic codes that are locally repairable"
    - "optimal locally repairable linear codes"
    - "optimal locally repairable codes via rank metric codes"
    - "an upper bound on the size of locally recoverable codes"
    - "optimal locally repairable codes and connections to matroid theory"

Connected through hyperedge HE-8 (induced by source paper "local codes with cooperative repair in distributed storage system"):
  with members:
    - "exact regenerating codes between mbr and msr points"
    - "optimal locally repairable codes via rank metric codes"
    - "distributed storage codes with repair by transfer and nonachievability of interior points on the storage bandwidth tradeoff"
    - "locally repairable codes"
    - "simple regenerating codes network coding for cloud storage"
    - "on the locality of codeword symbols"
    - "self repairing homomorphic codes for distributed storage systems"

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)