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: "balanced sparsest generator matrices for mds codes"
  Abstract: We show that given $n$ and $k$, for $q$ sufficiently large, there always exists an $[n, k]_q$ MDS code that has a generator matrix $G$ satisfying the following two conditions: (C1) Sparsest: each row of $G$ has Hamming weight $n - k + 1$; (C2) Balanced: Hamming weights of the columns of $G$ differ from each other by at most one.

Connected through hyperedge HE-1 (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"
    - "on the existence of mds codes over small fields with constrained generator matrices"

Connected through hyperedge HE-2 (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"
    - "on the existence of mds codes over small fields with constrained generator matrices"

Connected through hyperedge HE-3 (induced by source paper "cooperative data exchange based on mds codes"):
  with members:
    - "successive local and successive global omniscience"
    - "universal multiparty data exchange and secret key agreement"
    - "cooperative data exchange with unreliable clients"
    - "efficient algorithms for the data exchange problem"
    - "coded cooperative data exchange in multihop networks"
    - "coded cooperative data exchange problem for general topologies"
    - "on coding for cooperative data exchange"

Connected through hyperedge HE-4 (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"
    - "on the existence of mds codes over small fields with constrained generator matrices"

Connected through hyperedge HE-5 (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"
    - "on the existence of mds codes over small fields with constrained generator matrices"
    - "xoring elephants novel erasure codes for big data"
    - "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-6 (induced by source paper "new mds self dual codes from generalized reed solomon codes"):
  with members:
    - "on the classification of mds codes"
    - "on the existence of mds codes over small fields with constrained generator matrices"

Connected through hyperedge HE-7 (induced by source paper "erasure codes with symbol locality and group decodability for distributed storage"):
  with members:
    - "cooperative local repair in distributed storage"
    - "locally encodable and decodable codes for distributed storage systems"
    - "repair locality with multiple erasure tolerance"
    - "bounds on locally recoverable codes with multiple recovering sets"
    - "a family of optimal locally recoverable codes"
    - "on the existence of mds codes over small fields with constrained generator matrices"
    - "optimal locally repairable linear codes"
    - "on block security of regenerating codes at the mbr point for distributed storage systems"

Connected through hyperedge HE-8 (induced by source paper "coding with constraints minimum distance bounds and systematic constructions"):
  with members:
    - "storage capacity of repairable networks"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "a family of optimal locally recoverable codes"
    - "on the existence of mds codes over small fields with constrained generator matrices"
    - "optimal locally repairable codes and connections to matroid theory"
    - "codes with local regeneration"
    - "optimal linear codes with a local error correction property"
    - "locally repairable 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)