{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:4GFH6LTS2T7JAFO2QNHEAN5OIN","short_pith_number":"pith:4GFH6LTS","canonical_record":{"source":{"id":"2605.15645","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AR","submitted_at":"2026-05-15T06:01:25Z","cross_cats_sorted":[],"title_canon_sha256":"1c2cfe19983f44b393057645d887de7cbbe4c3f1170fe464b72151f38c4c779c","abstract_canon_sha256":"f12e77c42a67208fbab7d42ea27c4f78216a9c14a17e8fcb1786a63cd83ff3db"},"schema_version":"1.0"},"canonical_sha256":"e18a7f2e72d4fe9015da834e4037ae4369bd4ccd15bde34b1b4836d92ae58261","source":{"kind":"arxiv","id":"2605.15645","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15645","created_at":"2026-05-20T00:01:09Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15645v1","created_at":"2026-05-20T00:01:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15645","created_at":"2026-05-20T00:01:09Z"},{"alias_kind":"pith_short_12","alias_value":"4GFH6LTS2T7J","created_at":"2026-05-20T00:01:09Z"},{"alias_kind":"pith_short_16","alias_value":"4GFH6LTS2T7JAFO2","created_at":"2026-05-20T00:01:09Z"},{"alias_kind":"pith_short_8","alias_value":"4GFH6LTS","created_at":"2026-05-20T00:01:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:4GFH6LTS2T7JAFO2QNHEAN5OIN","target":"record","payload":{"canonical_record":{"source":{"id":"2605.15645","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AR","submitted_at":"2026-05-15T06:01:25Z","cross_cats_sorted":[],"title_canon_sha256":"1c2cfe19983f44b393057645d887de7cbbe4c3f1170fe464b72151f38c4c779c","abstract_canon_sha256":"f12e77c42a67208fbab7d42ea27c4f78216a9c14a17e8fcb1786a63cd83ff3db"},"schema_version":"1.0"},"canonical_sha256":"e18a7f2e72d4fe9015da834e4037ae4369bd4ccd15bde34b1b4836d92ae58261","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:01:09.842304Z","signature_b64":"7qRAJSauC3Q+yash6P8ZaX5iN8fmgjzhMTNte5SlkdVR6rm5SApXpd8twAGY08YkVpduPyAzbsBXxcwJkAYEBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e18a7f2e72d4fe9015da834e4037ae4369bd4ccd15bde34b1b4836d92ae58261","last_reissued_at":"2026-05-20T00:01:09.841405Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:01:09.841405Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.15645","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:01:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RcLiPQUFHd+sMK5JSs5OSDYLAVmBPJGWKf2cz4rw1uiixjjS9vyIEm3xQfUuUMysfSx90VB+jvNNGqSJDJFoCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T18:01:55.818645Z"},"content_sha256":"4d69aac7766c70b9a8b5f06a9c7e81910d97000546a858052e5a158aa0ff73aa","schema_version":"1.0","event_id":"sha256:4d69aac7766c70b9a8b5f06a9c7e81910d97000546a858052e5a158aa0ff73aa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:4GFH6LTS2T7JAFO2QNHEAN5OIN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"ICP: Exploiting Instruction Correlation for Prefetching Irregular Memory Accesses","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"ICP prefetching exploits stable instruction correlations to handle irregular memory accesses more efficiently than address-based methods.","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Buqing Xu, Ceyu Xu, Chenlu Miao, Mengming Li, Qijun Zhang, Shang Liu, Wenkai Li, Xiangfeng Sun, Yuan Xie, Zhiyao Xie","submitted_at":"2026-05-15T06:01:25Z","abstract_excerpt":"Irregular memory accesses pose challenges for effective and efficient data prefetching. While temporal prefetchers have recently shown promise for irregular memory access patterns, their effectiveness fundamentally depends on temporal address recurrence and large metadata storage. When memory addresses exhibit weak or no recurrence, as in indirect memory accesses, temporal prefetchers achieve limited performance gains while incurring substantial storage overhead.\n  This paper proposes Instruction-Correlation Prefetching (ICP), a new hardware prefetching mechanism that exploits instruction-leve"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"ICP outperforms the state-of-the-art temporal prefetcher Triangel by 14.0% and the indirect prefetcher DMP by 6.0%, while requiring only 2.1 KB of hardware storage, over three orders of magnitude smaller than temporal prefetchers.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The assumption that instructions generating irregular addresses recur with stable data-dependency relationships even when the addresses themselves show weak or no temporal recurrence, enabling speculative computation of future accesses from correlated predecessors.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"ICP is a prefetcher that learns stable instruction correlations to speculatively compute future irregular memory accesses, outperforming Triangel by 14% and DMP by 6% with only 2.1 KB storage.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"ICP prefetching exploits stable instruction correlations to handle irregular memory accesses more efficiently than address-based methods.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"c7c3874a188f749f14da2138d55a0d5c3a05c18f8b3cea4e606b46d2516d96ec"},"source":{"id":"2605.15645","kind":"arxiv","version":1},"verdict":{"id":"414e9d78-2a17-4961-9b9a-9ba2c3651fbe","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T19:43:27.391209Z","strongest_claim":"ICP outperforms the state-of-the-art temporal prefetcher Triangel by 14.0% and the indirect prefetcher DMP by 6.0%, while requiring only 2.1 KB of hardware storage, over three orders of magnitude smaller than temporal prefetchers.","one_line_summary":"ICP is a prefetcher that learns stable instruction correlations to speculatively compute future irregular memory accesses, outperforming Triangel by 14% and DMP by 6% with only 2.1 KB storage.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The assumption that instructions generating irregular addresses recur with stable data-dependency relationships even when the addresses themselves show weak or no temporal recurrence, enabling speculative computation of future accesses from correlated predecessors.","pith_extraction_headline":"ICP prefetching exploits stable instruction correlations to handle irregular memory accesses more efficiently than address-based methods."},"integrity":{"clean":false,"summary":{"advisory":0,"critical":1,"by_detector":{"doi_compliance":{"total":1,"advisory":0,"critical":1,"informational":0}},"informational":0},"endpoint":"/pith/2605.15645/integrity.json","findings":[{"note":"Identifier '10.1109/isca52012.2021.00099' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","detector":"doi_compliance","severity":"critical","ref_index":45,"audited_at":"2026-05-19T19:51:34.304526Z","detected_doi":"10.1109/isca52012.2021.00099","finding_type":"unresolvable_identifier","verdict_class":"cross_source","detected_arxiv_id":null}],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T20:01:19.255791Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T19:51:34.304526Z","status":"completed","version":"1.0.0","findings_count":1},{"name":"ai_meta_artifact","ran_at":"2026-05-19T19:33:35.321602Z","status":"skipped","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T17:21:56.092196Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"1d2af08ccd3d1cfb7bee05df1d4cec4eca1e024d65fa78e7ab8ec8cd94b45d48"},"references":{"count":60,"sample":[{"doi":"","year":null,"title":"“Gate equivalent,” https://en.wikipedia.org/wiki/Gate equivalent","work_id":"a2c9b653-54fa-4f9d-86ac-1af216a96426","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2006,"title":"“SPEC CPU 2006,” https://www.spec.org/cpu2006/","work_id":"b9e595b0-9314-4cff-aae4-946123f9c8e6","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2021,"title":"Ghostminion: A strictness-ordered cache system for spectre mitigation,","work_id":"8a7b1689-b4e3-461a-8ac2-082816214ed9","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2016,"title":"Graph prefetching using data structure knowledge,","work_id":"281d638a-f8a8-41df-b93a-d8cc774fda43","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2017,"title":"Software prefetching for indirect memory accesses,","work_id":"80ef0a55-c8ee-46cc-a7ca-073ea5287057","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":60,"snapshot_sha256":"861e1b0e31e967b9a1a20052cbad75e860b3fbdc507510e9c77afc9d6ff700e7","internal_anchors":1},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"414e9d78-2a17-4961-9b9a-9ba2c3651fbe"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:01:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3GWSVTmOllJ78C2YKA7qxc90mgp0IVCqGEGPTOGgyTeBFXxFDT2r1jkb4PI2PUFXT2rRTCmKjXQ7fknHd9N0CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T18:01:55.819475Z"},"content_sha256":"25c1c38039d095b9cbd09879832b047291b35784521b3e6cee8dae19cd8dc2dd","schema_version":"1.0","event_id":"sha256:25c1c38039d095b9cbd09879832b047291b35784521b3e6cee8dae19cd8dc2dd"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:4GFH6LTS2T7JAFO2QNHEAN5OIN","target":"integrity","payload":{"note":"Identifier '10.1109/isca52012.2021.00099' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","snippet":"A. Ros and A. Jimborean, “A cost-effective entangling prefetcher for instructions,” inProceedings of the 48th Annual International Symposium on Computer Architecture (ISCA). IEEE, 2021, pp. 99–111, entangling instruction prefetcher that sel","arxiv_id":"2605.15645","detector":"doi_compliance","evidence":{"doi":"10.1109/isca52012.2021.00099","arxiv_id":null,"ref_index":45,"raw_excerpt":"A. Ros and A. Jimborean, “A cost-effective entangling prefetcher for instructions,” inProceedings of the 48th Annual International Symposium on Computer Architecture (ISCA). IEEE, 2021, pp. 99–111, entangling instruction prefetcher that selects triggering instruction pairs for timely prefetching. [Online]. Available: https: //doi.org/10.1109/ISCA52012.2021.00099","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"]},"severity":"critical","ref_index":45,"audited_at":"2026-05-19T19:51:34.304526Z","event_type":"pith.integrity.v1","detected_doi":"10.1109/isca52012.2021.00099","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"63479da34f3960d4808ff450209d2411e3971f7609d2c39e85f852a02d268677","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":2778,"payload_sha256":"0efd4cf4f1a6bfd203225b9fd1eceda93275bb2ccba7604bb6c40b4b8e83eeaf","signature_b64":"DBIpySMInE9iQeUAPsWlohMYRlzG8+pVdRP3stOXNs8wDlCmvWLjbWJJ1Q6J6uCYOVkVzkcb6hSgs7zQstxPCQ==","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-19T19:52:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xbHrzfLavF51OoKNtQeqP0FP8Bqk+9tq9O6db+ap1u8x7MNLSreBMs8NSRlXVKR2/14ggXPNi8P6pjykyU0qBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T18:01:55.820491Z"},"content_sha256":"56b9c9e4845af826a0ba9c76d96ff53d912f05d2306001c10845e9506205ab70","schema_version":"1.0","event_id":"sha256:56b9c9e4845af826a0ba9c76d96ff53d912f05d2306001c10845e9506205ab70"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4GFH6LTS2T7JAFO2QNHEAN5OIN/bundle.json","state_url":"https://pith.science/pith/4GFH6LTS2T7JAFO2QNHEAN5OIN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4GFH6LTS2T7JAFO2QNHEAN5OIN/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-05-22T18:01:55Z","links":{"resolver":"https://pith.science/pith/4GFH6LTS2T7JAFO2QNHEAN5OIN","bundle":"https://pith.science/pith/4GFH6LTS2T7JAFO2QNHEAN5OIN/bundle.json","state":"https://pith.science/pith/4GFH6LTS2T7JAFO2QNHEAN5OIN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4GFH6LTS2T7JAFO2QNHEAN5OIN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:4GFH6LTS2T7JAFO2QNHEAN5OIN","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":"f12e77c42a67208fbab7d42ea27c4f78216a9c14a17e8fcb1786a63cd83ff3db","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AR","submitted_at":"2026-05-15T06:01:25Z","title_canon_sha256":"1c2cfe19983f44b393057645d887de7cbbe4c3f1170fe464b72151f38c4c779c"},"schema_version":"1.0","source":{"id":"2605.15645","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15645","created_at":"2026-05-20T00:01:09Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15645v1","created_at":"2026-05-20T00:01:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15645","created_at":"2026-05-20T00:01:09Z"},{"alias_kind":"pith_short_12","alias_value":"4GFH6LTS2T7J","created_at":"2026-05-20T00:01:09Z"},{"alias_kind":"pith_short_16","alias_value":"4GFH6LTS2T7JAFO2","created_at":"2026-05-20T00:01:09Z"},{"alias_kind":"pith_short_8","alias_value":"4GFH6LTS","created_at":"2026-05-20T00:01:09Z"}],"graph_snapshots":[{"event_id":"sha256:25c1c38039d095b9cbd09879832b047291b35784521b3e6cee8dae19cd8dc2dd","target":"graph","created_at":"2026-05-20T00:01:09Z","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":"ICP outperforms the state-of-the-art temporal prefetcher Triangel by 14.0% and the indirect prefetcher DMP by 6.0%, while requiring only 2.1 KB of hardware storage, over three orders of magnitude smaller than temporal prefetchers."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The assumption that instructions generating irregular addresses recur with stable data-dependency relationships even when the addresses themselves show weak or no temporal recurrence, enabling speculative computation of future accesses from correlated predecessors."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"ICP is a prefetcher that learns stable instruction correlations to speculatively compute future irregular memory accesses, outperforming Triangel by 14% and DMP by 6% with only 2.1 KB storage."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"ICP prefetching exploits stable instruction correlations to handle irregular memory accesses more efficiently than address-based methods."}],"snapshot_sha256":"c7c3874a188f749f14da2138d55a0d5c3a05c18f8b3cea4e606b46d2516d96ec"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":false,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T20:01:19.255791Z","status":"completed","version":"1.0.0"},{"findings_count":1,"name":"doi_compliance","ran_at":"2026-05-19T19:51:34.304526Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T19:33:35.321602Z","status":"skipped","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T17:21:56.092196Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.15645/integrity.json","findings":[{"audited_at":"2026-05-19T19:51:34.304526Z","detected_arxiv_id":null,"detected_doi":"10.1109/isca52012.2021.00099","detector":"doi_compliance","finding_type":"unresolvable_identifier","note":"Identifier '10.1109/isca52012.2021.00099' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","ref_index":45,"severity":"critical","verdict_class":"cross_source"}],"snapshot_sha256":"1d2af08ccd3d1cfb7bee05df1d4cec4eca1e024d65fa78e7ab8ec8cd94b45d48","summary":{"advisory":0,"by_detector":{"doi_compliance":{"advisory":0,"critical":1,"informational":0,"total":1}},"critical":1,"informational":0}},"paper":{"abstract_excerpt":"Irregular memory accesses pose challenges for effective and efficient data prefetching. While temporal prefetchers have recently shown promise for irregular memory access patterns, their effectiveness fundamentally depends on temporal address recurrence and large metadata storage. When memory addresses exhibit weak or no recurrence, as in indirect memory accesses, temporal prefetchers achieve limited performance gains while incurring substantial storage overhead.\n  This paper proposes Instruction-Correlation Prefetching (ICP), a new hardware prefetching mechanism that exploits instruction-leve","authors_text":"Buqing Xu, Ceyu Xu, Chenlu Miao, Mengming Li, Qijun Zhang, Shang Liu, Wenkai Li, Xiangfeng Sun, Yuan Xie, Zhiyao Xie","cross_cats":[],"headline":"ICP prefetching exploits stable instruction correlations to handle irregular memory accesses more efficiently than address-based methods.","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AR","submitted_at":"2026-05-15T06:01:25Z","title":"ICP: Exploiting Instruction Correlation for Prefetching Irregular Memory Accesses"},"references":{"count":60,"internal_anchors":1,"resolved_work":60,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"“Gate equivalent,” https://en.wikipedia.org/wiki/Gate equivalent","work_id":"a2c9b653-54fa-4f9d-86ac-1af216a96426","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"“SPEC CPU 2006,” https://www.spec.org/cpu2006/","work_id":"b9e595b0-9314-4cff-aae4-946123f9c8e6","year":2006},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Ghostminion: A strictness-ordered cache system for spectre mitigation,","work_id":"8a7b1689-b4e3-461a-8ac2-082816214ed9","year":2021},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Graph prefetching using data structure knowledge,","work_id":"281d638a-f8a8-41df-b93a-d8cc774fda43","year":2016},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Software prefetching for indirect memory accesses,","work_id":"80ef0a55-c8ee-46cc-a7ca-073ea5287057","year":2017}],"snapshot_sha256":"861e1b0e31e967b9a1a20052cbad75e860b3fbdc507510e9c77afc9d6ff700e7"},"source":{"id":"2605.15645","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T19:43:27.391209Z","id":"414e9d78-2a17-4961-9b9a-9ba2c3651fbe","model_set":{"reader":"grok-4.3"},"one_line_summary":"ICP is a prefetcher that learns stable instruction correlations to speculatively compute future irregular memory accesses, outperforming Triangel by 14% and DMP by 6% with only 2.1 KB storage.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"ICP prefetching exploits stable instruction correlations to handle irregular memory accesses more efficiently than address-based methods.","strongest_claim":"ICP outperforms the state-of-the-art temporal prefetcher Triangel by 14.0% and the indirect prefetcher DMP by 6.0%, while requiring only 2.1 KB of hardware storage, over three orders of magnitude smaller than temporal prefetchers.","weakest_assumption":"The assumption that instructions generating irregular addresses recur with stable data-dependency relationships even when the addresses themselves show weak or no temporal recurrence, enabling speculative computation of future accesses from correlated predecessors."}},"verdict_id":"414e9d78-2a17-4961-9b9a-9ba2c3651fbe"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4d69aac7766c70b9a8b5f06a9c7e81910d97000546a858052e5a158aa0ff73aa","target":"record","created_at":"2026-05-20T00:01:09Z","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":"f12e77c42a67208fbab7d42ea27c4f78216a9c14a17e8fcb1786a63cd83ff3db","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AR","submitted_at":"2026-05-15T06:01:25Z","title_canon_sha256":"1c2cfe19983f44b393057645d887de7cbbe4c3f1170fe464b72151f38c4c779c"},"schema_version":"1.0","source":{"id":"2605.15645","kind":"arxiv","version":1}},"canonical_sha256":"e18a7f2e72d4fe9015da834e4037ae4369bd4ccd15bde34b1b4836d92ae58261","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e18a7f2e72d4fe9015da834e4037ae4369bd4ccd15bde34b1b4836d92ae58261","first_computed_at":"2026-05-20T00:01:09.841405Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:01:09.841405Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7qRAJSauC3Q+yash6P8ZaX5iN8fmgjzhMTNte5SlkdVR6rm5SApXpd8twAGY08YkVpduPyAzbsBXxcwJkAYEBQ==","signature_status":"signed_v1","signed_at":"2026-05-20T00:01:09.842304Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.15645","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:56b9c9e4845af826a0ba9c76d96ff53d912f05d2306001c10845e9506205ab70","sha256:4d69aac7766c70b9a8b5f06a9c7e81910d97000546a858052e5a158aa0ff73aa","sha256:25c1c38039d095b9cbd09879832b047291b35784521b3e6cee8dae19cd8dc2dd"],"state_sha256":"f5e9268dd9b77fae94be48d564cc816612ccffa3faf05a7509bf32a59407cd49"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uSQ5iEqx59EtFzvQb3SQBYX+Guhd6c1+GrTdzV58TERHDTqNwLMomBnIV0huoEnCKUER1xgMGN3jJZFm8eI9Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T18:01:55.823352Z","bundle_sha256":"de4e5d498ca9019903d59f91b69954afbebb2e254daa4b67bd67dfdfce439d56"}}