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: "variable length compression allowing errors"
  Abstract: This paper studies the fundamental limits of the minimum average length of lossless and lossy variable-length compression, allowing a nonzero error probability $\epsilon$, for lossless compression. We give non-asymptotic bounds on the minimum average length in terms of Erokhin's rate-distortion function and we use those bounds to obtain a Gaussian approximation on the speed of approach to the limit which is quite accurate for all but small blocklengths: $$(1 - \epsilon) k H(\mathsf S) - \sqrt{\frac{k V(\mathsf S)}{2 \pi} } e^{- \frac {(Q^{-1}(\epsilon))^2} 2 }$$ where $Q^{-1}(\cdot)$ is the functional inverse of the standard Gaussian complementary cdf, and $V(\mathsf S)$ is the source dispersion. A nonzero error probability thus not only reduces the asymptotically achievable rate by a factor of $1 - \epsilon$, but this asymptotic limit is approached from below, i.e. larger source dispersions and shorter blocklengths are beneficial. Variable-length lossy compression under an excess distortion constraint is shown to exhibit similar properties.

Connected through hyperedge HE-1 (induced by source paper "asymptotic expansions of smooth r e nyi entropies and their applications"):
  with members:
    - "variable length source dispersions differ under maximum and average error criteria"
    - "a unified framework for problems on guessing source coding and task partitioning"
    - "on the conditional smooth renyi entropy and its applications in guessing and source coding"
    - "asymptotic estimates in information theory with non vanishing error probabilities"
    - "on the smooth renyi entropy and variable length source coding allowing errors"
    - "encoding tasks and renyi entropy"

Connected through hyperedge HE-2 (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"
    - "random access an information theoretic perspective"
    - "lossy joint source channel coding in the finite blocklength regime"
    - "second order slepian wolf coding theorems for non mixed and mixed sources"
    - "fixed length lossy compression in the finite blocklength regime"
    - "network coding is zero error always possible"

Connected through hyperedge HE-3 (induced by source paper "variable length source dispersions differ under maximum and average error criteria"):
  with members:
    - "on the conditional smooth renyi entropy and its applications in guessing and source coding"
    - "asymptotics and non asymptotics for universal fixed to variable source coding"
    - "an information spectrum approach to weak variable length source coding with side information"
    - "information spectrum approach to second order coding rate in channel coding"
    - "duality between channel capacity and rate distortion with two sided state information"
    - "second order asymptotics in fixed length source coding and intrinsic randomness"

Connected through hyperedge HE-4 (induced by source paper "improved bounds on lossless source coding and guessing moments via r e nyi measures"):
  with members:
    - "distributed task encoding"
    - "reducing guesswork via an unreliable oracle"
    - "guessing attacks on distributed storage systems"
    - "sharp bounds on arimoto s conditional r e nyi entropies between two distinct orders"
    - "on empirical cumulant generating functions of code lengths for individual sequences"
    - "f divergence inequalities"
    - "on the smooth renyi entropy and variable length source coding allowing errors"
    - "encoding tasks and renyi entropy"

Connected through hyperedge HE-5 (induced by source paper "on the conditional smooth renyi entropy and its applications in guessing and source coding"):
  with members:
    - "non asymptotic fundamental limits of guessing subject to distortion"
    - "a characterization of guesswork on swiftly tilting curves"
    - "non asymptotic and asymptotic fundamental limits of guessing subject to distortion"
    - "multi user guesswork and brute force security"
    - "on the smooth renyi entropy and variable length source coding allowing errors"
    - "variable length compression allowing errors extended"
    - "guesswork large deviations and shannon entropy"
    - "guessing revisited a large deviations approach"

Connected through hyperedge HE-6 (induced by source paper "cumulant generating function of codeword lengths in variable length lossy compression allowing positive excess distortion probability"):
  with members:
    - "variable length lossy compression allowing positive overflow and excess distortion probabilities"
    - "on the smooth renyi entropy and variable length source coding allowing errors"
    - "fixed length lossy compression in the finite blocklength regime"

Connected through hyperedge HE-7 (induced by source paper "optimum overflow thresholds in variable length source coding allowing non vanishing error probability"):
  with members:
    - "variable length coding with cost allowing non vanishing error probability"
    - "second order asymptotics in fixed length source coding and intrinsic randomness"

Connected through hyperedge HE-8 (induced by source paper "variable length resolvability for mixed sources and its application to variable length source coding"):
  with members:
    - "variable length resolvability for general sources and channels"
    - "variable length coding with cost allowing non vanishing error probability"

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)