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 "joint write once memory and error control codes"):
  Abstract: Write-Once-Memory (WOM) is a model for many modern non-volatile memories, such as flash memories. Recently, several capacity-achieving WOM coding schemes have been proposed based on polar coding. Due to the fact that practical computer memory systems always contain noises, a nature question to ask next is how may we generalize these coding schemes, such that they may also have the error-control capabilities. In this paper, we discuss a joint WOM and error-control coding scheme, which is a generalization of the capacity-achieving WOM codes based on source polarization. In this paper, we prove a sufficient and necessary condition for the noisy reading channel being less noisy than the test channel in data encoding in the polar WOM coding. Such a sufficient and necessary condition is usually satisfied in reality. As a consequence of the sufficient and necessary condition, the high entropy set related to the noisy channel is usually strictly contained in the high entropy set related to the test channel in data encoding. Therefore the low-complexity polar joint WOM and error-control codes are sufficient for most practical coding scenarios.

Includes members:
  Member "asymmetric error correction and flash memory rewriting using polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a new coding paradigm for the primitive relay channel")
  Member "universal polar codes for more capable and less noisy channels and sources":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "universal polarization for processes with memory")
  Member "write once memory codes by source polarization":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "asymmetric error correction and flash memory rewriting using polar codes")
  Member "polar write once memory codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on polar coding for binary dirty paper")
  Member "capacity achieving multiwrite wom codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "construction of fixed rate non binary wom codes based on integer programming")
  Member "polar codes for q ary channels q 2 r":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "polar codes simplicity random codes durability")
  Member "channel polarization on q ary discrete memoryless channels by arbitrary kernels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "polar codes and their quantum domain counterparts")

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)