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: "intrinsic rowhammer pufs leveraging the rowhammer effect for improved security"
  Abstract: Physically Unclonable Functions (PUFs) have become an important and promising hardware primitive for device fingerprinting, device identification, or key storage. Intrinsic PUFs leverage components already found in existing devices, unlike extrinsic silicon PUFs, which are based on customized circuits that involve modification of hardware. In this work, we present a new type of a memory-based intrinsic PUF, which leverages the Rowhammer effect in DRAM modules — the Rowhammer PUF. Our PUF makes use of bit flips, which occur in DRAM cells due to rapid and repeated access of DRAM rows. Prior research has mainly focused on Rowhammer attacks, where the Rowhammer effect is used to illegitimately alter data stored in memory, e.g., to change page table entries or enable privilege escalation attacks. Meanwhile, this is the first work to use the Rowhammer effect in a positive context — to design a novel PUF. We extensively evaluate the Rowhammer PUF using commercial, off-the-shelf devices, not relying on custom hardware or an FPGA-based setup. The evaluation shows that the Rowhammer PUF holds required properties needed for the envisioned security applications, and could be deployed today.

Connected through hyperedge HE-1 (induced by source paper "rowhammer a retrospective"):
  with members:
    - "processing data where it makes sense enabling in memory computation"
    - "rowhammer and beyond"
    - "improving 3d nand flash memory lifetime by tolerating early retention loss and process variation"
    - "d range using commodity dram devices to generate true random numbers with low latency and high throughput"
    - "nethammer inducing rowhammer faults through network requests"
    - "pointing in the right direction securing memory accesses in a faulty world"
    - "what your dram power models are not telling you lessons from a detailed experimental study"
    - "theory and practice of finding eviction sets"

Connected through hyperedge HE-2 (induced by source paper "understanding rowhammer attacks through the lens of a unified reference framework"):
  with members:
    - "still hammerable and exploitable on the effectiveness of software only physical kernel isolation"
    - "nethammer inducing rowhammer faults through network requests"
    - "another flip in the wall of rowhammer defenses"
    - "the rowhammer problem and other issues we may face as memory becomes denser"
    - "rowhammer reliability analysis and security implications"
    - "flush flush a fast and stealthy cache attack"
    - "flush flush a fast and stealthy cache attack"
    - "rowhammer js a remote software induced fault attack in javascript"

Connected through hyperedge HE-3 (induced by source paper "dataplant in dram security mechanisms for low cost devices"):
  with members:
    - "memory based combination pufs for device authentication in embedded systems"
    - "ensuring high quality randomness in cryptographic key generation"
    - "internet of things iot a vision architectural elements and future directions"
    - "security through amnesia a software based solution to the cold boot attack on disk encryption"

Connected through hyperedge HE-4 (induced by source paper "towards the avoidance of counterfeit memory identifying the dram origin"):
  with members:
    - "exploiting dram latency variations for generating true random numbers"
    - "prelatpuf exploiting dram latency variations for generating robust device signatures"

Connected through hyperedge HE-5 (induced by source paper "prelatpuf exploiting dram latency variations for generating robust device signatures"):
  with members:
    - "exploiting dram latency variations for generating true random numbers"

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)