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: "finite length scaling for iteratively decoded ldpc ensembles"
  Abstract: In this paper we investigate the behavior of iteratively decoded low-density parity-check codes over the binary erasure channel in the so-called ``waterfall region." We show that the performance curves in this region follow a very basic scaling law. We conjecture that essentially the same scaling behavior applies in a much more general setting and we provide some empirical evidence to support this conjecture. The scaling law, together with the error floor expressions developed previously, can be used for fast finite-length optimization.

Connected through hyperedge HE-1 (induced by source paper "finite length scaling of spatially coupled ldpc codes under window decoding over the bec"):
  with members:
    - "spatially coupled turbo like codes"
    - "a scaling law to predict the finite length performance of spatially coupled ldpc codes"
    - "spatially coupled sparse codes on graphs theory and practice"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "lossy source coding via spatially coupled ldgm ensembles"
    - "windowed decoding of protograph based ldpc convolutional codes over erasure channels"
    - "staircase codes fec for 100 gb s otn"
    - "information theoretically optimal compressed sensing via spatial coupling and approximate message passing"

Connected through hyperedge HE-2 (induced by source paper "spatially coupled generalized ldpc codes asymptotic analysis and finite length scaling"):
  with members:
    - "a refined scaling law for spatially coupled ldpc codes over the binary erasure channel"
    - "spatially coupled ldpc codes constructed from protographs"
    - "design of ldpc code ensembles with fast convergence properties"
    - "a scaling law to predict the finite length performance of spatially coupled ldpc codes"
    - "on the minimum distance of generalized spatially coupled ldpc codes"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "windowed decoding of protograph based ldpc convolutional codes over erasure channels"
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"

Connected through hyperedge HE-3 (induced by source paper "a refined scaling law for spatially coupled ldpc codes over the binary erasure channel"):
  with members:
    - "spatially coupled turbo like codes"
    - "a scaling law to predict the finite length performance of spatially coupled ldpc codes"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "staircase codes fec for 100 gb s otn"
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"

Connected through hyperedge HE-4 (induced by source paper "finite length analysis of irregular repetition slotted aloha in the waterfall region"):
  with members:
    - "enhancing contention resolution aloha using combining techniques"
    - "finite length analysis of frameless aloha with multi user detection"
    - "on frame asynchronous coded slotted aloha asymptotic finite length and delay analysis"
    - "error floor analysis of coded slotted aloha over packet erasure channels"
    - "coded slotted aloha a graph based method for uncoordinated multiple access"
    - "broadcast coded slotted aloha a finite frame length analysis"
    - "aloha random access that operates as a rateless code"

Connected through hyperedge HE-5 (induced by source paper "on generalized ldpc codes for 5g ultra reliable communication"):
  with members:
    - "a probabilistic peeling decoder to efficiently analyze generalized ldpc codes over the bec"
    - "ultra reliable communication in 5g wireless systems"
    - "on the minimum distance of generalized spatially coupled ldpc codes"

Connected through hyperedge HE-6 (induced by source paper "binary linear codes with optimal scaling polar codes with large kernels"):
  with members:
    - "achieving the uniform rate region of general multiple access channels by polar coding"
    - "near optimal finite length scaling for polar codes over large alphabets"
    - "construction of polar codes with sublinear complexity"
    - "finite length scaling for polar codes"
    - "performance limits and practical decoding of interleaved reed solomon polar concatenated codes"
    - "polar codes speed of polarization and polynomial gap to capacity"
    - "scaling exponent of list decoders with applications to polar codes"
    - "rate dependent analysis of the asymptotic behavior of channel polarization"

Connected through hyperedge HE-7 (induced by source paper "continuous transmission of spatially coupled ldpc code chains"):
  with members:
    - "spatially coupled ldpc codes constructed from protographs"
    - "triggering wave like convergence of tail biting spatially coupled ldpc codes"
    - "triggering wave like convergence of tail biting spatially coupled ldpc codes single and dual channel setup"
    - "a scaling law to predict the finite length performance of spatially coupled ldpc codes"
    - "threshold saturation for spatially coupled ldpc and ldgm codes on bms channels"
    - "terminated and tailbiting spatially coupled codes with optimized bit mappings for spectrally efficient fiber optical systems"
    - "on the convergence speed of spatially coupled ldpc ensembles"
    - "new codes on graphs constructed by connecting spatially coupled chains"

Connected through hyperedge HE-8 (induced by source paper "performance of ldpc decoders with missing connections"):
  with members:
    - "performance analysis based on density evolution on fault erasure belief propagation decoder"
    - "analysis and design of finite alphabet iterative decoders robust to faulty hardware"
    - "density evolution and functional threshold for the noisy min sum decoder"
    - "noise facilitation in associative memories of exponential capacity"
    - "limit on the addressability of fault tolerant nanowire decoders"
    - "performance of ldpc codes under faulty iterative decoding"
    - "iterative decoding of low density parity check codes a survey"

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)