human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "node placement and distributed magnetic beamforming optimization for wireless power transfer"
  Abstract: In multiple-input single-output (MISO) wireless power transfer (WPT) via magnetic resonant coupling (MRC), multiple transmitters are deployed to enhance the efficiency of power transfer to the electric load at a single receiver by jointly optimizing their source currents/voltages to constructively combine the induced magnetic fields at the receiver, known as magnetic beamforming. In practice, since the transmitters (power chargers) are usually at fixed locations and the receiver (e.g. mobile phone) is desired to be freely located in a target region for wireless charging, its received power can fluctuate significantly over locations even with adaptive magnetic beamforming applied. To achieve uniform coverage, the transmitters need to be optimally placed in the region, which motivates this paper. First, we derive the optimal magnetic beamforming solution in closed-form for a distributed MISO WPT system with given locations of the transmitters and receiver to maximize the deliverable power to the receiver load subject to a given sum-power constraint at all transmitters. With the optimal magnetic beamforming solution, we then jointly optimize the locations of all transmitters to maximize the minimum power deliverable to the receiver when it is being moved over a given one-dimensional (1D) region, i.e., a line of finite length. Although the formulated node placement problem is non-convex, we propose an iterative algorithm for solving it efficiently. Extensive simulation results are provided which show the significant performance gains by the proposed design with optimized transmitter locations and magnetic beamforming as compared to other benchmark schemes with non-adaptive or heuristic currents allocation and transmitters placement. Last, we extend the node placement problem to the more general case of two-dimensional (2D) region, and draw the key insights.

Question: Please tell me which class the center node 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.SY(Systems and Control)