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: "non homogeneous distributed storage systems"
  Abstract: This paper describes a non-homogeneous distributed storage systems (DSS), where there is one super node which has a larger storage size and higher reliability and availability than the other storage nodes. We propose three distributed storage schemes based on (k+2; k) maximum distance separable (MDS) codes and non-MDS codes to show the efficiency of such non-homogeneous DSS in terms of repair efficiency and data availability. Our schemes achieve optimal bandwidth (k+1/2)(M/k) when repairing 1-node failure, but require only one fourth of the minimum required file size and can operate with a smaller field size leading to significant complexity reduction than traditional homogeneous DSS. Moreover, with non-MDS codes, our scheme can achieve an even smaller repair bandwidth of M/2k . Finally, we show that our schemes can increase the data availability by 10% than the traditional homogeneous DSS scheme.

Connected through hyperedge HE-1 (induced by source paper "multi rack distributed data storage networks"):
  with members:
    - "the storage versus repair bandwidth trade off for clustered storage systems"
    - "increasing availability in distributed storage systems via clustering"
    - "capacity of clustered distributed storage"
    - "maximally recoverable codes for grid like topologies"
    - "architecture aware coding for distributed storage repairable block failure resilient codes"
    - "codes with hierarchical locality"
    - "xoring elephants novel erasure codes for big data"
    - "a realistic distributed storage system that minimizes data storage and repair bandwidth"

Connected through hyperedge HE-2 (induced by source paper "binary locally repairable codes sequential repair for multiple erasures"):
  with members:
    - "cooperative local repair in distributed storage"
    - "locally repairable codes with functional repair and multiple erasure tolerance"
    - "repair locality with multiple erasure tolerance"
    - "locality and availability in distributed storage"
    - "codes with locality for two erasures"
    - "bounds on locally recoverable codes with multiple recovering sets"
    - "a family of optimal locally recoverable codes"
    - "optimal locally repairable linear codes"

Connected through hyperedge HE-3 (induced by source paper "erasure codes with symbol locality and group decodability for distributed storage"):
  with members:
    - "cooperative local repair in distributed storage"
    - "locally encodable and decodable codes for distributed storage systems"
    - "repair locality with multiple erasure tolerance"
    - "bounds on locally recoverable codes with multiple recovering sets"
    - "a family of optimal locally recoverable codes"
    - "on the existence of mds codes over small fields with constrained generator matrices"
    - "optimal locally repairable linear codes"
    - "balanced sparsest generator matrices for mds codes"

Connected through hyperedge HE-4 (induced by source paper "capacity and security of heterogeneous distributed storage systems"):
  with members:
    - "xoring elephants novel erasure codes for big data"
    - "wireless device to device communications with distributed caching"
    - "distributed storage allocations"
    - "allocations for heterogenous distributed storage"
    - "cooperative regenerating codes"
    - "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction"
    - "repairing multiple failures with coordinated and adaptive regenerating codes"
    - "a construction of systematic mds codes with minimum repair bandwidth"

Connected through hyperedge HE-5 (induced by source paper "on block security of regenerating codes at the mbr point for distributed storage systems"):
  with members:
    - "optimal locally repairable linear codes"
    - "data secrecy in distributed storage systems under exact repair"
    - "regenerating codes for errors and erasures in distributed storage"
    - "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 the security of index coding with side information"
    - "fractional repetition codes for repair in distributed storage systems"
    - "security in distributed storage systems by communicating a logarithmic number of bits"

Connected through hyperedge HE-6 (induced by source paper "optimal locally repairable linear codes"):
  with members:
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "optimal locally repairable codes and connections to matroid theory"
    - "codes with local regeneration"
    - "on locality in distributed storage systems"
    - "partial mds codes and their application to raid type of architectures"
    - "optimal linear codes with a local error correction property"
    - "locally repairable codes"
    - "simple regenerating codes network coding for cloud storage"

Connected through hyperedge HE-7 (induced by source paper "a realistic distributed storage system the rack model"):
  with members:
    - "minimization of storage cost in distributed storage systems with repair consideration"

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)