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: "irregular fractional repetition code optimization for heterogeneous cloud storage"
  Abstract: This paper presents a flexible irregular model for heterogeneous cloud storage systems and investigates how the cost of repairing failed nodes can be minimized. The fractional repetition code, originally designed for minimizing repair bandwidth for homogeneous storage systems, is generalized to the irregular fractional repetition code, which is adaptable to heterogeneous environments. The code structure and the associated storage allocation can be obtained by solving an integer linear programming problem. For moderate sized networks, a heuristic algorithm is proposed and shown to be near-optimal by computer simulations.

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"
    - "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"
    - "analysis and construction of functional regenerating codes with uncoded repair for distributed storage systems"

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"
    - "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"
    - "cooperative regenerating codes"

Connected through hyperedge HE-3 (induced by source paper "on the duality and file size hierarchy of fractional repetition codes"):
  with members:
    - "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"
    - "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"

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"
    - "reconstruction and repair degree of fractional repetition codes"
    - "replication based storage systems with local repair"
    - "explicit mbr all symbol locality codes"
    - "enumerating some fractional repetition 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"
    - "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"
    - "scalable constructions of fractional repetition codes in distributed storage systems"
    - "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"
    - "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"
    - "scalable constructions of fractional repetition codes in distributed storage systems"

Connected through hyperedge HE-7 (induced by source paper "coded caching with distributed storage"):
  with members:
    - "reduced transmission in multi server coded caching"
    - "optimal scalar linear codes for some classes of the two sender groupcast index coding problem"
    - "coded caching in a multi server system with random topology"
    - "structural characteristics of two sender index coding"
    - "caching and delivery via interference elimination"
    - "caching aided coded multicasting with multiple random requests"
    - "order optimal rate of caching and coded multicasting with random demands"
    - "effect of number of users in multi level coded caching"

Connected through hyperedge HE-8 (induced by source paper "on dress codes with flowers"):
  with members:
    - "optimal fractional repetition codes and fractional repetition batch codes"
    - "optimal fractional repetition codes based on graphs and designs"
    - "fractional repetition codes with flexible repair from combinatorial designs"
    - "reconstruction and repair degree of fractional repetition codes"
    - "replication based storage systems with local repair"
    - "enumerating some fractional repetition codes"
    - "on weak dress codes for cloud storage"
    - "distributed storage codes with repair by transfer and nonachievability of interior points on the storage bandwidth tradeoff"

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)