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 "deterministic differential search algorithm for distributed sensor relay networks"):
  Abstract: For distributed sensor/relay networks, high reliability and power efficiency are often required. However, several implementation issues arise in practice. One such problem is that all the distributed transmitters have limited power supply since the power source of the transmitters cannot be recharged continually. To resolve this, distributed beamforming has been proposed as a viable solution where all distributed transmitters seek to align in phase at the receiver end. However, it is difficult to implement such transmit beamforming in a distributed fashion in practice since perfect channel state information (CSI) need to be made available at all distributed transmitters, requiring tremendous overhead to feed back CSI from the receiver to all distributed transmitters. #R##N#In this paper, we propose a novel algorithm that belongs to the category of deterministic phase adjustment algorithm: the Deterministic Differential Search Algorithm (DDSA), where the differences between the measured received signal strength (RSS) are utilized judiciously to help us predict the deterministic phase adjustment done at distributed transmitters. Numerical simulations demonstrate rapid convergence to a pre-determined threshold.

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 "energy efficient deterministic adaptive beamforming algorithms 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 "energy efficient deterministic adaptive beamforming algorithms 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 "energy efficient deterministic adaptive beamforming algorithms for distributed sensor relay networks")
  Member "distributed transmit beamforming using feedback control":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "low complexity random rotation based schemes for intelligent reflecting surfaces")

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)