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 "reducing guesswork via an unreliable oracle"):
  Abstract: Alice holds an r.v. $X$, and Bob is trying to guess its value by asking questions of the form "is $X=x$?". Alice answers truthfully and the game terminates once Bob guesses correctly. Before the game begins, Bob is allowed to reach out to an oracle, Carole, and ask her any yes/no question, i.e., a question of the form "is $X\in A$?". Carole is known to lie with a given probability $0\leq p\leq 1/2$. What should Bob ask Carole if he would like to minimize his expected guessing time? When Carole is truthful ($p=0$), it is easy to show that Bob should order the symbol probabilities in descending order, and ask Carole whether the index of $X$ w.r.t. this order is even or odd. We show that this strategy is almost optimal for any lying probability $p$, up to a small additive constant upper bounded by a $1/4$. We discuss a connection to the cutoff rate of the BSC with feedback.

Includes members:
  Member "improved bounds on lossless source coding and guessing moments via r e nyi measures":
    also connected through other hyperedges:
      (none)
  Member "on the listsize capacity with feedback":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the renyi capacity and center")
  Member "investigating the distribution of password choices":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "passlab a password security tool for the blue team")
  Member "guessing revisited a large deviations approach":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "practical estimation of renyi entropy")
  Member "optimal feedback communication via posterior matching":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "feedback channel communication with low precision arithmetic")
  Member "guessing under source uncertainty":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "generalized bayesian cramer rao inequality via information geometry of relative alpha entropy")

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)