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 "spectral efficiency of random time hopping cdma"):
  Abstract: Traditionally paired with impulsive communications, Time-Hopping CDMA (TH-CDMA) is a multiple access technique that separates users in time by coding their transmissions into pulses occupying a subset of $N_\mathsf{s}$ chips out of the total $N$ included in a symbol period, in contrast with traditional Direct-Sequence CDMA (DS-CDMA) where $N_\mathsf{s}=N$. This work analyzes TH-CDMA with random spreading, by determining whether peculiar theoretical limits are identifiable, with both optimal and sub-optimal receiver structures, in particular in the archetypal case of sparse spreading, that is, $N_\mathsf{s}=1$. Results indicate that TH-CDMA has a fundamentally different behavior than DS-CDMA, where the crucial role played by energy concentration, typical of time-hopping, directly relates with its intrinsic "uneven" use of degrees of freedom.

Includes members:
  Member "what will 5g be":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "5g network slicing using sdn and nfv a survey of taxonomy architectures and future challenges")
  Member "bounds on the sum capacity of synchronous binary cdma channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "capacity bounds of finite dimensional cdma systems with fading near far effects and power control")
  Member "tight bounds on the capacity of binary input random cdma systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimal errors and phase transitions in high dimensional generalized linear models")
  Member "sparsely spread cdma a statistical mechanics based analysis":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "fundamental limits of low density spreading noma with fading")
  Member "analysis of belief propagation for non linear problems the example of cdma or how to prove tanaka s formula":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "understanding phase transitions via mutual information and mmse")
  Member "randomly spread cdma asymptotics via statistical physics":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "unsourced multiuser sparse regression codes achieve the symmetric mac capacity")
  Member "channel uncertainty in ultra wideband communication systems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "bounds on the capacity of ofdm underspread frequency selective fading channels")

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)