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: "constructions and properties of linear locally repairable codes"
  Abstract: In this paper, locally repairable codes with all-symbol locality are studied. Methods to modify already existing codes are presented. It is also shown that, with high probability, a random matrix with a few extra columns guaranteeing the locality property is a generator matrix for a locally repairable code with a good minimum distance. The proof of the result provides a constructive method to find locally repairable codes. Finally, constructions of three infinite classes of optimal vector-linear locally repairable codes over a small alphabet independent of the code size are given.

Connected through hyperedge HE-1 (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"
    - "optimal linear and cyclic locally repairable codes over small fields"
    - "cooperative local repair in distributed storage"
    - "storage capacity of repairable networks"
    - "repairing reed solomon codes"

Connected through hyperedge HE-2 (induced by source paper "matroid theory and storage codes bounds and constructions"):
  with members:
    - "locally recoverable codes from algebraic curves and surfaces"
    - "improved singleton type bounds for locally repairable codes"
    - "codes with hierarchical locality"
    - "optimal binary locally repairable codes via anticodes"
    - "pir with low storage overhead coding instead of replication"
    - "bounds for batch codes with restricted query size"
    - "applications of polymatroid theory to distributed storage systems"
    - "bounds on the parameters of locally recoverable codes"

Connected through hyperedge HE-3 (induced by source paper "locally repairable codes with unequal local erasure correction"):
  with members:
    - "bounds and constructions of codes with multiple localities"
    - "codes with unequal locality"
    - "constructions of optimal cyclic r delta locally repairable codes"
    - "bounds on the maximal minimum distance of linear locally repairable codes"
    - "cyclic lrc codes and their subfield subcodes"
    - "locally repairable codes with functional repair and multiple erasure tolerance"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "a family of optimal locally recoverable codes"

Connected through hyperedge HE-4 (induced by source paper "codes with unequal disjoint local erasure correction constraints"):
  with members:
    - "bounds and constructions of codes with multiple localities"
    - "codes with unequal locality"
    - "constructions of optimal cyclic r delta locally repairable codes"
    - "bounds on the maximal minimum distance of linear locally repairable codes"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "a family of optimal locally recoverable codes"
    - "binary cyclic codes that are locally repairable"
    - "erasure codes with simplex locality"

Connected through hyperedge HE-5 (induced by source paper "locally repairable codes with multiple r_ i delta_ i localities"):
  with members:
    - "on the weight hierarchy of locally repairable codes"
    - "bounds and constructions of codes with multiple localities"
    - "codes with unequal locality"
    - "repair locality from a combinatorial perspective"
    - "an integer programming based bound for locally repairable codes"
    - "a family of optimal locally recoverable codes"
    - "optimal locally repairable linear codes"
    - "optimal locally repairable codes via rank metric codes"

Connected through hyperedge HE-6 (induced by source paper "on minimum distance of locally repairable codes"):
  with members:
    - "bounds on the parameters of locally recoverable codes"
    - "codes with locality for two erasures"
    - "an integer programming based bound for locally repairable codes"
    - "a family of optimal locally recoverable codes"
    - "binary cyclic codes that are locally repairable"
    - "xoring elephants novel erasure codes for big data"
    - "an upper bound on the size of locally recoverable codes"
    - "locally repairable codes"

Connected through hyperedge HE-7 (induced by source paper "on binary matroid minors and applications to data storage over small fields"):
  with members:
    - "matroid theory and storage codes bounds and constructions"
    - "optimal binary locally repairable codes via anticodes"
    - "binary linear locally repairable codes"
    - "bounds on the parameters of locally recoverable codes"
    - "xoring elephants novel erasure codes for big data"
    - "an upper bound on the size of locally recoverable codes"
    - "optimal locally repairable codes and connections to matroid theory"
    - "locally repairable codes"

Connected through hyperedge HE-8 (induced by source paper "on optimal ternary locally repairable codes"):
  with members:
    - "cyclic lrc codes and their subfield subcodes"
    - "a family of optimal locally recoverable codes"
    - "locally repairable codes"
    - "on the locality of codeword symbols"
    - "self repairing homomorphic codes for distributed storage systems"

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)