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 sub optimality of single letter coding over networks"):
  Abstract: In this paper, we establish a new bound tying together the effective length and the maximum correlation between the outputs of an arbitrary pair of Boolean functions which operate on two sequences of correlated random variables. We derive a new upper bound on the correlation between the outputs of these functions. The upper bound may find applications in problems in many areas which deal with common information. We build upon Witsenhausen's result on maximum correlation. The present upper bound takes into account the effective length of the Boolean functions in characterizing the correlation. #R##N#We use the new bound to characterize the communication-cooperation tradeoff in multi-terminal communications. We investigate binary block-codes (BBC). A BBC is defined as a vector of Boolean functions. We consider an ensemble of BBCs which is randomly generated using single-letter distributions. We characterize the vector of dependency spectrums of these BBCs. We use this vector to bound the correlation between the outputs of two distributed BBCs. Finally, the upper bound is used to show that the large blocklength single-letter coding schemes studied in the literature are sub-optimal in various multi-terminal communication settings.

Includes members:
  Member "dictator functions maximize mutual information":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "bounds on the average distance and distance enumerator with applications to non interactive simulation")
  Member "on non interactive simulation of joint distributions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "communication for generating correlation a unifying survey")
  Member "analysis of boolean functions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "coarse grained complexity for dynamic algorithms")
  Member "lossy joint source channel coding in the finite blocklength regime":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "finite sample analysis of image registration")
  Member "a new data processing inequality and its applications in distributed source and channel coding":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "estimation efficiency under privacy constraints")
  Member "on extracting common random bits from correlated sources":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "communication for generating correlation a unifying survey")
  Member "robust distributed source coding":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "generalized gaussian multiterminal source coding in the high resolution regime")

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)