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: "error correction in flash memories via codes in the ulam metric"
  Abstract: We consider rank modulation codes for flash memories that allow for handling arbitrary charge-drop errors. Unlike classical rank modulation codes used for correcting errors that manifest themselves as swaps of two adjacently ranked elements, the proposed \emph{translocation rank codes} account for more general forms of errors that arise in storage systems. Translocations represent a natural extension of the notion of adjacent transpositions and as such may be analyzed using related concepts in combinatorics and rank modulation coding. Our results include derivation of the asymptotic capacity of translocation rank codes, construction techniques for asymptotically good codes, as well as simple decoding methods for one class of constructed codes. As part of our exposition, we also highlight the close connections between the new code family and permutations with short common subsequences, deletion and insertion error-correcting codes for permutations, and permutation codes in the Hamming distance.

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"
    - "codes in permutations and error correction for rank modulation"

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"
    - "codes in permutations and error correction for rank modulation"

Connected through hyperedge HE-3 (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"
    - "snake in the box codes for rank modulation under kendall s tau metric"

Connected through hyperedge HE-4 (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"
    - "snake in the box codes for rank modulation under kendall s tau metric"

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

Connected through hyperedge HE-6 (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"
    - "coded modulation for power line communications"
    - "codes in permutations and error correction for rank modulation"
    - "lp decodable permutation codes based on linearly constrained permutation matrices"

Connected through hyperedge HE-7 (induced by source paper "multipermutation ulam sphere analysis toward characterizing maximal code size"):
  with members:
    - "new bounds for permutation codes in ulam metric"
    - "codes in permutations and error correction for rank modulation"

Connected through hyperedge HE-8 (induced by source paper "proof of a conjecture of klove on permutation codes under the chebychev distance"):
  with members:
    - "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)