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 once memory codes by source polarization"
  Abstract: We propose a new Write-Once-Memory (WOM) coding scheme based on source polarization. By applying a source polarization transformation on the to-be-determined codeword, the proposed WOM coding scheme encodes information into the bits in the high-entropy set. We prove in this paper that the proposed WOM codes are capacity-achieving. WOM codes have found many applications in modern data storage systems, such as flash memories.

Connected through hyperedge HE-1 (induced by source paper "asymmetric error correction and flash memory rewriting using polar codes"):
  with members:
    - "polar codes for broadcast channels with receiver message side information and noncausal state available at the encoder"
    - "polar codes for broadcast channels"
    - "achieving marton s region for broadcast channels using polar codes"
    - "how to achieve the capacity of asymmetric channels"
    - "achieving the capacity of any dmc using only polar codes"
    - "polar write once memory codes"
    - "capacity achieving multiwrite wom codes"
    - "polar codes for q ary channels q 2 r"

Connected through hyperedge HE-2 (induced by source paper "joint write once memory and error control codes"):
  with members:
    - "asymmetric error correction and flash memory rewriting using polar codes"
    - "universal polar codes for more capable and less noisy channels and sources"
    - "polar write once memory codes"
    - "capacity achieving multiwrite wom codes"
    - "polar codes for q ary channels q 2 r"
    - "channel polarization on q ary discrete memoryless channels by arbitrary kernels"

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)