human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "writing on dirty flash memory"):
  Abstract: The most important challenge in the scaling down of flash memory is its increased inter-cell interference (ICI). If side information about ICI is known to the encoder, the flash memory channel can be viewed as similar to Costa's “writing on dirty paper (dirty paper coding).” We first explain why flash memories are dirty due to ICI. We then show that “dirty flash memory” can be changed into “memory with defective cells” model by using only one pre-read operation. The asymmetry between write and erase operations in flash memory plays an important role in this change. Based on the “memory with defective cells” model, we show that additive encoding can significantly improve the probability of decoding failure by using the side information.

Includes members:
  Member "redundancy allocation of partitioned linear block codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "redundancy allocation in finite length nested codes for nonvolatile memories")
  Member "coding for memory with stuck at defects":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "redundancy allocation in finite length nested codes for nonvolatile memories")
  Member "modulation coding for flash memories":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "feedback capacity and coding for the 0 k rll input constrained bec")

Question: Please tell me which class the source paper 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)