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: "on the optimality of treating inter cell interference as noise downlink cellular networks and uplink downlink duality"
  Abstract: We consider the information-theoretic optimality of treating inter-cell interference as noise (multi-cell TIN) in downlink cellular networks. We focus on scenarios modeled by the Gaussian interfering broadcast channel (IBC), comprising $K$ mutually interfering Gaussian broadcast channels (BCs), each formed by a base station communicating independent messages to an arbitrary number of users. We establish a new power allocation duality between the IBC and its dual interfering multiple access channel (IMAC), which entails that the corresponding generalized degrees-of-freedom regions achieved through multi-cell TIN and power control (TINA regions) for both networks are identical. As by-products of this duality, we obtain an explicit characterization of the IBC TINA region from a previously established characterization of the IMAC TINA region; and identify a multi-cell convex-TIN regime in which the IBC TINA region is a polyhedron (hence convex) without the need for time-sharing. We then identify a smaller multi-cell TIN regime in which the IBC TINA region is optimal and multi-cell TIN achieves the entire capacity region of the IBC, up to a constant gap. This is accomplished by deriving a new genie-aided outer bound for the IBC, that reveals a novel BC-type order that holds amongst users in each constituent BC (or cell) under inter-cell interference, which in turn is not implied by previously known BC-type orders (i.e. degraded, less noisy and more capable orders). The multi-cell TIN regime that we identify for the IBC coincides with a corresponding multi-cell TIN regime previously identified for the IMAC, hence establishing a comprehensive uplink-downlink duality of multi-cell TIN in the GDoF (and approximate capacity) sense.

Connected through hyperedge HE-1 (induced by source paper "optimality of treating inter cell interference as noise under finite precision csit"):
  with members:
    - "towards an extremal network theory robust gdof gain of transmitter cooperation over tin"
    - "on the separability of parallel miso broadcast channels under partial csit a degrees of freedom region perspective"
    - "optimality of simple layered superposition coding in the 3 user miso bc with finite precision csit"
    - "on the optimality of treating interference as noise for interfering multiple access channels"
    - "on the optimality of treating inter cell interference as noise in uplink cellular networks"
    - "opportunistic treating interference as noise"
    - "generalized degrees of freedom of the symmetric k user interference channel under finite precision csit"
    - "optimality of treating interference as noise a combinatorial perspective"

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)