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 "infinity norm permutation covering codes from cyclic groups"):
  Abstract: We study covering codes of permutations with the $\ell_\infty$-metric. We provide a general code construction, which uses smaller building-block codes. We study cyclic transitive groups as building blocks, determining their exact covering radius, and showing linear-time algorithms for finding a covering codeword. We also bound the covering radius of relabeled cyclic transitive groups under conjugation.

Includes members:
  Member "limited magnitude error correcting gray codes for rank modulation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "secure index coding existence and construction")
  Member "constructions of snake in the box codes under ell_ infty metric for rank modulation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "limited magnitude error correcting gray codes for rank modulation")
  Member "compression in the space of permutations":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "improved lower bounds on the size of balls over permutations with the infinity metric")
  Member "snake in the box codes for rank modulation under kendall s tau metric":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "new theoretical bounds and constructions of permutation codes under block permutation metric")
  Member "systematic error correcting codes for rank modulation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "optimal constant weight codes under l_1 metric")
  Member "constructions of snake in the box codes for rank modulation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "limited magnitude error correcting gray codes for rank modulation")
  Member "error correction in flash memories via codes in the ulam metric":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "optimal constant weight codes under l_1 metric")
  Member "snake in the box codes for rank modulation":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "limited magnitude error correcting gray codes for rank modulation")

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)