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: "information dissemination via gossip applications to averaging and coding"
  Abstract: We study distributed algorithms, also known as {\em gossip} algorithms, for information dissemination in an arbitrary connected network of nodes. Distributed algorithms have applications to peer-to-peer, sensor, and ad hoc networks, in which nodes operate under limited computational, communication, and energy resources. These constraints naturally give rise to ``gossip'' algorithms: schemes in which nodes repeatedly communicate with randomly chosen neighbors, thus distributing the computational burden across all the nodes in the network. #R##N#We analyze the information dissemination problem under the gossip constraint for arbitrary networks, and find that the information dissemination time of a gossip algorithm is strongly related to the isoperimetric properties of the underlying graph. As an application of these results, we study two seemingly unrelated important questions: {\em distributed averaging} and {\em coding based information dissemination}. #R##N#Finally, we apply our results to several classes of graphs: grid graph, expander graphs, and complete graphs.

Connected through hyperedge HE-1 (induced by source paper "gossip algorithms for distributed signal processing"):
  with members:
    - "location aided fast distributed consensus in wireless networks"
    - "weight optimization for consensus algorithms with correlated switching topology"
    - "optimization and analysis of distributed averaging with short node memory"
    - "distributed lossy averaging"
    - "polynomial filtering for fast convergence in distributed consensus"
    - "distributed sensor localization in random environments using minimal number of anchor nodes"
    - "the impact of mobility on gossip algorithms"
    - "distributed parameter estimation in sensor networks nonlinear observation models and imperfect communication"

Connected through hyperedge HE-2 (induced by source paper "order optimal consensus through randomized path averaging"):
  with members:
    - "location aided fast distributed consensus in wireless networks"
    - "gossip algorithms for distributed signal processing"
    - "distributed consensus algorithms in sensor networks link failures and channel noise"
    - "geographic gossip efficient aggregation for sensor networks"
    - "gossiping with multiple messages"

Connected through hyperedge HE-3 (induced by source paper "geographic gossip efficient averaging for sensor networks"):
  with members:
    - "geographic gossip efficient aggregation for sensor networks"

Connected through hyperedge HE-4 (induced by source paper "geographic gossip on geometric random graphs via affine combinations"):
  with members:
    - "geographic gossip efficient aggregation for sensor networks"

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.NI(Networking and Internet Architecture)