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: "actshare sensitive data sharing with reliable leaker identification"
  Abstract: Data sharing among multiple parties becomes increasingly common today, so is the potential for data leakage. As required by new data protection regulations and laws, when data leakage occurs, one must be able to reliably identify the leaking party. Existing solutions utilize watermark technology or data object allocation strategy to differentiate the data shared with different parties to identify potential leakers. However the differentiation loses its effectiveness under several attacks, including injecting noise into the data copy to weaken the differentiation, or denying the reception of certain shared data. Worse yet, multiple parties might collude and apply a set of operations such as intersection, complement, and union to the shared dataset before leaking it, making leaker identification more difficult. In this paper, we propose ActShare, a systematic solution to provide reliable leaking source identification for leakages of identifiable information. ActShare takes advantage of the intrinsic properties of identifiable data and allocates data objects to individual sharing parties by identifying attributes, uses oblivious data transfer between the sender and receivers, and employs an immutable ledger to log all data sharing operations. A knowledge-based identification algorithm is proposed in ActShare to identify leakers in data leakage. Our evaluation shows that, with a modest amount of leaked data, ActShare can accurately (with accuracy > 99%) and undeniably identify the guilty party(s) in cases of non-collusive leakage, or collusive leakage by any number of data receivers, or even leakage by the data sender.

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.CR(Cryptography and Security)