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: "explicit resilient functions matching ajtai linial"
  Abstract: A Boolean function on n variables is q-resilient if for any subset of at most q variables, the function is very likely to be determined by a uniformly random assignment to the remaining n-q variables; in other words, no coalition of at most q variables has significant influence on the function. Resilient functions have been extensively studied with a variety of applications in cryptography, distributed computing, and pseudorandomness. The best known balanced resilient function on n variables due to Ajtai and Linial ([AL93]) is Omega(n/(log^2 n))-resilient. However, the construction of Ajtai and Linial is by the probabilistic method and does not give an efficiently computable function. #R##N#In this work we give an explicit monotone depth three almost-balanced Boolean function on n bits that is Omega(n/(log^2 n))-resilient matching the work of Ajtai and Linial. The best previous explicit construction due to Meka [Meka09] (which only gives a logarithmic depth function) and Chattopadhyay and Zuckermman [CZ15] were only n^{1-c}-resilient for any constant c < 1. Our construction and analysis are motivated by (and simplifies parts of) the recent breakthrough of [CZ15] giving explicit two-sources extractors for polylogarithmic min-entropy; a key ingredient in their result was the construction of explicit constant-depth resilient functions. #R##N#An important ingredient in our construction is a new randomness optimal oblivious sampler which preserves moment generating functions of sums of variables and could be useful elsewhere.

Connected through hyperedge HE-1 (induced by source paper "non malleable extractors and non malleable codes partially optimal constructions"):
  with members:
    - "an entropy lower bound for non malleable extractors"
    - "improved non malleable extractors non malleable codes and independent source extractors"
    - "explicit non malleable extractors multi source extractors and almost optimal privacy amplification protocols"
    - "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-2 (induced by source paper "optimal streaming and tracking distinct elements with high probability"):
  with members:
    - "streaming space complexity of nearly all functions of one variable on frequency vectors"
    - "tracking the frequency moments at all times"
    - "a multi round communication lower bound for gap hamming and some consequences"

Connected through hyperedge HE-3 (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"
    - "non malleable extractors and codes with their many tampered extensions"
    - "three source extractors for polylogarithmic min entropy"
    - "non malleable coding against bit wise and split state tampering"
    - "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-4 (induced by source paper "explicit non malleable extractors multi source extractors and almost optimal privacy amplification protocols"):
  with members:
    - "improved non malleable extractors non malleable codes and independent source extractors"
    - "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"

Connected through hyperedge HE-5 (induced by source paper "randomness extraction in ac0 and with small locality"):
  with members:
    - "analysis of boolean functions"
    - "sparse extractor families for all the entropy"

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)