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 "partial diffusion least mean square estimation over networks under noisy information exchange"):
  Abstract: Partial diffusion scheme is an effective method for reducing computational load and power consumption in adaptive network implementation. The Information is exchanged among the nodes, usually over noisy links. In this paper, we consider a general version of partial-diffusion least-mean-square (PDLMS) algorithm in the presence of various sources of imperfect information exchanges. Like the established PDLMS, we consider two different schemes to select the entries, sequential and stochastic, for transmission at each iteration. Our objective is to analyze the aggregate effect of these perturbations on general PDLMS strategies. Simulation results demonstrate that considering noisy link assumption adds a new complexity to the related optimization problem and the trade-off between communication cost and estimation performance in comparison to ideal case becomes unbalanced.

Includes members:
  Member "compressive diffusion strategies over distributed networks for reduced communication load":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a multitask diffusion strategy with optimized inter cluster cooperation")
  Member "single bit and reduced dimension diffusion strategies over distributed networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "distributed low rank adaptive algorithms based on alternating optimization and applications")
  Member "diffusion adaptation over networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "sparsity constrained distributed unmixing of hyperspectral data")

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.SY(Systems and Control)