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 "new bounds of permutation codes under hamming metric and kendall s tau metric"):
  Abstract: Permutation codes are widely studied objects due to their numerous applications in various areas, such as power line communications, block ciphers, and the rank modulation scheme for flash memories. Several kinds of metrics are considered for permutation codes according to their specific applications. This paper concerns some improvements on the bounds of permutation codes under Hamming metric and Kendall's $\tau$-metric respectively, using mainly a graph coloring approach. Specifically, under Hamming metric, we improve the Gilbert-Varshamov bound asymptotically by a factor $n$, when the minimum Hamming distance $d$ is fixed and the code length $n$ goes to infinity. Under Kendall's $\tau$-metric, we narrow the gap between the known lower bounds and upper bounds. Besides, we also obtain some sporadic results under Kendall's $\tau$-metric for small parameters.

Includes members:
  Member "error correction in flash memories via codes in the ulam metric":
    also connected through other hyperedges:
      - Hyperedge HE-1 (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-2 (induced by source paper "ulam sphere size analysis for permutation and multipermutation codes correcting translocation errors")
  Member "constructions of rank modulation codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "infinity norm permutation covering codes from cyclic groups")
  Member "codes in permutations and error correction for rank modulation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "optimal constant weight codes under l_1 metric")
  Member "correcting limited magnitude errors in the rank modulation scheme":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "infinity norm permutation covering codes from cyclic groups")

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)