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: "maximum distance separable codes for symbol pair read channels"
  Abstract: We study (symbol-pair) codes for symbol-pair read channels introduced recently by Cassuto and Blaum (2010). A Singleton-type bound on symbol-pair codes is established and infinite families of optimal symbol-pair codes are constructed. These codes are maximum distance separable (MDS) in the sense that they meet the Singleton-type bound. In contrast to classical codes, where all known q-ary MDS codes have length O(q), we show that q-ary MDS symbol-pair codes can have length \Omega(q^2). In addition, we completely determine the existence of MDS symbol-pair codes for certain parameters.

Connected through hyperedge HE-1 (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"
    - "constacyclic symbol pair codes lower bounds and optimal constructions"

Connected through hyperedge HE-2 (induced by source paper "coding for racetrack memories"):
  with members:
    - "mutually uncorrelated codes for dna storage"
    - "exact reconstruction from insertions in synchronization codes"
    - "codes correcting a burst of deletions or insertions"
    - "efficient low redundancy codes for correcting multiple deletions"

Connected through hyperedge HE-3 (induced by source paper "new constructions of mds symbol pair codes"):
  with members:
    - "on the minimum distance of elliptic curve codes"
    - "stopping sets of algebraic geometry codes"
    - "hard problems of algebraic geometry codes"

Connected through hyperedge HE-4 (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"
    - "constacyclic symbol pair codes lower bounds and optimal constructions"

Connected through hyperedge HE-5 (induced by source paper "constacyclic symbol pair codes lower bounds and optimal constructions"):
  with members:
    - "polyadic constacyclic codes"
    - "application of constacyclic codes to quantum mds codes"

Connected through hyperedge HE-6 (induced by source paper "construction of cyclic and constacyclic codes for b symbol read channels meeting the plotkin like bound"):
  with members:
    - "constacyclic symbol pair codes lower bounds and optimal constructions"

Connected through hyperedge HE-7 (induced by source paper "the symbol pair distance distribution of repeated root cyclic codes over mathbb f _ p m"):
  with members:
    - "constacyclic symbol pair codes lower bounds and optimal constructions"

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)