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: "an achievability scheme for the compound channel with state noncausally available at the encoder"
  Abstract: A new achievability scheme for the compound channel with discrete memoryless (DM) state noncausally available at the encoder is established. Achievability is proved using superposition coding, Marton coding, joint typicality encoding, and indirect decoding. The scheme is shown to achieve strictly higher rate than the straightforward extension of the Gelfand-Pinsker coding scheme for a single DMC with DM state, and is optimal for some classes of channels.

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"
    - "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"
    - "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 "polar codes for broadcast channels with receiver message side information and noncausal state available at the encoder"):
  with members:
    - "achieving the uniform rate region of general multiple access channels by polar coding"
    - "polar codes for broadcast channels"
    - "asymmetric error correction and flash memory rewriting using polar codes"
    - "polar coding for interference networks"
    - "achieving the uniform rate region of multiple access channels using polar codes"
    - "polar codes for the two user multiple access channel"
    - "achieving the capacity of any dmc using only polar codes"
    - "achieving the secrecy capacity of wiretap channels using polar codes"

Connected through hyperedge HE-3 (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"
    - "carbon copying onto dirty paper"

Connected through hyperedge HE-4 (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"
    - "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"
    - "carbon copying onto dirty paper"

Connected through hyperedge HE-5 (induced by source paper "on channels with asynchronous side information"):
  with members:
    - "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"
    - "carbon copying onto dirty paper"

Connected through hyperedge HE-6 (induced by source paper "is non unique decoding necessary"):
  with members:
    - "hybrid coding an interface for joint source channel coding and network communication"
    - "simultaneous nonunique decoding is rate optimal"
    - "capacity region of multiple access channel with states known noncausally at one encoder and only strictly causally at the other encoder"
    - "interference decoding for deterministic channels"
    - "on the optimal compressions in the compress and forward relay schemes"

Connected through hyperedge HE-7 (induced by source paper "capacity bounds for multiuser channels with non causal channel state information at the transmitters"):
  with members:
    - "rate regions for relay broadcast channels"
    - "duality between channel capacity and rate distortion with two sided state information"

Connected through hyperedge HE-8 (induced by source paper "on the capacity of compound state dependent channels with states known at the transmitter"):
  with members:
    - "3 receiver broadcast channels with common and confidential messages"
    - "on the capacity of interference channels with one cooperating transmitter"
    - "carbon copying onto dirty paper"
    - "capacity and random coding exponents for channel coding with side information"

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)