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: "minimization of storage cost in distributed storage systems with repair consideration"
  Abstract: In a distributed storage system, the storage costs of different storage nodes, in general, can be different. How to store a file in a given set of storage nodes so as to minimize the total storage cost is investigated. By analyzing the min-cut constraints of the information flow graph, the feasible region of the storage capacities of the nodes can be determined. The storage cost minimization can then be reduced to a linear programming problem, which can be readily solved. Moreover, the tradeoff between storage cost and repair-bandwidth is established.

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 "storage allocation for multi class distributed data storage systems"):
  with members:
    - "optimal storage allocation for wireless cloud caching systems with a limited sum storage capacity"
    - "on storage allocation for maximum service rate in distributed storage systems"
    - "on distributed storage allocations for memory limited systems"
    - "on the delay storage trade off in content download from coded distributed storage systems"
    - "distributed storage allocations"
    - "allocations for heterogenous distributed storage"
    - "distributed storage allocations for optimal delay"
    - "memory allocation in distributed storage networks"

Connected through hyperedge HE-3 (induced by source paper "irregular fractional repetition code optimization for heterogeneous cloud storage"):
  with members:
    - "zigzag codes mds array codes with optimal rebuilding"
    - "capacity and security of heterogeneous distributed storage systems"
    - "enumerating some fractional repetition codes"
    - "wireless device to device communications with distributed caching"
    - "distributed storage allocations"
    - "repairable replication based storage systems using resolvable designs"
    - "locally repairable codes"
    - "scalable constructions of fractional repetition codes in distributed storage systems"

Connected through hyperedge HE-4 (induced by source paper "a realistic distributed storage system the rack model"):
  with members:
    - "non homogeneous 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)