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: "enhanced blind decoding of tardos codes with new map based functions"
  Abstract: This paper presents a new decoder for probabilistic binary traitor tracing codes under the marking assumption. It is based on a binary hypothesis testing rule which integrates a collusion channel relaxation so as to obtain numerical and simple accusation functions. This decoder is blind as no estimation of the collusion channel prior to the accusation is required. Experimentations show that using the proposed decoder gives better performance than the well-known symmetric version of the Tardos decoder for common attack channels.

Connected through hyperedge HE-1 (induced by source paper "nearest neighbor decoding for tardos fingerprinting codes"):
  with members:
    - "ann benchmarks a benchmarking tool for approximate nearest neighbor algorithms"
    - "optimal hashing based time space trade offs for approximate near neighbors"
    - "optimal sequential fingerprinting wald vs tardos"
    - "practical and optimal lsh for angular distance"
    - "locality sensitive hashing without false negatives"
    - "optimal symmetric tardos traitor tracing schemes"
    - "capacities and capacity achieving decoders for various fingerprinting games"
    - "discrete distributions in the tardos scheme revisited"

Connected through hyperedge HE-2 (induced by source paper "asymptotics of fingerprinting and group testing capacity achieving log likelihood decoders"):
  with members:
    - "asymptotics of fingerprinting and group testing tight bounds from channel capacities"
    - "optimal symmetric tardos traitor tracing schemes"
    - "capacities and capacity achieving decoders for various fingerprinting games"
    - "dynamic traitor tracing schemes revisited"
    - "discrete distributions in the tardos scheme revisited"
    - "efficient probabilistic group testing based on traitor tracing"
    - "dynamic tardos traitor tracing schemes"
    - "on the saddle point solution and the large coalition asymptotics of fingerprinting games"

Connected through hyperedge HE-3 (induced by source paper "optimal sequential fingerprinting wald vs tardos"):
  with members:
    - "asymptotics of fingerprinting and group testing tight bounds from channel capacities"
    - "optimal symmetric tardos traitor tracing schemes"
    - "capacities and capacity achieving decoders for various fingerprinting games"
    - "interactive fingerprinting codes and the hardness of preventing false discovery"
    - "dynamic traitor tracing schemes revisited"
    - "discrete distributions in the tardos scheme revisited"
    - "fingerprinting codes and the price of approximate differential privacy"
    - "efficient probabilistic group testing based on traitor tracing"

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)