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: "write channel model for bit patterned media recording"
  Abstract: We propose a new write channel model for bit-patterned media recording that reflects the data dependence of write synchronization errors. It is shown that this model accommodates both substitution-like errors and insertion-deletion errors whose statistics are determined by an underlying channel state process. We study information theoretic properties of the write channel model, including the capacity, symmetric information rate, Markov-1 rate, and the zero-error capacity.

Connected through hyperedge HE-1 (induced by source paper "graph based encoders and their performance for finite state channels with feedback"):
  with members:
    - "feedback capacity and coding for the 0 k rll input constrained bec"
    - "feedback capacity and coding for the bibo channel with a no repeated ones input constraint"
    - "a single letter upper bound on the feedback capacity of unifilar finite state channels"
    - "a comprehensive survey of recent advancements in molecular communication"
    - "capacity and coding for the ising channel with feedback"
    - "optimal feedback communication via posterior matching"
    - "the capacity of channels with feedback"

Connected through hyperedge HE-2 (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"
    - "coding for high density recording on a 1 d granular magnetic medium"
    - "on the deletion channel with small deletion probability"
    - "novel bounds on the capacity of the binary deletion channel"

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"
    - "coding for high density recording on a 1 d granular magnetic medium"
    - "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"
    - "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-5 (induced by source paper "simcommsys taking the errors out of error correcting code simulations"):
  with members:
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"

Connected through hyperedge HE-6 (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"
    - "coding for high density recording on a 1 d granular magnetic medium"
    - "on the deletion channel with small deletion probability"
    - "novel bounds on the capacity of the binary deletion channel"

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

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