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 "on the achievable rate of bandlimited continuous time awgn channels with 1 bit output quantization"):
  Abstract: We consider a continuous-time bandlimited additive white Gaussian noise channel with 1-bit output quantization. On such a channel the information is carried by the temporal distances of the zero-crossings of the transmit signal. The set of input signals is constrained by the bandwidth of the channel and an average power constraint. We derive a lower bound on the capacity by lower-bounding the mutual information rate for a given set of waveforms with exponentially distributed zero-crossing distances, where we focus on the behavior in the mid to high signal-to-noise ratio regime. We find that in case the input randomness scales appropriately with the available bandwidth, the mutual information rate grows linearly with the channel bandwidth for constant signal-to-noise ratios. Furthermore, for a given bandwidth the lower bound saturates with the signal-to-noise ratio growing to infinity. The ratio between the lower bound on the mutual information rate and the capacity of the additive white Gaussian noise channel without quantization is a constant independent of the channel bandwidth for an appropriately chosen randomness of the channel input and a given signal-to-noise ratio. We complement those findings with an upper bound on the mutual information rate for the specific signaling scheme. We show that both bounds are close in the mid to high SNR domain.

Includes members:
  Member "capacity upper bounds for deletion type channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "an overview of capacity results for synchronization channels")
  Member "a general framework for transmission with transceiver distortion and some applications":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "sensitivity analysis for binary sampling systems via quantitative fisher information lower bounds")
  Member "increased capacity per unit cost by oversampling":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "bandlimited communication with one bit quantization and oversampling transceiver design and performance evaluation")

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)