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 dof of parallel miso bcs with partial csit total order and separability"
  Abstract: We study the degrees of freedom (DoF) of a $K$-user parallel MISO broadcast channel with arbitrary levels of partial CSIT over each subchannel. We derive a sum-DoF upperbound which depends on the average CSIT quality of each user. This upperbound is shown to be tight under total order, i.e. when the order of users with respect to their CSIT qualities is preserved over all subchannels. In this case, it is shown that separate coding over each subchannel is optimum in a sum-DoF sense.

Connected through hyperedge HE-1 (induced by source paper "on the separability of parallel miso broadcast channels under partial csit a degrees of freedom region perspective"):
  with members:
    - "degrees of freedom region of the m n 1 n 2 mimo broadcast channel with partial csit an application of sum set inequalities based on aligned image sets"
    - "towards an extremal network theory robust gdof gain of transmitter cooperation over tin"
    - "dof region of the miso bc with partial csit proof by inductive fourier motzkin elimination"
    - "optimality of simple layered superposition coding in the 3 user miso bc with finite precision csit"
    - "on the optimality of treating inter cell interference as noise in uplink cellular networks"
    - "optimal dof region of the k user miso bc with partial csit"
    - "elevated multiplexing and signal space partitioning in the 2 user mimo ic with partial csit"
    - "sum rate maximization for linearly precoded downlink multiuser miso systems with partial csit a rate splitting approach"

Connected through hyperedge HE-2 (induced by source paper "generalized degrees of freedom of the symmetric cache aided miso broadcast channel with partial csit"):
  with members:
    - "fog aided wireless networks for content delivery fundamental latency tradeoffs"
    - "fundamental limits on delivery time in cloud and cache aided heterogeneous networks"
    - "on the optimality of separation between caching and delivery in general cache networks"
    - "fundamental tradeoff between storage and latency in cache aided wireless interference networks"
    - "scalable content delivery with coded caching in multi antenna fading channels"
    - "on coded caching in the overloaded miso broadcast channel"
    - "characterizing the rate memory tradeoff in cache networks within a factor of 2"
    - "physical layer schemes for wireless coded caching"

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)