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: "the gelfand pinsker channel strong converse and upper bound for the reliability function"
  Abstract: We consider a Gelfand-Pinsker discrete memoryless channel (DMC) model and provide a strong converse for its capacity. The strong converse is then used to obtain an upper bound on the reliability function. Instrumental in our proofs is a new technical lemma which provides an upper bound for the rate of codes with codewords that are conditionally typical over large message dependent subsets of a typical set of state sequences. This technical result is a nonstraightforward analog of a known result for a DMC without states that provides an upper bound on the rate of a good code with codewords of a fixed type (to be found in, for instance, the Csiszar-Korner book).

Connected through hyperedge HE-1 (induced by source paper "wiretap and gelfand pinsker channels analogy and its applications"):
  with members:
    - "the likelihood encoder for lossy compression"
    - "wiretap channels with random states non causally available at the encoder"
    - "capacity of the state dependent wiretap channel secure writing on dirty paper"
    - "analogy between gambling and measurement based work extraction"
    - "duality of a source coding problem and the semi deterministic broadcast channel with rate limited cooperation"
    - "semantic security capacity for wiretap channels of type ii"
    - "secrecy capacity region of some classes of wiretap broadcast channels"
    - "on state dependent broadcast channels with cooperation"

Connected through hyperedge HE-2 (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-3 (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"
    - "information spectrum approach to second order coding rate in channel coding"
    - "relations between random coding exponents and the statistical physics of random codes"
    - "capacity and random coding exponents for channel coding with side information"

Connected through hyperedge HE-4 (induced by source paper "a proof of the strong converse theorem for gaussian broadcast channels via the gaussian poincar e inequality"):
  with members:
    - "second order asymptotics for the gaussian mac with degraded message sets"
    - "asymptotic estimates in information theory with non vanishing error probabilities"
    - "strong converse exponent for degraded broadcast channels at rates outside the capacity region"

Connected through hyperedge HE-5 (induced by source paper "on the dispersions of three network information theory problems"):
  with members:
    - "moderate deviations analysis of binary hypothesis testing"
    - "fixed length lossy compression in the finite blocklength regime"
    - "on refined versions of the azuma hoeffding inequality with applications in information theory"
    - "the dispersion of lossy source coding"
    - "moderate deviations of lossy source coding for discrete and gaussian sources"
    - "the dispersion of joint source channel coding"
    - "information spectrum approach to second order coding rate in channel coding"

Connected through hyperedge HE-6 (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-7 (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"

Connected through hyperedge HE-8 (induced by source paper "on dispersions of discrete memoryless channels with noncausal state information at the encoder"):
  with members:
    - "on the dispersions of three network information theory problems"
    - "finite dimensional infinite constellations"
    - "the dispersion of lossy source coding"
    - "the dispersion of joint source channel coding"
    - "information spectrum approach to second order coding rate in channel coding"
    - "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)