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: "coding for deletion channels with multiple traces"
  Abstract: Motivated by the sequence reconstruction problem from traces in DNA-based storage, we consider the problem of designing codes for the deletion channel when multiple observations (or traces) are available to the decoder. We propose simple binary and non-binary codes based on Varshamov-Tenengolts (VT) codes. The proposed codes split the codeword in blocks and employ a VT code in each block. The availability of multiple traces helps the decoder to identify deletion-free copies of a block, and to avoid mis-synchronization while decoding. The encoding complexity of the proposed scheme is linear in the codeword length; the decoding complexity is linear in the codeword length, and quadratic in the number of deletions and the number of traces. The proposed scheme offers an explicit low-complexity technique for correcting deletions using multiple traces.

Connected through hyperedge HE-1 (induced by source paper "the error probability of maximum likelihood decoding over two deletion channels"):
  with members:
    - "coding for sequence reconstruction for single edits"
    - "tutorial on algebraic deletion correction codes"
    - "from clustering supersequences to entropy minimizing subsequences for single and double deletions"
    - "average case reconstruction for the deletion channel subpolynomially many traces suffice"
    - "coding for racetrack memories"
    - "codes correcting a burst of deletions or insertions"
    - "fundamental bounds and approaches to sequence reconstruction from nanopore sequencers"
    - "optimal mean based algorithms for trace reconstruction"

Connected through hyperedge HE-2 (induced by source paper "an overview of capacity results for synchronization channels"):
  with members:
    - "coded trace reconstruction"
    - "coded trace reconstruction in a constant number of traces"
    - "optimally resilient codes for list decoding from insertions and deletions"
    - "zero error capacity of duplication channels"
    - "approximating edit distance within constant factor in truly sub quadratic time"
    - "maximum likelihood upper bounds on the capacities of discrete information stable channels"
    - "sharp analytical capacity upper bounds for sticky and related channels"
    - "on the list decodability of insertions and deletions"

Connected through hyperedge HE-3 (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"
    - "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"
    - "deterministic document exchange protocols and almost optimal binary codes for edit errors"

Connected through hyperedge HE-4 (induced by source paper "coded trace reconstruction in a constant number of traces"):
  with members:
    - "coded trace reconstruction"
    - "beyond trace reconstruction population recovery from the deletion channel"
    - "trace reconstruction generalized and parameterized"
    - "unique reconstruction of coded strings from multiset substring spectra"
    - "capacity upper bounds for deletion type channels"
    - "average case reconstruction for the deletion channel subpolynomially many traces suffice"
    - "polynomial time decodable codes for the binary deletion channel"
    - "synchronization strings explicit constructions local decoding and applications"

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)