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 dispersion of lossy source coding"
  Abstract: In this work we investigate the behavior of the minimal rate needed in order to guarantee a given probability that the distortion exceeds a prescribed threshold, at some fixed finite quantization block length. We show that the excess coding rate above the rate-distortion function is inversely proportional (to the first order) to the square root of the block length. We give an explicit expression for the proportion constant, which is given by the inverse Q-function of the allowed excess distortion probability, times the square root of a constant, termed the excess distortion dispersion. This result is the dual of a corresponding channel coding result, where the dispersion above is the dual of the channel dispersion. The work treats discrete memoryless sources, as well as the quadratic-Gaussian case.

Connected through hyperedge HE-1 (induced by source paper "sparse regression codes"):
  with members:
    - "the error probability of sparse superposition codes with approximate message passing decoding"
    - "sparcs for unsourced random access"
    - "spatially coupled sparse regression codes design and state evolution analysis"
    - "techniques for improving the finite length performance of sparse superposition codes"
    - "approximate message passing decoder and capacity achieving sparse superposition codes"
    - "capacity achieving sparse superposition codes via approximate message passing decoding"
    - "the rate distortion function and excess distortion exponent of sparse regression codes with optimal encoding"
    - "universal sparse superposition codes with spatial coupling and gamp decoding"

Connected through hyperedge HE-2 (induced by source paper "from parameter estimation to dispersion of nonstationary gauss markov processes"):
  with members:
    - "the dispersion of the gauss markov source"
    - "non asymptotic identification of lti systems from a single trajectory"
    - "near optimal finite time identification of arbitrary linear dynamical systems"
    - "learning without mixing towards a sharp analysis of linear system identification"
    - "finite time identification in unstable linear systems"
    - "fixed length lossy compression in the finite blocklength regime"
    - "a note on rate distortion functions for nonstationary gaussian autoregressive processes"

Connected through hyperedge HE-3 (induced by source paper "the dispersion of the gauss markov source"):
  with members:
    - "second order region for gray wyner network"
    - "on the dispersions of three network information theory problems"
    - "lossy joint source channel coding in the finite blocklength regime"
    - "fixed length lossy compression in the finite blocklength regime"
    - "the dispersion of joint source channel coding"
    - "a note on rate distortion functions for nonstationary gaussian autoregressive processes"

Connected through hyperedge HE-4 (induced by source paper "new converse bounds for discrete memoryless channels in the finite blocklength regime"):
  with members:
    - "lossy joint source channel coding in the finite blocklength regime"
    - "fixed length lossy compression in the finite blocklength regime"
    - "the dispersion of joint source channel coding"
    - "information spectrum approach to second order coding rate in channel coding"

Connected through hyperedge HE-5 (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-6 (induced by source paper "discrete lossy gray wyner revisited second order asymptotics large and moderate deviations"):
  with members:
    - "second order region for gray wyner network"
    - "strong successive refinability and rate distortion complexity tradeoff"
    - "asymptotic estimates in information theory with non vanishing error probabilities"
    - "second order coding region for the discrete lossy gray wyner source coding problem"
    - "the lossy common information of correlated sources"
    - "second order coding rates for channels with state"
    - "a technique for deriving one shot achievability results in network information theory"
    - "refinement of the random coding bound"

Connected through hyperedge HE-7 (induced by source paper "non asymptotic converse bounds and refined asymptotics for two lossy source coding problems"):
  with members:
    - "second order region for gray wyner network"
    - "discrete lossy gray wyner revisited second order asymptotics large and moderate deviations"
    - "asymptotic estimates in information theory with non vanishing error probabilities"
    - "second order coding rates for channels with state"
    - "second order coding rates for conditional rate distortion"
    - "a technique for deriving one shot achievability results in network information theory"
    - "moderate deviations in channel coding"
    - "moderate deviations of lossy source coding for discrete and gaussian sources"

Connected through hyperedge HE-8 (induced by source paper "refined asymptotics for rate distortion using gaussian codebooks for arbitrary sources"):
  with members:
    - "the dispersion of nearest neighbor decoding for additive non gaussian channels"
    - "moderate deviations in channel coding"
    - "fixed length lossy compression in the finite blocklength regime"
    - "moderate deviations of lossy source coding for discrete and gaussian sources"
    - "second order asymptotics in fixed length source coding and intrinsic randomness"

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)