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: "improved non malleable extractors non malleable codes and independent source extractors"
  Abstract: In this paper we give improved constructions of several central objects in the literature of randomness extraction and tamper-resilient cryptography. Our main results are: #R##N#(1) An explicit seeded non-malleable extractor with error $\epsilon$ and seed length $d=O(\log n)+O(\log(1/\epsilon)\log \log (1/\epsilon))$, that supports min-entropy $k=\Omega(d)$ and outputs $\Omega(k)$ bits. Combined with the protocol in \cite{DW09}, this gives a two round privacy amplification protocol with optimal entropy loss in the presence of an active adversary, for all security parameters up to $\Omega(k/\log k)$. #R##N#(2) An explicit non-malleable two-source extractor for min-entropy $k \geq (1-\gamma)n$, some constant $\gamma>0$, that outputs $\Omega(k)$ bits with error $2^{-\Omega(n/\log n)}$. Combined with the connection in \cite{CG14b} this gives a non-malleable code in the two-split-state model with relative rate $\Omega(1/\log n)$. This exponentially improves previous constructions, all of which only achieve rate $n^{-\Omega(1)}$.\footnote{The work of Aggarwal et. al \cite{ADKO15} had a construction which "achieves" constant rate, but recently the author found an error in their proof.} #R##N#(3)A two-source extractor for min-entropy $O(\log n \log \log n)$, which also implies a $K$-Ramsey graph on $N$ vertices with $K=(\log N)^{O(\log \log \log N)}$. We also obtain a seeded non-malleable $9$-source extractor with optimal seed length, which in turn gives a $10$-source extractor for min-entropy $O(\log n)$. Previously the best known extractor for such min-entropy requires $O(\log \log n)$ sources \cite{CohL16}. #R##N#Independent of our work, Cohen \cite{Cohen16} obtained similar results to (1) and the two-source extractor, except the dependence on $\epsilon$ is $\log(1/\epsilon)(\log \log (1/\epsilon))^{O(1)}$ and the two-source extractor requires min-entropy $\log n (\log \log n)^{O(1)}$.

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"
    - "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"
    - "invertible extractors and wiretap protocols"

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

Connected through hyperedge HE-3 (induced by source paper "non malleable extractors and non malleable codes partially optimal constructions"):
  with members:
    - "an entropy lower bound for non malleable extractors"
    - "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"
    - "fuzzy extractors how to generate strong keys from biometrics and other noisy data"

Connected through hyperedge HE-4 (induced by source paper "non malleable codes for small depth circuits"):
  with members:
    - "non malleable extractors and codes with their many tampered extensions"
    - "pseudorandomness for regular branching programs via fourier analysis"
    - "better pseudorandom generators from milder pseudorandom restrictions"
    - "non malleable extractors two source extractors and privacy amplification"

Connected through hyperedge HE-5 (induced by source paper "expander graphs are non malleable codes"):
  with members:
    - "non malleable extractors and codes with their many tampered extensions"

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

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.CC(Computational Complexity)