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: "guessing revisited a large deviations approach"
  Abstract: The problem of guessing a random string is revisited. A close relation between guessing and compression is first established. Then it is shown that if the sequence of distributions of the information spectrum satisfies the large deviation property with a certain rate function, then the limiting guessing exponent exists and is a scalar multiple of the Legendre-Fenchel dual of the rate function. Other sufficient conditions related to certain continuity properties of the information spectrum are briefly discussed. This approach highlights the importance of the information spectrum in determining the limiting guessing exponent. All known prior results are then re-derived as example applications of our unifying approach.

Connected through hyperedge HE-1 (induced by source paper "practical estimation of renyi entropy"):
  with members:
    - "estimating renyi entropy of discrete distributions"
    - "multiple source adaptation and the renyi divergence"

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"
    - "asymptotics and non asymptotics for universal fixed to variable source coding"

Connected through hyperedge HE-3 (induced by source paper "capacity achieving guessing random additive noise decoding"):
  with members:
    - "multi user guesswork and brute force security"
    - "on the origin of polar coding"
    - "the random coding bound is tight for the average linear code or lattice"
    - "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"
    - "frames in outdoor 802 11 wlans provide a hybrid binary symmetric packet erasure channel"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"

Connected through hyperedge HE-4 (induced by source paper "privacy against brute force inference attacks"):
  with members:
    - "estimation efficiency under privacy constraints"
    - "a tunable measure for information leakage"
    - "privacy utility tradeoffs under constrained data release mechanisms"
    - "multi user guesswork and brute force security"
    - "from the information bottleneck to the privacy funnel"
    - "privacy against statistical inference"

Connected through hyperedge HE-5 (induced by source paper "tight bounds on the r enyi entropy via majorization with applications to guessing and compression"):
  with members:
    - "on the conditional smooth renyi entropy and its applications in guessing and source coding"
    - "maximum entropy interval aggregations"
    - "distributed task encoding"
    - "reducing guesswork via an unreliable oracle"
    - "guessing attacks on distributed storage systems"
    - "bounds on the entropy of a function of a random variable and their applications"
    - "on the renyi divergence joint range of relative entropies and a channel coding theorem"
    - "on the smooth renyi entropy and variable length source coding allowing errors"

Connected through hyperedge HE-6 (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-7 (induced by source paper "guessing with a bit of help"):
  with members:
    - "reducing guesswork via an unreliable oracle"
    - "on the optimal boolean function for prediction under quadratic loss"
    - "password cracking the effect of hash function bias on the average guesswork"
    - "on the entropy of a noisy function"
    - "remarks on the most informative function conjecture at fixed mean"
    - "multi user guesswork and brute force security"
    - "an improved upper bound for the most informative boolean function conjecture"
    - "analysis of boolean functions"

Connected through hyperedge HE-8 (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"
    - "asymptotics and non asymptotics for universal fixed to variable source coding"
    - "guesswork large deviations and shannon entropy"
    - "guessing a password over a wireless channel on the effect of noise non uniformity"

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)