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: "new constructions of mds symbol pair codes"
  Abstract: Motivated by the application of high-density data storage technologies, symbol-pair codes are proposed to protect against pair-errors in symbol-pair channels, whose outputs are overlapping pairs of symbols. The research of symbol-pair codes with the largest minimum pair-distance is interesting since such codes have the best possible error-correcting capability. A symbol-pair code attaining the maximal minimum pair-distance is called a maximum distance separable (MDS) symbol-pair code. In this paper, we focus on constructing linear MDS symbol-pair codes over the finite field $\mathbb{F}_{q}$. We show that a linear MDS symbol-pair code over $\mathbb{F}_{q}$ with pair-distance $5$ exists if and only if the length $n$ ranges from $5$ to $q^2+q+1$. As for codes with pair-distance $6$, length ranging from $6$ to $q^{2}+1$, we construct linear MDS symbol-pair codes by using a configuration called ovoid in projective geometry. With the help of elliptic curves, we present a construction of linear MDS symbol-pair codes for any pair-distance $d+2$ with length $n$ satisfying $7\le d+2\leq n\le q+\lfloor 2\sqrt{q}\rfloor+\delta(q)-3$, where $\delta(q)=0$ or $1$.

Connected through hyperedge HE-1 (induced by source paper "symbol pair weight distributions of some linear codes"):
  with members:
    - "linear programming decoding of binary linear codes for symbol pair read channel"
    - "maximum distance separable codes for b symbol read channels"
    - "constructions of maximum distance separable symbol pair codes using cyclic and constacyclic codes"
    - "constacyclic symbol pair codes lower bounds and optimal constructions"
    - "maximum distance separable codes for symbol pair read channels"

Connected through hyperedge HE-2 (induced by source paper "maximum distance separable codes for b symbol read channels"):
  with members:
    - "constructions of maximum distance separable symbol pair codes using cyclic and constacyclic codes"
    - "constacyclic symbol pair codes lower bounds and optimal constructions"
    - "maximum distance separable codes for symbol pair read channels"

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)