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 bounds for permutation codes in ulam metric"
  Abstract: New bounds on the cardinality of permutation codes equipped with the Ulam distance are presented. First, an integer-programming upper bound is derived, which improves on the Singleton-type upper bound in the literature for some lengths. Second, several probabilistic lower bounds are developed, which improve on the known lower bounds for large minimum distances. The results of a computer search for permutation codes are also presented.

Connected through hyperedge HE-1 (induced by source paper "new theoretical bounds and constructions of permutation codes under block permutation metric"):
  with members:
    - "theoretical bounds and constructions of codes in the generalized cayley metric"
    - "new bounds of permutation codes under hamming metric and kendall s tau metric"
    - "snake in the box codes for rank modulation under kendall s tau metric"
    - "error correction in flash memories via codes in the ulam metric"

Connected through hyperedge HE-2 (induced by source paper "theoretical bounds and constructions of codes in the generalized cayley metric"):
  with members:
    - "snake in the box codes for rank modulation under kendall s tau metric"
    - "error correction in flash memories via codes in the ulam metric"

Connected through hyperedge HE-3 (induced by source paper "ulam sphere size analysis for permutation and multipermutation codes correcting translocation errors"):
  with members:
    - "multipermutation ulam sphere analysis toward characterizing maximal code size"
    - "linear programming upper bounds on permutation code sizes from coherent configurations related to the kendall tau distance metric"
    - "error correction in flash memories via codes in the ulam metric"
    - "coded modulation for power line communications"
    - "codes in permutations and error correction for rank modulation"
    - "lp decodable permutation codes based on linearly constrained permutation matrices"

Connected through hyperedge HE-4 (induced by source paper "multipermutation ulam sphere analysis toward characterizing maximal code size"):
  with members:
    - "error correction in flash memories via codes in the ulam metric"
    - "codes in permutations and error correction for rank modulation"

Connected through hyperedge HE-5 (induced by source paper "improved lower bounds on the size of balls over permutations with the infinity metric"):
  with members:
    - "proof of a conjecture of klove on permutation codes under the chebychev distance"
    - "limited magnitude error correcting gray codes for rank modulation"
    - "compression in the space of permutations"
    - "the bethe permanent of a nonnegative matrix"
    - "systematic error correcting codes for rank modulation"
    - "systematic codes for rank modulation"
    - "error correction in flash memories via codes in the ulam metric"
    - "snake in the box codes for rank modulation"

Connected through hyperedge HE-6 (induced by source paper "permutation codes source coding and a generalisation of bollobas lubell yamamoto meshalkin and kraft inequalities"):
  with members:
    - "codes in permutations and error correction for rank modulation"

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)