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: "bounds on the capacity of random insertion and deletion additive noise channels"
  Abstract: We develop several analytical lower bounds on the capacity of binary insertion and deletion channels by considering independent uniformly distributed (i.u.d.) inputs and computing lower bounds on the mutual information between the input and output sequences. For the deletion channel, we consider two different models: i.i.d. deletion-substitution channel and i.i.d. deletion channel with additive white Gaussian noise (AWGN). These two models are considered to incorporate effects of the channel noise along with the synchronization errors. For the insertion channel case, we consider Gallager's model in which the transmitted bits are replaced with two random bits and uniform over the four possibilities independently of any other insertion events. The general approach taken is similar in all cases, however the specific computations differ. Furthermore, the approach yields a useful lower bound on the capacity for a wide range of deletion probabilities of the deletion channels, while it provides a beneficial bound only for small insertion probabilities (less than 0.25) of the insertion model adopted. We emphasize the importance of these results by noting that: 1) our results are the first analytical bounds on the capacity of deletion-AWGN channels, 2) the results developed are the best available analytical lower bounds on the deletion-substitution case, 3) for the Gallager insertion channel model, the new lower bound improves the existing results for small insertion probabilities.

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"
    - "achievable rates for channels with deletions and insertions"
    - "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 "from clustering supersequences to entropy minimizing subsequences for single and double deletions"):
  with members:
    - "capacity upper bounds for deletion type channels"
    - "an improvement to levenshtein s upper bound on the cardinality of deletion correcting codes"
    - "a characterization of the number of subsequences obtained via the deletion channel"

Connected through hyperedge HE-4 (induced by source paper "mutual information bounds via adjacency events"):
  with members:
    - "analysis of boolean functions"

Connected through hyperedge HE-5 (induced by source paper "file updates under random arbitrary insertions and deletions"):
  with members:
    - "low complexity interactive algorithms for synchronization from deletions insertions and substitutions"
    - "synchronizing rankings via interactive communication"
    - "synchronizing edits in distributed storage networks"
    - "a compression algorithm using mis aligned side information"
    - "synchronization from deletions through interactive communication"
    - "efficient file synchronization a distributed source coding approach"
    - "on the deletion channel with small deletion probability"

Connected through hyperedge HE-6 (induced by source paper "achievable rates for noisy channels with synchronization errors"):
  with members:
    - "achievable rates for channels with deletions and insertions"
    - "on the deletion channel with small deletion probability"
    - "novel bounds on the capacity of the binary deletion channel"

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)