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: "novel bounds on the capacity of the binary deletion channel"
  Abstract: We present novel bounds on the capacity of the independent and identically distributed binary deletion channel. Four upper bounds are obtained by providing the transmitter and the receiver with genie-aided information on suitably-defined random processes. Since some of the proposed bounds involve infinite series, we also introduce provable inequalities that lead to more manageable results. For most values of the deletion probability, these bounds improve the existing ones and significantly narrow the gap with the available lower bounds. Exploiting the same auxiliary processes, we also derive, as a by-product, a couple of very simple lower bounds on the channel capacity, which, for low values of the deletion probability, are almost as good as the best existing lower bounds.

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 "capacity upper bounds for deletion type channels"):
  with members:
    - "sharp analytical capacity upper bounds for sticky and related channels"
    - "expressions for the entropy of binomial type distributions"
    - "edit distance sketching streaming and document exchange"
    - "coding against deletions in oblivious and online models"
    - "an improved bound on the fraction of correctable deletions"
    - "efficient low redundancy codes for correcting multiple deletions"
    - "deletion codes in the high noise and high rate regimes"
    - "list decoding subspace codes from insertions and deletions"

Connected through hyperedge HE-3 (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 channels with deletions and insertions"
    - "achievable rates for noisy channels with synchronization errors"

Connected through hyperedge HE-4 (induced by source paper "maximum likelihood upper bounds on the capacities of discrete information stable channels"):
  with members:
    - "capacity upper bounds for deletion type channels"
    - "a characterization of the number of subsequences obtained via the deletion channel"
    - "the capacity of channels with feedback"

Connected through hyperedge HE-5 (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-6 (induced by source paper "on the capacity of channels with timing synchronization errors"):
  with members:
    - "achievable rates for channels with deletions and insertions"
    - "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"

Connected through hyperedge HE-7 (induced by source paper "on the capacity of channels with synchronization errors"):
  with members:
    - "achievable rates for channels with deletions and insertions"
    - "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"

Connected through hyperedge HE-8 (induced by source paper "achievable rates for channels with deletions and insertions"):
  with members:
    - "modeling and information rates for synchronization error channels"
    - "efficient file synchronization a distributed source coding approach"
    - "write channel model for bit patterned media recording"
    - "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)