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: "non asymptotic upper bounds for deletion correcting codes"
  Abstract: Explicit non-asymptotic upper bounds on the sizes of multiple-deletion correcting codes are presented. In particular, the largest single-deletion correcting code for $q$-ary alphabet and string length $n$ is shown to be of size at most $\frac{q^n-q}{(q-1)(n-1)}$. An improved bound on the asymptotic rate function is obtained as a corollary. Upper bounds are also derived on sizes of codes for a constrained source that does not necessarily comprise of all strings of a particular length, and this idea is demonstrated by application to sets of run-length limited strings. #R##N#The problem of finding the largest deletion correcting code is modeled as a matching problem on a hypergraph. This problem is formulated as an integer linear program. The upper bound is obtained by the construction of a feasible point for the dual of the linear programming relaxation of this integer linear program. #R##N#The non-asymptotic bounds derived imply the known asymptotic bounds of Levenshtein and Tenengolts and improve on known non-asymptotic bounds. Numerical results support the conjecture that in the binary case, the Varshamov-Tenengolts codes are the largest single-deletion correcting codes.

Connected through hyperedge HE-1 (induced by source paper "duplication correcting codes"):
  with members:
    - "bounds on codes correcting tandem and palindromic duplications"
    - "duplication correcting codes for data storage in the dna of living organisms"
    - "codes correcting a burst of deletions or insertions"
    - "generalized sphere packing bound"
    - "constant weight and constant charge binary run length limited codes"

Connected through hyperedge HE-2 (induced by source paper "exact reconstruction from insertions in synchronization codes"):
  with members:
    - "codes in the damerau distance for dna storage"
    - "duplication correcting codes for data storage in the dna of living organisms"
    - "asymmetric lee distance codes for dna based storage"
    - "a rewritable random access dna based storage system"
    - "codes for dna sequence profiles"
    - "low complexity interactive algorithms for synchronization from deletions insertions and substitutions"
    - "string reconstruction from substring compositions"
    - "codes for dna storage channels"

Connected through hyperedge HE-3 (induced by source paper "linear programming based converses for finite blocklength lossy joint source channel coding"):
  with members:
    - "channels with cost constraints strong converse and dispersion"
    - "generalized sphere packing bound"
    - "upper bounds on the size of grain correcting codes"
    - "correcting grain errors in magnetic media"
    - "lossy joint source channel coding in the finite blocklength regime"
    - "fixed length lossy compression in the finite blocklength regime"

Connected through hyperedge HE-4 (induced by source paper "codes correcting a burst of deletions or insertions"):
  with members:
    - "efficient low redundancy codes for correcting multiple deletions"

Connected through hyperedge HE-5 (induced by source paper "generalized sphere packing bound"):
  with members:
    - "upper bounds on the size of grain correcting codes"
    - "bounds for projective codes from semidefinite programming"
    - "correcting grain errors in magnetic media"
    - "on the non existence of lattice tilings by quasi crosses"
    - "linearity and complements in projective space"
    - "write channel model for bit patterned media recording"
    - "coding for high density recording on a 1 d granular magnetic medium"
    - "coding for errors and erasures in random network coding"

Connected through hyperedge HE-6 (induced by source paper "deletion codes in the high noise and high rate regimes"):
  with members:
    - "efficiently decodable insertion deletion codes for high noise and high rate regimes"
    - "an improved bound on the fraction of correctable deletions"
    - "efficient low redundancy codes for correcting multiple deletions"
    - "generalized sphere packing bound"
    - "on the zero error capacity threshold for deletion channels"
    - "explicit codes achieving list decoding capacity error correction with optimal redundancy"

Connected through hyperedge HE-7 (induced by source paper "correcting grain errors in magnetic media"):
  with members:
    - "new constructions of codes for asymmetric channels via concatenation"
    - "upper bounds on the size of grain correcting codes"
    - "write channel model for bit patterned media recording"
    - "coding for high density recording on a 1 d granular magnetic medium"

Connected through hyperedge HE-8 (induced by source paper "upper bounds on the size of grain correcting codes"):
  with members:
    - "correcting grain errors in magnetic media"
    - "write channel model for bit patterned media recording"
    - "coding for high density recording on a 1 d granular magnetic medium"

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)