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 helper"
  Abstract: We consider a secure source coding problem with a rate-limited helper. In particular, Alice observes an independent and identically distributed (i.i.d.) source X and wishes to transmit this source losslessly to Bob over a rate-limited link. A helper (Helen), observes an i.i.d. correlated source Y and can transmit information to Bob over a separate rate-limited link. A passive eavesdropper (Eve) can observe the coded output of Alice, i.e., the link from Alice to Bob is public. The uncertainty about the source X at Eve, is measured by the conditional entropy of the source given the coded output of Alice. We completely characterize the rate-equivocation region for this secure source coding model, where we show that Slepian-Wolf binning of X with respect to the coded side information received at Bob is optimal. We next consider a modification of this model in which Alice also has access to the coded output of Helen. For the two-sided helper model, we characterize the rate-equivocation region. While the availability of side information at Alice does not reduce the rate of transmission from Alice, it significantly enhances the resulting equivocation at Eve. In particular, the resulting equivocation for the two-sided helper case is shown to be min(H(X),R_y), i.e., one bit from the two-sided helper provides one bit of uncertainty at Eve. From this result, we infer that Slepian-Wolf binning of X is suboptimal and one can further decrease the information leakage to the eavesdropper by utilizing the side information at Alice. We finally generalize these results to the case in which there is additional un-coded side information W available at Bob and characterize the rate-equivocation regions under the assumption that Y-X-W forms a Markov chain.

Connected through hyperedge HE-1 (induced by source paper "analysis of remaining uncertainties and exponents under various conditional r e nyi entropies"):
  with members:
    - "uniform random number generation from markov chains non asymptotic and asymptotic analyses"
    - "security analysis of varepsilon almost dual universal 2 hash functions smoothing of min entropy versus smoothing of renyi entropy of order 2"
    - "asymptotic estimates in information theory with non vanishing error probabilities"
    - "equivocations exponents and second order coding rates under various r enyi information measures"
    - "asymmetric evaluations of erasure and undetected error probabilities"
    - "list decoding random coding exponents and expurgated exponents"
    - "encoding tasks and renyi entropy"
    - "secure multiterminal source coding with side information at the eavesdropper"

Connected through hyperedge HE-2 (induced by source paper "wiretap channels with random states non causally available at the encoder"):
  with members:
    - "the likelihood encoder for lossy compression"
    - "arbitrarily varying wiretap channels with type constrained states"
    - "strong secrecy for cooperative broadcast channels"
    - "semantic security capacity for wiretap channels of type ii"
    - "renyi divergence and kullback leibler divergence"
    - "distributed channel synthesis"
    - "secret key generation using correlated sources and channels"
    - "a cryptographic treatment of the wiretap channel"

Connected through hyperedge HE-3 (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-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"
    - "secure source coding with a public helper"
    - "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 lossless compression with side information"

Connected through hyperedge HE-5 (induced by source paper "lossless secure source coding yamamoto s setting"):
  with members:
    - "secure multiterminal source coding with side information at the eavesdropper"
    - "secrecy is cheap if the adversary must reconstruct"
    - "secure lossless compression with side information"
    - "lossless compression with security constraints"

Connected through hyperedge HE-6 (induced by source paper "blind mimome wiretap channel with delayed csit"):
  with members:
    - "secure degrees of freedom region of the two user miso broadcast channel with alternating csit"
    - "secure degrees of freedom of one hop wireless networks"
    - "feasibility of interference alignment for the mimo interference channel"
    - "aligned image sets under channel uncertainty settling a conjecture by lapidoth shamai and wigger on the collapse of degrees of freedom under finite precision csit"
    - "secure degrees of freedom of the gaussian wiretap channel with helpers and no eavesdropper csi blind cooperative jamming"
    - "secure degrees of freedom of mimo x channels with output feedback and delayed csit"
    - "artificial noise alignment for secure multicast using multiple antennas"
    - "on the secrecy degrees of freedom of multi antenna wiretap channels with delayed csit"

Connected through hyperedge HE-7 (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-8 (induced by source paper "lossy source coding with reconstruction privacy"):
  with members:
    - "secure multiterminal source coding with side information at the eavesdropper"
    - "rate distortion theory for secrecy systems"
    - "discriminatory lossy source coding side information privacy"
    - "lossless compression with security constraints"
    - "on joint coding for watermarking and encryption"
    - "on the shannon cipher system with a capacity limited key distribution channel"

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)