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: "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})$.

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"
    - "generalized gray codes for local rank modulation"
    - "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:
    - "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-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"
    - "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-4 (induced by source paper "lp decodable multipermutation codes"):
  with members:
    - "the admm penalized decoder for ldpc codes"
    - "admm lp decoding of non binary ldpc codes in mathbb f _ 2 m"
    - "multipermutation codes in the ulam metric for nonvolatile memories"
    - "systematic error correcting codes for rank modulation"
    - "error correction in flash memories via codes in the ulam metric"
    - "decomposition methods for large scale lp decoding"
    - "coded modulation for power line communications"
    - "snake in the box codes for rank modulation"

Connected through hyperedge HE-5 (induced by source paper "systematic error correcting codes for rank modulation"):
  with members:
    - "error correction in flash memories via codes in the ulam metric"
    - "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-6 (induced by source paper "systematic codes for rank modulation"):
  with members:
    - "constructions of rank modulation codes"
    - "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)