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: "two user interference channels with local views on capacity regions of tdm dominating policies"
  Abstract: We study the capacity regions of two-user interference channels where transmitters base their transmission schemes on local views of the channel state. Under the local view model, each transmitter knows only a subset of the four channel gains, which may be mismatched from the other transmitter. #R##N#We consider a set of seven local views, and find that for five out of the seven local views, TDM is sufficient to achieve the qualified notion of capacity region for the linear deterministic interference channel which approximates the Gaussian interference channel. For these five local views, the qualified capacity result implies that no policy can achieve a rate point outside the TDM region without inducing a corner case of sub-TDM performance in another channel state. The common trait shared by the two remaining local views - those with the potential to outperform TDM - is transmitter knowledge of the outgoing interference link accompanied by some common knowledge of state, emphasizing their importance in creating opportunities to coordinate usage of more advanced schemes. #R##N#Our conclusions are extended to bounded gap characterizations of the capacity region for the Gaussian interference channel.

Connected through hyperedge HE-1 (induced by source paper "two user erasure interference channels with local delayed csit"):
  with members:
    - "when does spatial correlation add value to delayed channel state information"
    - "capacity results for binary fading interference channels with delayed csit"
    - "binary fading interference channel with no csit"
    - "communication through collisions opportunistic utilization of past receptions"
    - "approximate capacity region of the two user miso broadcast channels with delayed csit"
    - "on the degrees of freedom of k user siso interference and x channels with delayed csit"
    - "interference alignment for the mimo interference channel with delayed local csit"
    - "the degrees of freedom regions of two user and certain three user mimo broadcast channels with delayed csit"

Connected through hyperedge HE-2 (induced by source paper "the value of local delayed csit"):
  with members:
    - "capacity results for binary fading interference channels with delayed csit"
    - "on the degrees of freedom of k user siso interference and x channels with delayed csit"
    - "interference alignment for the mimo interference channel with delayed local csit"
    - "completely stale transmitter channel state information is still very useful"
    - "retrospective interference alignment"
    - "gaussian interference channel capacity to within one bit"

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)