human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "explicit codes minimizing repair bandwidth for distributed storage"
  Abstract: We consider the setting of data storage across n nodes in a distributed manner. A data collector (DC) should be able to reconstruct the entire data by connecting to any k out of the n nodes and downloading all the data stored in them. When a node fails, it has to be regenerated back using the existing nodes. In a recent paper, Wu et al. have obtained an information theoretic lower bound for the repair bandwidth. Also, there has been additional interest in storing data in systematic form as no post processing is required when DC connects to k systematic nodes. Because of their preferred status there is a need to regenerate back any systematic node quickly and exactly. Replacement of a failed node by an exact replica is termed Exact Regeneration.In this paper, we consider the problem of minimizing the repair bandwidth for exact regeneration of the systematic nodes. The file to be stored is of size B and each node can store alpha = B/k units of data. A failed systematic node is regenerated by downloading beta units of data each from d existing nodes. We give a lower bound for the repair bandwidth for exact regeneration of the systematic nodes which matches with the bound given by Wu et al. For d >= 2k-1 we give an explicit code construction which minimizes the repair bandwidth when the existing k-1 systematic nodes participate in the regeneration. We show the existence and construction of codes that achieve the bound for d >= 2k-3. Here we also establish the necessity of interference alignment. We prove that the bound is not achievable for d  = 2k-1.

Connected through hyperedge HE-1 (induced by source paper "rack aware regenerating codes for data centers"):
  with members:
    - "explicit construction of mbr codes for clustered distributed storage"
    - "the storage versus repair bandwidth trade off for clustered storage systems"
    - "a class of msr codes for clustered distributed storage"
    - "optimal repair layering for erasure coded data centers from theory to practice"
    - "capacity of clustered distributed storage"
    - "minimum storage regenerating codes for all parameters"
    - "xoring elephants novel erasure codes for big data"
    - "a realistic distributed storage system that minimizes data storage and repair bandwidth"

Connected through hyperedge HE-2 (induced by source paper "a class of msr codes for clustered distributed storage"):
  with members:
    - "the storage versus repair bandwidth trade off for clustered storage systems"
    - "optimal repair layering for erasure coded data centers from theory to practice"
    - "increasing availability in distributed storage systems via clustering"
    - "capacity of clustered distributed storage"
    - "minimum storage regenerating codes for all parameters"
    - "explicit constructions of high rate mds array codes with optimal repair bandwidth"
    - "codes between mbr and msr points with exact repair property"
    - "a family of optimal locally recoverable codes"

Connected through hyperedge HE-3 (induced by source paper "efficiently repairing algebraic geometry codes"):
  with members:
    - "repairing reed solomon codes"
    - "a family of optimal locally recoverable codes"
    - "zigzag codes mds array codes with optimal rebuilding"
    - "an improved sub packetization bound for minimum storage regenerating codes"
    - "optimal locally repairable codes and connections to matroid theory"
    - "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction"
    - "exact regenerating codes for byzantine fault tolerance in distributed storage"
    - "optimal repair of mds codes in distributed storage via subspace interference alignment"

Connected through hyperedge HE-4 (induced by source paper "mds codes with progressive engagement property for cloud storage systems"):
  with members:
    - "the storage repair bandwidth trade off of exact repair linear regenerating codes for the case d k n 1"
    - "zigzag codes mds array codes with optimal rebuilding"
    - "rate region of the 4 3 3 exact repair regenerating codes"
    - "exact repair regenerating codes via layered erasure correction and block designs"
    - "optimal repair of mds codes in distributed storage via subspace interference alignment"
    - "a survey on network codes for distributed storage"
    - "exact regeneration codes for distributed storage repair using interference alignment"

Connected through hyperedge HE-5 (induced by source paper "progress on high rate msr codes enabling arbitrary number of helper nodes"):
  with members:
    - "zigzag codes mds array codes with optimal rebuilding"
    - "an improved sub packetization bound for minimum storage regenerating codes"
    - "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction"
    - "repair optimal erasure codes through hadamard designs"
    - "on codes for optimal rebuilding access"

Connected through hyperedge HE-6 (induced by source paper "information theoretically secure erasure codes for distributed storage"):
  with members:
    - "toward optimal secure distributed storage systems with exact repair"
    - "the storage repair bandwidth trade off of exact repair linear regenerating codes for the case d k n 1"
    - "a framework of constructions of minimal storage regenerating codes with the optimal access update property"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "an improved outer bound on the storage repair bandwidth tradeoff of exact repair regenerating codes"
    - "a framework of constructions of minimum storage regenerating codes with the optimal update access property for distributed storage systems based on invariant subspace technique"
    - "novel repair by transfer codes and systematic exact mbr codes with lower complexities and smaller field sizes"
    - "generalization of rashmi shah kumar minimum storage regenerating codes"

Connected through hyperedge HE-7 (induced by source paper "repairing reed solomon codes"):
  with members:
    - "repairing reed solomon codes with two erasures"
    - "progress on high rate msr codes enabling arbitrary number of helper nodes"
    - "explicit constructions of optimal access mds codes with nearly optimal sub packetization"
    - "a high rate msr code with polynomial sub packetization level"
    - "communication efficient secret sharing"
    - "bounds on locally recoverable codes with multiple recovering sets"
    - "a family of optimal locally recoverable codes"
    - "update efficient regenerating codes with minimum per node storage"

Connected through hyperedge HE-8 (induced by source paper "optimal construction of regenerating code through rate matching in hostile networks"):
  with members:
    - "toward optimal secure distributed storage systems with exact repair"
    - "repairing reed solomon codes"
    - "beyond the mds bound in distributed cloud storage"
    - "layered exact repair regenerating codes via embedded error correction and block designs"
    - "multilevel diversity coding with regeneration"
    - "regenerating codes for errors and erasures in distributed storage"
    - "interference alignment in regenerating codes for distributed storage necessity and code constructions"
    - "exact cooperative regenerating codes with minimum repair bandwidth for distributed storage"

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