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: "correcting limited magnitude errors in the rank modulation scheme"
  Abstract: We study error-correcting codes for permutations under the infinity norm, motivated by a novel storage scheme for flash memories call rank modulation. In this scheme, a set of $n$ flash cells are combined to create a single virtual multi-level cell. Information is stored in the permutation induced by the cell charge levels. Spike errors, which are characterized by a limited-magnitude change in cell charge levels, correspond to a low-distance change under the infinity norm. #R##N#We define codes protecting against spike errors, called limited-magnitude rank-modulation codes (LMRM codes), and present several constructions for these codes, some resulting in optimal codes. These codes admit simple recursive, and sometimes direct, encoding and decoding procedures. #R##N#We also provide lower and upper bounds on the maximal size of LMRM codes both in the general case, and in the case where the codes form a subgroup of the symmetric group. In the asymptotic analysis, the codes we construct out-perform the Gilbert-Varshamov-like bound estimate.

Connected through hyperedge HE-1 (induced by source paper "infinity norm permutation covering codes from cyclic groups"):
  with members:
    - "limited magnitude error correcting gray codes for rank modulation"
    - "constructions of snake in the box codes under ell_ infty metric for rank modulation"
    - "compression in the space of permutations"
    - "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"
    - "error correction in flash memories via codes in the ulam metric"
    - "snake in the box codes for rank modulation"

Connected through hyperedge HE-2 (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"
    - "generalized gray codes for local rank modulation"
    - "snake in the box codes for rank modulation"
    - "constructions of rank modulation codes"

Connected through hyperedge HE-3 (induced by source paper "secure index coding existence and construction"):
  with members:
    - "limited magnitude error correcting gray codes for rank modulation"
    - "perfectly secure index coding"
    - "snake in the box codes for rank modulation under kendall s tau metric"
    - "on the capacity region for index coding"
    - "duality codes and the integrality gap bound for index coding"
    - "systematic error correcting codes for rank modulation"
    - "constructions of snake in the box codes for rank modulation"
    - "local graph coloring and index coding"

Connected through hyperedge HE-4 (induced by source paper "improved lower bounds on the size of balls over permutations with the infinity metric"):
  with members:
    - "proof of a conjecture of klove on permutation codes under the chebychev distance"
    - "limited magnitude error correcting gray codes for rank modulation"
    - "compression in the space of permutations"
    - "new bounds for permutation codes in ulam metric"
    - "the bethe permanent of a nonnegative matrix"
    - "systematic error correcting codes for rank modulation"
    - "systematic codes for rank modulation"
    - "error correction in flash memories via codes in the ulam metric"

Connected through hyperedge HE-5 (induced by source paper "coding for locality in reconstructing permutations"):
  with members:
    - "synchronizing edits in distributed storage networks"
    - "a family of optimal locally recoverable codes"
    - "optimal linear codes with a local error correction property"
    - "error correction in flash memories via codes in the ulam metric"
    - "succinct representations of permutations and functions"
    - "codes in permutations and error correction for rank modulation"

Connected through hyperedge HE-6 (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"
    - "generalized gray codes for local rank modulation"
    - "snake in the box codes for rank modulation"
    - "codes in permutations and error correction for rank modulation"

Connected through hyperedge HE-7 (induced by source paper "new bounds of permutation codes under hamming metric and kendall s tau metric"):
  with members:
    - "error correction in flash memories via codes in the ulam metric"
    - "coded modulation for power line communications"
    - "constructions of rank modulation codes"
    - "codes in permutations and error correction for rank modulation"

Connected through hyperedge HE-8 (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"
    - "generalized gray codes for local rank modulation"
    - "snake in the box codes for rank modulation"
    - "constructions of rank modulation codes"
    - "codes in permutations and error correction for rank modulation"

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)