human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "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.

Includes members:
  Member "a technique for deriving one shot achievability results in network information theory":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "exponential strong converse for successive refinement with causal decoder side information")
  Member "empirical processes typical sequences and coordinated actions in standard borel spaces":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the renyi capacity and center")
  Member "non asymptotic and second order achievability bounds for coding with side information":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "second order asymptotics for the gaussian mac with degraded message sets")
  Member "strong secrecy from channel resolvability":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "securing distributed function approximation via coding for continuous compound channels")
  Member "the gelfand pinsker channel strong converse and upper bound for the reliability function":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "wiretap and gelfand pinsker channels analogy and its applications")
  Member "duality between channel capacity and rate distortion with two sided state information":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "variable length source dispersions differ under maximum and average error criteria")
  Member "capacity and random coding exponents for channel coding with side information":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on the capacity of the carbon copy onto dirty paper channel")

Question: Please tell me which class the source paper 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)