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: "carbon copying onto dirty paper"
  Abstract: A generalization of the problem of writing on dirty paper is considered in which one transmitter sends a common message to multiple receivers. Each receiver experiences on its link an additive interference (in addition to the additive noise), which is known noncausally to the transmitter but not to any of the receivers. Applications range from wireless multi-antenna multicasting to robust dirty paper coding. #R##N#We develop results for memoryless channels in Gaussian and binary special cases. In most cases, we observe that the availability of side information at the transmitter increases capacity relative to systems without such side information, and that the lack of side information at the receivers decreases capacity relative to systems with such side information. #R##N#For the noiseless binary case, we establish the capacity when there are two receivers. When there are many receivers, we show that the transmitter side information provides a vanishingly small benefit. When the interference is large and independent across the users, we show that time sharing is optimal. #R##N#For the Gaussian case we present a coding scheme and establish its optimality in the high signal-to-interference-plus-noise limit when there are two receivers. When the interference is large and independent across users we show that time-sharing is again optimal. Connections to the problem of robust dirty paper coding are also discussed.

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"
    - "writing on dirty paper with resizing and its application to quasi static fading broadcast channels"
    - "capacity and random coding exponents for channel coding with side information"

Connected through hyperedge HE-2 (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"
    - "writing on dirty paper with resizing and its application to quasi static fading broadcast channels"

Connected through hyperedge HE-3 (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"
    - "writing on dirty paper with resizing and its application to quasi static fading broadcast channels"
    - "on the fading paper achievable region of the fading mimo broadcast channel"

Connected through hyperedge HE-4 (induced by source paper "the carbon copy onto dirty paper channel with statistically equivalent states"):
  with members:
    - "the impact of phase fading on the dirty paper channel"
    - "an achievability scheme for the compound channel with state noncausally available at the encoder"

Connected through hyperedge HE-5 (induced by source paper "asynchronous transmission over single user state dependent channels"):
  with members:
    - "on the multiple access channel with asynchronous cognition"
    - "secret key agreement with channel state information at the transmitter"
    - "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"
    - "coding for the feedback gel fand pinsker channel and the feedforward wyner ziv source"

Connected through hyperedge HE-6 (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"
    - "writing on dirty paper with resizing and its application to quasi static fading broadcast channels"

Connected through hyperedge HE-7 (induced by source paper "parallel gaussian networks with a common state cognitive helper"):
  with members:
    - "on the achievable rate regions for state dependent gaussian interference channel"
    - "secret key agreement with channel state information at the transmitter"
    - "the state dependent semideterministic broadcast channel"
    - "bounds on the capacity of the relay channel with noncausal state at source"
    - "capacity bounds for multiuser channels with non causal channel state information at the transmitters"
    - "distributed interference cancellation in multiple access channels"
    - "on the capacity of compound state dependent channels with states known at the transmitter"
    - "lattice strategies for the dirty multiple access channel"

Connected through hyperedge HE-8 (induced by source paper "on channels with asynchronous side information"):
  with members:
    - "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"
    - "coding for the feedback gel fand pinsker channel and the feedforward wyner ziv source"

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)