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 racetrack memories"
  Abstract: Racetrack memory is a new technology which utilizes magnetic domains along a nanoscopic wire in order to obtain extremely high storage density. In racetrack memory, each magnetic domain can store a single bit of information, which can be sensed by a reading port (head). The memory has a tape-like structure which supports a shift operation that moves the domains to be read sequentially by the head. In order to increase the memory's speed, prior work studied how to minimize the latency of the shift operation, while the no less important reliability of this operation has received only a little attention. #R##N#In this work we design codes which combat shift errors in racetrack memory, called position errors. Namely, shifting the domains is not an error-free operation and the domains may be over-shifted or are not shifted, which can be modeled as deletions and sticky insertions. While it is possible to use conventional deletion and insertion-correcting codes, we tackle this problem with the special structure of racetrack memory, where the domains can be read by multiple heads. Each head outputs a noisy version of the stored data and the multiple outputs are combined in order to reconstruct the data. Under this paradigm, we will show that it is possible to correct, with at most a single bit of redundancy, $d$ deletions with $d+1$ heads if the heads are well-separated. Similar results are provided for burst of deletions, sticky insertions and combinations of both deletions and sticky insertions.

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"
    - "coding for deletion channels with multiple traces"
    - "from clustering supersequences to entropy minimizing subsequences for single and double deletions"
    - "average case reconstruction for the deletion channel subpolynomially many traces suffice"
    - "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 "uncertainty of reconstruction with list decoding from uniform tandem duplication noise"):
  with members:
    - "codes correcting all patterns of tandem duplication errors of maximum length 3"
    - "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"
    - "duplication correcting codes"
    - "bounds on codes correcting tandem and palindromic duplications"
    - "exact reconstruction from insertions in synchronization codes"

Connected through hyperedge HE-3 (induced by source paper "coding for sequence reconstruction for single edits"):
  with members:
    - "coded trace reconstruction"
    - "reconstruction codes for dna sequences with uniform tandem duplication errors"
    - "exact reconstruction from insertions in synchronization codes"

Connected through hyperedge HE-4 (induced by source paper "an overview of capacity results for synchronization channels"):
  with members:
    - "coding for deletion channels with multiple traces"
    - "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"

Connected through hyperedge HE-5 (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"
    - "codes in the space of multisets coding for permutation channels with impairments"
    - "rank modulation codes for dna storage"
    - "duplication correcting codes"
    - "bounds on codes correcting tandem and palindromic duplications"
    - "codes in the damerau distance for dna storage"
    - "asymmetric lee distance codes for dna based storage"

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)