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: "second order slepian wolf coding theorems for non mixed and mixed sources"
  Abstract: The second-order achievable rate region in Slepian-Wolf source coding systems is investigated. The concept of second-order achievable rates, which enables us to make a finer evaluation of achievable rates, has already been introduced and analyzed for general sources in the single-user source coding problem. Analogously, in this paper, we first define the second-order achievable rate region for the Slepian-Wolf coding system to establish the source coding theorem in the second- order sense. The Slepian-Wolf coding problem for correlated sources is one of typical problems in the multi-terminal information theory. In particular, Miyake and Kanaya, and Han have established the first-order source coding theorems for general correlated sources. On the other hand, in general, the second-order achievable rate problem for the Slepian-Wolf coding system with general sources remains still open up to present. In this paper we present the analysis concerning the second- order achievable rates for general sources which are based on the information spectrum methods developed by Han and Verdu. Moreover, we establish the explicit second-order achievable rate region for i.i.d. correlated sources with countably infinite alphabets and mixed correlated sources, respectively, using the relevant asymptotic normality.

Connected through hyperedge HE-1 (induced by source paper "lossless source coding in the point to point multiple access and random access scenarios"):
  with members:
    - "random access channel coding in the finite blocklength regime"
    - "on the calculation of the minimax converse of the channel coding problem"
    - "on the dispersions of three network information theory problems"
    - "variable length compression allowing errors"
    - "random access an information theoretic perspective"
    - "lossy joint source channel coding in the finite blocklength regime"
    - "fixed length lossy compression in the finite blocklength regime"
    - "network coding is zero error always possible"

Connected through hyperedge HE-2 (induced by source paper "fundamental limits of lossless data compression with side information"):
  with members:
    - "lossless source coding in the point to point multiple access and random access scenarios"
    - "improved finite blocklength converses for slepian wolf coding via linear programming"
    - "on the dispersions of three network information theory problems"
    - "reference based genome compression"

Connected through hyperedge HE-3 (induced by source paper "first and second order hypothesis testing for mixed memoryless sources"):
  with members:
    - "second order region for gray wyner network"
    - "first and second order coding theorems for mixed memoryless channels with general mixture"
    - "on the dispersions of three network information theory problems"
    - "second order resolvability intrinsic randomness and fixed length source coding for mixed sources information spectrum approach"
    - "information spectrum approach to second order coding rate in channel coding"

Connected through hyperedge HE-4 (induced by source paper "second order region for gray wyner network"):
  with members:
    - "discrete lossy gray wyner revisited second order asymptotics large and moderate deviations"
    - "interactive communication for data exchange"
    - "second order asymptotics for the gaussian mac with degraded message sets"
    - "strong successive refinability and rate distortion complexity tradeoff"
    - "asymptotic estimates in information theory with non vanishing error probabilities"
    - "information complexity density and simulation of protocols"
    - "strong converse and second order asymptotics of channel resolvability"
    - "channels with cost constraints strong converse and dispersion"

Connected through hyperedge HE-5 (induced by source paper "second order and moderate deviation asymptotics for successive refinement"):
  with members:
    - "second order region for gray wyner network"
    - "second order asymptotics for the gaussian mac with degraded message sets"
    - "strong successive refinability and rate distortion complexity tradeoff"
    - "asymptotic estimates in information theory with non vanishing error probabilities"
    - "second order coding rates for channels with state"
    - "a case where interference does not affect the channel dispersion"
    - "on the dispersions of three network information theory problems"
    - "on the dispersions of the gel fand pinsker channel and dirty paper coding"

Connected through hyperedge HE-6 (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-7 (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"
    - "non asymptotic and second order achievability bounds for coding with side information"

Connected through hyperedge HE-8 (induced by source paper "first and second order coding theorems for mixed memoryless channels with general mixture"):
  with members:
    - "second order coding rates for channels with state"
    - "single letter characterization of epsilon capacity for mixed memoryless channels"
    - "quasi static simo fading channels at finite blocklength"
    - "a tight upper bound for the third order asymptotics for most discrete memoryless channels"
    - "second order resolvability intrinsic randomness and fixed length source coding for mixed sources information spectrum approach"
    - "information spectrum approach to second order coding rate in channel coding"

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)