human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "guessing attacks on distributed storage systems"):
  Abstract: The secrecy of a distributed-storage system for passwords is studied. The encoder, Alice, observes a length-n password and describes it using two hints, which she stores in different locations. The legitimate receiver, Bob, observes both hints. In one scenario the requirement is that the expected number of guesses it takes Bob to guess the password approach one as n tends to infinity, and in the other that the expected size of the shortest list that Bob must form to guarantee that it contain the password approach one. The eavesdropper, Eve, sees only one of the hints. Assuming that Alice cannot control which hints Eve observes, the largest normalized (by n) exponent that can be guaranteed for the expected number of guesses it takes Eve to guess the password is characterized for each scenario. Key to the proof are new results on Arikan's guessing and Bunte and Lapidoth's task-encoding problem; in particular, the paper establishes a close relation between the two problems. A rate-distortion version of the model is also discussed, as is a generalization that allows for Alice to produce {\delta} (not necessarily two) hints, for Bob to observe {\nu} (not necessarily two) of the hints, and for Eve to observe {\eta} (not necessarily one) of the hints. The generalized model is robust against {\delta} - {\nu} disk failures.

Includes members:
  Member "distributed task encoding":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "tight bounds on the r enyi entropy via majorization with applications to guessing and compression")
  Member "distributed storage for data security":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "distributed task encoding")
  Member "on the listsize capacity with feedback":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the renyi capacity and center")
  Member "encoding tasks and renyi entropy":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "asymptotic expansions of smooth r e nyi entropies and their applications")
  Member "guesswork large deviations and shannon entropy":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "mismatched guesswork")
  Member "the shannon cipher system with a guessing wiretapper general sources":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "tight bounds on the r enyi entropy via majorization with applications to guessing and compression")
  Member "guessing revisited a large deviations approach":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "practical estimation of renyi entropy")
  Member "mds codes on the erasure erasure wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "the storage versus repair bandwidth trade off for clustered storage systems")

Question: Please tell me which class the source paper 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)