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 "constructions of snake in the box codes under ell_ infty metric for rank modulation"):
  Abstract: In the rank modulation scheme, Gray codes are very useful in the realization of flash memories. For a Gray code in this scheme, two adjacent codewords are obtained by using one "push-to-the-top" operation. Moreover, snake-in-the-box codes under the $\ell_{\infty}$-metric are Gray codes, which can be capable of detecting one $\ell_{\infty}$-error. In this paper, we give two constructions of $\ell_{\infty}$-snakes. On the one hand, inspired by Yehezkeally and Schwartz's construction, we present a new construction of the $\ell_{\infty}$-snake. The length of this $\ell_{\infty}$-snake is longer than the length of the $\ell_{\infty}$-snake constructed by Yehezkeally and Schwartz. On the other hand, we also give another construction of $\ell_{\infty}$-snakes by using $\mathcal{K}$-snakes and obtain the longer $\ell_{\infty}$-snakes than the previously known ones.

Includes members:
  Member "snake in the box codes for rank modulation under kendall s tau 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 "constructions of snake in the box codes for rank modulation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "infinity norm permutation covering codes from cyclic groups")
  Member "generalized gray codes for local rank modulation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "limited magnitude error correcting gray codes for rank modulation")
  Member "snake in the box codes for rank modulation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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-5 (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-6 (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)