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: "centralized vs decentralized multi agent guesswork"
  Abstract: We study a notion of guesswork, where multiple agents intend to launch a coordinated brute-force attack to find a single binary secret string, and each agent has access to side information generated through either a BEC or a BSC. The average number of trials required to find the secret string grows exponentially with the length of the string, and the rate of the growth is called the guesswork exponent. We compute the guesswork exponent for several multi-agent attacks. We show that a multi-agent attack reduces the guesswork exponent compared to a single agent, even when the agents do not exchange information to coordinate their attack, and try to individually guess the secret string using a predetermined scheme in a decentralized fashion. Further, we show that the guesswork exponent of two agents who do coordinate their attack is strictly smaller than that of any finite number of agents individually performing decentralized guesswork.

Connected through hyperedge HE-1 (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"
    - "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"
    - "erasure list random coding error exponents are not universally achievable"

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

Connected through hyperedge HE-3 (induced by source paper "why botnets work distributed brute force attacks need no synchronization"):
  with members:
    - "a characterization of guesswork on swiftly tilting curves"
    - "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"
    - "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)