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 existence of mds codes over small fields with constrained generator matrices"
  Abstract: We study the existence over small fields of Maximum Distance Separable (MDS) codes with generator matrices having specified supports (i.e. having specified locations of zero entries). This problem unifies and simplifies the problems posed in recent works of Yan and Sprintson (NetCod'13) on weakly secure cooperative data exchange, of Halbawi et al. (arxiv'13) on distributed Reed-Solomon codes for simple multiple access networks, and of Dau et al. (ISIT'13) on MDS codes with balanced and sparse generator matrices. We conjecture that there exist such $[n,k]_q$ MDS codes as long as $q \geq n + k - 1$, if the specified supports of the generator matrices satisfy the so-called MDS condition, which can be verified in polynomial time. We propose a combinatorial approach to tackle the conjecture, and prove that the conjecture holds for a special case when the sets of zero coordinates of rows of the generator matrix share with each other (pairwise) at most one common element. Based on our numerical result, the conjecture is also verified for all $k \leq 7$. Our approach is based on a novel generalization of the well-known Hall's marriage theorem, which allows (overlapping) multiple representatives instead of a single representative for each subset.

Connected through hyperedge HE-1 (induced by source paper "gabidulin codes with support constrained generator matrices"):
  with members:
    - "generalized reed solomon codes with sparsest and balanced generator matrices"
    - "optimum linear codes with support constraints over small fields"
    - "mds matrices over small fields a proof of the gm mds conjecture"
    - "an algebraic combinatorial proof technique for the gm mds conjecture"
    - "new criteria for mrd and gabidulin codes and some rank metric code constructions"
    - "further generalisations of twisted gabidulin codes"
    - "balanced reed solomon codes"
    - "a rank metric approach to error control in random network coding"

Connected through hyperedge HE-2 (induced by source paper "generalized reed solomon codes with sparsest and balanced generator matrices"):
  with members:
    - "an algebraic combinatorial proof technique for the gm mds conjecture"
    - "cooperative data exchange based on mds codes"
    - "balanced reed solomon codes"
    - "coding with constraints minimum distance bounds and systematic constructions"
    - "balanced sparsest generator matrices for mds codes"

Connected through hyperedge HE-3 (induced by source paper "optimum linear codes with support constraints over small fields"):
  with members:
    - "generalized reed solomon codes with sparsest and balanced generator matrices"
    - "further progress on the gm mds conjecture for reed solomon codes"
    - "an algebraic combinatorial proof technique for the gm mds conjecture"
    - "balanced reed solomon codes"

Connected through hyperedge HE-4 (induced by source paper "mds matrices over small fields a proof of the gm mds conjecture"):
  with members:
    - "optimum linear codes with support constraints over small fields"
    - "an algebraic combinatorial proof technique for the gm mds conjecture"
    - "balanced sparsest generator matrices for mds codes"

Connected through hyperedge HE-5 (induced by source paper "further progress on the gm mds conjecture for reed solomon codes"):
  with members:
    - "an algebraic combinatorial proof technique for the gm mds conjecture"
    - "balanced reed solomon codes"
    - "bounds on the parameters of locally recoverable codes"

Connected through hyperedge HE-6 (induced by source paper "an algebraic combinatorial proof technique for the gm mds conjecture"):
  with members:
    - "balanced reed solomon codes"
    - "coding with constraints minimum distance bounds and systematic constructions"
    - "balanced sparsest generator matrices for mds codes"

Connected through hyperedge HE-7 (induced by source paper "balanced reed solomon codes"):
  with members:
    - "coding with constraints minimum distance bounds and systematic constructions"
    - "a family of optimal locally recoverable codes"
    - "xoring elephants novel erasure codes for big data"
    - "balanced sparsest generator matrices for mds codes"
    - "rapidraid pipelined erasure codes for fast data archival in distributed storage systems"
    - "on the locality of codeword symbols"
    - "a rank metric approach to error control in random network coding"
    - "decentralized erasure codes for distributed networked storage"

Connected through hyperedge HE-8 (induced by source paper "new mds self dual codes from generalized reed solomon codes"):
  with members:
    - "on the classification of mds codes"
    - "balanced sparsest generator matrices for mds 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)