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 architectures for uplink cloud radio access networks"
  Abstract: Consider an uplink cloud radio access network where users are observed simultaneously by several base stations, each with a rate-limited link to a central processor, which wishes to decode all transmitted messages. Recent efforts have demonstrated the advantages of compression-based strategies that send quantized channel observations to the central processor, rather than attempt local decoding. We study the setting where channel state information is not available at the transmitters, but known fully or partially at the base stations. We propose an end-to-end integer-forcing framework for compression-based uplink cloud radio access, and show that it operates within a constant gap from the optimal outage probability if channel state information is fully available at the base stations. We demonstrate via simulations that our framework is competitive with state-of-the-art Wyner-Ziv-based strategies.

Connected through hyperedge HE-1 (induced by source paper "on the capacity regions of cloud radio access networks with limited orthogonal fronthaul"):
  with members:
    - "generalized compression strategy for the downlink cloud radio access network"
    - "the capacity of the relay channel solution to cover s problem in the gaussian case"
    - "on the capacity of cloud radio access networks with oblivious relaying"
    - "lossy compression for compute and forward in limited backhaul uplink multicell processing"
    - "on the optimal fronthaul compression and decoding strategies for uplink cloud radio access networks"
    - "an uplink downlink duality for cloud radio access network"
    - "on achievability for downlink cloud radio access networks with base station cooperation"
    - "capacity bounds for diamond networks with an orthogonal broadcast channel"

Connected through hyperedge HE-2 (induced by source paper "some properties of successive minima and their applications"):
  with members:
    - "expanding the compute and forward framework unequal powers signal levels and multiple linear combinations"
    - "a modified kz reduction algorithm"
    - "integer forcing source coding"
    - "an algebraic approach to physical layer network coding"
    - "partial lll reduction"
    - "integer forcing linear receivers"

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)