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 "asymptotic analysis and spatial coupling of counter braids"):
  Abstract: A counter braid (CB) is a novel counter architecture introduced by Lu et al. in 2007 for per-flow measurements on high-speed links which can be decoded with low complexity using message passing (MP). CBs achieve an asymptotic compression rate (under optimal decoding) that matches the entropy lower bound of the flow size distribution. In this paper, we apply the concept of spatial coupling to CBs to improve the performance of the original CBs and analyze the performance of the resulting spatially-coupled CBs (SC-CBs). We introduce an equivalent bipartite graph representation of CBs with identical iteration-by-iteration finite-length and asymptotic performance. Based on this equivalent representation, we then analyze the asymptotic performance of single-layer CBs and SC-CBs under the MP decoding algorithm proposed by Lu et al.. In particular, we derive the potential threshold of the uncoupled system and show that it is equal to the area threshold. We also derive the Maxwell decoder for CBs and prove that the potential threshold is an upper bound on the Maxwell decoding threshold. We show that the area under the extended MP extrinsic information transfer curve is equal to zero precisely at the area threshold. This, combined with the analysis of the Maxwell decoder and simulation results, leads us to the conjecture that the potential threshold is equal to the Maxwell decoding threshold and hence a lower bound on the maximum a posteriori decoding threshold. Interestingly, SC-CBs do not show the well-known phenomenon of threshold saturation of the MP decoding threshold to the potential threshold characteristic of spatially-coupled low-density parity-check codes and other coupled systems. However, SC-CBs yield better MP decoding thresholds than their uncoupled counterparts. Finally, we also consider SC-CBs as a compressed sensing scheme and show that low undersampling factors can be achieved.

Includes members:
  Member "spatially coupled turbo like codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "finite length scaling of spatially coupled ldpc codes under window decoding over the bec")
  Member "deterministic and ensemble based spatially coupled product codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "density evolution for deterministic generalized product codes on the binary erasure channel at high rates")
  Member "a simple proof of maxwell saturation for coupled scalar recursions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "capacity achieving spatially coupled sparse superposition codes with amp decoding")
  Member "spatially coupled ldpc codes for decode and forward relaying of two correlated sources over the bec":
    also connected through other hyperedges:
      (none)
  Member "approaching the rate distortion limit with spatial coupling belief propagation and decimation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "sparse regression codes")
  Member "threshold saturation in spatially coupled constraint satisfaction problems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "universal sparse superposition codes with spatial coupling and gamp decoding")
  Member "lossy source coding via spatially coupled ldgm ensembles":
    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 "approaching capacity at high rates with iterative hard decision decoding":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "lattice coding for downlink multiuser transmission")

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)