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: "quasi cyclic ldpc codes influence of proto and tanner graph structure on minimum hamming distance upper bounds"
  Abstract: Quasi-cyclic (QC) low-density parity-check (LDPC) codes are an important instance of proto-graph-based LDPC codes. In this paper we present upper bounds on the minimum Hamming distance of QC LDPC codes and study how these upper bounds depend on graph structure parameters (like variable degrees, check node degrees, girth) of the Tanner graph and of the underlying proto-graph. Moreover, for several classes of proto-graphs we present explicit QC LDPC code constructions that achieve (or come close to) the respective minimum Hamming distance upper bounds. Because of the tight algebraic connection between QC codes and convolutional codes, we can state similar results for the free Hamming distance of convolutional codes. In fact, some QC code statements are established by first proving the corresponding convolutional code statements and then using a result by Tanner that says that the minimum Hamming distance of a QC code is upper bounded by the free Hamming distance of the convolutional code that is obtained by “unwrapping” the QC code.

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"
    - "hierarchical and high girth qc ldpc codes"
    - "multi dimensional spatially coupled codes"
    - "new codes on graphs constructed by connecting spatially coupled chains"

Connected through hyperedge HE-2 (induced by source paper "design and analysis of time invariant sc ldpc convolutional 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"
    - "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"
    - "terminated ldpc convolutional codes with thresholds close to capacity"

Connected through hyperedge HE-3 (induced by source paper "from cages to trapping sets and codewords a technique to derive tight upper bounds on the minimum size of trapping sets and minimum distance of ldpc codes"):
  with members:
    - "on the minimum stopping distance of array low density parity check codes"
    - "on characterization of elementary trapping sets of variable regular ldpc codes"
    - "practical graph isomorphism ii"
    - "searching for voltage graph based ldpc tailbiting codes with large girth"
    - "error floor approximation for ldpc codes in the awgn channel"
    - "lowering the error floor of ldpc codes using cyclic liftings"
    - "on the dynamics of the error floor behavior in regular ldpc codes"
    - "shortened array codes of large girth"

Connected through hyperedge HE-4 (induced by source paper "design of improved quasi cyclic protograph based raptor like ldpc codes for short block lengths"):
  with members:
    - "protograph based raptor like ldpc codes"
    - "the bethe permanent of a nonnegative matrix"
    - "bounds on the minimum distance of punctured quasi cyclic ldpc codes"

Connected through hyperedge HE-5 (induced by source paper "time invariant spatially coupled low density parity check codes with small constraint length"):
  with members:
    - "array convolutional low density parity check codes"
    - "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"
    - "deriving good ldpc convolutional codes from ldpc block codes"

Connected through hyperedge HE-6 (induced by source paper "bounding the bethe and the degree m bethe permanents"):
  with members:
    - "hierarchical and high girth qc ldpc codes"
    - "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"
    - "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-7 (induced by source paper "quasi cyclic ldpc codes based on pre lifted protographs"):
  with members:
    - "hierarchical and high girth qc ldpc codes"
    - "design of multiple edge protographs for qc ldpc codes avoiding short inevitable cycles"
    - "bounds on the minimum distance of punctured quasi cyclic ldpc codes"
    - "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-8 (induced by source paper "hierarchical and high girth qc ldpc codes"):
  with members:
    - "quasi cyclic ldpc codes based on pre lifted protographs"
    - "searching for voltage graph based ldpc tailbiting codes with large girth"
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"
    - "lowering the error floor of ldpc codes using cyclic liftings"
    - "shortened array codes of large girth"

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)