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: "generalized sphere packing bound"
  Abstract: Kulkarni and Kiyavash recently introduced a new method to establish upper bounds on the size of deletion-correcting codes. This method is based upon tools from hypergraph theory. The deletion channel is represented by a hypergraph whose edges are the deletion balls (or spheres), so that a deletion-correcting code becomes a matching in this hypergraph. Consequently, a bound on the size of such a code can be obtained from bounds on the matching number of a hypergraph. Classical results in hypergraph theory are then invoked to compute an upper bound on the matching number as a solution to a linear-programming problem. #R##N#The method by Kulkarni and Kiyavash can be applied not only for the deletion channel but also for other error channels. This paper studies this method in its most general setup. First, it is shown that if the error channel is regular and symmetric then this upper bound coincides with the sphere packing bound and thus is called the generalized sphere packing bound. Even though this bound is explicitly given by a linear programming problem, finding its exact value may still be a challenging task. In order to simplify the complexity of the problem, we present a technique based upon graph automorphisms that in many cases reduces the number of variables and constraints in the problem. We then apply this method on specific examples of error channels. We start with the $Z$ channel and show how to exactly find the generalized sphere packing bound for this setup. Next studied is the non-binary limited magnitude channel both for symmetric and asymmetric errors, where we focus on the single-error case. We follow up on the deletion and grain-error channels and show how to improve upon the existing upper bounds for single deletion/error. Finally, we apply this method for projective spaces and find its generalized sphere packing bound for the single-error case.

Connected through hyperedge HE-1 (induced by source paper "covering codes for insertions and deletions"):
  with members:
    - "an overview of capacity results for synchronization channels"
    - "near linear time insertion deletion codes and 1 e approximating edit distance via indexing"
    - "optimally resilient codes for list decoding from insertions and deletions"
    - "polynomial time decodable codes for the binary deletion channel"
    - "an improved bound on the fraction of correctable deletions"
    - "locality sensitive hashing without false negatives"
    - "coding for interactive communication correcting insertions and deletions"
    - "a characterization of the number of subsequences obtained via the deletion channel"

Connected through hyperedge HE-2 (induced by source paper "generalized sphere packing bound for subblock constrained codes"):
  with members:
    - "bounds on the size and asymptotic rate of subblock constrained codes"
    - "subblock constrained codes for real time simultaneous energy and information transfer"
    - "multiply constant weight codes and the reliability of loop physically unclonable functions"

Connected through hyperedge HE-3 (induced by source paper "coding over sets for dna storage"):
  with members:
    - "sequence subset distance and coding for error control in dna based data storage"
    - "codes in the space of multisets coding for permutation channels with impairments"
    - "a characterization of the dna data storage channel"
    - "on coding over sliced information"
    - "fundamental limits of dna storage systems"
    - "a rewritable random access dna based storage system"
    - "codes for dna sequence profiles"

Connected through hyperedge HE-4 (induced by source paper "bounds and constructions for multi symbol duplication error correcting codes"):
  with members:
    - "bounds on codes correcting tandem and palindromic duplications"
    - "duplication correcting codes for data storage in the dna of living organisms"
    - "efficient low redundancy codes for correcting multiple deletions"
    - "constant weight and constant charge binary run length limited codes"

Connected through hyperedge HE-5 (induced by source paper "bounds on the size and asymptotic rate of subblock constrained codes"):
  with members:
    - "new bounds and constructions for multiply constant weight codes"
    - "subblock constrained codes for real time simultaneous energy and information transfer"
    - "multiply constant weight codes and the reliability of loop physically unclonable functions"
    - "constructions of optimal and near optimal multiply constant weight codes"
    - "on bounded weight codes"

Connected through hyperedge HE-6 (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"
    - "non asymptotic upper bounds for deletion correcting codes"
    - "constant weight and constant charge binary run length limited codes"

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

Connected through hyperedge HE-8 (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"
    - "upper bounds on the size of grain correcting codes"
    - "correcting grain errors in magnetic media"
    - "non asymptotic upper bounds for deletion correcting codes"
    - "lossy joint source channel coding in the finite blocklength regime"
    - "fixed length lossy compression in the finite blocklength regime"

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)