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: "sufficient conditions for convergence of the sum product algorithm"
  Abstract: Novel conditions are derived that guarantee convergence of the sum-product algorithm (also known as loopy belief propagation or simply belief propagation (BP)) to a unique fixed point, irrespective of the initial messages, for parallel (synchronous) updates. The computational complexity of the conditions is polynomial in the number of variables. In contrast with previously existing conditions, our results are directly applicable to arbitrary factor graphs (with discrete variables) and are shown to be valid also in the case of factors containing zeros, under some additional conditions. The conditions are compared with existing ones, numerically and, if possible, analytically. For binary variables with pairwise interactions, sufficient conditions are derived that take into account local evidence (i.e., single-variable factors) and the type of pair interactions (attractive or repulsive). It is shown empirically that this bound outperforms existing bounds.

Connected through hyperedge HE-1 (induced by source paper "factorized graph representations for semi supervised learning from sparse data"):
  with members:
    - "snorkel rapid training data creation with weak supervision"
    - "a general framework for estimating graphlet statistics via random walk"
    - "semi supervised classification with graph convolutional networks"
    - "graph based semi supervised learning for relational networks"
    - "semi supervised learning with heterophily"
    - "localization and centrality in networks"
    - "linearized and single pass belief propagation"
    - "spectral redemption in clustering sparse networks"

Connected through hyperedge HE-2 (induced by source paper "step by step community detection for volume regular graphs"):
  with members:
    - "distributed community detection via metastability of the 2 choices dynamics"
    - "phase transition of the 2 choices dynamics on core periphery networks"
    - "eigenvector computation and community detection in asynchronous gossip models"
    - "distributed graph clustering and sparsification"
    - "find your place simple distributed algorithms for community detection"
    - "partitioning well clustered graphs spectral clustering works"
    - "exact recovery in the stochastic block model"
    - "spectral redemption in clustering sparse networks"

Connected through hyperedge HE-3 (induced by source paper "optimization of the belief propagation algorithm for distributed detection by linear data fusion techniques"):
  with members:
    - "random interruptions in cooperation for spectrum sensing in cognitive radio networks"
    - "stochastic belief propagation a low complexity alternative to the sum product algorithm"
    - "the dynamics of message passing on dense graphs with applications to compressed sensing"
    - "generalized approximate message passing for estimation with random linear mixing"
    - "optimal multiband joint detection for spectrum sensing in cognitive radio networks"
    - "message passing algorithms for compressed sensing i motivation and construction"
    - "message passing algorithms for compressed sensing"

Connected through hyperedge HE-4 (induced by source paper "fast convergence of belief propagation to global optima beyond correlation decay"):
  with members:
    - "the mean field approximation information inequalities algorithms and complexity"
    - "mean field approximation convex hierarchies and the optimality of correlation rounding a unified perspective"
    - "belief optimization for binary networks a stable alternative to loopy belief propagation"
    - "bethe bounds and approximating the global optimum"
    - "the bethe partition function of log supermodular graphical models"
    - "the dynamics of message passing on dense graphs with applications to compressed sensing"

Connected through hyperedge HE-5 (induced by source paper "the max product algorithm viewed as linear data fusion a distributed detection scenario"):
  with members:
    - "optimization of the belief propagation algorithm for distributed detection by linear data fusion techniques"
    - "the dynamics of message passing on dense graphs with applications to compressed sensing"
    - "generalized approximate message passing for estimation with random linear mixing"
    - "optimal multiband joint detection for spectrum sensing in cognitive radio networks"
    - "message passing algorithms for compressed sensing i motivation and construction"
    - "message passing algorithms for compressed sensing"

Connected through hyperedge HE-6 (induced by source paper "message scheduling for performant many core belief propagation"):
  with members:
    - "graph partition neural networks for semi supervised classification"
    - "gunrock gpu graph analytics"
    - "loopy belief propagation for approximate inference an empirical study"
    - "residual belief propagation informed scheduling for asynchronous message passing"

Connected through hyperedge HE-7 (induced by source paper "probabilistic mimo symbol detection with expectation consistency approximate inference"):
  with members:
    - "convergence analysis and assurance for gaussian message passing iterative detector in massive mu mimo systems"
    - "capacity achieving iterative lmmse detection for mimo noma systems"
    - "gaussian message passing iterative detection for mimo noma systems with massive access"
    - "spatially coupled ldpc codes constructed from protographs"
    - "optimality of large mimo detection via approximate message passing"
    - "fifty years of mimo detection the road to large scale mimos"
    - "spatially coupled sparse codes on graphs theory and practice"
    - "channel hardening exploiting message passing chemp receiver in large scale mimo systems"

Connected through hyperedge HE-8 (induced by source paper "the mean field approximation information inequalities algorithms and complexity"):
  with members:
    - "the vertex sample complexity of free energy is polynomial"
    - "the ising partition function zeros and deterministic approximation"
    - "approximating partition functions in constant time"
    - "how to calculate partition functions using convex programming hierarchies provable bounds for variational methods"
    - "a new regularity lemma and faster approximation algorithms for low threshold rank graphs"

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)