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: "progressive differences convolutional low density parity check codes"
  Abstract: We present a new family of low-density parity-check (LDPC) convolutional codes that can be designed using ordered sets of progressive differences. We study their properties and define a subset of codes in this class that have some desirable features, such as fixed minimum distance and Tanner graphs without short cycles. The design approach we propose ensures that these properties are guaranteed independently of the code rate. This makes these codes of interest in many practical applications, particularly when high rate codes are needed for saving bandwidth. We provide some examples of coded transmission schemes exploiting this new class of codes.

Connected through hyperedge HE-1 (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"
    - "quasi cyclic ldpc codes influence of proto and tanner graph structure on minimum hamming distance upper bounds"
    - "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-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"
    - "hierarchical and high girth qc ldpc codes"
    - "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"
    - "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 "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"
    - "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"
    - "deriving good ldpc convolutional codes from ldpc block codes"

Connected through hyperedge HE-4 (induced by source paper "array convolutional low density parity check codes"):
  with members:
    - "on a family of circulant matrices for quasi cyclic low density generator matrix codes"
    - "deriving good ldpc convolutional codes from ldpc block codes"
    - "error rate analysis for coded multicarrier systems over quasi static fading channels"
    - "shortened array codes of large girth"

Connected through hyperedge HE-5 (induced by source paper "improving the efficiency of the ldpc code based mceliece cryptosystem through irregular codes"):
  with members:
    - "security and complexity of the mceliece cryptosystem based on quasi cyclic low density parity check codes"
    - "optimization of the parity check matrix density in qc ldpc code based mceliece cryptosystems"
    - "coding with scrambling concatenation and harq for the awgn wire tap channel a security gap analysis"
    - "interleaved product ldpc codes"
    - "scaling efficient code based cryptosystems for embedded platforms"
    - "on a family of circulant matrices for quasi cyclic low density generator matrix codes"
    - "construction of near optimum burst erasure correcting low density parity check codes"

Connected through hyperedge HE-6 (induced by source paper "advanced channel coding for space mission telecommand links"):
  with members:
    - "interleaved product ldpc codes"
    - "on a family of circulant matrices for quasi cyclic low density generator matrix codes"
    - "an improved sphere packing bound for finite length codes on symmetric 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)