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: "polar write once memory codes"
  Abstract: A coding scheme for write once memory (WOM) using polar codes is presented. It is shown that the scheme achieves the capacity region of noiseless WOMs when an arbitrary number of multiple writes is permitted. The encoding and decoding complexities scale as O(N log N) where N is the blocklength. For N sufficiently large, the error probability decreases sub-exponentially in N. The results can be generalized from binary to generalized WOMs, described by an arbitrary directed acyclic graph, using nonbinary polar codes. In the derivation we also obtain results on the typical distortion of polar codes for lossy source coding. Some simulation results with finite length codes are presented.

Connected through hyperedge HE-1 (induced by source paper "on polar coding for binary dirty paper"):
  with members:
    - "finite length scaling for polar codes"
    - "improved bounds on the finite length scaling of polar codes"
    - "universal polar codes"
    - "list decoding of polar codes"
    - "fixed length lossy compression in the finite blocklength regime"
    - "polar codes are optimal for lossy source coding"

Connected through hyperedge HE-2 (induced by source paper "channel capacity of polar coding with a given polar mismatched successive cancellation decoder"):
  with members:
    - "a simple proof of fast polarization"
    - "on the scaling exponent of polar codes for binary input energy harvesting channels"
    - "a split reduced successive cancellation list decoder for polar codes"
    - "a low latency list successive cancellation decoding implementation for polar codes"
    - "a high throughput list decoder architecture for polar codes"
    - "fast list decoders for polar codes"
    - "symbol decision successive cancellation list decoder for polar codes"
    - "polar coding for processes with memory"

Connected through hyperedge HE-3 (induced by source paper "duality between erasures and defects"):
  with members:
    - "locally rewritable codes for resistive memories"
    - "reed muller codes achieve capacity on erasure channels"
    - "rewriting flash memories by message passing"
    - "cyclic lrc codes and their subfield subcodes"
    - "coding scheme for 3d vertical flash memory"
    - "writing on dirty flash memory"
    - "on the duality of erasures and defects"
    - "a family of optimal locally recoverable codes"

Connected through hyperedge HE-4 (induced by source paper "rewriting flash memories by message passing"):
  with members:
    - "asymmetric error correction and flash memory rewriting using polar codes"
    - "achieving marton s region for broadcast channels using polar codes"
    - "trajectory codes for flash memory"
    - "on coding efficiency for flash memories"
    - "iterative quantization using codes on graphs"

Connected through hyperedge HE-5 (induced by source paper "codes for partially stuck at memory cells"):
  with members:
    - "coding for memory with stuck at defects"
    - "capacity achieving multiwrite wom codes"
    - "new constructions of wom codes using the wozencraft ensemble"

Connected through hyperedge HE-6 (induced by source paper "when do wom codes improve the erasure factor in flash memories"):
  with members:
    - "rewriting flash memories by message passing"
    - "capacity achieving multiwrite wom codes"

Connected through hyperedge HE-7 (induced by source paper "achieving marton s region for broadcast channels using polar codes"):
  with members:
    - "achieving the uniform rate region of general multiple access channels by polar coding"
    - "polar codes for broadcast channels"
    - "universal polar codes for more capable and less noisy channels and sources"
    - "polar coding for interference networks"
    - "achieving the uniform rate region of multiple access channels using polar codes"
    - "a comparison of superposition coding schemes"
    - "polar codes for arbitrary dmcs and arbitrary macs"
    - "universal polar codes"

Connected through hyperedge HE-8 (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"
    - "write once memory codes by source polarization"
    - "how to achieve the capacity of asymmetric channels"
    - "achieving the capacity of any dmc using only polar codes"
    - "capacity achieving multiwrite wom codes"
    - "polar codes for q ary channels q 2 r"

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)