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 "optimal communication rates for zero error distributed simulation under blackboard communication protocols"):
  Abstract: We study the distributed simulation problem where $n$ users aim to generate \emph{same} sequences of random coin flips. Some subsets of the users share an independent common coin which can be tossed multiple times, and there is a publicly seen blackboard through which the users communicate with each other. We show that when each coin is shared among subsets of size $k$, the communication rate (i.e., number of bits on blackboard per bit in generated sequence) is at least $\frac{n-k}{n-1}$. Moreover, if the size-$k$ subsets with common coins contain a path-connected cluster of topologically connected components, we propose a communication scheme which achieves the optimal rate $\frac{n-k}{n-1}$. #R##N#Some key steps in analyzing the upper bounds rely on two different definitions of connectivity in hypergraphs, which may be of independent interest.

Includes members:
  Member "domain compression and its application to randomness optimal distributed goodness of fit":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "optimal communication rates and combinatorial properties for distributed simulation")
  Member "coordination using individually shared randomness":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "optimal communication rates and combinatorial properties for distributed simulation")
  Member "distributed simulation and distributed inference":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "communication complexity in locally private distribution estimation and heavy hitters")
  Member "inference under information constraints i lower bounds from chi square contraction":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "locally private hypothesis selection")
  Member "on the public communication needed to achieve sk capacity in the multiterminal source model":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "communication for generating correlation a unifying survey")
  Member "communication lower bounds for statistical estimation problems via a distributed data processing inequality":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "locally private hypothesis selection")
  Member "strong coordination over multi hop line networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "optimal communication rates and combinatorial properties for distributed simulation")
  Member "strong coordination over a line network":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "coordination through shared randomness")

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)