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: "invertible extractors and wiretap protocols"
  Abstract: A wiretap protocol is a pair of randomized encoding and decoding functions such that knowledge of a bounded fraction of the encoding of a message reveals essentially no information about the message, while knowledge of the entire encoding reveals the message using the decoder. In this paper we study the notion of efficiently invertible extractors and show that a wiretap protocol can be constructed from such an extractor. We will then construct invertible extractors for symbol-fixing, affine, and general sources and apply them to create wiretap protocols with asymptotically optimal trade-offs between their rate (ratio of the length of the message versus its encoding) and resilience (ratio of the observed positions of the encoding and the length of the encoding). We will then apply our results to create wiretap protocols for challenging communication problems, such as active intruders who change portions of the encoding, network coding, and intruders observing arbitrary boolean functions of the encoding. #R##N#As a by-product of our constructions we obtain new explicit extractors for a restricted family of affine sources over large fields (that in particular generalizes the notion of symbol-fixing sources) which is of independent interest. These extractors are able to extract the entire source entropy with zero error. #R##N#Keywords: Wiretap Channel, Extractors, Network Coding, Active Intrusion, Exposure Resilient Cryptography.

Connected through hyperedge HE-1 (induced by source paper "leakage resilient non malleable secret sharing in non compartmentalized models"):
  with members:
    - "secret sharing with binary shares"
    - "improved non malleable extractors non malleable codes and independent source extractors"
    - "repairing reed solomon codes"
    - "non malleable extractors and codes with their many tampered extensions"
    - "non malleable coding against bit wise and split state tampering"
    - "non malleable extractors two source extractors and privacy amplification"
    - "optimal rate code constructions for computationally simple channels"

Connected through hyperedge HE-2 (induced by source paper "non malleable secret sharing against affine tampering"):
  with members:
    - "improved non malleable extractors non malleable codes and independent source extractors"
    - "non malleable extractors and codes with their many tampered extensions"

Connected through hyperedge HE-3 (induced by source paper "secret sharing with binary shares"):
  with members:
    - "optimal rate code constructions for computationally simple channels"

Connected through hyperedge HE-4 (induced by source paper "polar coding for achieving the capacity of marginal channels in nonbinary input setting"):
  with members:
    - "soft decision decoding of reed muller codes recursive lists"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "nested polar codes for wiretap and relay channels"
    - "strong secrecy for erasure wiretap channels"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "performance of polar codes for channel and source coding"
    - "polarization for arbitrary discrete memoryless channels"
    - "on the rate of channel polarization"

Connected through hyperedge HE-5 (induced by source paper "on the construction of polar codes for achieving the capacity of marginal channels"):
  with members:
    - "soft decision decoding of reed muller codes recursive lists"
    - "polar coding for achieving the capacity of marginal channels in nonbinary input setting"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "nested polar codes for wiretap and relay channels"
    - "strong secrecy for erasure wiretap channels"
    - "performance of polar codes for channel and source coding"
    - "polarization for arbitrary discrete memoryless channels"
    - "on the rate of channel polarization"

Connected through hyperedge HE-6 (induced by source paper "secure polar coding for the two way wiretap channel"):
  with members:
    - "achieving the uniform rate region of general multiple access channels by polar coding"
    - "polar codes for broadcast channels"
    - "polar coding for secure transmission in miso fading wiretap channels"
    - "achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component"
    - "polar coding for the broadcast channel with confidential messages a random binning analogy"
    - "channel upgradation for non binary input alphabets and macs"
    - "polar coding for secret key generation"
    - "polar codes for arbitrary dmcs and arbitrary macs"

Connected through hyperedge HE-7 (induced by source paper "finite blocklength bounds for wiretap channels"):
  with members:
    - "security analysis of varepsilon almost dual universal 2 hash functions smoothing of min entropy versus smoothing of renyi entropy of order 2"
    - "e_ gamma resolvability"
    - "asymptotic estimates in information theory with non vanishing error probabilities"
    - "the third order term in the normal approximation for the awgn channel"
    - "on the secrecy exponent of the wire tap channel"
    - "converses for secret key agreement and secure computing"
    - "information spectrum approach to strong converse theorems for degraded wiretap channels"
    - "strong converse for a degraded wiretap channel via active hypothesis testing"

Connected through hyperedge HE-8 (induced by source paper "on the capacity of the binary adversarial wiretap channel"):
  with members:
    - "sufficiently myopic adversaries are blind"
    - "semantic security capacity for wiretap channels of type ii"
    - "wiretap channels implications of the more capable condition and cyclic shift symmetry"

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)