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 mbr all symbol locality codes"
  Abstract: Node failures are inevitable in distributed storage systems (DSS). To enable efficient repair when faced with such failures, two main techniques are known: Regenerating codes, i.e., codes that minimize the total repair bandwidth; and codes with locality, which minimize the number of nodes participating in the repair process. This paper focuses on regenerating codes with locality, using pre-coding based on Gabidulin codes, and presents constructions that utilize minimum bandwidth regenerating (MBR) local codes. The constructions achieve maximum resilience (i.e., optimal minimum distance) and have maximum capacity (i.e., maximum rate). Finally, the same pre-coding mechanism can be combined with a subclass of fractional-repetition codes to enable maximum resilience and repair-by-transfer simultaneously.

Connected through hyperedge HE-1 (induced by source paper "the complete hierarchical locality of the punctured simplex code"):
  with members:
    - "codes with hierarchical locality from covering maps of curves"
    - "combinatorial alphabet dependent bounds for locally recoverable codes"
    - "matroid theory and storage codes bounds and constructions"
    - "alphabet dependent bounds for linear locally repairable codes based on residual codes"
    - "optimal linear and cyclic locally repairable codes over small fields"
    - "codes with hierarchical locality"
    - "locality and availability in distributed storage"
    - "optimal locally repairable and secure codes for distributed storage systems"

Connected through hyperedge HE-2 (induced by source paper "alphabet dependent bounds for linear locally repairable codes based on residual codes"):
  with members:
    - "combinatorial alphabet dependent bounds for locally recoverable codes"
    - "matroid theory and storage codes bounds and constructions"
    - "mds code constructions with small sub packetization and near optimal repair bandwidth"
    - "bounds on binary locally repairable codes tolerating multiple erasures"
    - "constructions and properties of linear locally repairable codes"
    - "optimal linear and cyclic locally repairable codes over small fields"
    - "cooperative local repair in distributed storage"
    - "storage capacity of repairable networks"

Connected through hyperedge HE-3 (induced by source paper "explicit construction of mbr codes for clustered distributed storage"):
  with members:
    - "explicit constructions of msr codes for clustered distributed storage the rack aware storage model"
    - "the storage versus repair bandwidth trade off for clustered storage systems"
    - "a class of msr codes for clustered distributed storage"
    - "secure clustered distributed storage against eavesdroppers"
    - "optimal repair layering for erasure coded data centers from theory to practice"
    - "increasing availability in distributed storage systems via clustering"
    - "locality and availability of array codes constructed from subspaces"
    - "capacity of clustered distributed storage"

Connected through hyperedge HE-4 (induced by source paper "explicit constructions of mbr and msr codes for clustered distributed storage"):
  with members:
    - "explicit constructions of msr codes for clustered distributed storage the rack aware storage model"
    - "the storage versus repair bandwidth trade off for clustered storage systems"
    - "a class of msr codes for clustered distributed storage"
    - "secure clustered distributed storage against eavesdroppers"
    - "optimal repair layering for erasure coded data centers from theory to practice"
    - "increasing availability in distributed storage systems via clustering"
    - "locality and availability of array codes constructed from subspaces"
    - "capacity of clustered distributed storage"

Connected through hyperedge HE-5 (induced by source paper "locality and availability of array codes constructed from subspaces"):
  with members:
    - "nearly optimal constructions of pir and batch codes"
    - "lengthening and extending binary private information retrieval codes"
    - "binary shortened projective reed muller codes for coded private information retrieval"
    - "locality via partially lifted codes"
    - "pir array codes with optimal virtual server rate"
    - "bounds and constructions of codes with multiple localities"
    - "codes with unequal locality"
    - "on private information retrieval array codes"

Connected through hyperedge HE-6 (induced by source paper "increasing availability in distributed storage systems via clustering"):
  with members:
    - "the storage versus repair bandwidth trade off for clustered storage systems"
    - "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 high rate mds array codes with optimal repair bandwidth"
    - "the storage repair bandwidth trade off of exact repair linear regenerating codes for the case d k n 1"
    - "achieving arbitrary locality and availability in binary codes"
    - "layered exact repair regenerating codes via embedded error correction and block designs"
    - "locality and availability in distributed storage"
    - "characterizing the rate region of the 4 3 3 exact repair regenerating codes"

Connected through hyperedge HE-7 (induced by source paper "bounds on fractional repetition codes using hypergraphs"):
  with members:
    - "load balanced fractional repetition codes"
    - "on the duality of fractional repetition codes"
    - "on some universally good fractional repetition codes"
    - "optimal fractional repetition codes and fractional repetition batch codes"
    - "irregular fractional repetition code optimization for heterogeneous cloud storage"
    - "reconstruction and repair degree of fractional repetition codes"
    - "replication based storage systems with local repair"
    - "enumerating some fractional repetition codes"

Connected through hyperedge HE-8 (induced by source paper "on code rates of fractional repetition codes"):
  with members:
    - "on some universally good fractional repetition codes"
    - "irregular fractional repetition code optimization for heterogeneous cloud storage"
    - "reconstruction and repair degree of fractional repetition codes"
    - "enumerating some fractional repetition codes"
    - "on weak dress codes for cloud storage"
    - "repairable replication based storage systems using resolvable designs"
    - "scalable constructions of fractional repetition codes in distributed storage systems"
    - "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction"

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)