human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "generalized gray codes for local rank modulation"
  Abstract: We consider the local rank-modulation scheme in which a sliding window going over a sequence of real-valued variables induces a sequence of permutations. Local rank-modulation is a generalization of the rank-modulation scheme, which has been recently suggested as a way of storing information in flash memory. We study Gray codes for the local rank-modulation scheme in order to simulate conventional multi-level flash cells while retaining the benefits of rank modulation. Unlike the limited scope of previous works, we consider code constructions for the entire range of parameters including the code length, sliding window size, and overlap between adjacent windows. We show our constructed codes have asymptotically-optimal rate. We also provide efficient encoding, decoding, and next-state algorithms.

Connected through hyperedge HE-1 (induced by source paper "limited magnitude error correcting gray codes for rank modulation"):
  with members:
    - "constructions of snake in the box codes under ell_ infty metric for rank modulation"
    - "improved lower bounds on the size of balls over permutations with the infinity metric"
    - "snake in the box codes for rank modulation under kendall s tau metric"
    - "systematic error correcting codes for rank modulation"
    - "constructions of snake in the box codes for rank modulation"
    - "snake in the box codes for rank modulation"
    - "constructions of rank modulation codes"
    - "on the labeling problem of permutation group codes under the infinity metric"

Connected through hyperedge HE-2 (induced by source paper "constructions of snake in the box codes under ell_ infty metric for rank modulation"):
  with members:
    - "snake in the box codes for rank modulation under kendall s tau metric"
    - "constructions of snake in the box codes for rank modulation"
    - "snake in the box codes for rank modulation"
    - "codes in permutations and error correction for rank modulation"
    - "correcting limited magnitude errors in the rank modulation scheme"

Connected through hyperedge HE-3 (induced by source paper "snake in the box codes for rank modulation under kendall s tau metric"):
  with members:
    - "constructions of snake in the box codes for rank modulation"
    - "snake in the box codes for rank modulation"
    - "constructions of rank modulation codes"
    - "codes in permutations and error correction for rank modulation"
    - "correcting limited magnitude errors in the rank modulation scheme"

Connected through hyperedge HE-4 (induced by source paper "constructions of snake in the box codes for rank modulation"):
  with members:
    - "snake in the box codes for rank modulation"

Connected through hyperedge HE-5 (induced by source paper "snake in the box codes for rank modulation"):
  with members:
    - "compressed encoding for rank modulation"
    - "constructions of rank modulation codes"
    - "constant weight gray codes for local rank modulation"
    - "codes in permutations and error correction for rank modulation"
    - "multidimensional flash codes"
    - "correcting limited magnitude errors in the rank modulation scheme"

Connected through hyperedge HE-6 (induced by source paper "on the labeling problem of permutation group codes under the infinity metric"):
  with members:
    - "quasi cross lattice tilings with applications to flash memory"
    - "computing the ball size of frequency permutations under chebyshev distance"
    - "constructions of rank modulation codes"
    - "constant weight gray codes for local rank modulation"
    - "codes in permutations and error correction for rank modulation"
    - "correcting limited magnitude errors in the rank modulation scheme"

Question: Please tell me which class the center node 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)