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 "on the labeling problem of permutation group codes under the infinity metric"):
  Abstract: Codes over permutations under the infinity norm have been recently suggested as a coding scheme for correcting limited-magnitude errors in the rank modulation scheme. Given such a code, we show that a simple relabeling operation, which produces an isomorphic code, may drastically change the minimal distance of the code. Thus, we may choose a code structure for efficient encoding/decoding procedures, and then optimize the code's minimal distance via relabeling. #R##N#We formally define the relabeling problem, and show that all codes may be relabeled to get a minimal distance at most 2. The decision problem of whether a code may be relabeled to distance 1 is shown to be NP-complete, and calculating the best achievable minimal distance after relabeling is proved hard to approximate. #R##N#Finally, we consider general bounds on the relabeling problem. We specifically show the optimal relabeling distance of cyclic groups. A specific case of a general probabilistic argument is used to show $\agl(p)$ may be relabeled to a minimal distance of $p-O(\sqrt{p\ln p})$.

Includes members:
  Member "quasi cross lattice tilings with applications to flash memory":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "some new results on splitter sets")
  Member "generalized gray codes for local rank modulation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "limited magnitude error correcting gray codes for rank modulation")
  Member "computing the ball size of frequency permutations under chebyshev distance":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "multipermutation codes in the ulam metric for nonvolatile memories")
  Member "constructions of rank modulation codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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-5 (induced by source paper "snake in the box codes for rank modulation")
  Member "codes in permutations and error correction for rank modulation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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-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)