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: "writing on dirty paper with resizing and its application to quasi static fading broadcast channels"
  Abstract: This paper studies a variant of the classical problem of "writing on dirty paper" in which the sum of the input and the interference, or dirt, is multiplied by a random variable that models resizing, known to the decoder but not to the encoder. The achievable rate of Costa's dirty paper coding (DPC) scheme is calculated and compared to the case of the decoder's also knowing the dirt. In the ergodic case, the corresponding rate loss vanishes asymptotically in the limits of both high and low signal-to-noise ratio (SNR), and is small at all finite SNR for typical distributions like Rayleigh, Rician, and Nakagami. In the quasi-static case, the DPC scheme is lossless at all SNR in terms of outage probability. Quasi-static fading broadcast channels (BC) without transmit channel state information (CSI) are investigated as an application of the robustness properties. It is shown that the DPC scheme leads to an outage achievable rate region that strictly dominates that of time division.

Connected through hyperedge HE-1 (induced by source paper "on the capacity of the carbon copy onto dirty paper channel"):
  with members:
    - "on capacity of the dirty paper channel with fading dirt in the strong fading regime"
    - "the impact of phase fading on the dirty paper channel"
    - "is non unique decoding necessary"
    - "an achievability scheme for the compound channel with state noncausally available at the encoder"
    - "on the capacity of compound state dependent channels with states known at the transmitter"
    - "dirty paper coding for fading channels with partial transmitter side information"
    - "carbon copying onto dirty paper"
    - "capacity and random coding exponents for channel coding with side information"

Connected through hyperedge HE-2 (induced by source paper "ergodic fading mimo dirty paper and broadcast channels capacity bounds and lattice strategies"):
  with members:
    - "on the dirty paper channel with fast fading dirt"
    - "the two user gaussian fading broadcast channel"
    - "dirty paper coding for fading channels with partial transmitter side information"
    - "on the fading paper achievable region of the fading mimo broadcast channel"

Connected through hyperedge HE-3 (induced by source paper "on the capacity of the dirty paper channel with fast fading and discrete channel states"):
  with members:
    - "on capacity of the dirty paper channel with fading dirt in the strong fading regime"
    - "the impact of phase fading on the dirty paper channel"
    - "aligned image sets under channel uncertainty settling a conjecture by lapidoth shamai and wigger on the collapse of degrees of freedom under finite precision csit"
    - "the two user gaussian interference channel a deterministic view"
    - "carbon copying onto dirty paper"

Connected through hyperedge HE-4 (induced by source paper "on capacity of the writing onto fast fading dirt channel"):
  with members:
    - "on capacity of the dirty paper channel with fading dirt in the strong fading regime"
    - "the two user gaussian interference channel a deterministic view"
    - "on the fading paper achievable region of the fading mimo broadcast channel"
    - "carbon copying onto dirty paper"

Connected through hyperedge HE-5 (induced by source paper "on the dirty paper channel with fast fading dirt"):
  with members:
    - "on capacity of the dirty paper channel with fading dirt in the strong fading regime"
    - "the impact of phase fading on the dirty paper channel"
    - "an upper bound on the capacity of vector dirty paper with unknown spin and stretch"
    - "carbon copying onto dirty paper"

Connected through hyperedge HE-6 (induced by source paper "on capacity of the dirty paper channel with fading dirt in the strong fading regime"):
  with members:
    - "on the capacity of compound state dependent channels with states known at the transmitter"
    - "carbon copying onto dirty paper"

Connected through hyperedge HE-7 (induced by source paper "relay channel with orthogonal components and structured interference known at the source"):
  with members:
    - "bounds on the capacity of the relay channel with noncausal state at source"
    - "structured interference mitigation in two hop networks"
    - "capacity bounds and exact results for the cognitive z interference channel"
    - "bounds on the capacity of the relay channel with noncausal state information at source"
    - "lecture notes on network information theory"
    - "dirty paper coding for fading channels with partial transmitter side information"
    - "on the fading paper achievable region of the fading mimo broadcast channel"

Connected through hyperedge HE-8 (induced by source paper "an upper bound on the capacity of vector dirty paper with unknown spin and stretch"):
  with members:
    - "inner and outer bounds for the gaussian cognitive interference channel and new capacity results"
    - "carbon copying onto dirty paper"

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)