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 "duality between erasures and defects"):
  Abstract: We investigate the duality of the binary erasure channel (BEC) and the binary defect channel (BDC). This duality holds for channel capacities, capacity achieving schemes, minimum distances, and upper bounds on the probability of failure to retrieve the original message. In addition, the relations between BEC, BDC, binary erasure quantization (BEQ), and write-once memory (WOM) are described. From these relations we claim that the capacity of the BDC can be achieved by Reed-Muller (RM) codes under maximum a posterior (MAP) decoding. Also, polar codes with a successive cancellation encoder achieve the capacity of the BDC. Inspired by the duality between the BEC and the BDC, we introduce locally rewritable codes (LWC) for resistive memories, which are the counterparts of locally repairable codes (LRC) for distributed storage systems. The proposed LWC can improve endurance limit and power efficiency of resistive memories.

Includes members:
  Member "locally rewritable codes for resistive memories":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "redundancy allocation in finite length nested codes for nonvolatile memories")
  Member "reed muller codes achieve capacity on erasure channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "partially symmetric monomial codes")
  Member "rewriting flash memories by message passing":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "when do wom codes improve the erasure factor in flash memories")
  Member "cyclic lrc codes and their subfield subcodes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "locally recoverable j affine variety codes")
  Member "coding scheme for 3d vertical flash memory":
    also connected through other hyperedges:
      (none)
  Member "writing on dirty flash memory":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the arbitrarily varying channel with colored gaussian noise")
  Member "on the duality of erasures and defects":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "locally rewritable codes for resistive memories")
  Member "a family of optimal locally recoverable codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a locality based approach for coded computation")

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)