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: "bounds on the minimum distance of punctured quasi cyclic ldpc codes"
  Abstract: Recent work by Divsalar et al. has shown that properly designed protograph-based low-density parity-check (LDPC) codes typically have minimum (Hamming) distance linearly increasing with block length. This fact rests on ensemble arguments over all possible expansions of the base protograph. However, when implementation complexity is considered, the expansions are frequently selected from a smaller class of structured expansions. For example, protograph expansion by cyclically shifting connections generates a quasi-cyclic (QC) code. Other recent work by Smarandache and Vontobel has provided upper bounds on the minimum distance of QC codes. In this paper, we generalize these bounds to punctured QC codes and then show how to tighten these for certain classes of codes. We then evaluate these upper bounds for the family of protograph codes known as AR4JA codes that have been recommended for use in deep space communications in a standard established by the Consultative Committee for Space Data Systems (CCSDS). At block lengths larger than 4400 bits, these upper bounds fall well below the ensemble lower bounds.

Connected through hyperedge HE-1 (induced by source paper "characterization and efficient search of non elementary trapping sets of ldpc codes with applications to stopping sets"):
  with members:
    - "on the tanner graph cycle distribution of random ldpc random protograph based ldpc and random quasi cyclic ldpc code ensembles"
    - "characterization and efficient exhaustive search algorithm for elementary trapping sets of irregular ldpc codes"
    - "on the minimum stopping distance of array low density parity check codes"
    - "on characterization of elementary trapping sets of variable regular ldpc codes"

Connected through hyperedge HE-2 (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"
    - "quasi cyclic ldpc codes influence of proto and tanner graph structure on minimum hamming distance upper bounds"

Connected through hyperedge HE-3 (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"
    - "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-4 (induced by source paper "spectral analysis of quasi cyclic product codes"):
  with members:
    - "construction of quasi cyclic product codes"
    - "decoding of quasi cyclic codes up to a new lower bound on the minimum distance"
    - "generalizing bounds on the minimum distance of cyclic codes using cyclic product codes"
    - "on the decoding of quasi bch codes"
    - "a new bound on the minimum distance of cyclic codes using small minimum distance cyclic codes"
    - "on quasi cyclic codes as a generalization of cyclic codes"
    - "collaborative decoding of interleaved reed solomon codes and concatenated code designs"

Connected through hyperedge HE-5 (induced by source paper "construction of quasi cyclic product codes"):
  with members:
    - "decoding of quasi cyclic codes up to a new lower bound on the minimum distance"
    - "on quasi cyclic codes as a generalization of cyclic codes"

Connected through hyperedge HE-6 (induced by source paper "some problems of graph based codes for belief propagation decoding"):
  with members:
    - "design and analysis of e2rc codes"

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"
    - "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-8 (induced by source paper "design of multiple edge protographs for qc ldpc codes avoiding short inevitable cycles"):
  with members:
    - "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"
    - "shortened array codes of large girth"
    - "pseudocodewords of tanner graphs"

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)