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: "capacity and random coding exponents for channel coding with side information"
  Abstract: Capacity formulas and random-coding exponents are derived for a generalized family of Gel'fand-Pinsker coding problems. These exponents yield asymptotic upper bounds on the achievable log probability of error. In our model, information is to be reliably transmitted through a noisy channel with finite input and output alphabets and random state sequence, and the channel is selected by a hypothetical adversary. Partial information about the state sequence is available to the encoder, adversary, and decoder. The design of the transmitter is subject to a cost constraint. Two families of channels are considered: 1) compound discrete memoryless channels (CDMC), and 2) channels with arbitrary memory, subject to an additive cost constraint, or more generally to a hard constraint on the conditional type of the channel output given the input. Both problems are closely connected. The random-coding exponent is achieved using a stacked binning scheme and a maximum penalized mutual information decoder, which may be thought of as an empirical generalized Maximum a Posteriori decoder. For channels with arbitrary memory, the random-coding exponents are larger than their CDMC counterparts. Applications of this study include watermarking, data hiding, communication in presence of partially known interferers, and problems such as broadcast channels, all of which involve the fundamental idea of binning.

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"
    - "carbon copying onto dirty paper"

Connected through hyperedge HE-2 (induced by source paper "a new parallel message distribution technique for cost based steganography"):
  with members:
    - "covert communication over noisy channels a resolvability perspective"

Connected through hyperedge HE-3 (induced by source paper "convolutional neural network steganalysis s application to steganography"):
  with members:
    - "a new parallel message distribution technique for cost based steganography"

Connected through hyperedge HE-4 (induced by source paper "asymptotic estimates in information theory with non vanishing error probabilities"):
  with members:
    - "second order asymptotics for the gaussian mac with degraded message sets"
    - "the third order term in the normal approximation for the awgn channel"
    - "strong converse and second order asymptotics of channel resolvability"
    - "channels with cost constraints strong converse and dispersion"
    - "secret key agreement general capacity and second order asymptotics"
    - "second order coding rates for channels with state"
    - "unequal message protection asymptotic and non asymptotic tradeoffs"
    - "information spectrum approach to strong converse theorems for degraded wiretap channels"

Connected through hyperedge HE-5 (induced by source paper "on the reliability function of the discrete memoryless relay channel"):
  with members:
    - "multiuser coding techniques for mismatched decoding"
    - "multiuser random coding techniques for mismatched decoding"
    - "reliability in source coding with side information"
    - "moderate deviations of lossy source coding for discrete and gaussian sources"
    - "the gelfand pinsker channel strong converse and upper bound for the reliability function"
    - "information spectrum approach to second order coding rate in channel coding"
    - "relations between random coding exponents and the statistical physics of random codes"

Connected through hyperedge HE-6 (induced by source paper "communication in the presence of a state aware adversary"):
  with members:
    - "sufficiently myopic adversaries are blind"
    - "wiretap channels with random states non causally available at the encoder"
    - "secrecy results for compound wiretap channels"
    - "upper bounds on the capacity of binary channels with causal adversaries"
    - "coding into a source a direct inverse rate distortion theorem"

Connected through hyperedge HE-7 (induced by source paper "non asymptotic and second order achievability bounds for coding with side information"):
  with members:
    - "second order asymptotics for the gaussian mac with degraded message sets"
    - "on the dispersions of three network information theory problems"
    - "a technique for deriving one shot achievability results in network information theory"
    - "a tight upper bound for the third order asymptotics for most discrete memoryless channels"
    - "non asymptotic output statistics of random binning and its applications"
    - "distributed channel synthesis"
    - "a formula for the capacity of the general gel fand pinsker channel"
    - "achievability proof via output statistics of random binning"

Connected through hyperedge HE-8 (induced by source paper "on the dispersions of the gel fand pinsker channel and dirty paper coding"):
  with members:
    - "second order asymptotics for the gaussian mac with degraded message sets"
    - "second order coding rates for channels with state"
    - "on the dispersions of three network information theory problems"
    - "a technique for deriving one shot achievability results in network information theory"
    - "non asymptotic output statistics of random binning and its applications"
    - "second order rate region of constant composition codes for the multiple access channel"
    - "non asymptotic and second order achievability bounds for coding with side information"
    - "a finite blocklength perspective on gaussian multi access channels"

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)