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: "coding for memory with stuck at defects"
  Abstract: In this paper, we propose an encoding scheme for partitioned linear block codes (PLBC) which mask the stuck-at defects in memories. In addition, we derive an upper bound and the estimate of the probability that masking fails. Numerical results show that PLBC can efficiently mask the defects with the proposed encoding scheme. Also, we show that our upper bound is very tight by using numerical results.

Connected through hyperedge HE-1 (induced by source paper "redundancy allocation in finite length nested codes for nonvolatile memories"):
  with members:
    - "locally rewritable codes for resistive memories"
    - "duality between erasures and defects"
    - "writing on dirty flash memory"
    - "redundancy allocation of partitioned linear block codes"

Connected through hyperedge HE-2 (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-3 (induced by source paper "locally rewritable codes for resistive memories"):
  with members:
    - "optimal binary locally repairable codes via anticodes"
    - "cyclic lrc codes and their subfield subcodes"
    - "on the duality of erasures and defects"
    - "a family of optimal locally recoverable codes"
    - "binary cyclic codes that are locally repairable"
    - "optimal locally repairable codes via rank metric codes"
    - "optimal locally repairable codes and connections to matroid theory"
    - "on the locality of codeword symbols"

Connected through hyperedge HE-4 (induced by source paper "coding scheme for 3d vertical flash memory"):
  with members:
    - "writing on dirty flash memory"
    - "on the duality of erasures and defects"
    - "redundancy allocation of partitioned linear block codes"
    - "modulation coding for flash memories"

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

Connected through hyperedge HE-6 (induced by source paper "writing on dirty flash memory"):
  with members:
    - "redundancy allocation of partitioned linear block codes"
    - "modulation coding for flash memories"

Connected through hyperedge HE-7 (induced by source paper "on the duality of erasures and defects"):
  with members:
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"

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)