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: "asymptotics and non asymptotics for universal fixed to variable source coding"
  Abstract: Universal fixed-to-variable lossless source coding for memoryless sources is studied in the finite blocklength and higher-order asymptotics regimes. Optimal third-order coding rates are derived for general fixed-to-variable codes and for prefix codes. It is shown that the non-prefix Type Size code, in which codeword lengths are chosen in ascending order of type class size, achieves the optimal third-order rate and outperforms classical Two-Stage codes. Converse results are proved making use of a result on the distribution of the empirical entropy and Laplace's approximation. Finally, the fixed-to-variable coding problem without a prefix constraint is shown to be essentially the same as the universal guessing problem.

Connected through hyperedge HE-1 (induced by source paper "finite sample analysis of image registration"):
  with members:
    - "estimators for multivariate information measures in general probability spaces"
    - "end to end unsupervised deformable image registration with a convolutional neural network"
    - "a deep metric for multimodal registration"
    - "fundamental limits in multi image alignment"
    - "demystifying fixed k nearest neighbor information estimators"
    - "asymptotic estimates in information theory with non vanishing error probabilities"
    - "channels with cost constraints strong converse and dispersion"
    - "a tight upper bound for the third order asymptotics for most discrete memoryless channels"

Connected through hyperedge HE-2 (induced by source paper "mismatched guesswork"):
  with members:
    - "universal randomized guessing with application to asynchronous decentralized brute force attacks"
    - "why botnets work distributed brute force attacks need no synchronization"
    - "a characterization of guesswork on swiftly tilting curves"
    - "centralized vs decentralized multi agent guesswork"
    - "guesswork subject to a total entropy budget"
    - "multi user guesswork and brute force security"
    - "list decoding random coding exponents and expurgated exponents"
    - "erasure list random coding error exponents are not universally achievable"

Connected through hyperedge HE-3 (induced by source paper "second and third order asymptotics of the continuous time poisson channel"):
  with members:
    - "the stochastic calculus approach to multi receiver poisson channels"
    - "fine asymptotics for universal one to one compression of parametric sources"
    - "asymptotic estimates in information theory with non vanishing error probabilities"
    - "channels with cost constraints strong converse and dispersion"
    - "a tight upper bound for the third order asymptotics for most discrete memoryless channels"
    - "the log volume of optimal codes for memoryless channels asymptotically within a few nats"
    - "information spectrum approach to second order coding rate in channel coding"

Connected through hyperedge HE-4 (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"
    - "an information spectrum approach to weak variable length source coding with side information"
    - "variable length compression allowing errors"
    - "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-5 (induced by source paper "universal compression with side information from a correlated source"):
  with members:
    - "a characterization of guesswork on swiftly tilting curves"
    - "packet level network compression realization and scaling of the network wide benefits"
    - "results on the fundamental gain of memory assisted universal source coding"
    - "results on the redundancy of universal compression for finite length sequences"

Connected through hyperedge HE-6 (induced by source paper "universal randomized guessing with application to asynchronous decentralized brute force attacks"):
  with members:
    - "why botnets work distributed brute force attacks need no synchronization"
    - "centralized vs decentralized multi agent guesswork"
    - "guesswork subject to a total entropy budget"
    - "guessing attacks on distributed storage systems"
    - "multi user guesswork and brute force security"
    - "guesswork large deviations and shannon entropy"
    - "guessing a password over a wireless channel on the effect of noise non uniformity"
    - "investigating the distribution of password choices"

Connected through hyperedge HE-7 (induced by source paper "why botnets work distributed brute force attacks need no synchronization"):
  with members:
    - "a characterization of guesswork on swiftly tilting curves"
    - "centralized vs decentralized multi agent guesswork"
    - "guesswork subject to a total entropy budget"
    - "guessing attacks on distributed storage systems"
    - "multi user guesswork and brute force security"
    - "guesswork large deviations and shannon entropy"
    - "guessing a password over a wireless channel on the effect of noise non uniformity"
    - "guessing revisited a large deviations approach"

Connected through hyperedge HE-8 (induced by source paper "a characterization of guesswork on swiftly tilting curves"):
  with members:
    - "multi user guesswork and brute force security"
    - "list decoding random coding exponents and expurgated exponents"
    - "guesswork large deviations and shannon entropy"
    - "brute force searching the typical set and guesswork"
    - "guessing a password over a wireless channel on the effect of noise non uniformity"
    - "guessing revisited a large deviations approach"
    - "guessing under source uncertainty"

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)