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: "limited magnitude error correcting gray codes for rank modulation"
  Abstract: We construct error-correcting codes over permutations under the infinity-metric, which are also Gray codes in the context of rank modulation, i.e., are generated as simple circuits in the rotator graph. These errors model limited-magnitude or spike errors, for which only single-error-detecting Gray codes are currently known. Surprisingly, the error-correcting codes we construct achieve a better asymptotic rate than that of presently known constructions not having the Gray property, and exceed the Gilbert-Varshamov bound. Additionally, we present efficient ranking and unranking procedures, as well as a decoding procedure that runs in linear time. Finally, we also apply our methods to solve an outstanding issue with error-detecting rank-modulation Gray codes (also known in this context as snake-in-the-box codes) under a different metric, the Kendall    $\tau $   -metric, in the group of permutations over an even number of elements    $S_{2n}$   , where we provide asymptotically optimal codes.

Connected through hyperedge HE-1 (induced by source paper "infinity norm permutation covering codes from cyclic groups"):
  with members:
    - "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"
    - "constructions of rank modulation codes"

Connected through hyperedge HE-2 (induced by source paper "secure index coding existence and construction"):
  with members:
    - "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"
    - "an equivalence between network coding and index coding"

Connected through hyperedge HE-3 (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"
    - "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"
    - "snake in the box codes 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)