human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "design and analysis of time invariant sc ldpc convolutional codes with small constraint length"):
  Abstract: In this paper, we deal with time-invariant spatially coupled low-density parity-check convolutional codes (SC-LDPC-CCs). Classic design approaches usually start from quasi-cyclic low-density parity-check block codes and exploit suitable unwrapping procedures to obtain SC-LDPC-CCs. We show that the direct design of the SC-LDPC-CCs syndrome former matrix or, equivalently, the symbolic parity-check matrix, leads to codes with smaller syndrome former constraint lengths with respect to the best solutions available in the literature. We provide theoretical lower bounds on the syndrome former constraint length for the most relevant families of SC-LDPC-CCs, under constraints on the minimum length of cycles in their Tanner graphs. We also propose new code design techniques that approach or achieve such theoretical limits.

Includes members:
  Member "on advisability of designing short length qc ldpc codes using perfect difference families":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "design and analysis of time invariant sc ldpc codes with small constraint length")
  Member "spatially coupled ldpc codes constructed from protographs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "capacity achieving spatially coupled sparse superposition codes with amp decoding")
  Member "construction of high rate regular quasi cyclic ldpc codes based on cyclic difference families":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "design and analysis of time invariant sc ldpc codes with small constraint length")
  Member "quasi cyclic ldpc codes influence of proto and tanner graph structure on minimum hamming distance upper bounds":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "multi dimensional spatially coupled code design enhancing the cycle properties")
  Member "progressive differences convolutional low density parity check codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "design and analysis of time invariant sc ldpc codes with small constraint length")
  Member "windowed decoding of protograph based ldpc convolutional codes over erasure channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "finite length scaling of spatially coupled ldpc codes under window decoding over the bec")
  Member "deriving good ldpc convolutional codes from ldpc block codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "analysis and optimization of tail biting spatially coupled protograph ldpc codes for bicm id systems")
  Member "terminated ldpc convolutional codes with thresholds close to capacity":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "compact qc ldpc block and sc ldpc convolutional codes for low latency communications")

Question: Please tell me which class the source paper 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)