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 classification of mds codes"
  Abstract: A    $q$   -ary code of length    $n$   , size    $M$   , and minimum distance    $d$    is called an    $(n,M,d)_{q}$    code. An    $(n,q^{k},n-k+1)_{q}$    code is called a maximum distance separable (MDS) code. In this paper, some MDS codes over small alphabets are classified. It is shown that every    $(k+d-1,q^{k},d)_{q}$    code with    $k\geq 3$   ,    $d \geq 3$   ,    $q \in \{5,7\}$    is equivalent to a linear code with the same parameters. This implies that the    $(6,5^{4},3)_{5}$    code and the    $(n,7^{n-2},3)_{7}$    MDS codes for    $n\in \{6,7,8\}$    are unique. The classification of one-error-correcting 8-ary MDS codes is also finished; there are 14, 8, 4, and 4 equivalence classes of    $(n,8^{n-2},3)_{8}$    codes for    $n=6,7,8$   , and 9, respectively. One of the equivalence classes of perfect    $(9,8^{7},3)_{8}$    codes corresponds to the Hamming code and the other three are nonlinear codes for which there exists no previously known construction.

Connected through hyperedge HE-1 (induced by source paper "new mds self dual codes from generalized reed solomon codes"):
  with members:
    - "on the existence of mds codes over small fields with constrained generator matrices"
    - "balanced sparsest generator matrices for mds codes"

Connected through hyperedge HE-2 (induced by source paper "constructions of transitive latin hypercubes"):
  with members:
    - "propelinear 1 perfect codes from quadratic functions"

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)