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: "new constructions of wom codes using the wozencraft ensemble"
  Abstract: In this paper we give several new constructions of WOM codes. The novelty in our constructions is the use of the so called Wozencraft ensemble of linear codes. Specifically, we obtain the following results. #R##N#We give an explicit construction of a two-write Write-Once-Memory (WOM for short) code that approaches capacity, over the binary alphabet. More formally, for every \epsilon>0, 0<p<1 and n =(1/\epsilon)^{O(1/p\epsilon)} we give a construction of a two-write WOM code of length n and capacity H(p)+1-p-\epsilon. Since the capacity of a two-write WOM code is max_p (H(p)+1-p), we get a code that is \epsilon-close to capacity. Furthermore, encoding and decoding can be done in time O(n^2.poly(log n)) and time O(n.poly(log n)), respectively, and in logarithmic space. #R##N#We obtain a new encoding scheme for 3-write WOM codes over the binary alphabet. Our scheme achieves rate 1.809-\epsilon, when the block length is exp(1/\epsilon). This gives a better rate than what could be achieved using previous techniques. #R##N#We highlight a connection to linear seeded extractors for bit-fixing sources. In particular we show that obtaining such an extractor with seed length O(log n) can lead to improved parameters for 2-write WOM codes. We then give an application of existing constructions of extractors to the problem of designing encoding schemes for memory with defects.

Connected through hyperedge HE-1 (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"
    - "capacity achieving multiwrite wom codes"

Connected through hyperedge HE-2 (induced by source paper "polar write once memory codes"):
  with members:
    - "list decoding of polar codes"
    - "capacity achieving multiwrite wom codes"
    - "polar codes are optimal for lossy source coding"
    - "performance and construction of polar codes on symmetric binary input memoryless channels"
    - "position modulation code for rewriting write once memories"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "polarization for arbitrary discrete memoryless channels"
    - "on the rate of channel polarization"

Connected through hyperedge HE-3 (induced by source paper "capacity achieving multiwrite wom codes"):
  with members:
    - "polar codes speed of polarization and polynomial gap to capacity"
    - "polar write once memory codes"
    - "polar codes are optimal for lossy source coding"

Connected through hyperedge HE-4 (induced by source paper "using short synchronous wom codes to make wom codes decodable"):
  with members:
    - "a nearly optimal construction of flash codes"

Connected through hyperedge HE-5 (induced by source paper "tilings with n dimensional chairs and their applications to asymmetric codes"):
  with members:
    - "quasi cross lattice tilings with applications to flash memory"

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)