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: "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.

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)