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: "constacyclic symbol pair codes lower bounds and optimal constructions"
  Abstract: Symbol-pair codes introduced by Cassuto and Blaum (2010) are designed to protect against pair errors in symbol-pair read channels. The higher the minimum pair distance, the more pair errors the code can correct. MDS symbol-pair codes are optimal in the sense that pair distance cannot be improved for given length and code size. The contribution of this paper is twofold. First we present three lower bounds for the minimum pair distance of constacyclic codes, the first two of which generalize the previously known results due to Cassuto and Blaum (2011) and Kai {\it et al.} (2015). The third one exhibits a lower bound for the minimum pair distance of repeated-root cyclic codes. Second we obtain new MDS symbol-pair codes with minimum pair distance seven and eight through repeated-root cyclic codes.

Connected through hyperedge HE-1 (induced by source paper "generalized pair weights of linear codes and macwilliams extension theorem"):
  with members:
    - "generalized hamming weights of irreducible cyclic codes"

Connected through hyperedge HE-2 (induced by source paper "symbol pair weight distributions of some linear codes"):
  with members:
    - "new constructions of mds symbol pair codes"
    - "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"
    - "maximum distance separable codes for symbol pair read channels"

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

Connected through hyperedge HE-4 (induced by source paper "construction of cyclic and constacyclic codes for b symbol read channels meeting the plotkin like bound"):
  with members:
    - "maximum distance separable codes for symbol pair read channels"

Connected through hyperedge HE-5 (induced by source paper "the symbol pair distance distribution of repeated root cyclic codes over mathbb f _ p m"):
  with members:
    - "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)