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: "non asymptotic and second order achievability bounds for coding with side information"
  Abstract: We present novel non-asymptotic or finite blocklength achievability bounds for three side-information problems in network information theory. These include (i) the Wyner-Ahlswede-Korner (WAK) problem of almost-lossless source coding with rate-limited side-information, (ii) the Wyner-Ziv (WZ) problem of lossy source coding with side-information at the decoder and (iii) the Gel'fand-Pinsker (GP) problem of channel coding with noncausal state information available at the encoder. The bounds are proved using ideas from channel simulation and channel resolvability. Our bounds for all three problems improve on all previous non-asymptotic bounds on the error probability of the WAK, WZ and GP problems--in particular those derived by Verdu. Using our novel non-asymptotic bounds, we recover the general formulas for the optimal rates of these side-information problems. Finally, we also present achievable second-order coding rates by applying the multidimensional Berry-Esseen theorem to our new non-asymptotic bounds. Numerical results show that the second-order coding rates obtained using our non-asymptotic achievability bounds are superior to those obtained using existing finite blocklength bounds.

Connected through hyperedge HE-1 (induced by source paper "second order asymptotics for the gaussian mac with degraded message sets"):
  with members:
    - "asymptotic estimates in information theory with non vanishing error probabilities"
    - "the third order term in the normal approximation for the awgn channel"
    - "on the dispersions of three network information theory problems"
    - "second order asymptotics for the discrete memoryless mac with degraded message sets"
    - "mismatched decoding error exponents second order rates and saddlepoint approximations"
    - "second order resolvability intrinsic randomness and fixed length source coding for mixed sources information spectrum approach"
    - "second order rate region of constant composition codes for the multiple access channel"
    - "a finite blocklength perspective on gaussian multi access channels"

Connected through hyperedge HE-2 (induced by source paper "a case where interference does not affect the channel dispersion"):
  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"
    - "second order coding rates for channels with state"
    - "on the dispersions of three network information theory problems"
    - "a tight upper bound for the third order asymptotics for most discrete memoryless channels"
    - "second order rate region of constant composition codes for the multiple access channel"
    - "a finite blocklength perspective on gaussian multi access channels"
    - "lossy joint source channel coding in the finite blocklength regime"

Connected through hyperedge HE-3 (induced by source paper "second order coding rates for conditional rate distortion"):
  with members:
    - "asymptotic estimates in information theory with non vanishing error probabilities"
    - "second order coding rates for channels with state"
    - "on the dispersions of the gel fand pinsker channel and dirty paper coding"
    - "the dispersion of lossy source coding"
    - "source coding when the side information may be delayed"
    - "moderate deviations of lossy source coding for discrete and gaussian sources"

Connected through hyperedge HE-4 (induced by source paper "strong converse and second order asymptotics of channel resolvability"):
  with members:
    - "second order resolvability intrinsic randomness and fixed length source coding for mixed sources information spectrum approach"
    - "distributed channel synthesis"
    - "strong secrecy from channel resolvability"
    - "information spectrum approach to second order coding rate in channel coding"

Connected through hyperedge HE-5 (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"
    - "a finite blocklength perspective on gaussian multi access channels"
    - "the gelfand pinsker channel strong converse and upper bound for the reliability function"

Connected through hyperedge HE-6 (induced by source paper "a technique for deriving one shot achievability results in network information theory"):
  with members:
    - "on the dispersions of three network information theory problems"
    - "distributed channel synthesis"
    - "lossy joint source channel coding in the finite blocklength regime"
    - "the dispersion of joint source channel coding"

Connected through hyperedge HE-7 (induced by source paper "a formula for the capacity of the general gel fand pinsker channel"):
  with members:
    - "a technique for deriving one shot achievability results in network information theory"
    - "empirical processes typical sequences and coordinated actions in standard borel spaces"
    - "strong secrecy from channel resolvability"
    - "the gelfand pinsker channel strong converse and upper bound for the reliability function"
    - "duality between channel capacity and rate distortion with two sided state information"
    - "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)