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: "integer forcing effective snr distribution and practical block based schemes"
  Abstract: Integer Forcing (IF) is a novel linear receiver architecture, where instead of separating the codewords sent by each transmitter, and decoding them individually, forces integer-valued linear combinations at each receive antenna, and decodes the linear combinations. The original codewords are obtained by inverting the integer-valued matrix. While demonstrating superior performance, IF requires complex optimization in order to find the optimal linear combinations, and demands either using multi-level nested lattice codes, or reducing the rates of all transmitters to equal the weakest one. Finally, the distribution of the resulting effective SNR is hard to evaluate. #R##N#In this paper, we first give simple upper and lower bounds on the effective SNR of a single linear combination in IF. These expressions allow us to easily bound the distribution of the effective SNR for any given linear combination used. We then suggest two simple block-based IF schemes. These schemes, while sub-optimal, significantly reduce the complexity of the optimization process, and, more importantly, do not require reducing the rates of all transmitters, as decoding is done block-wise. Finally, we bound the distribution of the effective SNR of the decoding schemes, and show via simulations the superiority of block-wise schemes at low SNR.

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)