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 "practical functional regenerating codes for broadcast repair of multiple nodes"):
  Abstract: A code construction and repair scheme for optimal functional regeneration of multiple node failures is presented, which is based on stitching together short MDS codes on carefully chosen sets of points lying on a linearized polynomial. The nodes are connected wirelessly, hence all transmissions by helper nodes during a repair round are available to all the nodes being repaired. The scheme is simple and practical because of low subpacketization, low I/O cost and low computational cost. Achievability of the minimum-bandwidth regenerating (MBR) point, as well as an interior point, on the optimal storage-repair bandwidth tradeoff curve is shown. The subspace properties derived in the paper provide insight into the general properties of functional regenerating codes.

Includes members:
  Member "functional repair codes a view from projective geometry":
    also connected through other hyperedges:
      (none)
  Member "centralized multi node repair regenerating codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the sub packetization size and the repair bandwidth of reed solomon codes")
  Member "broadcast repair for wireless distributed storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "storage repair bandwidth trade off for wireless caching with partial failure and broadcast repair")
  Member "centralized repair of multiple node failures with applications to communication efficient secret sharing":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "distributed secure storage rate privacy trade off and xor based coding scheme")
  Member "characterizations and construction methods for linear functional repair storage codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "functional repair codes a view from projective geometry")
  Member "exact cooperative regenerating codes with minimum repair bandwidth for distributed storage":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the achievability region of regenerating codes for multiple erasures")
  Member "cooperative regenerating codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "explicit constructions of msr codes for clustered distributed storage the rack aware storage model")
  Member "repairing multiple failures with coordinated and adaptive regenerating codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "new constructions of cooperative msr codes reducing node size to exp o n")

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)