{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:7WFKVGNH5RGJAFI3NB76GAOD7C","short_pith_number":"pith:7WFKVGNH","canonical_record":{"source":{"id":"1805.03969","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2018-05-08T18:08:23Z","cross_cats_sorted":[],"title_canon_sha256":"a478d4ae9b9bf6f7ea5024ab79f2f970a1cbb2b48ea130965228a21998df0fc4","abstract_canon_sha256":"75a7e5f6192208c022a14d03884f7235c867c2fd56d3a5d3ba30cd7682809d3f"},"schema_version":"1.0"},"canonical_sha256":"fd8aaa99a7ec4c90151b687fe301c3f8bc406320af2100e7c8077858152fbdeb","source":{"kind":"arxiv","id":"1805.03969","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.03969","created_at":"2026-05-18T00:16:15Z"},{"alias_kind":"arxiv_version","alias_value":"1805.03969v1","created_at":"2026-05-18T00:16:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03969","created_at":"2026-05-18T00:16:15Z"},{"alias_kind":"pith_short_12","alias_value":"7WFKVGNH5RGJ","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7WFKVGNH5RGJAFI3","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7WFKVGNH","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:7WFKVGNH5RGJAFI3NB76GAOD7C","target":"record","payload":{"canonical_record":{"source":{"id":"1805.03969","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2018-05-08T18:08:23Z","cross_cats_sorted":[],"title_canon_sha256":"a478d4ae9b9bf6f7ea5024ab79f2f970a1cbb2b48ea130965228a21998df0fc4","abstract_canon_sha256":"75a7e5f6192208c022a14d03884f7235c867c2fd56d3a5d3ba30cd7682809d3f"},"schema_version":"1.0"},"canonical_sha256":"fd8aaa99a7ec4c90151b687fe301c3f8bc406320af2100e7c8077858152fbdeb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:15.659223Z","signature_b64":"Wm7I9HnSmA39D9/tuh8l51LGLJQaWDi+40gyO2HYxuPofgSSAvvZWdWqcLcp+KiWm39HA+BrABvEe4zjlHuICA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd8aaa99a7ec4c90151b687fe301c3f8bc406320af2100e7c8077858152fbdeb","last_reissued_at":"2026-05-18T00:16:15.658669Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:15.658669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.03969","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-18T00:16:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oECsqODkOxS17izN/NB5BFRWSTwnlhkIX4CmJrGiIx1IqDeAzdeD4LoT1PTQpb47ww5HJco7woHJSOWFgTkDDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T03:26:08.147644Z"},"content_sha256":"d2660bc64dfcd5481a95b76a4d9b09a9be671436403c150fc33dedbd758a3808","schema_version":"1.0","event_id":"sha256:d2660bc64dfcd5481a95b76a4d9b09a9be671436403c150fc33dedbd758a3808"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:7WFKVGNH5RGJAFI3NB76GAOD7C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exploiting Row-Level Temporal Locality in DRAM to Reduce the Memory Access Latency","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Donghyuk Lee, Gennady Pekhimenko, Hasan Hassan, Nandita Vijaykumar, Oguz Ergin, Onur Mutlu, Vivek Seshadri","submitted_at":"2018-05-08T18:08:23Z","abstract_excerpt":"This paper summarizes the idea of ChargeCache, which was published in HPCA 2016 [51], and examines the work's significance and future potential. DRAM latency continues to be a critical bottleneck for system performance. In this work, we develop a low-cost mechanism, called ChargeCache, that enables faster access to recently-accessed rows in DRAM, with no modifications to DRAM chips. Our mechanism is based on the key observation that a recently-accessed row has more charge and thus the following access to the same row can be performed faster. To exploit this observation, we propose to track the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.03969","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"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":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:16:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u6F513GfX+zQzQIAxQw+uNaLAwrKoMTsGK3v2KM3WX4uNfxPpVS7op7t0qitzxmZXQmhSvx1qR30sfJeitcDBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T03:26:08.148295Z"},"content_sha256":"47f0fdcc80b76d0ae10e359bff1b81f55565116eab23b09d7c028107bf9ce64b","schema_version":"1.0","event_id":"sha256:47f0fdcc80b76d0ae10e359bff1b81f55565116eab23b09d7c028107bf9ce64b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7WFKVGNH5RGJAFI3NB76GAOD7C/bundle.json","state_url":"https://pith.science/pith/7WFKVGNH5RGJAFI3NB76GAOD7C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7WFKVGNH5RGJAFI3NB76GAOD7C/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-24T03:26:08Z","links":{"resolver":"https://pith.science/pith/7WFKVGNH5RGJAFI3NB76GAOD7C","bundle":"https://pith.science/pith/7WFKVGNH5RGJAFI3NB76GAOD7C/bundle.json","state":"https://pith.science/pith/7WFKVGNH5RGJAFI3NB76GAOD7C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7WFKVGNH5RGJAFI3NB76GAOD7C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:7WFKVGNH5RGJAFI3NB76GAOD7C","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"75a7e5f6192208c022a14d03884f7235c867c2fd56d3a5d3ba30cd7682809d3f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2018-05-08T18:08:23Z","title_canon_sha256":"a478d4ae9b9bf6f7ea5024ab79f2f970a1cbb2b48ea130965228a21998df0fc4"},"schema_version":"1.0","source":{"id":"1805.03969","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.03969","created_at":"2026-05-18T00:16:15Z"},{"alias_kind":"arxiv_version","alias_value":"1805.03969v1","created_at":"2026-05-18T00:16:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03969","created_at":"2026-05-18T00:16:15Z"},{"alias_kind":"pith_short_12","alias_value":"7WFKVGNH5RGJ","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7WFKVGNH5RGJAFI3","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7WFKVGNH","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:47f0fdcc80b76d0ae10e359bff1b81f55565116eab23b09d7c028107bf9ce64b","target":"graph","created_at":"2026-05-18T00:16:15Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"This paper summarizes the idea of ChargeCache, which was published in HPCA 2016 [51], and examines the work's significance and future potential. DRAM latency continues to be a critical bottleneck for system performance. In this work, we develop a low-cost mechanism, called ChargeCache, that enables faster access to recently-accessed rows in DRAM, with no modifications to DRAM chips. Our mechanism is based on the key observation that a recently-accessed row has more charge and thus the following access to the same row can be performed faster. To exploit this observation, we propose to track the","authors_text":"Donghyuk Lee, Gennady Pekhimenko, Hasan Hassan, Nandita Vijaykumar, Oguz Ergin, Onur Mutlu, Vivek Seshadri","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2018-05-08T18:08:23Z","title":"Exploiting Row-Level Temporal Locality in DRAM to Reduce the Memory Access Latency"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.03969","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d2660bc64dfcd5481a95b76a4d9b09a9be671436403c150fc33dedbd758a3808","target":"record","created_at":"2026-05-18T00:16:15Z","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":"75a7e5f6192208c022a14d03884f7235c867c2fd56d3a5d3ba30cd7682809d3f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2018-05-08T18:08:23Z","title_canon_sha256":"a478d4ae9b9bf6f7ea5024ab79f2f970a1cbb2b48ea130965228a21998df0fc4"},"schema_version":"1.0","source":{"id":"1805.03969","kind":"arxiv","version":1}},"canonical_sha256":"fd8aaa99a7ec4c90151b687fe301c3f8bc406320af2100e7c8077858152fbdeb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fd8aaa99a7ec4c90151b687fe301c3f8bc406320af2100e7c8077858152fbdeb","first_computed_at":"2026-05-18T00:16:15.658669Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:15.658669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Wm7I9HnSmA39D9/tuh8l51LGLJQaWDi+40gyO2HYxuPofgSSAvvZWdWqcLcp+KiWm39HA+BrABvEe4zjlHuICA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:15.659223Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.03969","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d2660bc64dfcd5481a95b76a4d9b09a9be671436403c150fc33dedbd758a3808","sha256:47f0fdcc80b76d0ae10e359bff1b81f55565116eab23b09d7c028107bf9ce64b"],"state_sha256":"66a6836a055a4dbf6e2ef66e409d4444323c78af18a850fcb3db97054376b82b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LvSFWguq3fX+hcVGNAdUyaZo+ZJ8U9LhS5ESO7t+G/MU78Bnq/tOR/NYylDyYDNOA1Eee/MSdWEG0lqWMqVxBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T03:26:08.151684Z","bundle_sha256":"e05e9ce0e03678811cf9c889705a54951ddf1e4d2f2f95ee72597aec5c7cb390"}}