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 a password over a wireless channel on the effect of noise non uniformity"
  Abstract: A string is sent over a noisy channel that erases some of its characters. Knowing the statistical properties of the string's source and which characters were erased, a listener that is equipped with an ability to test the veracity of a string, one string at a time, wishes to fill in the missing pieces. Here we characterize the influence of the stochastic properties of both the string's source and the noise on the channel on the distribution of the number of attempts required to identify the string, its guesswork. In particular, we establish that the average noise on the channel is not a determining factor for the average guesswork and illustrate simple settings where one recipient with, on average, a better channel than another recipient, has higher average guesswork. These results stand in contrast to those for the capacity of wiretap channels and suggest the use of techniques such as friendly jamming with pseudo-random sequences to exploit this guesswork behavior.

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"
    - "frames in outdoor 802 11 wlans provide a hybrid binary symmetric packet erasure channel"
    - "guessing revisited a large deviations approach"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"

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"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "guessing based on length functions"
    - "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"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "guessing based on length functions"
    - "iterative algebraic soft decision list decoding of reed solomon codes"

Connected through hyperedge HE-4 (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"
    - "investigating the distribution of password choices"

Connected through hyperedge HE-5 (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"
    - "asymptotics and non asymptotics for universal fixed to variable source coding"
    - "guesswork large deviations and shannon entropy"
    - "guessing revisited a large deviations approach"

Connected through hyperedge HE-6 (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"
    - "asymptotics and non asymptotics for universal fixed to variable source coding"
    - "guesswork large deviations and shannon entropy"
    - "brute force searching the typical set and guesswork"
    - "guessing revisited a large deviations approach"
    - "guessing under source uncertainty"

Connected through hyperedge HE-7 (induced by source paper "centralized vs decentralized multi agent guesswork"):
  with members:
    - "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"
    - "guesswork large deviations and shannon entropy"
    - "brute force searching the typical set and guesswork"
    - "guessing under source uncertainty"

Connected through hyperedge HE-8 (induced by source paper "password cracking the effect of hash function bias on the average guesswork"):
  with members:
    - "reducing guesswork via an unreliable oracle"
    - "design and analysis of stability guaranteed pufs"
    - "multi user guesswork and brute force security"
    - "the henchman problem measuring secrecy by the minimum distortion in a list"
    - "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)