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 "secure cascade channel synthesis"):
  Abstract: We consider the problem of generating correlated random variables in a distributed fashion, where communication is constrained to a cascade network. The first node in the cascade observes an i.i.d. sequence $X^n$ locally before initiating communication along the cascade. All nodes share bits of common randomness that are independent of $X^n$. We consider secure synthesis - random variables produced by the system appear to be appropriately correlated and i.i.d. even to an eavesdropper who is cognizant of the communication transmissions. We characterize the optimal tradeoff between the amount of common randomness used and the required rates of communication. We find that not only does common randomness help, its usage exceeds the communication rate requirements. The most efficient scheme is based on a superposition codebook, with the first node selecting messages for all downstream nodes. We also provide a fleeting view of related problems, demonstrating how the optimal rate region may shrink or expand.

Includes members:
  Member "strong coordination over multi hop line networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "optimal communication rates and combinatorial properties for distributed simulation")
  Member "secrecy in cascade networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the likelihood encoder for source coding")
  Member "the likelihood encoder for lossy source compression":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the likelihood encoder for lossy compression")
  Member "strong coordination over a line network":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "coordination through shared randomness")
  Member "distributed channel synthesis":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "gaussian approximation of quantization error for estimation from compressed data")
  Member "rate distortion theory for secrecy systems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "privacy aware distributed hypothesis testing")
  Member "achievability proof via output statistics of random binning":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "biometric and physical identifiers with correlated noise for controllable private authentication")
  Member "secure channel simulation":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "interactive secure function computation")

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)