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: "correcting grain errors in magnetic media"
  Abstract: This paper studies new bounds and constructions that are applicable to the combinatorial granular channel model previously introduced by Sharov and Roth. We derive new bounds on the maximum cardinality of a grain-error-correcting code and propose constructions of codes that correct grain-errors. We demonstrate that a permutation of the classical group codes (e.g., Constantin-Rao codes) can correct a single grain-error. In many cases of interest, our results improve upon the currently best known bounds and constructions. Some of the approaches adopted in the context of grain-errors may have application to other channel models.

Connected through hyperedge HE-1 (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"
    - "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"

Connected through hyperedge HE-2 (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"
    - "non asymptotic upper bounds for deletion correcting codes"
    - "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-3 (induced by source paper "generalized sphere packing and sphere covering bounds on the size of codes for combinatorial channels"):
  with members:
    - "generalized sphere packing bound"
    - "upper bounds on the size of grain correcting codes"
    - "an improvement to levenshtein s upper bound on the cardinality of deletion correcting codes"

Connected through hyperedge HE-4 (induced by source paper "upper bounds on the size of grain correcting codes"):
  with members:
    - "non asymptotic upper bounds for deletion correcting codes"
    - "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)