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: "capacity achieving multiwrite wom codes"
  Abstract: In this paper we give an explicit construction of a capacity achieving family of binary t-write WOM codes for any number of writes t, that have a polynomial time encoding and decoding algorithms. The block length of our construction is N=(t/\epsilon)^{O(t/(\delta\epsilon))} when \epsilon is the gap to capacity and encoding and decoding run in time N^{1+\delta}. This is the first deterministic construction achieving these parameters. Our techniques also apply to larger alphabets.

Connected through hyperedge HE-1 (induced by source paper "construction of fixed rate non binary wom codes based on integer programming"):
  with members:
    - "d imbalance wom codes for reduced inter cell interference in multi level nvms"

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

Connected through hyperedge HE-3 (induced by source paper "when do wom codes improve the erasure factor in flash memories"):
  with members:
    - "rewriting flash memories by message passing"
    - "polar write once memory codes"

Connected through hyperedge HE-4 (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"
    - "polar write once memory codes"
    - "polar codes for q ary channels q 2 r"

Connected through hyperedge HE-5 (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"
    - "write once memory codes by source polarization"
    - "polar write once memory codes"
    - "polar codes for q ary channels q 2 r"
    - "channel polarization on q ary discrete memoryless channels by arbitrary kernels"

Connected through hyperedge HE-6 (induced by source paper "write once memory codes by source polarization"):
  with members:
    - "polar write once memory codes"

Connected through hyperedge HE-7 (induced by source paper "polar codes speed of polarization and polynomial gap to capacity"):
  with members:
    - "finite length scaling for polar codes"
    - "improved bounds on the finite length scaling of polar codes"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "universal bounds on the scaling behavior of polar codes"
    - "on the construction of polar codes"
    - "source and channel polarization over finite fields and reed solomon matrices"
    - "polar codes robustness of the successive cancellation decoder with respect to quantization"
    - "how to construct polar codes"

Connected through hyperedge HE-8 (induced by source paper "rank modulation rewrite coding for flash memories"):
  with members:
    - "improved bounds on the finite length scaling of polar codes"
    - "polar write once memory codes"
    - "codes in permutations and error correction for rank modulation"
    - "polar codes are optimal for lossy source coding"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "correcting limited magnitude errors in the rank modulation scheme"

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)