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 "network traffic driven storage repair"):
  Abstract: Recently we constructed an explicit family of locally repairable and locally regenerating codes. Their existence was proven by Kamath et al. but no explicit construction was given. Our design is based on HashTag codes that can have different sub-packetization levels. In this work we emphasize the importance of having two ways to repair a node: repair only with local parity nodes or repair with both local and global parity nodes. We say that the repair strategy is network traffic driven since it is in connection with the concrete system and code parameters: the repair bandwidth of the code, the number of I/O operations, the access time for the contacted parts and the size of the stored file. We show the benefits of having repair duality in one practical example implemented in Hadoop. We also give algorithms for efficient repair of the global parity nodes.

Includes members:
  Member "repair duality with locally repairable and locally regenerating codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "sok of used cryptography in blockchain")
  Member "product matrix msr codes with bandwidth adaptive exact repair":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "convertible codes efficient conversion of coded data in distributed storage")
  Member "improved schemes for asymptotically optimal repair of mds codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "new constructions of cooperative msr codes reducing node size to exp o n")
  Member "ldpc code design for distributed storage balancing repair bandwidth reliability and storage overhead":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "babel storage uncoordinated content delivery from multiple coded storage systems")
  Member "codes with unequal locality":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "private information retrieval from locally repairable databases with colluding servers")
  Member "minimum storage regenerating codes for all parameters":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "towards practical private information retrieval from mds array codes")
  Member "general sub packetized access optimal regenerating codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "erasure codes for distributed storage tight bounds and matching constructions")
  Member "hashtag erasure codes from theory to practice":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "towards practical private information retrieval from mds array 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)