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 "on the entropy of a noisy function"):
  Abstract: Let $0   0$. Namely, if $X$ is uniformly distributed in $\{0,1\}^n$ and $Y$ is obtained by flipping each coordinate of $X$ independently with probability $\epsilon$, then, provided $\epsilon \ge 1/2 - \delta$, for any boolean function $f$ holds $I\Big(f(X);Y\Big) \le 1 - H(\epsilon)$.

Includes members:
  Member "strong data processing inequalities for channels and bayesian networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "intelligence physics and information the tradeoff between accuracy and simplicity in machine learning")
  Member "novel lower bounds on the entropy rate of binary hidden markov processes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "computable lower bounds for capacities of input driven finite state channels")
  Member "an improved upper bound for the most informative boolean function conjecture":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "guessing with a bit of help")
  Member "dissipation of information in channels with input constraints":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "broadcasting on random directed acyclic graphs")
  Member "analysis of boolean functions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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)