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 "dictator functions maximize mutual information"):
  Abstract: Let $(\mathbf X, \mathbf Y)$ denote $n$ independent, identically distributed copies of two arbitrarily correlated Rademacher random variables $(X, Y)$. We prove that the inequality $I(f(\mathbf X); g(\mathbf Y)) \le I(X; Y)$ holds for any two Boolean functions: $f,g \colon \{-1,1\}^n \to \{-1,1\}$ ($I(\cdot; \cdot)$ denotes mutual information). We further show that equality in general is achieved only by the dictator functions $f(\mathbf x)=\pm g(\mathbf x)=\pm x_i$, $i \in \{1,2,\dots,n\}$.

Includes members:
  Member "remarks on the most informative function conjecture at fixed mean":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "guessing with a bit of help")
  Member "an improved upper bound for the most informative boolean function conjecture":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "guessing with a bit of help")
  Member "which boolean functions are most informative":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on universal features for high dimensional learning and inference")
  Member "canalizing boolean functions maximize the mutual information":
    also connected through other hyperedges:
      (none)

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)