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 "energy efficient deterministic adaptive beamforming algorithms for distributed sensor relay networks"):
  Abstract: In this study, energy-efficient deterministic adaptive beamforming algorithms are proposed for distributed sensor/relay networks. Specifically, DBSA, D-QESA, D-QESA-E, and a hybrid algorithm, hybrid-QESA, that combines the benefits of both deterministic and random adaptive beamforming algorithms, are proposed. Rigorous convergence analyses are provided for all our proposed algorithms and convergence to the global optimal solution is shown for all our proposed algorithms. Through extensive numerical simulations, we demonstrate that superior performance is achieved by our proposed DBSA and D-QESA over random adaptive beamforming algorithms for static channels. Surprisingly, D-QESA is also more robust against random node removal than random adaptive beamforming algorithms. For time-varying channels, hybrid-QESA indeed achieves the best performance since it combines the benefits of both types of adaptive beamforming algorithms. In summary, our proposed deterministic algorithms demonstrate superior performance both in terms of convergence time and robustness against channel and network uncertainties.

Includes members:
  Member "a bio inspired robust adaptive random search algorithm for distributed beamforming":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "deterministic differential search algorithm for distributed sensor relay networks")
  Member "a general proof of convergence for adaptive distributed beamforming schemes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "deterministic differential search algorithm for distributed sensor relay networks")
  Member "perturbation based distributed beamforming for wireless relay networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "performance analysis of relay selection with enhanced dynamic decode and forward and network coding in two way relay channels")
  Member "a random search framework for convergence analysis of distributed beamforming with feedback":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "deterministic differential search algorithm for distributed sensor relay networks")

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)