{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:E62CYXSQ2YWYCGV2Z37LY4M3NU","short_pith_number":"pith:E62CYXSQ","canonical_record":{"source":{"id":"2605.17358","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2026-05-17T09:54:02Z","cross_cats_sorted":[],"title_canon_sha256":"b456fd6eab577aa79bcc072ca5e594d6401c87920a7fa82ebe53cb590814f703","abstract_canon_sha256":"f45eb012c5c1291776fb698af924cdc18da8789b72cf96ab91b88f4a9bab6e5e"},"schema_version":"1.0"},"canonical_sha256":"27b42c5e50d62d811abacefebc719b6d2b1a2688bb83035d75a5f5ef529fda27","source":{"kind":"arxiv","id":"2605.17358","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.17358","created_at":"2026-05-20T00:03:54Z"},{"alias_kind":"arxiv_version","alias_value":"2605.17358v1","created_at":"2026-05-20T00:03:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.17358","created_at":"2026-05-20T00:03:54Z"},{"alias_kind":"pith_short_12","alias_value":"E62CYXSQ2YWY","created_at":"2026-05-20T00:03:54Z"},{"alias_kind":"pith_short_16","alias_value":"E62CYXSQ2YWYCGV2","created_at":"2026-05-20T00:03:54Z"},{"alias_kind":"pith_short_8","alias_value":"E62CYXSQ","created_at":"2026-05-20T00:03:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:E62CYXSQ2YWYCGV2Z37LY4M3NU","target":"record","payload":{"canonical_record":{"source":{"id":"2605.17358","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2026-05-17T09:54:02Z","cross_cats_sorted":[],"title_canon_sha256":"b456fd6eab577aa79bcc072ca5e594d6401c87920a7fa82ebe53cb590814f703","abstract_canon_sha256":"f45eb012c5c1291776fb698af924cdc18da8789b72cf96ab91b88f4a9bab6e5e"},"schema_version":"1.0"},"canonical_sha256":"27b42c5e50d62d811abacefebc719b6d2b1a2688bb83035d75a5f5ef529fda27","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:03:54.060003Z","signature_b64":"yJwIL4BMf3OZlL1t8y0QwOAnqC5uiU30cS0xjW+wBxyI4XwQK4xb9h20QHnoTHgwTc4mc6V7F8Lx+F/fF9V6Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27b42c5e50d62d811abacefebc719b6d2b1a2688bb83035d75a5f5ef529fda27","last_reissued_at":"2026-05-20T00:03:54.059144Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:03:54.059144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.17358","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:03:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WtnjyaWp4VSdG6RD71GCs8Ga7ZtwO8ewTgrKyo6Px3/iNj3TIMczySRTUieLa8aeo6+HZR7HfggBBu9WBCr4Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T13:08:56.583888Z"},"content_sha256":"32fc3b160fb39c70e261e20c3f5953e414c7b540e10497c109341630ed25fff8","schema_version":"1.0","event_id":"sha256:32fc3b160fb39c70e261e20c3f5953e414c7b540e10497c109341630ed25fff8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:E62CYXSQ2YWYCGV2Z37LY4M3NU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Loaded Dice: Solving the Non-Selection Problem for Scalable Probabilistic RowHammer Defense","license":"http://creativecommons.org/licenses/by/4.0/","headline":"PrISM detects persistent RowHammer attacks by correlating reappearing sampled rows across mitigation windows, avoiding the global rate hikes that slow down normal memory traffic.","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Aamer Jaleel, Jeonghyun Woo, Junsu Kim, Prashant J. Nair","submitted_at":"2026-05-17T09:54:02Z","abstract_excerpt":"DRAM scaling has exacerbated the RowHammer vulnerability. To counter this, JEDEC recently introduced Per Row Activation Counting (PRAC) with the Alert Back-Off protocol as an optional DDR5 feature. While promising, PRAC requires per-row counter cells that incur area overhead, and updating them on every activation lengthens DRAM timing parameters, degrading performance. Probabilistic mitigations such as MINT offer a lower-cost alternative by randomly selecting and mitigating rows within periodic mitigation windows. MINT is effective at higher thresholds (>= 1000), but at lower thresholds, it mu"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"At the threshold of 500, PrISM incurs a negligible 0.2% average slowdown compared to 14% for PRAC, with no DRAM array changes or per-row counters and only 625B of SRAM per bank; compared to MINT it reduces average slowdown from 10.7% to 1.5% at a threshold of 250.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The assumption that reappearance of a sampled row in the Sampled History Queue reliably indicates a persistent RowHammer attack rather than benign repeated access patterns, and that the chosen sampling rate and queue size suffice to catch all relevant attack intensities without missing sophisticated or distributed hammering.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"PrISM uses a Sampled History Queue to correlate row samples across windows, solving the non-selection problem in probabilistic RowHammer mitigation and cutting slowdown from 10.7% to 1.5% at threshold 250 versus prior methods.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"PrISM detects persistent RowHammer attacks by correlating reappearing sampled rows across mitigation windows, avoiding the global rate hikes that slow down normal memory traffic.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"ced7a641bc7216c81be9bba61ada430b7daab3a6c3b4c906a304be93090f8f4e"},"source":{"id":"2605.17358","kind":"arxiv","version":1},"verdict":{"id":"4d04a4bf-ebd6-4af3-ab12-6bb3b27ab54b","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T23:35:08.419628Z","strongest_claim":"At the threshold of 500, PrISM incurs a negligible 0.2% average slowdown compared to 14% for PRAC, with no DRAM array changes or per-row counters and only 625B of SRAM per bank; compared to MINT it reduces average slowdown from 10.7% to 1.5% at a threshold of 250.","one_line_summary":"PrISM uses a Sampled History Queue to correlate row samples across windows, solving the non-selection problem in probabilistic RowHammer mitigation and cutting slowdown from 10.7% to 1.5% at threshold 250 versus prior methods.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The assumption that reappearance of a sampled row in the Sampled History Queue reliably indicates a persistent RowHammer attack rather than benign repeated access patterns, and that the chosen sampling rate and queue size suffice to catch all relevant attack intensities without missing sophisticated or distributed hammering.","pith_extraction_headline":"PrISM detects persistent RowHammer attacks by correlating reappearing sampled rows across mitigation windows, avoiding the global rate hikes that slow down normal memory traffic."},"integrity":{"clean":false,"summary":{"advisory":1,"critical":0,"by_detector":{"doi_compliance":{"total":1,"advisory":1,"critical":0,"informational":0}},"informational":0},"endpoint":"/pith/2605.17358/integrity.json","findings":[{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.14288/SOCKEYE.”) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detector":"doi_compliance","severity":"advisory","ref_index":1,"audited_at":"2026-05-19T23:41:36.689975Z","detected_doi":"10.14288/SOCKEYE.”","finding_type":"recoverable_identifier","verdict_class":"incontrovertible","detected_arxiv_id":null}],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-20T00:01:20.632967Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T23:41:36.689975Z","status":"completed","version":"1.0.0","findings_count":1},{"name":"claim_evidence","ran_at":"2026-05-19T21:41:57.788277Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T21:33:23.722017Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"c1af1f5a63aef51d985ec70472b7526f0d573ed632651a232c5eb80c6dca8ef6"},"references":{"count":119,"sample":[{"doi":"10.14288/sockeye","year":2019,"title":"UBC Advanced Research Computing,","work_id":"afca7a9b-06ae-4e75-839a-0733d7fef522","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2024,"title":"(2024) AMD EPYC 9965 Processor","work_id":"a5060038-da22-4ae6-9c5f-e4d3df38e35c","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Available: https://www.amd.com/en/products/processors/ server/epyc/9005-series/amd-epyc-9965.html","work_id":"d97cf824-bd86-4b86-9c49-aecbcae62657","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1145/3669940.3707242","year":2025,"title":"Instruction-aware cooperative tlb and cache replacement policies","work_id":"06cbbf6b-057e-42d3-9f4d-e1d864337327","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1145/3085572","year":2017,"title":"Kahng, Naveen Muralimanohar, Ali Shafiee, and Vaishnav Srinivas","work_id":"405f5680-9ab5-456f-9801-6336e98841d5","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":119,"snapshot_sha256":"44610f25608447e968ed704ea13d559bec8f46e0ef361ce9ac04794f85ab1cf5","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"1f478f5cc02aa21a78cd3ca1400fd9bddfd4138c347e00a9fc97ddf1a493b8e2"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"4d04a4bf-ebd6-4af3-ab12-6bb3b27ab54b"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:03:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cE/tJxTAgp5BoabGcCDf07WZBTVU0eEiMJj7rQTSr/TQtSnUWoWDdnzu9SgVi1udl3MUdBYU6a/+VFka0kJYBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T13:08:56.584669Z"},"content_sha256":"b69bcba2ae1c6eca4fee66561f1fa9e42f06259784d701d4580065a53d138c41","schema_version":"1.0","event_id":"sha256:b69bcba2ae1c6eca4fee66561f1fa9e42f06259784d701d4580065a53d138c41"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:E62CYXSQ2YWYCGV2Z37LY4M3NU","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.14288/SOCKEYE.”) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"“UBC Advanced Research Computing, ”UBC ARC Sockeye.” UBC Advanced Research Computing, 2019, doi: 10.14288/SOCKEYE.”","arxiv_id":"2605.17358","detector":"doi_compliance","evidence":{"ref_index":1,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"“UBC Advanced Research Computing, ”UBC ARC Sockeye.” UBC Advanced Research Computing, 2019, doi: 10.14288/SOCKEYE.”","reconstructed_doi":"10.14288/SOCKEYE.”"},"severity":"advisory","ref_index":1,"audited_at":"2026-05-19T23:41:36.689975Z","event_type":"pith.integrity.v1","detected_doi":"10.14288/SOCKEYE.”","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"95fb3b1977cf44a98efd154057dc9053dece5efa4363313fa4ee30a7dc95d8f2","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":3661,"payload_sha256":"7125eca884afb78400daeb817fc8f5d89b7117bbd0316b0e8f9ff1ff6534831e","signature_b64":"igOB0Hsk+xqpLPxqAO1Vqqx2hmKdevwxBth7/j6Uv+cDUZHOXGzqiz0zjr6XWmjgnFjoqQqcH9RlQei8t0amAg==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-19T23:42:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0ahLSsNa4yNdlrySzR+gM5shRKYCS5m1gM4xBzM5QP6nS+53FFUf4OAKuy0DYJ5gtxslXetjZotLSjWLZtSPBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T13:08:56.585527Z"},"content_sha256":"d35027e23539785eee1bb8ec06bbf7d8294dd273f71d2ad63a03dbf043892650","schema_version":"1.0","event_id":"sha256:d35027e23539785eee1bb8ec06bbf7d8294dd273f71d2ad63a03dbf043892650"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E62CYXSQ2YWYCGV2Z37LY4M3NU/bundle.json","state_url":"https://pith.science/pith/E62CYXSQ2YWYCGV2Z37LY4M3NU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E62CYXSQ2YWYCGV2Z37LY4M3NU/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-05T13:08:56Z","links":{"resolver":"https://pith.science/pith/E62CYXSQ2YWYCGV2Z37LY4M3NU","bundle":"https://pith.science/pith/E62CYXSQ2YWYCGV2Z37LY4M3NU/bundle.json","state":"https://pith.science/pith/E62CYXSQ2YWYCGV2Z37LY4M3NU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E62CYXSQ2YWYCGV2Z37LY4M3NU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:E62CYXSQ2YWYCGV2Z37LY4M3NU","merge_version":"pith-open-graph-merge-v1","event_count":3,"valid_event_count":3,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f45eb012c5c1291776fb698af924cdc18da8789b72cf96ab91b88f4a9bab6e5e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2026-05-17T09:54:02Z","title_canon_sha256":"b456fd6eab577aa79bcc072ca5e594d6401c87920a7fa82ebe53cb590814f703"},"schema_version":"1.0","source":{"id":"2605.17358","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.17358","created_at":"2026-05-20T00:03:54Z"},{"alias_kind":"arxiv_version","alias_value":"2605.17358v1","created_at":"2026-05-20T00:03:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.17358","created_at":"2026-05-20T00:03:54Z"},{"alias_kind":"pith_short_12","alias_value":"E62CYXSQ2YWY","created_at":"2026-05-20T00:03:54Z"},{"alias_kind":"pith_short_16","alias_value":"E62CYXSQ2YWYCGV2","created_at":"2026-05-20T00:03:54Z"},{"alias_kind":"pith_short_8","alias_value":"E62CYXSQ","created_at":"2026-05-20T00:03:54Z"}],"graph_snapshots":[{"event_id":"sha256:b69bcba2ae1c6eca4fee66561f1fa9e42f06259784d701d4580065a53d138c41","target":"graph","created_at":"2026-05-20T00:03:54Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"At the threshold of 500, PrISM incurs a negligible 0.2% average slowdown compared to 14% for PRAC, with no DRAM array changes or per-row counters and only 625B of SRAM per bank; compared to MINT it reduces average slowdown from 10.7% to 1.5% at a threshold of 250."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The assumption that reappearance of a sampled row in the Sampled History Queue reliably indicates a persistent RowHammer attack rather than benign repeated access patterns, and that the chosen sampling rate and queue size suffice to catch all relevant attack intensities without missing sophisticated or distributed hammering."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"PrISM uses a Sampled History Queue to correlate row samples across windows, solving the non-selection problem in probabilistic RowHammer mitigation and cutting slowdown from 10.7% to 1.5% at threshold 250 versus prior methods."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"PrISM detects persistent RowHammer attacks by correlating reappearing sampled rows across mitigation windows, avoiding the global rate hikes that slow down normal memory traffic."}],"snapshot_sha256":"ced7a641bc7216c81be9bba61ada430b7daab3a6c3b4c906a304be93090f8f4e"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"1f478f5cc02aa21a78cd3ca1400fd9bddfd4138c347e00a9fc97ddf1a493b8e2"},"integrity":{"available":true,"clean":false,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-20T00:01:20.632967Z","status":"completed","version":"1.0.0"},{"findings_count":1,"name":"doi_compliance","ran_at":"2026-05-19T23:41:36.689975Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T21:41:57.788277Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T21:33:23.722017Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.17358/integrity.json","findings":[{"audited_at":"2026-05-19T23:41:36.689975Z","detected_arxiv_id":null,"detected_doi":"10.14288/SOCKEYE.”","detector":"doi_compliance","finding_type":"recoverable_identifier","note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.14288/SOCKEYE.”) was visible in the surrounding text but could not be confirmed against doi.org as printed.","ref_index":1,"severity":"advisory","verdict_class":"incontrovertible"}],"snapshot_sha256":"c1af1f5a63aef51d985ec70472b7526f0d573ed632651a232c5eb80c6dca8ef6","summary":{"advisory":1,"by_detector":{"doi_compliance":{"advisory":1,"critical":0,"informational":0,"total":1}},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"DRAM scaling has exacerbated the RowHammer vulnerability. To counter this, JEDEC recently introduced Per Row Activation Counting (PRAC) with the Alert Back-Off protocol as an optional DDR5 feature. While promising, PRAC requires per-row counter cells that incur area overhead, and updating them on every activation lengthens DRAM timing parameters, degrading performance. Probabilistic mitigations such as MINT offer a lower-cost alternative by randomly selecting and mitigating rows within periodic mitigation windows. MINT is effective at higher thresholds (>= 1000), but at lower thresholds, it mu","authors_text":"Aamer Jaleel, Jeonghyun Woo, Junsu Kim, Prashant J. Nair","cross_cats":[],"headline":"PrISM detects persistent RowHammer attacks by correlating reappearing sampled rows across mitigation windows, avoiding the global rate hikes that slow down normal memory traffic.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2026-05-17T09:54:02Z","title":"Loaded Dice: Solving the Non-Selection Problem for Scalable Probabilistic RowHammer Defense"},"references":{"count":119,"internal_anchors":0,"resolved_work":119,"sample":[{"cited_arxiv_id":"","doi":"10.14288/sockeye","is_internal_anchor":false,"ref_index":1,"title":"UBC Advanced Research Computing,","work_id":"afca7a9b-06ae-4e75-839a-0733d7fef522","year":2019},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"(2024) AMD EPYC 9965 Processor","work_id":"a5060038-da22-4ae6-9c5f-e4d3df38e35c","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Available: https://www.amd.com/en/products/processors/ server/epyc/9005-series/amd-epyc-9965.html","work_id":"d97cf824-bd86-4b86-9c49-aecbcae62657","year":null},{"cited_arxiv_id":"","doi":"10.1145/3669940.3707242","is_internal_anchor":false,"ref_index":4,"title":"Instruction-aware cooperative tlb and cache replacement policies","work_id":"06cbbf6b-057e-42d3-9f4d-e1d864337327","year":2025},{"cited_arxiv_id":"","doi":"10.1145/3085572","is_internal_anchor":false,"ref_index":5,"title":"Kahng, Naveen Muralimanohar, Ali Shafiee, and Vaishnav Srinivas","work_id":"405f5680-9ab5-456f-9801-6336e98841d5","year":2017}],"snapshot_sha256":"44610f25608447e968ed704ea13d559bec8f46e0ef361ce9ac04794f85ab1cf5"},"source":{"id":"2605.17358","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T23:35:08.419628Z","id":"4d04a4bf-ebd6-4af3-ab12-6bb3b27ab54b","model_set":{"reader":"grok-4.3"},"one_line_summary":"PrISM uses a Sampled History Queue to correlate row samples across windows, solving the non-selection problem in probabilistic RowHammer mitigation and cutting slowdown from 10.7% to 1.5% at threshold 250 versus prior methods.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"PrISM detects persistent RowHammer attacks by correlating reappearing sampled rows across mitigation windows, avoiding the global rate hikes that slow down normal memory traffic.","strongest_claim":"At the threshold of 500, PrISM incurs a negligible 0.2% average slowdown compared to 14% for PRAC, with no DRAM array changes or per-row counters and only 625B of SRAM per bank; compared to MINT it reduces average slowdown from 10.7% to 1.5% at a threshold of 250.","weakest_assumption":"The assumption that reappearance of a sampled row in the Sampled History Queue reliably indicates a persistent RowHammer attack rather than benign repeated access patterns, and that the chosen sampling rate and queue size suffice to catch all relevant attack intensities without missing sophisticated or distributed hammering."}},"verdict_id":"4d04a4bf-ebd6-4af3-ab12-6bb3b27ab54b"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:32fc3b160fb39c70e261e20c3f5953e414c7b540e10497c109341630ed25fff8","target":"record","created_at":"2026-05-20T00:03:54Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"f45eb012c5c1291776fb698af924cdc18da8789b72cf96ab91b88f4a9bab6e5e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2026-05-17T09:54:02Z","title_canon_sha256":"b456fd6eab577aa79bcc072ca5e594d6401c87920a7fa82ebe53cb590814f703"},"schema_version":"1.0","source":{"id":"2605.17358","kind":"arxiv","version":1}},"canonical_sha256":"27b42c5e50d62d811abacefebc719b6d2b1a2688bb83035d75a5f5ef529fda27","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"27b42c5e50d62d811abacefebc719b6d2b1a2688bb83035d75a5f5ef529fda27","first_computed_at":"2026-05-20T00:03:54.059144Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:03:54.059144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yJwIL4BMf3OZlL1t8y0QwOAnqC5uiU30cS0xjW+wBxyI4XwQK4xb9h20QHnoTHgwTc4mc6V7F8Lx+F/fF9V6Dw==","signature_status":"signed_v1","signed_at":"2026-05-20T00:03:54.060003Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.17358","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d35027e23539785eee1bb8ec06bbf7d8294dd273f71d2ad63a03dbf043892650","sha256:32fc3b160fb39c70e261e20c3f5953e414c7b540e10497c109341630ed25fff8","sha256:b69bcba2ae1c6eca4fee66561f1fa9e42f06259784d701d4580065a53d138c41"],"state_sha256":"6b75dbd098c665036ec9885a8450c96719ec14042b5236083d9163467fa8bdbc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aZ/Ncy7kfUqXhWiovw3eXR3A12Ufx0HYpoIEXmpfEdKNEXvlrUjQhZ7w4wtz8Ks7vY7sUGe1hbXfU1bbdmsRCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T13:08:56.588305Z","bundle_sha256":"de47716a628acf3aa29dcc97ac296341b447bcf65faba8969d4e99b68dc56fe7"}}