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: "codes in permutations and error correction for rank modulation"
  Abstract: Codes for rank modulation have been recently proposed as a means of protecting flash memory devices from errors. We study basic coding theoretic problems for such codes, representing them as subsets of the set of permutations of n elements equipped with the Kendall tau distance. We derive several lower and upper bounds on the size of codes. These bounds enable us to establish the exact scaling of the size of optimal codes for large values of n. We also show the existence of codes whose size is within a constant factor of the sphere packing bound for any fixed number of errors.

Connected through hyperedge HE-1 (induced by source paper "optimal constant weight codes under l_1 metric"):
  with members:
    - "single error detection and correction for duplication and substitution channels"
    - "reconstruction codes for dna sequences with uniform tandem duplication errors"
    - "bounds and constructions for multi symbol duplication error correcting codes"
    - "asymptotically optimal codes correcting fixed length duplication errors in dna storage systems"
    - "codes in the space of multisets coding for permutation channels with impairments"
    - "constructions of optimal and near optimal multiply constant weight codes"
    - "systematic error correcting codes for rank modulation"
    - "error correction in flash memories via codes in the ulam metric"

Connected through hyperedge HE-2 (induced by source paper "some enumeration problems in the duplication loss model of genome rearrangement"):
  with members:
    - "reconstruction codes for dna sequences with uniform tandem duplication errors"
    - "error correction in flash memories via codes in the ulam metric"

Connected through hyperedge HE-3 (induced by source paper "codes in the space of multisets coding for permutation channels with impairments"):
  with members:
    - "fundamental limits of dna storage systems"
    - "duplication correcting codes for data storage in the dna of living organisms"
    - "perfect codes in the discrete simplex"
    - "compressing sets and multisets of sequences"
    - "multiset codes for permutation channels"
    - "subset codes for packet networks"

Connected through hyperedge HE-4 (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-5 (induced by source paper "worst case vs average case design for estimation from fixed pairwise comparisons"):
  with members:
    - "active ranking from pairwise comparisons and when parametric assumptions don t help"
    - "competitive analysis of the top k ranking problem"
    - "feeling the bern adaptive estimators for bernoulli probabilities of pairwise comparisons"
    - "top k ranking from pairwise comparisons when spectral ranking is optimal"
    - "a permutation based model for crowd labeling optimal estimation and robustness"
    - "spectral mle top k rank aggregation from pairwise comparisons"
    - "estimation from pairwise comparisons sharp minimax bounds with topology dependence"
    - "simple robust and optimal ranking from pairwise comparisons"

Connected through hyperedge HE-6 (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-7 (induced by source paper "ulam sphere size analysis for permutation and multipermutation codes correcting translocation errors"):
  with members:
    - "multipermutation ulam sphere analysis toward characterizing maximal code size"
    - "new bounds for permutation codes in ulam metric"
    - "linear programming upper bounds on permutation code sizes from coherent configurations related to the kendall tau distance metric"
    - "error correction in flash memories via codes in the ulam metric"
    - "coded modulation for power line communications"
    - "lp decodable permutation codes based on linearly constrained permutation matrices"

Connected through hyperedge HE-8 (induced by source paper "multipermutation ulam sphere analysis toward characterizing maximal code size"):
  with members:
    - "new bounds for permutation codes in ulam metric"
    - "error correction in flash memories via codes in the ulam metric"

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)