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: "a framework for partial secrecy"
  Abstract: We consider theoretical limits of partial secrecy in a setting where an eavesdropper attempts to causally reconstruct an information sequence with low distortion based on an intercepted transmission and the past of the sequence. The transmitter and receiver have limited secret key at their disposal but not enough to establish perfect secrecy with a one-time pad. From another viewpoint, the eavesdropper is acting as an adversary, competing in a zero-sum repeated game against the sender and receiver of the secrecy system. In this case, the information sequence represents a sequence of actions, and the distortion function captures the payoff of the game. #R##N#We give an information theoretic region expressing the tradeoff between secret key rate and max-min distortion for the eavesdropper. We also simplify this characterization to a linear program. As an example, we discuss how to optimally use secret key to hide Bernoulli-p bits from an eavesdropper so that they incur maximal Hamming distortion.

Connected through hyperedge HE-1 (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"
    - "secure channel simulation"

Connected through hyperedge HE-2 (induced by source paper "gaussian secure source coding and wyner s common information"):
  with members:
    - "an extremal inequality for long markov chains"
    - "secure coordination with a two sided helper"
    - "the lossy common information of correlated sources"
    - "wyner s common information generalizations and a new lossy source coding interpretation"
    - "a bit of secrecy for gaussian source compression"
    - "optimal equivocation in secrecy systems a special case of distortion based characterization"
    - "on secure source coding with side information at the encoder"
    - "distributed channel synthesis"

Connected through hyperedge HE-3 (induced by source paper "joint source channel secrecy using hybrid coding"):
  with members:
    - "rate distortion based physical layer secrecy with applications to multimode fiber"
    - "a rate distortion based secrecy system with side information at the decoders"
    - "the likelihood encoder for lossy source compression"
    - "the likelihood encoder for source coding"
    - "distributed channel synthesis"
    - "rate distortion theory for secrecy systems"
    - "hybrid coding an interface for joint source channel coding and network communication"
    - "source channel secrecy with causal disclosure"

Connected through hyperedge HE-4 (induced by source paper "secure coordination with a two sided helper"):
  with members:
    - "optimal equivocation in secrecy systems a special case of distortion based characterization"
    - "the likelihood encoder for source coding"
    - "on secure source coding with side information at the encoder"
    - "distributed channel synthesis"
    - "rate distortion theory for secrecy systems"
    - "using a secret key to foil an eavesdropper"
    - "multiterminal source coding under logarithmic loss"
    - "secure lossy source coding with side information at the decoders"

Connected through hyperedge HE-5 (induced by source paper "rate distortion based physical layer secrecy with applications to multimode fiber"):
  with members:
    - "rate distortion theory for secrecy systems"
    - "source channel secrecy with causal disclosure"
    - "secrecy is cheap if the adversary must reconstruct"
    - "multiple input multiple output gaussian broadcast channels with common and confidential messages"
    - "the secrecy capacity of the mimo wiretap channel"

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"
    - "information masking and amplification the source coding setting"
    - "multiterminal source coding under logarithmic loss"
    - "cascade triangular and two way source coding with degraded side information at the second user"

Connected through hyperedge HE-7 (induced by source paper "distributed channel synthesis"):
  with members:
    - "secure cascade channel synthesis"
    - "a connection between good rate distortion codes and backward dmcs"
    - "on secure communication with constrained randomization"
    - "achievability proof via output statistics of random binning"
    - "channel simulation via interactive communications"
    - "coordination via a relay"
    - "secrecy is cheap if the adversary must reconstruct"
    - "generating dependent random variables over networks"

Connected through hyperedge HE-8 (induced by source paper "optimal equivocation in secrecy systems a special case of distortion based characterization"):
  with members:
    - "secrecy is cheap if the adversary must reconstruct"
    - "using a secret key to foil an eavesdropper"
    - "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"
    - "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)