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 "new codes and inner bounds for exact repair in distributed storage systems"):
  Abstract: We study the exact-repair tradeoff between storage and repair bandwidth in distributed storage systems (DSS). We give new inner bounds for the tradeoff region and provide code constructions that achieve these bounds.

Includes members:
  Member "distributed data storage systems with opportunistic repair":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "differentiated latency in data center networks with erasure coded files through traffic engineering")
  Member "exact regenerating codes between mbr and msr points":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "local codes with cooperative repair in distributed storage system")
  Member "rate region of the 4 3 3 exact repair regenerating codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "increasing availability in distributed storage systems via clustering")
  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 "exact repair regenerating codes via layered erasure correction and block designs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on secure exact repair regenerating codes with a single pareto optimal point")
  Member "high rate regenerating codes through layering":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a connection between locally repairable codes and exact regenerating codes")
  Member "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction":
    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 "repair optimal erasure codes through hadamard designs":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "convertible codes efficient conversion of coded data in distributed storage")

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)