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: "coding for high density recording on a 1 d granular magnetic medium"
  Abstract: In terabit-density magnetic recording, several bits of data can be replaced by the values of their neighbors in the storage medium. As a result, errors in the medium are dependent on each other and also on the data written. We consider a simple 1-D combinatorial model of this medium. In our model, we assume a setting where binary data is sequentially written on the medium and a bit can erroneously change to the immediately preceding value. We derive several properties of codes that correct this type of errors, focusing on bounds on their cardinality. We also define a probabilistic finite-state channel model of the storage medium, and derive lower and upper estimates of its capacity. A lower bound is derived by evaluating the symmetric capacity of the channel, i.e., the maximum transmission rate under the assumption of the uniform input distribution of the channel. An upper bound is found by showing that the original channel is a stochastic degradation of another, related channel model whose capacity we can compute explicitly.

Connected through hyperedge HE-1 (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"
    - "on the deletion channel with small deletion probability"
    - "novel bounds on the capacity of the binary deletion channel"

Connected through hyperedge HE-2 (induced by source paper "asymmetric lee distance codes for dna based storage"):
  with members:
    - "dna based storage trends and methods"
    - "a rewritable random access dna based storage system"
    - "codes for dna sequence profiles"
    - "generalized sphere packing bound"
    - "how to construct polar codes"
    - "capacity achieving polar codes for arbitrarily permuted parallel channels"

Connected through hyperedge HE-3 (induced by source paper "on capacity formulation with stationary inputs and application to a bit patterned media recording channel model"):
  with members:
    - "asymptotic estimates in information theory with non vanishing error probabilities"
    - "write channel model for bit patterned media recording"
    - "on the deletion channel with small deletion probability"

Connected through hyperedge HE-4 (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"
    - "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 errors and erasures in random network coding"

Connected through hyperedge HE-5 (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"
    - "on the deletion channel with small deletion probability"
    - "novel bounds on the capacity of the binary deletion channel"

Connected through hyperedge HE-6 (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"
    - "non asymptotic upper bounds for deletion correcting codes"
    - "write channel model for bit patterned media recording"

Connected through hyperedge HE-7 (induced by source paper "upper bounds on the size of grain correcting codes"):
  with members:
    - "correcting grain errors in magnetic media"
    - "non asymptotic upper bounds for deletion correcting codes"
    - "write channel model for bit patterned media recording"

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)