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: "network coding for distributed storage systems"
  Abstract: Distributed storage systems provide reliable access to data through redundancy spread over individually unreliable nodes. Application scenarios include data centers, peer-to-peer storage systems, and storage in wireless networks. Storing data using an erasure code, in fragments spread across nodes, requires less redundancy than simple replication for the same level of reliability. However, since fragments must be periodically replaced as nodes fail, a key question is how to generate encoded fragments in a distributed way while transferring as little data as possible across the network. #R##N#For an erasure coded system, a common practice to repair from a node failure is for a new node to download subsets of data stored at a number of surviving nodes, reconstruct a lost coded block using the downloaded data, and store it at the new node. We show that this procedure is sub-optimal. We introduce the notion of regenerating codes, which allow a new node to download \emph{functions} of the stored data from the surviving nodes. We show that regenerating codes can significantly reduce the repair bandwidth. Further, we show that there is a fundamental tradeoff between storage and repair bandwidth which we theoretically characterize using flow arguments on an appropriately constructed graph. By invoking constructive results in network coding, we introduce regenerating codes that can achieve any point in this optimal tradeoff.

Connected through hyperedge HE-1 (induced by source paper "new bounds on the field size for maximally recoverable codes instantiating grid like topologies"):
  with members:
    - "on maximally recoverable codes for product topologies"
    - "maximally recoverable lrcs a field size lower bound and constructions for few heavy parities"
    - "maximally recoverable codes for grid like topologies"
    - "binary codes with locality for multiple erasures having short block length"
    - "optimal binary locally repairable codes via anticodes"
    - "binary linear locally repairable codes"
    - "locally recoverable codes on algebraic curves"
    - "repair locality with multiple erasure tolerance"

Connected through hyperedge HE-2 (induced by source paper "on the i o costs of some repair schemes for full length reed solomon codes"):
  with members:
    - "improved schemes for asymptotically optimal repair of mds codes"
    - "optimal repair of reed solomon codes achieving the cut set bound"
    - "repairing reed solomon codes universally achieving the cut set bound for any number of erasures"
    - "repairing reed solomon codes with two erasures"
    - "repairing multiple failures for scalar mds codes"
    - "repairing reed solomon codes with multiple erasures"
    - "repairing reed solomon codes"
    - "a repair framework for scalar mds codes"

Connected through hyperedge HE-3 (induced by source paper "epsilon msr codes contacting fewer code blocks for exact repair"):
  with members:
    - "explicit constructions of high rate mds array codes with optimal repair bandwidth"
    - "zigzag codes mds array codes with optimal rebuilding"
    - "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction"

Connected through hyperedge HE-4 (induced by source paper "bandwidth adaptive error resilient mbr exact repair regenerating codes"):
  with members:
    - "product matrix msr codes with bandwidth adaptive exact repair"
    - "product matrix minimum storage regenerating codes with flexible number of helpers"
    - "mds codes with progressive engagement property for cloud storage systems"
    - "explicit constructions of high rate mds array codes with optimal repair bandwidth"
    - "on mbr codes with replication"
    - "explicit constructions of optimal access mds codes with nearly optimal sub packetization"
    - "information theoretically secure erasure codes for distributed storage"
    - "beyond the mds bound in distributed cloud storage"

Connected through hyperedge HE-5 (induced by source paper "product matrix msr codes with bandwidth adaptive exact repair"):
  with members:
    - "bandwidth adaptive error resilient mbr exact repair regenerating codes"
    - "product matrix minimum storage regenerating codes with flexible number of helpers"
    - "mds codes with progressive engagement property for cloud storage systems"
    - "general sub packetized access optimal regenerating codes"
    - "explicit constructions of high rate mds array codes with optimal repair bandwidth"
    - "asymptotically optimal regenerating codes over any field"
    - "explicit constructions of optimal access mds codes with nearly optimal sub packetization"
    - "a high rate msr code with polynomial sub packetization level"

Connected through hyperedge HE-6 (induced by source paper "on the service capacity region of accessing erasure coded content"):
  with members:
    - "simplex queues for hot data download"
    - "on storage allocation for maximum service rate in distributed storage systems"
    - "repair locality with multiple erasure tolerance"
    - "locality and availability in distributed storage"
    - "bounds on locally recoverable codes with multiple recovering sets"
    - "fast cloud pushing the envelope on delay performance of cloud storage with coding"
    - "coding for fast content download"
    - "the mds queue analysing the latency performance of erasure codes"

Connected through hyperedge HE-7 (induced by source paper "optimal repair schemes for some families of full length reed solomon codes"):
  with members:
    - "repairing reed solomon codes"
    - "zigzag codes mds array codes with optimal rebuilding"
    - "a repair framework for scalar mds codes"
    - "locally repairable codes"
    - "on the locality of codeword symbols"
    - "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction"
    - "on codes for optimal rebuilding access"
    - "self repairing homomorphic codes for distributed storage systems"

Connected through hyperedge HE-8 (induced by source paper "liquid cloud storage"):
  with members:
    - "xoring elephants novel erasure codes for big data"
    - "coding for fast content download"
    - "on the locality of codeword symbols"

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)