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: "on the combinatorics of locally repairable codes via matroid theory"
  Abstract: This paper provides a link between matroid theory and locally repairable codes (LRCs) that are either linear or more generally almost affine. Using this link, new results on both LRCs and matroid theory are derived. The parameters $(n,k,d,r,\delta)$ of LRCs are generalized to matroids, and the matroid analogue of the generalized Singleton bound in [P. Gopalan et al., "On the locality of codeword symbols," IEEE Trans. Inf. Theory] for linear LRCs is given for matroids. It is shown that the given bound is not tight for certain classes of parameters, implying a nonexistence result for the corresponding locally repairable almost affine codes, that are coined perfect in this paper. #R##N#Constructions of classes of matroids with a large span of the parameters $(n,k,d,r,\delta)$ and the corresponding local repair sets are given. Using these matroid constructions, new LRCs are constructed with prescribed parameters. The existence results on linear LRCs and the nonexistence results on almost affine LRCs given in this paper strengthen the nonexistence and existence results on perfect linear LRCs given in [W. Song et al., "Optimal locally repairable codes," IEEE J. Sel. Areas Comm.].

Connected through hyperedge HE-1 (induced by source paper "functional repair codes a view from projective geometry"):
  with members:
    - "cooperative repair constructions of optimal mds codes for all admissible parameters"
    - "on the achievability region of regenerating codes for multiple erasures"
    - "a class of msr codes for clustered distributed storage"
    - "increasing availability in distributed storage systems via clustering"
    - "locality and availability of array codes constructed from subspaces"
    - "a tight lower bound on the sub packetization level of optimal access msr and mds codes"
    - "optimal fractional repetition codes and fractional repetition batch codes"
    - "fractional repetition and erasure batch codes"

Connected through hyperedge HE-2 (induced by source paper "generalized hamming weights for almost affine codes"):
  with members:
    - "a generalization of kung s theorem"

Connected through hyperedge HE-3 (induced by source paper "some improvements on locally repairable codes"):
  with members:
    - "locally recoverable codes on algebraic curves"
    - "repair locality with multiple erasure tolerance"
    - "locality and availability in distributed storage"
    - "codes with locality for two erasures"
    - "bounds on locally recoverable codes with multiple recovering sets"
    - "an integer programming based bound for locally repairable codes"
    - "a family of optimal locally recoverable codes"
    - "xoring elephants novel erasure codes for big data"

Connected through hyperedge HE-4 (induced by source paper "applications of polymatroid theory to distributed storage systems"):
  with members:
    - "achieving arbitrary locality and availability in binary codes"
    - "repair locality with multiple erasure tolerance"
    - "locality and availability in distributed storage"
    - "optimal locally repairable codes via rank metric codes"
    - "optimal locally repairable codes and connections to matroid theory"
    - "optimal linear codes with a local error correction property"
    - "locally repairable codes"
    - "on the locality of codeword symbols"

Connected through hyperedge HE-5 (induced by source paper "optimal locally repairable codes and connections to matroid theory"):
  with members:
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "a family of optimal locally recoverable codes"
    - "explicit maximally recoverable codes with locality"
    - "update efficiency and local repairability limits for capacity approaching codes"
    - "xoring elephants novel erasure codes for big data"
    - "on the locality of codeword symbols in non linear codes"
    - "an upper bound on the size of locally recoverable codes"
    - "codes with local regeneration"

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)