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 "snake in the box codes for rank modulation"):
  Abstract: Motivated by the rank-modulation scheme with applications to flash memory, we consider Gray codes capable of detecting a single error, also known as snake-in-the-box codes. We study two error metrics: Kendall's $\tau$-metric, which applies to charge-constrained errors, and the $\ell_\infty$-metric, which is useful in the case of limited magnitude errors. In both cases we construct snake-in-the-box codes with rate asymptotically tending to 1. We also provide efficient successor-calculation functions, as well as ranking and unranking functions. Finally, we also study bounds on the parameters of such codes.

Includes members:
  Member "generalized gray codes for local rank modulation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "limited magnitude error correcting gray codes for rank modulation")
  Member "compressed encoding for rank modulation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "subgraph domatic problem and writing capacity of memory devises with restricted state transitions")
  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 "constant weight gray codes for local rank modulation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the labeling problem of permutation group codes under the infinity 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 "multidimensional flash codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "trajectory codes for flash memory")
  Member "correcting limited magnitude errors in the rank modulation scheme":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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)