human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "secure channel simulation"
  Abstract: In this paper the Output Statistics of Random Binning (OSRB) framework is used to prove a new inner bound for the problem of secure channel simulation. Our results subsume some recent results on the secure function computation. We also provide an achievability result for the problem of simultaneously simulating a channel and creating a shared secret key. A special case of this result generalizes the lower bound of Gohari and Anantharam on the source model to include constraints on the rates of the public discussion.

Connected through hyperedge HE-1 (induced by source paper "interactive secure function computation"):
  with members:
    - "robust privacy utility tradeoffs under differential privacy and hamming distortion"
    - "communication rounds tradeoffs for common randomness and secret key generation"
    - "secret key agreement under discussion rate constraints"
    - "communication and randomness lower bounds for secure computation"
    - "on the public communication needed to achieve sk capacity in the multiterminal source model"
    - "information complexity density and simulation of protocols"
    - "secure multiterminal source coding with side information at the eavesdropper"
    - "distributed channel synthesis"

Connected through hyperedge HE-2 (induced by source paper "common randomness and key generation with limited interaction"):
  with members:
    - "the likelihood encoder for lossy compression"
    - "asymptotic estimates in information theory with non vanishing error probabilities"
    - "secret key generation with one communicator and a one shot converse via hypercontractivity"
    - "a note on the strong data processing inequalities in bayesian networks"
    - "converses for secret key agreement and secure computing"
    - "secret key agreement general capacity and second order asymptotics"
    - "key capacity for product sources with application to stationary gaussian processes"
    - "outer bounds for multiterminal source coding via a strong data processing inequality"

Connected through hyperedge HE-3 (induced by source paper "secret key generation with limited interaction"):
  with members:
    - "strong data processing inequalities for channels and bayesian networks"
    - "the likelihood encoder for lossy compression"
    - "e_ gamma resolvability"
    - "secret key generation with one communicator and a one shot converse via hypercontractivity"
    - "converses for secret key agreement and secure computing"
    - "secret key agreement general capacity and second order asymptotics"
    - "key capacity for product sources with application to stationary gaussian processes"
    - "outer bounds for multiterminal source coding via a strong data processing inequality"

Connected through hyperedge HE-4 (induced by source paper "secure cascade channel synthesis"):
  with members:
    - "strong coordination over multi hop line networks"
    - "secrecy in cascade networks"
    - "the likelihood encoder for lossy source compression"
    - "strong coordination over a line network"
    - "distributed channel synthesis"
    - "rate distortion theory for secrecy systems"
    - "achievability proof via output statistics of random binning"
    - "channel simulation via interactive communications"

Connected through hyperedge HE-5 (induced by source paper "channel simulation via interactive communications"):
  with members:
    - "secure cascade channel synthesis"
    - "when is it possible to simulate a dmc channel from another"
    - "distributed channel synthesis"
    - "achievability proof via output statistics of random binning"
    - "coordination via a relay"
    - "generating dependent random variables over networks"
    - "communication requirements for generating correlated random variables"

Question: Please tell me which class the center node 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)