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 constructions of high rate mds array codes with optimal repair bandwidth"
  Abstract: Maximum distance separable (MDS) codes are optimal error-correcting codes in the sense that they provide the maximum failure-tolerance for a given number of parity nodes. Suppose that an MDS code with $k$ information nodes and $r=n-k$ parity nodes is used to encode data in a distributed storage system. It is known that if $h$ out of the $n$ nodes are inaccessible and $d$ surviving (helper) nodes are used to recover the lost data, then we need to download at least $h/(d+h-k)$ fraction of the data stored in each of the helper nodes (Dimakis et. al., 2010 and Cadambe et al., 2013). If this lower bound is achieved for the repair of any $h$ erased nodes from any $d$ helper nodes, we say that the MDS code has the $(h,d)$-optimal repair property. #R##N#We study high-rate MDS array codes with the optimal repair property. Explicit constructions of such codes in the literature are only available for the cases where there are at most 3 parity nodes, and these existing constructions can only optimally repair a single node failure by accessing all the surviving nodes. #R##N#In this paper, given any $r$ and $n$, we present two explicit constructions of MDS array codes with the $(h,d)$-optimal repair property for all $h\le r$ and $k\le d\le n-h$ simultaneously. Codes in the first family can be constructed over any base field $F$ as long as $|F|\ge sn,$ where $s=\text{lcm}(1,2,\dots,r).$ The encoding, decoding, repair of failed nodes, and update procedures of these codes all have low complexity. Codes in the second family have the optimal access property and can be constructed over any base field $F$ as long as $|F|\ge n+1.$ Moreover, both code families have the optimal error resilience capability when repairing failed nodes. We also construct several other related families of MDS codes with the optimal repair property.

Connected through hyperedge HE-1 (induced by source paper "towards practical private information retrieval from mds array codes"):
  with members:
    - "a new capacity achieving private information retrieval scheme with almost optimal file length for coded servers"
    - "on the pir capacity of msr codes"
    - "breaking the mds pir capacity barrier via joint storage coding"
    - "a generic transformation to enable optimal repair in mds codes for distributed storage systems"
    - "capacity achieving private information retrieval codes with optimal message size and upload cost"
    - "private information retrieval from mds coded data in distributed storage systems"
    - "on sub packetization and access number of capacity achieving pir schemes for mds coded non colluding servers"
    - "private information retrieval schemes with regenerating codes"

Connected through hyperedge HE-2 (induced by source paper "enabling optimal access and error correction for the repair of reed solomon codes"):
  with members:
    - "explicit constructions of msr codes for clustered distributed storage the rack aware storage model"
    - "optimal repairing schemes for reed solomon codes with alphabet sizes linear in lengths under the rack aware model"
    - "on the i o costs of some repair schemes for full length reed solomon codes"
    - "the repair problem for reed solomon codes optimal repair of single and multiple erasures asymptotically optimal node size"
    - "a tight lower bound on the sub packetization level of optimal access msr and mds codes"
    - "repairing reed solomon codes with multiple erasures"
    - "minimum storage regenerating codes for all parameters"
    - "explicit constructions of optimal access mds codes with nearly optimal sub packetization"

Connected through hyperedge HE-3 (induced by source paper "partial mds codes with local regeneration"):
  with members:
    - "on error decoding of locally repairable and partial mds codes"
    - "locally repairable and locally regenerating codes obtained by parity splitting of hashtag codes"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "explicit maximally recoverable codes with locality"
    - "optimal locally repairable codes and connections to matroid theory"
    - "partial mds codes and their application to raid type of architectures"
    - "on the locality of codeword symbols"

Connected through hyperedge HE-4 (induced by source paper "cascade codes for distributed storage systems"):
  with members:
    - "a generic transformation to enable optimal repair in mds codes for distributed storage systems"
    - "determinant codes with helper independent repair for single and multiple failures"
    - "a class of msr codes for clustered distributed storage"
    - "product matrix msr codes with bandwidth adaptive exact repair"
    - "bandwidth adaptive error resilient mbr exact repair regenerating codes"
    - "a tight lower bound on the sub packetization level of optimal access msr and mds codes"
    - "capacity of clustered distributed storage"
    - "progress on high rate msr codes enabling arbitrary number of helper nodes"

Connected through hyperedge HE-5 (induced by source paper "private information retrieval from mds array codes with near optimal repair bandwidth"):
  with members:
    - "a new capacity achieving private information retrieval scheme with almost optimal file length for coded servers"
    - "capacity achieving private information retrieval codes from mds coded databases with minimum message size"
    - "a generic transformation to enable optimal repair in mds codes for distributed storage systems"
    - "capacity achieving private information retrieval codes with optimal message size and upload cost"
    - "private information retrieval from mds coded data in distributed storage systems"
    - "on sub packetization and access number of capacity achieving pir schemes for mds coded non colluding servers"
    - "mds code constructions with small sub packetization and near optimal repair bandwidth"
    - "bandwidth adaptive error resilient mbr exact repair regenerating codes"

Connected through hyperedge HE-6 (induced by source paper "explicit constructions of msr codes for clustered distributed storage the rack aware storage model"):
  with members:
    - "a generic transformation to enable optimal repair in mds codes for distributed storage systems"
    - "the storage versus repair bandwidth trade off for clustered storage systems"
    - "rack aware regenerating codes for data centers"
    - "cooperative repair constructions of optimal mds codes for all admissible parameters"
    - "a class of msr codes for clustered distributed storage"
    - "erasure coding for distributed storage an overview"
    - "optimal repair layering for erasure coded data centers from theory to practice"
    - "increasing availability in distributed storage systems via clustering"

Connected through hyperedge HE-7 (induced by source paper "an exponential lower bound on the sub packetization of msr codes"):
  with members:
    - "optimal repair of reed solomon codes achieving the cut set bound"
    - "mds code constructions with small sub packetization and near optimal repair bandwidth"
    - "a tight lower bound on the sub packetization level of optimal access msr and mds codes"
    - "minimum storage regenerating codes for all parameters"
    - "an explicit coupled layer construction of a high rate msr code with low sub packetization level small field size and all node repair"
    - "explicit constructions of optimal access mds codes with nearly optimal sub packetization"
    - "improved upper bounds on systematic length for linear minimum storage regenerating codes"
    - "a high rate msr code with polynomial sub packetization level"

Connected through hyperedge HE-8 (induced by source paper "new constructions of cooperative msr codes reducing node size to exp o n"):
  with members:
    - "cooperative repair constructions of optimal mds codes for all admissible parameters"
    - "on the achievability region of regenerating codes for multiple erasures"
    - "improved schemes for asymptotically optimal repair of mds codes"
    - "optimal repair of reed solomon codes achieving the cut set bound"
    - "optimal repair schemes for some families of full length reed solomon codes"
    - "repairing reed solomon codes with multiple erasures"
    - "an explicit coupled layer construction of a high rate msr code with low sub packetization level small field size and all node repair"
    - "centralized repair of multiple node failures with applications to communication efficient secret sharing"

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)