human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "ulam sphere size analysis for permutation and multipermutation codes correcting translocation errors"):
  Abstract: Permutation and multipermutation codes in the Ulam metric have been suggested for use in non-volatile memory storage systems such as flash memory devices. In this paper we introduce a new method to calculate permutation sphere sizes in the Ulam metric using Young Tableaux and prove the non-existence of non-trivial perfect permutation codes in the Ulam metric. We then extend the study to multipermutations, providing tight upper and lower bounds on multipermutation Ulam sphere sizes and resulting upper and lower bounds on the maximal size of multipermutation codes in the Ulam metric.

Includes members:
  Member "multipermutation ulam sphere analysis toward characterizing maximal code size":
    also connected through other hyperedges:
      (none)
  Member "new bounds for permutation codes in ulam metric":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "new theoretical bounds and constructions of permutation codes under block permutation metric")
  Member "linear programming upper bounds on permutation code sizes from coherent configurations related to the kendall tau distance metric":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "new bounds for permutation codes in ulam metric")
  Member "error correction in flash memories via codes in the ulam metric":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimal constant weight codes under l_1 metric")
  Member "coded modulation for power line communications":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "new bounds of permutation codes under hamming metric and kendall s tau metric")
  Member "codes in permutations and error correction for rank modulation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "optimal constant weight codes under l_1 metric")
  Member "lp decodable permutation codes based on linearly constrained permutation matrices":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "new bounds for permutation codes in ulam metric")

Question: Please tell me which class the source paper 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)