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: "weight enumerators and higher support weights of maximally recoverable codes"
  Abstract: In this paper, we establish the matroid structures corresponding to data-local and local maximally recoverable codes (MRC). The matroid structures of these codes can be used to determine the associated Tutte polynomial. Greene proved that the weight enumerators of any code can be determined from its associated Tutte polynomial. We will use this result to derive explicit expressions for the weight enumerators of data-local and local MRC. Also, Britz proved that the higher support weights of any code can be determined from its associated Tutte polynomial. We will use this result to derive expressions for the higher support weights of data-local and local MRC with two local codes.

Connected through hyperedge HE-1 (induced by source paper "uniform minors in maximally recoverable codes"):
  with members:
    - "matroid theory and storage codes bounds and constructions"
    - "maximally recoverable lrcs a field size lower bound and constructions for few heavy parities"
    - "a family of optimal locally recoverable codes"
    - "explicit maximally recoverable codes with locality"
    - "locally repairable codes"
    - "on the locality of codeword symbols"

Connected through hyperedge HE-2 (induced by source paper "erasure codes for distributed storage tight bounds and matching constructions"):
  with members:
    - "explicit msr codes with optimal access optimal sub packetization and small field size for d k 1 k 2 k 3"
    - "a tight rate bound and a matching construction for locally recoverable codes with sequential recovery from any number of multiple erasures"
    - "optimal lrc codes for all lenghts n q"
    - "optimal locally repairable codes of distance 3 and 4 via cyclic codes"
    - "on optimal ternary locally repairable codes"
    - "liquid cloud storage"
    - "rate optimal binary linear locally repairable codes with small availability"
    - "bounds and constructions of codes with all symbol locality and availability"

Connected through hyperedge HE-3 (induced by source paper "on the weight hierarchy of locally repairable codes"):
  with members:
    - "on optimal ternary locally repairable codes"
    - "bounds and constructions of locally repairable codes parity check matrix approach"
    - "cyclic lrc codes and their subfield subcodes"
    - "locally recoverable codes on algebraic curves"
    - "repair locality from a combinatorial perspective"
    - "codes with locality for two erasures"
    - "an integer programming based bound for locally repairable codes"
    - "a family of optimal locally recoverable codes"

Connected through hyperedge HE-4 (induced by source paper "communication cost for updating linear functions when message updates are sparse connections to maximally recoverable codes"):
  with members:
    - "on partial maximally recoverable and maximally recoverable codes"
    - "file updates under random arbitrary insertions and deletions"
    - "synchronizing edits in distributed storage networks"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "codes with locality for two erasures"
    - "fundamental limits on communication for oblivious updates in storage networks"
    - "explicit maximally recoverable codes with locality"
    - "explicit mbr all symbol locality codes"

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)