{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:7WFKVGNH5RGJAFI3NB76GAOD7C","short_pith_number":"pith:7WFKVGNH","schema_version":"1.0","canonical_sha256":"fd8aaa99a7ec4c90151b687fe301c3f8bc406320af2100e7c8077858152fbdeb","source":{"kind":"arxiv","id":"1805.03969","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1805.03969","created_at":"2026-05-18T00:16:15.658756+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.03969v1","created_at":"2026-05-18T00:16:15.658756+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03969","created_at":"2026-05-18T00:16:15.658756+00:00"},{"alias_kind":"pith_short_12","alias_value":"7WFKVGNH5RGJ","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"7WFKVGNH5RGJAFI3","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"7WFKVGNH","created_at":"2026-05-18T12:32:11.075285+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7WFKVGNH5RGJAFI3NB76GAOD7C","json":"https://pith.science/pith/7WFKVGNH5RGJAFI3NB76GAOD7C.json","graph_json":"https://pith.science/api/pith-number/7WFKVGNH5RGJAFI3NB76GAOD7C/graph.json","events_json":"https://pith.science/api/pith-number/7WFKVGNH5RGJAFI3NB76GAOD7C/events.json","paper":"https://pith.science/paper/7WFKVGNH"},"agent_actions":{"view_html":"https://pith.science/pith/7WFKVGNH5RGJAFI3NB76GAOD7C","download_json":"https://pith.science/pith/7WFKVGNH5RGJAFI3NB76GAOD7C.json","view_paper":"https://pith.science/paper/7WFKVGNH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.03969&json=true","fetch_graph":"https://pith.science/api/pith-number/7WFKVGNH5RGJAFI3NB76GAOD7C/graph.json","fetch_events":"https://pith.science/api/pith-number/7WFKVGNH5RGJAFI3NB76GAOD7C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7WFKVGNH5RGJAFI3NB76GAOD7C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7WFKVGNH5RGJAFI3NB76GAOD7C/action/storage_attestation","attest_author":"https://pith.science/pith/7WFKVGNH5RGJAFI3NB76GAOD7C/action/author_attestation","sign_citation":"https://pith.science/pith/7WFKVGNH5RGJAFI3NB76GAOD7C/action/citation_signature","submit_replication":"https://pith.science/pith/7WFKVGNH5RGJAFI3NB76GAOD7C/action/replication_record"}},"created_at":"2026-05-18T00:16:15.658756+00:00","updated_at":"2026-05-18T00:16:15.658756+00:00"}