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: "key capacity with limited one way communication for product sources"
  Abstract: We show that for product sources, rate splitting is optimal for secret key agreement using limited one-way communication at two terminals. This yields an alternative proof of the tensorization property of a strong data processing inequality originally studied by Erkip and Cover and amended recently by Anantharam et al. We derive a `water-filling' solution of the communication-rate--key-rate tradeoff for two arbitrarily correlated vector Gaussian sources, for the case with an eavesdropper, and for stationary Gaussian processes.

Connected through hyperedge HE-1 (induced by source paper "accuracy memory tradeoffs and phase transitions in belief propagation"):
  with members:
    - "the circuit complexity of inference"
    - "communication complexity of estimating correlations"
    - "geometric lower bounds for distributed parameter estimation under communication constraints"
    - "reducibility and computational lower bounds for problems with planted sparse structure"
    - "inference under information constraints i lower bounds from chi square contraction"
    - "extractor based time space lower bounds for learning"
    - "secret key generation with limited interaction"
    - "fast learning requires good memory a time space lower bound for parity learning"

Connected through hyperedge HE-2 (induced by source paper "e_ gamma resolvability"):
  with members:
    - "f divergence inequalities"
    - "the likelihood encoder for lossy compression"
    - "soft covering with high probability"
    - "bounds among f divergences"
    - "semantic security capacity for wiretap channels of type ii"
    - "one shot mutual covering lemma and marton s inner bound with a common message"
    - "resolvability in e γ with applications to lossy compression and wiretap channels"
    - "robustness of sparse recovery via f minimization a topological viewpoint"

Connected through hyperedge HE-3 (induced by source paper "full duplex vs half duplex secret key generation"):
  with members:
    - "the sender excited secret key agreement model capacity reliability and secrecy exponents"
    - "design and characterization of a full duplex multiantenna system for wifi networks"
    - "full duplex transceiver system calculations analysis of adc and linearity challenges"
    - "rate gain region and design tradeoffs for full duplex wireless communications"
    - "multiaccess channel with partially cooperating encoders and security constraints"
    - "separation of reliability and secrecy in rate limited secret key generation"
    - "exploiting channel diversity in secret key generation from multipath fading randomness"
    - "secret key agreement from correlated gaussian sources by rate limited public communication"

Connected through hyperedge HE-4 (induced by source paper "on the duality of additivity and tensorization"):
  with members:
    - "on non interactive simulation of joint distributions"
    - "an exploration of the role of principal inertia components in information theory"
    - "key capacity for product sources with application to stationary gaussian processes"
    - "on maximal correlation hypercontractivity and the data processing inequality studied by erkip and cover"
    - "evaluation of marton s inner bound for the general broadcast channel"
    - "a new data processing inequality and its applications in distributed source and channel coding"
    - "evaluation of marton s inner bound for the general broadcast channel"

Connected through hyperedge HE-5 (induced by source paper "key capacity for product sources with application to stationary gaussian processes"):
  with members:
    - "the likelihood encoder for lossy compression"
    - "secret key generation with one communicator and a one shot converse via hypercontractivity"
    - "on the duality of additivity and tensorization"
    - "outer bounds for multiterminal source coding via a strong data processing inequality"
    - "distributed channel synthesis"
    - "on maximal correlation hypercontractivity and the data processing inequality studied by erkip and cover"
    - "separation of reliability and secrecy in rate limited secret key generation"
    - "the rate distortion function for product of two sources with side information at decoders"

Connected through hyperedge HE-6 (induced by source paper "polynomial complexity of polar codes for non binary alphabets key agreement and slepian wolf coding"):
  with members:
    - "polar coding for secret key generation"
    - "polar codes for the two user multiple access channel"
    - "on the construction of polar codes"
    - "how to construct polar codes"
    - "polar coding for secure transmission and key agreement"
    - "an entropy inequality for q ary random variables and its application to channel polarization"
    - "polar codes for the m user mac"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"

Connected through hyperedge HE-7 (induced by source paper "strong data processing inequalities and phi sobolev inequalities for discrete channels"):
  with members:
    - "strong data processing inequalities for channels and bayesian networks"
    - "bounds between contraction coefficients"
    - "bounds among f divergences"
    - "dissipation of information in channels with input constraints"
    - "tractable inference for complex stochastic processes"
    - "outer bounds for multiterminal source coding via a strong data processing inequality"
    - "on maximal correlation hypercontractivity and the data processing inequality studied by erkip and cover"

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)