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 with a bit of help"):
  Abstract: What is the value of a single bit to a guesser? We study this problem in a setup where Alice wishes to guess an i.i.d. random vector, and can procure one bit of information from Bob, who observes this vector through a memoryless channel. We are interested in the guessing efficiency, which we define as the best possible multiplicative reduction in Alice's guessing-moments obtainable by observing Bob's bit. For the case of a uniform binary vector observed through a binary symmetric channel, we provide two lower bounds on the guessing efficiency by analyzing the performance of the Dictator and Majority functions, and two upper bounds via maximum entropy and Fourier-analytic / hypercontractivity arguments. We then extend our maximum entropy argument to give a lower bound on the guessing efficiency for a general channel with a binary uniform input, via the strong data-processing inequality constant of the reverse channel. We compute this bound for the binary erasure channel, and conjecture that Greedy Dictator functions achieve the guessing efficiency.

Includes members:
  Member "reducing guesswork via an unreliable oracle":
    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 "on the optimal boolean function for prediction under quadratic loss":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "boolean functions with biased inputs approximation and noise sensitivity")
  Member "password cracking the effect of hash function bias on the average guesswork":
    also connected through other hyperedges:
      (none)
  Member "on the entropy of a noisy function":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the most informative boolean functions of the very noisy channel")
  Member "remarks on the most informative function conjecture at fixed mean":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "principal inertia components and applications")
  Member "multi user guesswork and brute force security":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "mismatched guesswork")
  Member "an improved upper bound for the most informative boolean function conjecture":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the most informative boolean functions of the very noisy channel")
  Member "analysis of boolean functions":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "coarse grained complexity for dynamic algorithms")

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)