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: "information masking and amplification the source coding setting"
  Abstract: The complementary problems of masking and amplifying channel state information in the Gel'fand-Pinsker channel have recently been solved by Merhav and Shamai, and Kim et al., respectively. In this paper, we study a related source coding problem. Specifically, we consider the two-encoder source coding setting where one source is to be amplified, while the other source is to be masked. In general, there is a tension between these two objectives which is characterized by the amplification-masking tradeoff. In this paper, we give a single-letter description of this tradeoff. We apply this result, together with a recent theorem by Courtade and Weissman on multiterminal source coding, to solve a fundamental entropy characterization problem.

Connected through hyperedge HE-1 (induced by source paper "noiseless privacy"):
  with members:
    - "an operational approach to information leakage"
    - "uncertain wiretap channels and secure estimation"
    - "on the relation between identifiability differential privacy and mutual information privacy"
    - "extremal mechanisms for local differential privacy"
    - "utility privacy tradeoffs in databases an information theoretic approach"
    - "a nonstochastic information theory for communication and state estimation"
    - "the composition theorem for differential privacy"
    - "privacy against statistical inference"

Connected through hyperedge HE-2 (induced by source paper "development and analysis of deterministic privacy preserving policies using non stochastic information theory"):
  with members:
    - "uncertain wiretap channels and secure estimation"
    - "extremal mechanisms for local differential privacy"
    - "utility privacy tradeoffs in databases an information theoretic approach"
    - "a nonstochastic information theory for communication and state estimation"
    - "the optimal mechanism in differential privacy"
    - "privacy against statistical inference"
    - "on the relation between differential privacy and quantitative information flow"

Connected through hyperedge HE-3 (induced by source paper "broadcasting information subject to state masking over a mimo state dependent gaussian channel"):
  with members:
    - "broadcasting information subject to state masking"
    - "information extraction under privacy constraints"
    - "state amplification subject to masking constraints"
    - "capacity bounds for multiuser channels with non causal channel state information at the transmitters"
    - "an extremal inequality motivated by multiterminal information theoretic problems"

Connected through hyperedge HE-4 (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-5 (induced by source paper "information extraction under privacy constraints"):
  with members:
    - "on maximal correlation mutual information and data privacy"
    - "lossless secure source coding yamamoto s setting"
    - "notes on information theoretic privacy"
    - "maximal correlation secrecy"
    - "extremal mechanisms for local differential privacy"
    - "from the information bottleneck to the privacy funnel"
    - "utility privacy tradeoffs in databases an information theoretic approach"
    - "bounds on inference"

Connected through hyperedge HE-6 (induced by source paper "secure source coding with a public helper"):
  with members:
    - "secure coordination with a two sided helper"
    - "secure multiterminal source coding with side information at the eavesdropper"
    - "utility privacy tradeoffs in databases an information theoretic approach"
    - "on secure source coding with side information at the encoder"
    - "rate distortion theory for secrecy systems"
    - "multiterminal source coding under logarithmic loss"
    - "cascade triangular and two way source coding with degraded side information at the second user"
    - "a framework for partial secrecy"

Connected through hyperedge HE-7 (induced by source paper "on secure source coding with side information at the encoder"):
  with members:
    - "increasing smart meter privacy through energy harvesting and storage devices"
    - "utility privacy tradeoffs in databases an information theoretic approach"
    - "broadcast channels with confidential messages by randomness constrained stochastic encoder"
    - "smart meter privacy a utility privacy framework"
    - "discriminatory lossy source coding side information privacy"
    - "multiterminal source coding under logarithmic loss"
    - "multiterminal source coding with an entropy based distortion measure"
    - "secure lossy source coding with side information at the decoders"

Connected through hyperedge HE-8 (induced by source paper "state amplification subject to masking constraints"):
  with members:
    - "a secure communication game with a relay helping the eavesdropper"
    - "secret key agreement with channel state information at the transmitter"
    - "secure relay beamforming over cognitive radio channels"
    - "secret key agreement on wiretap channels with transmitter side information"
    - "secure source coding with a helper"
    - "information theoretically secret key generation for fading wireless channels"

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)