{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:7XEAQXOZJYP7TH4TC3EEAELXTX","short_pith_number":"pith:7XEAQXOZ","schema_version":"1.0","canonical_sha256":"fdc8085dd94e1ff99f9316c84011779dee1bc58916d7a15adca324ade401a452","source":{"kind":"arxiv","id":"1805.03048","version":1},"attestation_state":"computed","paper":{"title":"Tiered-Latency DRAM: Enabling Low-Latency Main Memory at Low Cost","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Donghyuk Lee, Jamie Liu, Lavanya Subramanian, Onur Mutlu, Vivek Seshadri, Yoongu Kim","submitted_at":"2018-05-04T19:31:43Z","abstract_excerpt":"This paper summarizes the idea of Tiered-Latency DRAM (TL-DRAM), which was published in HPCA 2013, and examines the work's significance and future potential. The capacity and cost-per-bit of DRAM have historically scaled to satisfy the needs of increasingly large and complex computer systems. However, DRAM latency has remained almost constant, making memory latency the performance bottleneck in today's systems. We observe that the high access latency is not intrinsic to DRAM, but a trade-off is made to decrease the cost per bit. To mitigate the high area overhead of DRAM sensing structures, co"},"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.03048","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2018-05-04T19:31:43Z","cross_cats_sorted":[],"title_canon_sha256":"dd2742326f19614d3c5e42a988d1c9ebaa2ae89eaa60acea4a50f654fab62356","abstract_canon_sha256":"3b2f9030ad1c73404175de335eec6c240eb17c22c19a2b423090e03b47140ef9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:34.788581Z","signature_b64":"fxT4NgPb6DyGpMba3oMIncEE5XOMEsrWcqIhU3a4a6dHFrZrmMX+jTDta1E1OPpJxPDR01aQYtZA8POncHnjCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fdc8085dd94e1ff99f9316c84011779dee1bc58916d7a15adca324ade401a452","last_reissued_at":"2026-05-18T00:16:34.787960Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:34.787960Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tiered-Latency DRAM: Enabling Low-Latency Main Memory at Low Cost","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Donghyuk Lee, Jamie Liu, Lavanya Subramanian, Onur Mutlu, Vivek Seshadri, Yoongu Kim","submitted_at":"2018-05-04T19:31:43Z","abstract_excerpt":"This paper summarizes the idea of Tiered-Latency DRAM (TL-DRAM), which was published in HPCA 2013, and examines the work's significance and future potential. The capacity and cost-per-bit of DRAM have historically scaled to satisfy the needs of increasingly large and complex computer systems. However, DRAM latency has remained almost constant, making memory latency the performance bottleneck in today's systems. We observe that the high access latency is not intrinsic to DRAM, but a trade-off is made to decrease the cost per bit. To mitigate the high area overhead of DRAM sensing structures, co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.03048","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.03048","created_at":"2026-05-18T00:16:34.788052+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.03048v1","created_at":"2026-05-18T00:16:34.788052+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03048","created_at":"2026-05-18T00:16:34.788052+00:00"},{"alias_kind":"pith_short_12","alias_value":"7XEAQXOZJYP7","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"7XEAQXOZJYP7TH4T","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"7XEAQXOZ","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/7XEAQXOZJYP7TH4TC3EEAELXTX","json":"https://pith.science/pith/7XEAQXOZJYP7TH4TC3EEAELXTX.json","graph_json":"https://pith.science/api/pith-number/7XEAQXOZJYP7TH4TC3EEAELXTX/graph.json","events_json":"https://pith.science/api/pith-number/7XEAQXOZJYP7TH4TC3EEAELXTX/events.json","paper":"https://pith.science/paper/7XEAQXOZ"},"agent_actions":{"view_html":"https://pith.science/pith/7XEAQXOZJYP7TH4TC3EEAELXTX","download_json":"https://pith.science/pith/7XEAQXOZJYP7TH4TC3EEAELXTX.json","view_paper":"https://pith.science/paper/7XEAQXOZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.03048&json=true","fetch_graph":"https://pith.science/api/pith-number/7XEAQXOZJYP7TH4TC3EEAELXTX/graph.json","fetch_events":"https://pith.science/api/pith-number/7XEAQXOZJYP7TH4TC3EEAELXTX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7XEAQXOZJYP7TH4TC3EEAELXTX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7XEAQXOZJYP7TH4TC3EEAELXTX/action/storage_attestation","attest_author":"https://pith.science/pith/7XEAQXOZJYP7TH4TC3EEAELXTX/action/author_attestation","sign_citation":"https://pith.science/pith/7XEAQXOZJYP7TH4TC3EEAELXTX/action/citation_signature","submit_replication":"https://pith.science/pith/7XEAQXOZJYP7TH4TC3EEAELXTX/action/replication_record"}},"created_at":"2026-05-18T00:16:34.788052+00:00","updated_at":"2026-05-18T00:16:34.788052+00:00"}