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: "shannon s secrecy system with informed receivers and its application to systematic coding for wiretapped channels"
  Abstract: Shannon's secrecy system is studied in a setting, where both the legitimate decoder and the wiretapper have access to side information sequences correlated to the source, but the wiretapper receives both the coded information and the side information via channels that are more noisy than the respective channels of the legitmate decoder, which in turn, also shares a secret key with the encoder. A single--letter characterization is provided for the achievable region in the space of five figures of merit: the equivocation at the wiretapper, the key rate, the distortion of the source reconstruction at the legitimate receiver, the bandwidth expansion factor of the coded channels, and the average transmission cost (generalized power). Beyond the fact that this is an extension of earlier studies, it also provides a framework for studying fundamental performance limits of systematic codes in the presence of a wiretap channel. The best achievable performance of systematic codes is then compared to that of a general code in several respects, and a few examples are given.

Connected through hyperedge HE-1 (induced by source paper "secure broadcasting using independent secret keys"):
  with members:
    - "secrecy results for compound wiretap channels"
    - "strong secrecy for multiple access channels"
    - "effective secrecy reliability confusion and stealth"
    - "new results on multiple input multiple output broadcast channels with confidential messages"
    - "capacity results for compound wiretap channels"
    - "strong secrecy from channel resolvability"
    - "capacity region of gaussian mimo broadcast channels with common and confidential messages"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"

Connected through hyperedge HE-2 (induced by source paper "measuring secrecy by the probability of a successful guess"):
  with members:
    - "a large deviations approach to secure lossy compression"
    - "mitigating timing side channel in shared schedulers"
    - "the henchman problem measuring secrecy by the minimum distortion in a list"
    - "rate distortion theory for secrecy systems"
    - "improved rate equivocation regions for secure cooperative communication"
    - "lossless compression with security constraints"
    - "anonymous networking amidst eavesdroppers"

Connected through hyperedge HE-3 (induced by source paper "a large deviations approach to secure lossy compression"):
  with members:
    - "measuring secrecy by the probability of a successful guess"
    - "the henchman problem measuring secrecy by the minimum distortion in a list"
    - "optimum trade offs between the error exponent and the excess rate exponent of variable rate slepian wolf coding"
    - "rate distortion theory for secrecy systems"
    - "errors and erasures decoding for block codes with feedback"
    - "secrecy is cheap if the adversary must reconstruct"
    - "using a secret key to foil an eavesdropper"
    - "secure lossless compression with side information"

Connected through hyperedge HE-4 (induced by source paper "individual secrecy for broadcast channels with receiver side information"):
  with members:
    - "secure multiplex coding with dependent and non uniform multiple messages"
    - "strong secrecy for cooperative broadcast channels"
    - "individual secrecy for the broadcast channel"
    - "secrecy capacity region of some classes of wiretap broadcast channels"
    - "capacity regions for broadcast channels with degraded message sets and message cognition under different secrecy constraints"
    - "on block security of regenerating codes at the mbr point for distributed storage systems"
    - "effective secrecy reliability confusion and stealth"
    - "new results on multiple input multiple output broadcast channels with confidential messages"

Connected through hyperedge HE-5 (induced by source paper "universal decoding for source channel coding with side information"):
  with members:
    - "exact random coding error exponents of optimal bin index decoding"
    - "erasure list exponents for slepian wolf decoding"
    - "universal decoding for arbitrary channels relative to a given class of decoding metrics"
    - "multiuser random coding techniques for mismatched decoding"
    - "communication over individual channels a general framework"
    - "the porosity of additive noise sequences"
    - "communication over individual channels"
    - "universal communication part i modulo additive channels"

Connected through hyperedge HE-6 (induced by source paper "capacity regions for broadcast channels with degraded message sets and message cognition under different secrecy constraints"):
  with members:
    - "individual secrecy for broadcast channels with receiver side information"
    - "effective secrecy reliability confusion and stealth"
    - "strong secrecy from channel resolvability"
    - "broadcast capacity region of two phase bidirectional relaying"
    - "multiple access channels with generalized feedback and confidential messages"
    - "the gaussian multiple access wire tap channel"

Connected through hyperedge HE-7 (induced by source paper "secure transmission of sources over noisy channels with side information at the receivers"):
  with members:
    - "secure multiterminal source coding with side information at the eavesdropper"
    - "discriminatory lossy source coding side information privacy"
    - "secure lossy source coding with side information at the decoders"
    - "lecture notes on network information theory"
    - "capacity regions of two new classes of 2 receiver broadcast channels"
    - "joint source channel coding with side information using hybrid digital analog codes"
    - "two way source coding with a helper"

Connected through hyperedge HE-8 (induced by source paper "correlated source coded sequences with compromised channel and source symbols using shannon s cipher system"):
  with members:
    - "secure transmission of sources over noisy channels with side information at the receivers"
    - "secure multiterminal source coding with side information at the eavesdropper"
    - "imperfect secrecy in wiretap channel ii"
    - "the shannon cipher system with a guessing wiretapper general sources"

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)