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: "optimized sensor collaboration for estimation of temporally correlated parameters"
  Abstract: In this paper, we aim to design the optimal sensor collaboration strategy for the estimation of time-varying parameters, where collaboration refers to the act of sharing measurements with neighboring sensors prior to transmission to a fusion center. We begin by addressing the sensor collaboration problem for the estimation of uncorrelated parameters. We show that the resulting collaboration problem can be transformed into a special nonconvex optimization problem, where a difference of convex functions carries all the nonconvexity. This specific problem structure enables the use of a convex–concave procedure to obtain a near-optimal solution. When the parameters of interest are temporally correlated, a penalized version of the convex–concave procedure becomes well suited for designing the optimal collaboration scheme. In order to improve computational efficiency, we further propose a fast algorithm that scales gracefully with problem size via the alternating direction method of multipliers. Numerical results are provided to demonstrate the effectiveness of our approach and the impact of parameter correlation and temporal dynamics of sensor networks on estimation performance.

Connected through hyperedge HE-1 (induced by source paper "distributed sensing with orthogonal multiple access to code or not to code"):
  with members:
    - "wireless power transfer for distributed estimation in sensor networks"
    - "a survey on non orthogonal multiple access for 5g networks research challenges and future trends"
    - "delay limited source and channel coding of quasi stationary sources over block fading channels design and scaling laws"
    - "estimation diversity and energy efficiency in distributed sensing"

Connected through hyperedge HE-2 (induced by source paper "optimal power control for transmitting correlated sources with energy harvesting constraints"):
  with members:
    - "online learning schemes for power allocation in energy harvesting communications"
    - "energy harvesting wireless communications a review of recent advances"
    - "near optimal energy control and approximate capacity of energy harvesting communication"
    - "the binary energy harvesting channel with a unit sized battery"
    - "on online energy harvesting in multiple access communication systems"
    - "optimal energy allocation for wireless communications with energy harvesting constraints"
    - "transmission with energy harvesting nodes in fading wireless channels optimal policies"
    - "estimation diversity and energy efficiency in distributed sensing"

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.IT(Information Theory)