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: "a formula for the capacity of the general gel fand pinsker channel"
  Abstract: We consider the Gel'fand-Pinsker problem in which the channel and state are general, i.e., possibly non-stationary, non-memoryless and non-ergodic. Using the information spectrum method and a non-trivial modification of the piggyback coding lemma by Wyner, we prove that the capacity can be expressed as an optimization over the difference of a spectral inf- and a spectral sup-mutual information rate. We consider various specializations including the case where the channel and state are memoryless but not necessarily stationary.

Connected through hyperedge HE-1 (induced by source paper "coding for classical quantum channels with rate limited side information at the encoder an information spectrum approach"):
  with members:
    - "uncomputability of the generalized capacity"
    - "one shot marton inner bound for classical quantum broadcast channel"

Connected through hyperedge HE-2 (induced by source paper "information spectrum approach to strong converse theorems for degraded wiretap channels"):
  with members:
    - "converses for secret key agreement and secure computing"
    - "strong converse and second order asymptotics of channel resolvability"
    - "secret key agreement general capacity and second order asymptotics"
    - "second order coding rates for channels with state"
    - "strong converse for a degraded wiretap channel via active hypothesis testing"
    - "fixed error asymptotics for erasure and list decoding"
    - "a tight upper bound for the third order asymptotics for most discrete memoryless channels"
    - "how many queries will resolve common randomness"

Connected through hyperedge HE-3 (induced by source paper "second order coding rates for channels with state"):
  with members:
    - "on the dispersions of three network information theory problems"
    - "quasi static simo fading channels at finite blocklength"
    - "a tight upper bound for the third order asymptotics for most discrete memoryless channels"
    - "bounds on the second order coding rate of the mimo rayleigh block fading channel"
    - "information spectrum approach to second order coding rate in channel coding"
    - "simple channel coding bounds"
    - "second order asymptotics in fixed length source coding and intrinsic randomness"

Connected through hyperedge HE-4 (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"
    - "achievability proof via output statistics of random binning"
    - "second order slepian wolf coding theorems for non mixed and mixed sources"

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)