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 signal detection rates with 1 bit array measurements"):
  Abstract: This work considers detecting the presence of a band-limited random radio source using an antenna array featuring a low-complexity digitization process with single-bit output resolution. In contrast to high-resolution analog-to-digital conversion, such a direct transformation of the analog radio measurements to a binary representation can be implemented hardware and energy-efficient. For a wireless spectrum monitoring problem, formulated as a binary hypothesis test, we analyze the achievable detection performance when using such 1-bit radio measurements from an array of sensors. To simplify the derivations, we consider asymptotic statistical tests with exponential family models, which results in analytic detection rate expressions without access to the intractable 1-bit array likelihood. As an application, we explore the detection capability of a GPS spectrum monitoring system with different numbers of antennas and different observation intervals. Results show that binary arrays with a moderate amount of sensors are capable of performing fast and reliable spectrum monitoring.

Includes members:
  Member "throughput analysis of massive mimo uplink with low resolution adcs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "capacity bounds for communication systems with quantization and spectral constraints")
  Member "double detector for sparse signal detection from one bit compressed sensing measurements":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "compressive spectrum sensing for cognitive radio networks")
  Member "doa parameter estimation with 1 bit quantization bounds methods and the exponential replacement":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "sensitivity analysis for binary sampling systems via quantitative fisher information lower bounds")
  Member "low power wideband sensing for one bit quantized cognitive radio systems":
    also connected through other hyperedges:
      (none)
  Member "near maximum likelihood detector and channel estimator for uplink multiuser massive mimo systems with one bit adcs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "performance analysis of quantized uplink massive mimo ofdm with oversampling under adjacent channel interference")
  Member "one bit decentralized detection with a rao test for multisensor fusion":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "generalized rao test for decentralized detection of an uncooperative target")

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)