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 coding over sliced information"
  Abstract: The interest in channel models in which the data is sent as an unordered set of binary strings has increased lately, due to emerging applications in DNA storage, among others. In this paper we analyze the minimal redundancy of binary codes for this channel under substitution errors, and provide several constructions, some of which are shown to be asymptotically optimal. The surprising result in this paper is that while the information vector is sliced into a set of unordered strings, the amount of redundant bits that are required to correct errors is asymptotically equal to the amount required in the classical error correcting paradigm.

Connected through hyperedge HE-1 (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-2 (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"
    - "codes in the space of multisets coding for permutation channels with impairments"
    - "a characterization of the dna data storage channel"
    - "a rewritable random access dna based storage system"
    - "codes for dna sequence profiles"

Connected through hyperedge HE-3 (induced by source paper "unique reconstruction of coded strings from multiset substring spectra"):
  with members:
    - "mutually uncorrelated codes for dna storage"
    - "exact reconstruction from insertions in synchronization codes"
    - "codes correcting a burst of deletions or insertions"
    - "rates of dna sequence profiles for practical values of read lengths"
    - "a rewritable random access dna based storage system"
    - "codes for dna sequence profiles"
    - "string reconstruction from substring compositions"

Connected through hyperedge HE-4 (induced by source paper "coding over sets for dna storage"):
  with members:
    - "sequence subset distance and coding for error control in dna based data storage"
    - "codes in the space of multisets coding for permutation channels with impairments"
    - "a characterization of the dna data storage channel"
    - "fundamental limits of dna storage systems"
    - "a rewritable random access dna based storage system"
    - "codes for dna sequence profiles"
    - "generalized sphere packing bound"

Connected through hyperedge HE-5 (induced by source paper "sequence subset distance and coding for error control in dna based data storage"):
  with members:
    - "coding over sets for dna storage"
    - "codes in the space of multisets coding for permutation channels with impairments"
    - "fundamental limits of dna storage systems"
    - "a rewritable random access dna based storage system"
    - "codes for dna sequence profiles"

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)