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: "high performance non binary spatially coupled codes for flash memories"
  Abstract: Modern dense Flash memory devices operate at very low error rates, which require powerful error correcting coding (ECC) techniques. An emerging class of graph-based ECC techniques that has broad applications is the class of spatially-coupled (SC) codes, where a block code is partitioned into components that are then rewired multiple times to construct an SC code. Here, our focus is on SC codes with the underlying circulant-based structure. In this paper, we present a three-stage approach for the design of high performance non-binary SC (NB-SC) codes optimized for practical Flash channels; we aim at minimizing the number of detrimental general absorbing sets of type two (GASTs) in the graph of the designed NB-SC code. In the first stage, we deploy a novel partitioning mechanism, called the optimal overlap partitioning, which acts on the protograph of the SC code to produce optimal partitioning corresponding to the smallest number of detrimental objects. In the second stage, we apply a new circulant power optimizer to further reduce the number of detrimental GASTs. In the third stage, we use the weight consistency matrix framework to manipulate edge weights to eliminate as many as possible of the GASTs that remain in the NB-SC code after the first two stages (that operate on the unlabeled graph of the code). Simulation results reveal that NB-SC codes designed using our approach outperform state-of-the-art NB-SC codes when used over Flash channels.

Connected through hyperedge HE-1 (induced by source paper "managing device lifecycle reconfigurable constrained codes for m t q p lc flash memories"):
  with members:
    - "asymmetric loco codes constrained codes for flash memories"
    - "loco codes lexicographically ordered constrained codes"
    - "finite length construction of high performance spatially coupled codes via optimized partitioning and lifting"

Connected through hyperedge HE-2 (induced by source paper "a combinatorial methodology for optimizing non binary graph based codes theoretical analysis and applications in data storage"):
  with members:
    - "finite length construction of high performance spatially coupled codes via optimized partitioning and lifting"
    - "spatially coupled code design for partial response channels optimal object minimization approach"
    - "a generalized algebraic approach to optimizing sc ldpc codes"
    - "threshold saturation for nonbinary sc ldpc codes on the binary erasure channel"
    - "spatially coupled ldpc codes constructed from protographs"
    - "a scaling law to predict the finite length performance of spatially coupled ldpc codes"
    - "iterative decoding of ldpc codes over the q ary partial erasure channel"
    - "thresholds of absorbing sets in low density parity check codes"

Connected through hyperedge HE-3 (induced by source paper "multi dimensional spatially coupled code design enhancing the cycle properties"):
  with members:
    - "efficient search and elimination of harmful objects in optimized qc sc ldpc codes"
    - "finite length construction of high performance spatially coupled codes via optimized partitioning and lifting"
    - "multi dimensional spatially coupled code design through informed relocation of circulants"
    - "spatially coupled code design for partial response channels optimal object minimization approach"
    - "hierarchical and high girth qc ldpc codes"
    - "multi dimensional spatially coupled codes"
    - "new codes on graphs constructed by connecting spatially coupled chains"
    - "on characterization of elementary trapping sets of variable regular ldpc codes"

Connected through hyperedge HE-4 (induced by source paper "a finite length construction of irregular spatially coupled codes"):
  with members:
    - "finite length construction of high performance spatially coupled codes via optimized partitioning and lifting"
    - "threshold saturation for nonbinary sc ldpc codes on the binary erasure channel"
    - "design of non binary quasi cyclic ldpc codes by ace optimization"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "windowed decoding of spatially coupled codes"

Connected through hyperedge HE-5 (induced by source paper "minimizing the number of detrimental objects in multi dimensional graph based codes"):
  with members:
    - "a combinatorial methodology for optimizing non binary graph based codes theoretical analysis and applications in data storage"
    - "multi dimensional spatially coupled code design through informed relocation of circulants"
    - "new codes on graphs constructed by connecting spatially coupled chains"

Connected through hyperedge HE-6 (induced by source paper "finite length construction of high performance spatially coupled codes via optimized partitioning and lifting"):
  with members:
    - "threshold saturation for nonbinary sc ldpc codes on the binary erasure channel"
    - "spatially coupled ldpc codes constructed from protographs"
    - "design of spatially coupled ldpc codes over gf q for windowed decoding"
    - "performance comparison of ldpc block and spatially coupled codes over gf q"
    - "design of non binary quasi cyclic ldpc codes by ace optimization"
    - "on characterization of elementary trapping sets of variable regular ldpc codes"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "the cycle consistency matrix approach to absorbing sets in separable circulant based ldpc codes"

Connected through hyperedge HE-7 (induced by source paper "a channel aware combinatorial approach to design high performance spatially coupled codes for magnetic recording systems"):
  with members:
    - "a combinatorial methodology for optimizing non binary graph based codes theoretical analysis and applications in data storage"
    - "finite length construction of high performance spatially coupled codes via optimized partitioning and lifting"
    - "spatially coupled code design for partial response channels optimal object minimization approach"
    - "threshold saturation for nonbinary sc ldpc codes on the binary erasure channel"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "windowed decoding of protograph based ldpc convolutional codes over erasure channels"
    - "deriving good ldpc convolutional codes from ldpc block codes"

Connected through hyperedge HE-8 (induced by source paper "spatially coupled code design for partial response channels optimal object minimization approach"):
  with members:
    - "a combinatorial methodology for optimizing non binary graph based codes theoretical analysis and applications in data storage"
    - "finite length construction of high performance spatially coupled codes via optimized partitioning and lifting"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "windowed decoding of protograph based ldpc convolutional codes over erasure channels"
    - "deriving good ldpc convolutional codes from ldpc block codes"

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)