human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "on heterogeneous regenerating codes and capacity of distributed storage systems"):
  Abstract: Heterogeneous Distributed Storage Systems (DSS) are close to real world applications for data storage. Internet caching system and peer-to-peer storage clouds are the examples of such DSS. In this work, we calculate the capacity formula for such systems where each node store different number of packets and each having a different repair bandwidth (node can be repaired by contacting a specific set of nodes). The tradeoff curve between storage and repair bandwidth is studied for such heterogeneous DSS. By analyzing the capacity formula new minimum bandwidth regenerating (MBR) and minimum storage regenerating (MBR) points are obtained on the curve. It is shown that in some cases these are better than the homogeneous DSS.

Includes members:
  Member "when and by how much can helper node selection improve regenerating codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a connection between locally repairable codes and exact regenerating codes")
  Member "new codes and inner bounds for exact repair in distributed storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "cascade codes for distributed storage systems")
  Member "xoring elephants novel erasure codes for big data":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on optimal locally repairable codes and generalized sector disk codes")
  Member "capacity and security of heterogeneous distributed storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "capacity of distributed storage systems with clusters and separate nodes")
  Member "explicit mbr all symbol locality codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the complete hierarchical locality of the punctured simplex code")
  Member "on weak dress codes for cloud storage":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "bounds on fractional repetition codes using hypergraphs")
  Member "distributed storage codes with repair by transfer and nonachievability of interior points on the storage bandwidth tradeoff":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "enabling optimal access and error correction for the repair of reed solomon codes")
  Member "codes with local regeneration":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "locally recoverable j affine variety codes")

Question: Please tell me which class the source paper 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)