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: "hierarchical and high girth qc ldpc codes"
  Abstract: We present an approach to designing capacity-approaching high-girth low-density parity-check (LDPC) codes that are friendly to hardware implementation, and compatible with some desired input code structure defined using a protograph. The approach is based on a mapping of any class of codes defined using a protograph into a family of hierarchical quasi-cyclic (HQC) LDPC codes. Whereas the parity check matrices of standard quasi-cyclic (QC) LDPC codes are composed of circulant submatrices, those of HQC LDPC codes are composed of a hierarchy of circulant submatrices that are, in turn, constructed from circulant submatrices, and so on, through some number of levels. Next, we present a girth-maximizing algorithm that optimizes the degrees of freedom within the family of codes to yield a high-girth HQC LDPC code, subject to bounds imposed by the fact that HQC codes are still quasi-cyclic. Finally, we discuss how certain characteristics of a code protograph will lead to inevitable short cycles and show that these short cycles can be eliminated using a “squashing” procedure that results in a high-girth QC LDPC code, although not a hierarchical one. We illustrate our approach with three design examples of QC LDPC codes-two girth-10 codes of rates 1/3 and 0.45 and one girth-8 code of rate 0.7-all of which are obtained from protographs of one-sided spatially coupled codes.

Connected through hyperedge HE-1 (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"
    - "high performance non binary spatially coupled codes for flash memories"
    - "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-2 (induced by source paper "design and analysis of time invariant sc ldpc codes with small constraint length"):
  with members:
    - "on advisability of designing short length qc ldpc codes using perfect difference families"
    - "spatially coupled ldpc codes constructed from protographs"
    - "construction of high rate regular quasi cyclic ldpc codes based on cyclic difference families"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "searching for voltage graph based ldpc tailbiting codes with large girth"
    - "progressive differences convolutional low density parity check codes"
    - "windowed decoding of protograph based ldpc convolutional codes over erasure channels"
    - "deriving good ldpc convolutional codes from ldpc block codes"

Connected through hyperedge HE-3 (induced by source paper "the admm penalized decoder for ldpc codes"):
  with members:
    - "linear programming decoding of spatially coupled codes"
    - "an improved three weight message passing algorithm"
    - "counting in graph covers a combinatorial characterization of the bethe entropy function"
    - "mathematical programming decoding of binary linear codes theory and algorithms"
    - "error floor approximation for ldpc codes in the awgn channel"
    - "adaptive cut generation algorithm for improved linear programming decoding of binary linear codes"
    - "decomposition methods for large scale lp decoding"
    - "instantons causing iterative decoding to cycle"

Connected through hyperedge HE-4 (induced by source paper "hardware based linear program decoding with the alternating direction method of multipliers"):
  with members:
    - "1 bit massive mu mimo precoding in vlsi"
    - "hardware based projection onto the parity polytope and probability simplex"
    - "lp decodable multipermutation codes"
    - "error floor approximation for ldpc codes in the awgn channel"
    - "adaptive cut generation algorithm for improved linear programming decoding of binary linear codes"
    - "decomposition methods for large scale lp decoding"
    - "adaptive methods for linear programming decoding"
    - "towards low complexity linear programming decoding"

Connected through hyperedge HE-5 (induced by source paper "bounding the bethe and the degree m bethe permanents"):
  with members:
    - "the bethe permanent of a nonnegative matrix"
    - "design of multiple edge protographs for qc ldpc codes avoiding short inevitable cycles"
    - "bounds on the minimum distance of punctured quasi cyclic ldpc codes"
    - "quasi cyclic ldpc codes influence of proto and tanner graph structure on minimum hamming distance upper bounds"
    - "the bethe partition function of log supermodular graphical models"
    - "computing the permanent with belief propagation"
    - "absdet pseudo codewords and perm pseudo codewords definitions and properties"
    - "approximating the permanent with belief propagation"

Connected through hyperedge HE-6 (induced by source paper "quasi cyclic ldpc codes based on pre lifted protographs"):
  with members:
    - "design of multiple edge protographs for qc ldpc codes avoiding short inevitable cycles"
    - "bounds on the minimum distance of punctured quasi cyclic ldpc codes"
    - "quasi cyclic ldpc codes influence of proto and tanner graph structure on minimum hamming distance upper bounds"
    - "searching for voltage graph based ldpc tailbiting codes with large girth"
    - "lowering the error floor of ldpc codes using cyclic liftings"

Connected through hyperedge HE-7 (induced by source paper "decomposition methods for large scale lp decoding"):
  with members:
    - "counting in graph covers a combinatorial characterization of the bethe entropy function"
    - "online alternating direction method"
    - "error floor approximation for ldpc codes in the awgn channel"
    - "improved linear programming decoding of ldpc codes and bounds on the minimum and fractional distance"
    - "l1 projections with box constraints"
    - "efficient implementation of linear programming decoding"
    - "probabilistic analysis of linear programming decoding"
    - "interior point algorithms for linear programming decoding"

Connected through hyperedge HE-8 (induced by source paper "bounds on the minimum distance of punctured quasi cyclic ldpc codes"):
  with members:
    - "quasi cyclic ldpc codes influence of proto and tanner graph structure on minimum hamming distance upper bounds"
    - "on distance properties of quasi cyclic protograph based ldpc 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)