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 "centralized repair of multiple node failures with applications to communication efficient secret sharing"):
  Abstract: This paper considers a distributed storage system, where multiple storage nodes can be reconstructed simultaneously at a centralized location. This centralized multi-node repair (CMR) model is a generalization of regenerating codes that allow for bandwidth-efficient repair of a single failed node. This work focuses on the trade-off between the amount of data stored and repair bandwidth in this CMR model. In particular, repair bandwidth bounds are derived for the minimum storage multi-node repair (MSMR) and the minimum bandwidth multi-node repair (MBMR) operating points. The tightness of these bounds are analyzed via code constructions. The MSMR point is characterized through codes achieving this point under functional repair for general set of CMR parameters, as well as with codes enabling exact repair for certain CMR parameters. The MBMR point, on the other hand, is characterized with exact repair codes for all CMR parameters for systems that satisfy a certain entropy accumulation property. Finally, the model proposed here is utilized for the secret sharing problem, where the codes for the multi-node repair problem is used to construct communication efficient secret sharing schemes with the property of bandwidth efficient share repair.

Includes members:
  Member "on the tradeoff region of secure exact repair regenerating codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "multilevel diversity coding with secure regeneration separate coding achieves the mbr point")
  Member "minimum storage regenerating codes for all parameters":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "towards practical private information retrieval from mds array codes")
  Member "broadcast repair for wireless distributed storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "practical functional regenerating codes for broadcast repair of multiple nodes")
  Member "explicit constructions of high rate mds array codes with optimal repair bandwidth":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "towards practical private information retrieval from mds array codes")
  Member "security concerns in minimum storage cooperative regenerating codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "cooperative repair of multiple node failures in distributed storage systems")
  Member "optimal rebuilding of multiple erasures in mds codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "new constructions of cooperative msr codes reducing node size to exp o n")
  Member "on secrecy capacity of minimum storage regenerating codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "achieving secrecy capacity of minimum storage regenerating codes for all feasible n k d parameter values")
  Member "a high rate msr code with polynomial sub packetization level":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "cascade codes for distributed storage systems")

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)