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 the space of multisets coding for permutation channels with impairments"
  Abstract: Motivated by communication channels in which the transmitted sequences are subjected to random permutations, as well as by certain DNA storage systems, we study the error control problem in settings where the information is stored/transmitted in the form of multisets of symbols from a given finite alphabet. A general channel model is assumed in which the transmitted multisets are potentially impaired by insertions, deletions, substitutions, and erasures of symbols. Several constructions of error-correcting codes for this channel are described, and bounds on the size of optimal codes correcting any given number of errors are derived. The construction based on the notion of Sidon sets in finite Abelian groups is shown to be optimal, in the sense of the asymptotic scaling of code redundancy, for any error radius and alphabet size. It is also shown to be optimal in the stronger sense of maximal code cardinality in various cases.

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

Connected through hyperedge HE-2 (induced by source paper "coded trace reconstruction"):
  with members:
    - "capacity results for the noisy shuffling channel"
    - "anchor based correction of substitutions in indexed sets"
    - "clustering correcting codes"
    - "coding for deletion channels with multiple traces"
    - "reconstructing trees from traces"
    - "beyond trace reconstruction population recovery from the deletion channel"
    - "trace reconstruction generalized and parameterized"
    - "sequence subset distance and coding for error control in dna based data storage"

Connected through hyperedge HE-3 (induced by source paper "reconstruction codes for dna sequences with uniform tandem duplication errors"):
  with members:
    - "bounds and constructions for multi symbol duplication error correcting codes"
    - "asymptotically optimal codes correcting fixed length duplication errors in dna storage systems"
    - "rank modulation codes for dna storage"
    - "duplication correcting codes"
    - "bounds on codes correcting tandem and palindromic duplications"
    - "coding for racetrack memories"
    - "codes in the damerau distance for dna storage"
    - "asymmetric lee distance codes for dna based storage"

Connected through hyperedge HE-4 (induced by source paper "capacity results for the noisy shuffling channel"):
  with members:
    - "anchor based correction of substitutions in indexed sets"
    - "asymptotically optimal codes correcting fixed length duplication errors in dna storage systems"
    - "sequence subset distance and coding for error control in dna based data storage"
    - "a characterization of the dna data storage channel"
    - "fundamental limits of dna storage systems"
    - "exact reconstruction from insertions in synchronization codes"
    - "a rewritable random access dna based storage system"
    - "codes for dna sequence profiles"

Connected through hyperedge HE-5 (induced by source paper "anchor based correction of substitutions in indexed sets"):
  with members:
    - "efficient and explicit balanced primer codes"
    - "sequence subset distance and coding for error control in dna based data storage"
    - "a characterization of the dna data storage channel"
    - "on coding over sliced information"
    - "a rewritable random access dna based storage system"
    - "codes for dna sequence profiles"

Connected through hyperedge HE-6 (induced by source paper "error exponent bounds for the bee identification problem"):
  with members:
    - "capacity results for the noisy shuffling channel"
    - "the strongly asynchronous massive access channel"
    - "on identifying a massive number of distributions"
    - "fundamental limits of dna storage systems"
    - "error exponents of typical random codes"

Connected through hyperedge HE-7 (induced by source paper "runlength limited sequences and shift correcting codes asymptotic analysis"):
  with members:
    - "asymptotically optimal codes correcting fixed length duplication errors in dna storage systems"
    - "a note on parallel asynchronous channels with arbitrary skews"
    - "zero error capacity of p ary shift channels and fifo queues"
    - "zero error capacity of a class of timing channels"
    - "constant weight and constant charge binary run length limited codes"

Connected through hyperedge HE-8 (induced by source paper "on the bee identification error exponent with absentee bees"):
  with members:
    - "capacity results for the noisy shuffling channel"
    - "on identifying a massive number of distributions"
    - "fundamental limits of dna storage systems"
    - "universal decoding for arbitrary channels relative to a given class of decoding metrics"
    - "distance distribution of binary codes and the error probability of decoding"

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)