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 based on length functions"
  Abstract: Close relationships between guessing functions and length functions are established. Good length functions lead to good guessing functions. In particular, guessing in the increasing order of Lempel-Ziv lengths has certain universality properties for finite-state sources. As an application, these results show that hiding the parameters of the key-stream generating source in a private key crypto-system may not enhance the privacy of the system, the privacy level being measured by the difficulty in brute-force guessing of the key stream.

Connected through hyperedge HE-1 (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"
    - "guessing revisited a large deviations approach"

Connected through hyperedge HE-2 (induced by source paper "guessing random additive noise decoding with symbol reliability information srgrand"):
  with members:
    - "capacity achieving guessing random additive noise decoding"
    - "a characterization of guesswork on swiftly tilting curves"
    - "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"
    - "guessing a password over a wireless channel on the effect of noise non uniformity"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "iterative algebraic soft decision list decoding of reed solomon codes"

Connected through hyperedge HE-3 (induced by source paper "guessing random additive noise decoding with soft detection symbol reliability information sgrand"):
  with members:
    - "capacity achieving guessing random additive noise decoding"
    - "a characterization of guesswork on swiftly tilting curves"
    - "on the origin of polar coding"
    - "guesswork large deviations and shannon entropy"
    - "guessing a password over a wireless channel on the effect of noise non uniformity"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "iterative algebraic soft decision list decoding of reed solomon codes"

Connected through hyperedge HE-4 (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-5 (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-6 (induced by source paper "multi user guesswork and brute force security"):
  with members:
    - "encoding tasks and renyi entropy"
    - "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"
    - "investigating the distribution of password choices"
    - "lists that are smaller than their parts a coding approach to tunable secrecy"
    - "the shannon cipher system with a guessing wiretapper general sources"
    - "guessing revisited a large deviations approach"

Connected through hyperedge HE-7 (induced by source paper "quantifying the computational security of multi user systems"):
  with members:
    - "encoding tasks and renyi entropy"
    - "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"
    - "investigating the distribution of password choices"
    - "lists that are smaller than their parts a coding approach to tunable secrecy"
    - "the shannon cipher system with a guessing wiretapper general sources"
    - "guessing revisited a large deviations approach"

Connected through hyperedge HE-8 (induced by source paper "guesswork large deviations and shannon entropy"):
  with members:
    - "investigating the distribution of password choices"
    - "lists that are smaller than their parts a coding approach to tunable secrecy"
    - "guessing revisited a large deviations approach"

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)