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: "snake in the box codes for rank modulation under kendall s tau metric"
  Abstract: For a Gray code in the scheme of rank modulation for flash memories, the codewords are permutations and two consecutive codewords are obtained using a push-to-the-top operation. We consider snake-in-the-box codes under Kendall's $\tau$-metric, which is a Gray code capable of detecting one Kendall's $\tau$-error. We answer two open problems posed by Horovitz and Etzion. Firstly, we prove the validity of a construction given by them, resulting in a snake of size $M_{2n+1}=\frac{(2n+1)!}{2}-2n+1$. Secondly, we come up with a different construction aiming at a longer snake of size $M_{2n+1}=\frac{(2n+1)!}{2}-2n+3$. The construction is applied successfully to $S_7$.

Connected through hyperedge HE-1 (induced by source paper "new theoretical bounds and constructions of permutation codes under block permutation metric"):
  with members:
    - "theoretical bounds and constructions of codes in the generalized cayley metric"
    - "new bounds of permutation codes under hamming metric and kendall s tau metric"
    - "new bounds for permutation codes in ulam metric"
    - "error correction in flash memories via codes in the ulam metric"

Connected through hyperedge HE-2 (induced by source paper "theoretical bounds and constructions of codes in the generalized cayley metric"):
  with members:
    - "new bounds for permutation codes in ulam metric"
    - "error correction in flash memories via codes in the ulam metric"

Connected through hyperedge HE-3 (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"
    - "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-4 (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"
    - "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"
    - "on the labeling problem of permutation group codes under the infinity metric"

Connected through hyperedge HE-5 (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"
    - "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-6 (induced by source paper "constructions of snake in the box codes under ell_ infty metric for rank modulation"):
  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"
    - "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)