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 "performance analysis for time of arrival estimation with oversampled low complexity 1 bit a d conversion"):
  Abstract: Analog-to-digtial (A/D) conversion plays a crucial role when it comes to the design of energy-efficient and fast signal processing systems. As its complexity grows exponentially with the number of output bits, significant savings are possible when resorting to a minimum resolution of a single bit. However, then the nonlinear effect which is introduced by the A/D converter results in a pronounced performance loss, in particular for the case when the receiver is operated outside the low signal-to-noise ratio (SNR) regime. By trading the A/D resolution for a moderately faster sampling rate, we show that for time-of-arrival (TOA) estimation under any SNR level it is possible to obtain a low-complexity $1$-bit receive system which features a smaller performance degradation then the classical low SNR hard-limiting loss of $2/\pi$ ($-1.96$ dB). Key to this result is the employment of a lower bound for the Fisher information matrix which enables us to approximate the estimation performance for coarsely quantized receivers with correlated noise models in a pessimistic way.

Includes members:
  Member "an overview of signal processing techniques for millimeter wave mimo systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "energy efficient hybrid precoding design for integrated multicast unicast millimeter wave communications with swipt")
  Member "performance analysis for pilot based 1 bit channel estimation with unknown quantization threshold":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "performance analysis for channel estimation with 1 bit adc and unknown quantization threshold")
  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 "one bit massive mimo channel estimation and high order modulations":
    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 "capacity analysis of one bit quantized mimo systems with transmitter channel state information":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "capacity bounds for communication systems with quantization and spectral constraints")
  Member "fisher information bounds with applications in nonlinear learning compression and inference":
    also connected through other hyperedges:
      (none)
  Member "overdemodulation for high performance receivers with low resolution adc":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "performance analysis of mixed adc massive mimo systems over rician fading channels")
  Member "multiple parameter estimation with quantized channel output":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on throughput of millimeter wave mimo systems with low resolution adcs")

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)