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: "the shannon cipher system with a guessing wiretapper general sources"
  Abstract: The Shannon cipher system is studied in the context of general sources using a notion of computational secrecy introduced by Merhav & Arikan. Bounds are derived on limiting exponents of guessing moments for general sources. The bounds are shown to be tight for iid, Markov, and unifilar sources, thus recovering some known results. A close relationship between error exponents and correct decoding exponents for fixed rate source compression on the one hand and exponents for guessing moments on the other hand is established.

Connected through hyperedge HE-1 (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-2 (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-3 (induced by source paper "guessing attacks on distributed storage systems"):
  with members:
    - "distributed task encoding"
    - "distributed storage for data security"
    - "on the listsize capacity with feedback"
    - "encoding tasks and renyi entropy"
    - "guesswork large deviations and shannon entropy"
    - "guessing revisited a large deviations approach"
    - "mds codes on the erasure erasure wiretap channel"
    - "guessing under source uncertainty"

Connected through hyperedge HE-4 (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"
    - "guessing revisited a large deviations approach"
    - "guessing based on length functions"

Connected through hyperedge HE-5 (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"
    - "guessing revisited a large deviations approach"
    - "guessing based on length functions"

Connected through hyperedge HE-6 (induced by source paper "correlated source coded sequences with compromised channel and source symbols using shannon s cipher system"):
  with members:
    - "secure transmission of sources over noisy channels with side information at the receivers"
    - "secure multiterminal source coding with side information at the eavesdropper"
    - "imperfect secrecy in wiretap channel ii"
    - "shannon s secrecy system with informed receivers and its application to systematic coding for wiretapped channels"

Connected through hyperedge HE-7 (induced by source paper "information leakage of correlated source coded sequences over channel with an eavesdropper"):
  with members:
    - "secure transmission of sources over noisy channels with side information at the receivers"
    - "secure multiterminal source coding with side information at the eavesdropper"

Connected through hyperedge HE-8 (induced by source paper "how many queries will resolve common randomness"):
  with members:
    - "entropy and set cardinality inequalities for partition determined functions"
    - "information inequalities for joint distributions with interpretations and applications"
    - "generalized entropy power inequalities and monotonicity properties of information"

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)