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 "bounds on the average distance and distance enumerator with applications to non interactive simulation"):
  Abstract: We leverage proof techniques in coding theory and Fourier analysis to derive new bounds for the problem of non-interactive simulation of random variables. Previous bounds in the literature were derived by applying data processing inequalities concerning maximal correlation or hypercontractivity. We show that our bounds are sharp in some regimes, and are also tighter than the existing ones in some other regimes. As by-products of our analyses, various new properties of the average distance and distance enumerator of binary block codes are established. Finally, by using an existing hypercontractivity bound for non-interactive simulation, a new bound on the average distance is derived.

Includes members:
  Member "second order converses via reverse hypercontractivity":
    also connected through other hyperedges:
      (none)
  Member "dictator functions maximize mutual information":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the sub optimality of single letter coding over networks")
  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 "strong data processing inequalities and phi sobolev inequalities for discrete channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on data processing and majorization inequalities for f divergences with applications")
  Member "lower bounds on the minimum average distance of binary codes":
    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)