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: "modulation coding for flash memories"
  Abstract: The aggressive scaling down of flash memories has threatened data reliability since the scaling down of cell sizes gives rise to more serious degradation mechanisms such as cell-to-cell interference and lateral charge spreading. The effect of these mechanisms has pattern dependency and some data patterns are more vulnerable than other ones. In this paper, we will categorize data patterns taking into account degradation mechanisms and pattern dependency. In addition, we propose several modulation coding schemes to improve the data reliability by transforming original vulnerable data patterns into more robust ones.

Connected through hyperedge HE-1 (induced by source paper "feedback capacity and coding for the 0 k rll input constrained bec"):
  with members:
    - "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"
    - "an efficient feedback coding scheme with low error probability for discrete memoryless channels"
    - "a simple proof for the optimality of randomized posterior matching"
    - "extrinsic jensen shannon divergence applications to variable length coding"
    - "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 "d imbalance wom codes for reduced inter cell interference in multi level nvms"):
  with members:
    - "using short synchronous wom codes to make wom codes decodable"
    - "geometric wom codes and coding strategies for multilevel flash memories"

Connected through hyperedge HE-3 (induced by source paper "coding scheme for 3d vertical flash memory"):
  with members:
    - "writing on dirty flash memory"
    - "on the duality of erasures and defects"
    - "redundancy allocation of partitioned linear block codes"
    - "coding for memory with stuck at defects"

Connected through hyperedge HE-4 (induced by source paper "writing on dirty flash memory"):
  with members:
    - "redundancy allocation of partitioned linear block codes"
    - "coding for memory with stuck at defects"

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)