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: "achievable rates for channels with deletions and insertions"
  Abstract: This paper considers a binary channel with deletions and insertions, where each input bit is transformed in one of the following ways: it is deleted with probability d, or an extra bit is added after it with probability i, or it is transmitted unmodified with probability 1-d-i. A computable lower bound on the capacity of this channel is derived. The transformation of the input sequence by the channel may be viewed in terms of runs as follows: some runs of the input sequence get shorter/longer, some runs get deleted, and some new runs are added. It is difficult for the decoder to synchronize the channel output sequence to the transmitted codeword mainly due to deleted runs and new inserted runs. The main idea is a mutual information decomposition in terms of the rate achieved by a suboptimal decoder that determines the positions of the deleted and inserted runs in addition to decoding the transmitted codeword. The mutual information between the channel input and output sequences is expressed as the sum of the rate achieved by this decoder and the rate loss due to its suboptimality. Obtaining computable lower bounds on each of these quantities yields a lower bound on the capacity. The bounds proposed in this paper provide the first characterization of achievable rates for channels with general insertions, and for channels with both deletions and insertions. For the special case of the deletion channel, the proposed bound improves on the previous best lower bound for deletion probabilities up to 0.3.

Connected through hyperedge HE-1 (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-2 (induced by source paper "sharp analytical capacity upper bounds for sticky and related channels"):
  with members:
    - "optimal document exchange and new codes for small number of insertions and deletions"
    - "capacity upper bounds for deletion type channels"
    - "on the capacity of channels with timing synchronization errors"
    - "bounds on the capacity of random insertion and deletion additive noise channels"
    - "achievable rates for noisy channels with synchronization errors"
    - "novel bounds on the capacity of the binary deletion channel"

Connected through hyperedge HE-3 (induced by source paper "polynomial time decodable codes for the binary deletion channel"):
  with members:
    - "optimal document exchange and new codes for small number of insertions and deletions"
    - "deterministic document exchange protocols and almost optimal binary codes for edit errors"
    - "capacity upper bounds for deletion type channels"
    - "optimal document exchange and new codes for insertions and deletions"
    - "synchronization strings codes for insertions and deletions approaching the singleton bound"
    - "efficiently decodable insertion deletion codes for high noise and high rate regimes"
    - "coding against deletions in oblivious and online models"
    - "an improved bound on the fraction of correctable deletions"

Connected through hyperedge HE-4 (induced by source paper "guess check codes for deletions insertions and synchronization"):
  with members:
    - "guess check codes for deletions and synchronization"
    - "codes in the damerau distance for dna storage"
    - "efficiently decodable insertion deletion codes for high noise and high rate regimes"
    - "coding against deletions in oblivious and online models"
    - "efficient low redundancy codes for correcting multiple deletions"
    - "low complexity interactive algorithms for synchronization from deletions insertions and substitutions"
    - "an improvement to levenshtein s upper bound on the cardinality of deletion correcting codes"
    - "a deterministic polynomial time protocol for synchronizing from deletions"

Connected through hyperedge HE-5 (induced by source paper "guess check codes for deletions and synchronization"):
  with members:
    - "codes in the damerau distance for dna storage"
    - "efficient low redundancy codes for correcting multiple deletions"
    - "low complexity interactive algorithms for synchronization from deletions insertions and substitutions"
    - "deletion codes in the high noise and high rate regimes"
    - "an improvement to levenshtein s upper bound on the cardinality of deletion correcting codes"
    - "a deterministic polynomial time protocol for synchronizing from deletions"

Connected through hyperedge HE-6 (induced by source paper "polar coding for the binary erasure channel with deletions"):
  with members:
    - "finite length scaling for polar codes"
    - "rate dependent analysis of the asymptotic behavior of channel polarization"
    - "list decoding of polar codes"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "on the rate of channel polarization"

Connected through hyperedge HE-7 (induced by source paper "on the capacity of channels with timing synchronization errors"):
  with members:
    - "modeling and information rates for synchronization error channels"
    - "optimal coding for the deletion channel with small deletion probability"
    - "write channel model for bit patterned media recording"
    - "coding for high density recording on a 1 d granular magnetic medium"
    - "on the deletion channel with small deletion probability"
    - "novel bounds on the capacity of the binary deletion channel"

Connected through hyperedge HE-8 (induced by source paper "energy efficient communication over the unsynchronized gaussian diamond network"):
  with members:
    - "using superposition codebooks and partial decode and forward in low snr parallel relay networks"
    - "energy efficient communication in the presence of synchronization errors"
    - "modeling and information rates for synchronization error channels"
    - "the approximate capacity of the gaussian n relay diamond network"
    - "asynchronous capacity per unit cost"
    - "on the deletion channel with small deletion probability"

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)