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 "inference based distributed channel allocation in wireless sensor networks"):
  Abstract: Interference-aware resource allocation of time slots and frequency channels in single-antenna, halfduplex radio wireless sensor networks (WSN) is challenging. Devising distributed algorithms for such task further complicates the problem. This work studiesWSN joint time and frequency channel allocation for a given routing tree, such that: a) allocation is performed in a fully distributed way, i.e., information exchange is only performed among neighboring WSN terminals, within communication up to two hops, and b) detection of potential interfering terminals is simplified and can be practically realized. The algorithm imprints space, time, frequency and radio hardware constraints into a loopy factor graph and performs iterative message passing/ loopy belief propagation (BP) with randomized initial priors. Sufficient conditions for convergence to a valid solution are offered, for the first time in the literature, exploiting the structure of the proposed factor graph. Based on theoretical findings, modifications of BP are devised that i) accelerate convergence to a valid solution and ii) reduce computation cost. Simulations reveal promising throughput results of the proposed distributed algorithm, even though it utilizes simplified interfering terminals set detection. Future work could modify the constraints such that other disruptive wireless technologies (e.g., full-duplex radios or network coding) could be accommodated within the same inference framework.

Includes members:
  Member "stochastic belief propagation a low complexity alternative to the sum product algorithm":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "continuous graph flow for flexible density estimation")
  Member "the dynamics of message passing on dense graphs with applications to compressed sensing":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "capacity achieving spatially coupled sparse superposition codes with amp decoding")
  Member "max product for maximum weight matching convergence correctness and lp duality":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "my fair bandit distributed learning of max min fairness with multi player bandits")
  Member "sufficient conditions for convergence of the sum product algorithm":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "factorized graph representations for semi supervised learning from sparse 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.IT(Information Theory)