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 source coding with a public helper"
  Abstract: We consider secure multi-terminal source coding problems in the presence of a public helper. Two main scenarios are studied: 1) source coding with a helper where the coded side information from the helper is eavesdropped by an external eavesdropper; 2) triangular source coding with a helper where the helper is considered as a public terminal. We are interested in how the helper can support the source transmission subject to a constraint on the amount of information leaked due to its public nature. We characterize the tradeoff between transmission rate, incurred distortion, and information leakage rate at the helper/eavesdropper in the form of a rate-distortion-leakage region for various classes of problems.

Connected through hyperedge HE-1 (induced by source paper "vector gaussian ceo problem under logarithmic loss"):
  with members:
    - "vector gaussian ceo problem under logarithmic loss and applications"
    - "universality of logarithmic loss in lossy compression"
    - "on the optimal fronthaul compression and decoding strategies for uplink cloud radio access networks"
    - "justification of logarithmic loss via the benefit of side information"
    - "rate region of the vector gaussian ceo problem with the trace distortion constraint"
    - "an outer bound for the vector gaussian ceo problem"
    - "multiterminal source coding under logarithmic loss"
    - "multiterminal source coding with an entropy based distortion measure"

Connected through hyperedge HE-2 (induced by source paper "vector gaussian ceo problem under logarithmic loss and applications"):
  with members:
    - "vector gaussian ceo problem under logarithmic loss"
    - "chaining mutual information and tightening generalization bounds"
    - "on the universality of the logistic loss function"
    - "minimax learning for remote prediction"
    - "information theoretic analysis of generalization capability of learning algorithms"
    - "distributed information bottleneck method for discrete and gaussian sources"
    - "universality of logarithmic loss in lossy compression"
    - "a generalization of blahut arimoto algorithm to compute rate distortion regions of multiterminal source coding under logarithmic loss"

Connected through hyperedge HE-3 (induced by source paper "secure lossy source coding for some classes of helper and gray wyner models"):
  with members:
    - "multiaccess channel with partially cooperating encoders and security constraints"
    - "on secure source coding with side information at the encoder"
    - "secure degrees of freedom of mimo x channels with output feedback and delayed csit"
    - "bounds on the capacity of the relay channel with noncausal state at source"
    - "secure lossless compression with side information"
    - "on the secure degrees of freedom of wireless x networks"
    - "the secrecy capacity of the mimo wiretap channel"
    - "the gaussian multiple access wire tap channel"

Connected through hyperedge HE-4 (induced by source paper "the ceo problem with secrecy constraints"):
  with members:
    - "secure multiterminal source coding with side information at the eavesdropper"
    - "on secure source coding with side information at the encoder"
    - "rate distortion theory for secrecy systems"
    - "discriminatory lossy source coding side information privacy"
    - "multiterminal source coding under logarithmic loss"
    - "secure lossy source coding with side information at the decoders"
    - "secure source coding with a helper"
    - "secure lossless compression with side information"

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)