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: "scalable constructions of fractional repetition codes in distributed storage systems"
  Abstract: In distributed storage systems built using commodity hardware, it is necessary to have data redundancy in order to ensure system reliability. In such systems, it is also often desirable to be able to quickly repair storage nodes that fail. We consider a scheme — introduced by El Rouayheb and Ramchandran — which uses combinatorial block design in order to design storage systems that enable efficient (and exact) node repair. In this work, we investigate systems where node sizes may be much larger than replication degrees, and explicitly provide algorithms for constructing these storage designs. Our designs, which are related to projective geometries, are based on the construction of bipartite cage graphs (with girth 6) and the concept of mutually-orthogonal Latin squares. Via these constructions, we can guarantee that the resulting designs require the fewest number of storage nodes for the given parameters, and can further show that these systems can be easily expanded without need for frequent reconfiguration.

Connected through hyperedge HE-1 (induced by source paper "on universally good flower codes"):
  with members:
    - "on the duality of fractional repetition codes"
    - "on some universally good fractional repetition codes"
    - "irregular fractional repetition code optimization for heterogeneous cloud storage"
    - "optimal fractional repetition codes based on graphs and designs"
    - "reconstruction and repair degree of fractional repetition codes"
    - "enumerating some fractional repetition codes"
    - "distributed storage codes with repair by transfer and nonachievability of interior points on the storage bandwidth tradeoff"
    - "repairable replication based storage systems using resolvable designs"

Connected through hyperedge HE-2 (induced by source paper "load balanced fractional repetition codes"):
  with members:
    - "nearly optimal constructions of pir and batch codes"
    - "fractional repetition and erasure batch codes"
    - "irregular fractional repetition code optimization for heterogeneous cloud storage"
    - "optimal fractional repetition codes based on graphs and designs"
    - "codes with locality for two erasures"
    - "batch codes through dense graphs without short cycles"
    - "fractional repetition codes with flexible repair from combinatorial designs"
    - "distributed storage codes with repair by transfer and nonachievability of interior points on the storage bandwidth tradeoff"

Connected through hyperedge HE-3 (induced by source paper "locality and availability of array codes constructed from subspaces"):
  with members:
    - "nearly optimal constructions of pir and batch codes"
    - "lengthening and extending binary private information retrieval codes"
    - "binary shortened projective reed muller codes for coded private information retrieval"
    - "locality via partially lifted codes"
    - "pir array codes with optimal virtual server rate"
    - "bounds and constructions of codes with multiple localities"
    - "codes with unequal locality"
    - "on private information retrieval array codes"

Connected through hyperedge HE-4 (induced by source paper "bounds on fractional repetition codes using hypergraphs"):
  with members:
    - "load balanced fractional repetition codes"
    - "on the duality of fractional repetition codes"
    - "on some universally good fractional repetition codes"
    - "optimal fractional repetition codes and fractional repetition batch codes"
    - "irregular fractional repetition code optimization for heterogeneous cloud storage"
    - "reconstruction and repair degree of fractional repetition codes"
    - "replication based storage systems with local repair"
    - "explicit mbr all symbol locality codes"

Connected through hyperedge HE-5 (induced by source paper "on code rates of fractional repetition codes"):
  with members:
    - "on some universally good fractional repetition codes"
    - "irregular fractional repetition code optimization for heterogeneous cloud storage"
    - "reconstruction and repair degree of fractional repetition codes"
    - "explicit mbr all symbol locality codes"
    - "enumerating some fractional repetition codes"
    - "on weak dress codes for cloud storage"
    - "repairable replication based storage systems using resolvable designs"
    - "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction"

Connected through hyperedge HE-6 (induced by source paper "on the duality of fractional repetition codes"):
  with members:
    - "on dress codes with flowers"
    - "irregular fractional repetition code optimization for heterogeneous cloud storage"
    - "optimal fractional repetition codes based on graphs and designs"
    - "fractional repetition codes with flexible repair from combinatorial designs"
    - "xoring elephants novel erasure codes for big data"
    - "enumerating some fractional repetition codes"
    - "on weak dress codes for cloud storage"
    - "repairable replication based storage systems using resolvable designs"

Connected through hyperedge HE-7 (induced by source paper "when can helper node selection improve regenerating codes part ii an explicit exact repair code construction"):
  with members:
    - "optimal fractional repetition codes based on graphs and designs"
    - "replication based storage systems with local repair"
    - "explicit mbr all symbol locality codes"
    - "distributed storage codes with repair by transfer and nonachievability of interior points on the storage bandwidth tradeoff"
    - "interference alignment in regenerating codes for distributed storage necessity and code constructions"
    - "repairable replication based storage systems using resolvable designs"
    - "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction"
    - "a construction of systematic mds codes with minimum repair bandwidth"

Connected through hyperedge HE-8 (induced by source paper "flexible fractional repetition codes for distributed storage networks"):
  with members:
    - "optimal fractional repetition codes based on graphs and designs"
    - "fractional repetition codes with flexible repair from combinatorial designs"
    - "replication based storage systems with local repair"
    - "distributed storage codes with repair by transfer and nonachievability of interior points on the storage bandwidth tradeoff"
    - "interference alignment in regenerating codes for distributed storage necessity and code constructions"
    - "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction"
    - "a construction of systematic mds codes with minimum repair bandwidth"
    - "fractional repetition codes for repair in 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)