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: "non malleable coding against bit wise and split state tampering"
  Abstract: Non-malleable coding, introduced by Dziembowski, Pietrzak and Wichs (ICS 2010), aims for protecting the integrity of information against tampering attacks in situations where error-detection is impossible. Intuitively, information encoded by a non-malleable code either decodes to the original message or, in presence of any tampering, to an unrelated message. Dziembowski et al. show existence of non-malleable codes for any class of tampering functions of bounded size. #R##N#We consider constructions of coding schemes against two well-studied classes of tampering functions: bit-wise tampering functions (where the adversary tampers each bit of the encoding independently) and split-state adversaries (where two independent adversaries arbitrarily tamper each half of the encoded sequence). #R##N#1. For bit-tampering, we obtain explicit and efficiently encodable and decodable codes of length $n$ achieving rate $1-o(1)$ and error (security) $\exp(-\tilde{\Omega}(n^{1/7}))$. We improve the error to $\exp(-\tilde{\Omega}(n))$ at the cost of making the construction Monte Carlo with success probability $1-\exp(-\Omega(n))$. Previously, the best known construction of bit-tampering codes was the Monte Carlo construction of Dziembowski et al. (ICS 2010) achieving rate ~.1887. #R##N#2. We initiate the study of seedless non-malleable extractors as a variation of non-malleable extractors introduced by Dodis and Wichs (STOC 2009). We show that construction of non-malleable codes for the split-state model reduces to construction of non-malleable two-source extractors. We prove existence of such extractors, which implies that codes obtained from our reduction can achieve rates arbitrarily close to 1/5 and exponentially small error. Currently, the best known explicit construction of split-state coding schemes is due to Aggarwal, Dodis and Lovett (ECCC TR13-081) which only achieves vanishing (polynomially small) rate.

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 extractors two source extractors and privacy amplification"
    - "optimal rate code constructions for computationally simple channels"
    - "invertible extractors and wiretap protocols"

Connected through hyperedge HE-2 (induced by source paper "improved non malleable extractors non malleable codes and independent source extractors"):
  with members:
    - "explicit non malleable extractors multi source extractors and almost optimal privacy amplification protocols"
    - "explicit resilient functions matching ajtai linial"
    - "non malleable extractors and codes with their many tampered extensions"
    - "three source extractors for polylogarithmic min entropy"
    - "capacity of non malleable codes"
    - "non malleable condensers for arbitrary min entropy and almost optimal protocols for privacy amplification"
    - "non malleable extractors two source extractors and privacy amplification"
    - "fuzzy extractors how to generate strong keys from biometrics and other noisy data"

Connected through hyperedge HE-3 (induced by source paper "non malleable extractors and codes with their many tampered extensions"):
  with members:
    - "three source extractors for polylogarithmic min entropy"
    - "capacity of non malleable codes"
    - "non malleable condensers for arbitrary min entropy and almost optimal protocols for privacy amplification"
    - "non malleable extractors two source extractors and privacy amplification"
    - "non malleable codes from the wire tap channel"
    - "fuzzy extractors how to generate strong keys from biometrics and other noisy data"

Connected through hyperedge HE-4 (induced by source paper "correction of samplable additive errors"):
  with members:
    - "optimal rate code constructions for computationally simple channels"
    - "capacity achieving codes from randomness condensers"

Connected through hyperedge HE-5 (induced by source paper "error correction by structural simplicity correcting samplable additive errors"):
  with members:
    - "optimal rate code constructions for computationally simple 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)