{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:Z7PS7VSHV4F47RI5H2KADNPF2S","short_pith_number":"pith:Z7PS7VSH","canonical_record":{"source":{"id":"1907.02167","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2019-07-04T00:28:51Z","cross_cats_sorted":[],"title_canon_sha256":"0f69e1125bc97f99e844273ad00617794f9a669fa8cc967fde1c3b4062131e57","abstract_canon_sha256":"080f45c75f4107ab7d5a92bb318d428942849752d75f4512a015058fabc88112"},"schema_version":"1.0"},"canonical_sha256":"cfdf2fd647af0bcfc51d3e9401b5e5d4bc3ad49f24db375108e7b4a64d48827d","source":{"kind":"arxiv","id":"1907.02167","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.02167","created_at":"2026-05-17T23:41:29Z"},{"alias_kind":"arxiv_version","alias_value":"1907.02167v1","created_at":"2026-05-17T23:41:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.02167","created_at":"2026-05-17T23:41:29Z"},{"alias_kind":"pith_short_12","alias_value":"Z7PS7VSHV4F4","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"Z7PS7VSHV4F47RI5","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"Z7PS7VSH","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:Z7PS7VSHV4F47RI5H2KADNPF2S","target":"record","payload":{"canonical_record":{"source":{"id":"1907.02167","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2019-07-04T00:28:51Z","cross_cats_sorted":[],"title_canon_sha256":"0f69e1125bc97f99e844273ad00617794f9a669fa8cc967fde1c3b4062131e57","abstract_canon_sha256":"080f45c75f4107ab7d5a92bb318d428942849752d75f4512a015058fabc88112"},"schema_version":"1.0"},"canonical_sha256":"cfdf2fd647af0bcfc51d3e9401b5e5d4bc3ad49f24db375108e7b4a64d48827d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:29.571082Z","signature_b64":"up+c/SvNfSPxAsd4kNLMAahBUFDEgKJBT6rpfcMduR4MlEG3X4iOOEzAAoccgPAXZ96ATRXYQfgeV6DdT1P+DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cfdf2fd647af0bcfc51d3e9401b5e5d4bc3ad49f24db375108e7b4a64d48827d","last_reissued_at":"2026-05-17T23:41:29.570127Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:29.570127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.02167","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-17T23:41:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sNnbhhc4hbdLuuNOsrpGfqXC276l8Ha8VYNsPYEyxUZ+EvSNz3qOuMWh5vx4KEvYfBAI0ujDgqr7sZxE2R3ODw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T10:17:42.607879Z"},"content_sha256":"1600d563ec1a09cd2de93d368dab246eb0aef0cacc53937fd56ec5b65ae36072","schema_version":"1.0","event_id":"sha256:1600d563ec1a09cd2de93d368dab246eb0aef0cacc53937fd56ec5b65ae36072"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:Z7PS7VSHV4F47RI5H2KADNPF2S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"To Update or Not To Update?: Bandwidth-Efficient Intelligent Replacement Policies for DRAM Caches","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Moinuddin K. Qureshi, Vinson Young","submitted_at":"2019-07-04T00:28:51Z","abstract_excerpt":"This paper investigates intelligent replacement policies for improving the hit-rate of gigascale DRAM caches. Cache replacement policies are commonly used to improve the hit-rate of on-chip caches. The most effective replacement policies often require the cache to track per-line reuse state to inform their decision. A fundamental challenge on DRAM caches, however, is that stateful policies would require significant bandwidth to maintain per-line DRAM cache state. As such, DRAM cache replacement policies have primarily been stateless policies, such as always-install or probabilistic bypass. Unf"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.02167","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-17T23:41:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NePPACgdv/XeFv/hEsSjEPPRPuOKuNmRHOtJfv2RuixktvpzEfe8gayHNS2/5gEQkOH82Eo4k/IHiY3ficD/BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T10:17:42.608568Z"},"content_sha256":"7092c4f8d233599496fa5c95289ef8d8bcceff0a41ce4bb1d10cbb473dd8f1f6","schema_version":"1.0","event_id":"sha256:7092c4f8d233599496fa5c95289ef8d8bcceff0a41ce4bb1d10cbb473dd8f1f6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z7PS7VSHV4F47RI5H2KADNPF2S/bundle.json","state_url":"https://pith.science/pith/Z7PS7VSHV4F47RI5H2KADNPF2S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z7PS7VSHV4F47RI5H2KADNPF2S/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-31T10:17:42Z","links":{"resolver":"https://pith.science/pith/Z7PS7VSHV4F47RI5H2KADNPF2S","bundle":"https://pith.science/pith/Z7PS7VSHV4F47RI5H2KADNPF2S/bundle.json","state":"https://pith.science/pith/Z7PS7VSHV4F47RI5H2KADNPF2S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z7PS7VSHV4F47RI5H2KADNPF2S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:Z7PS7VSHV4F47RI5H2KADNPF2S","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":"080f45c75f4107ab7d5a92bb318d428942849752d75f4512a015058fabc88112","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2019-07-04T00:28:51Z","title_canon_sha256":"0f69e1125bc97f99e844273ad00617794f9a669fa8cc967fde1c3b4062131e57"},"schema_version":"1.0","source":{"id":"1907.02167","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.02167","created_at":"2026-05-17T23:41:29Z"},{"alias_kind":"arxiv_version","alias_value":"1907.02167v1","created_at":"2026-05-17T23:41:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.02167","created_at":"2026-05-17T23:41:29Z"},{"alias_kind":"pith_short_12","alias_value":"Z7PS7VSHV4F4","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"Z7PS7VSHV4F47RI5","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"Z7PS7VSH","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:7092c4f8d233599496fa5c95289ef8d8bcceff0a41ce4bb1d10cbb473dd8f1f6","target":"graph","created_at":"2026-05-17T23:41:29Z","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 investigates intelligent replacement policies for improving the hit-rate of gigascale DRAM caches. Cache replacement policies are commonly used to improve the hit-rate of on-chip caches. The most effective replacement policies often require the cache to track per-line reuse state to inform their decision. A fundamental challenge on DRAM caches, however, is that stateful policies would require significant bandwidth to maintain per-line DRAM cache state. As such, DRAM cache replacement policies have primarily been stateless policies, such as always-install or probabilistic bypass. Unf","authors_text":"Moinuddin K. Qureshi, Vinson Young","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2019-07-04T00:28:51Z","title":"To Update or Not To Update?: Bandwidth-Efficient Intelligent Replacement Policies for DRAM Caches"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.02167","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:1600d563ec1a09cd2de93d368dab246eb0aef0cacc53937fd56ec5b65ae36072","target":"record","created_at":"2026-05-17T23:41:29Z","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":"080f45c75f4107ab7d5a92bb318d428942849752d75f4512a015058fabc88112","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2019-07-04T00:28:51Z","title_canon_sha256":"0f69e1125bc97f99e844273ad00617794f9a669fa8cc967fde1c3b4062131e57"},"schema_version":"1.0","source":{"id":"1907.02167","kind":"arxiv","version":1}},"canonical_sha256":"cfdf2fd647af0bcfc51d3e9401b5e5d4bc3ad49f24db375108e7b4a64d48827d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cfdf2fd647af0bcfc51d3e9401b5e5d4bc3ad49f24db375108e7b4a64d48827d","first_computed_at":"2026-05-17T23:41:29.570127Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:29.570127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"up+c/SvNfSPxAsd4kNLMAahBUFDEgKJBT6rpfcMduR4MlEG3X4iOOEzAAoccgPAXZ96ATRXYQfgeV6DdT1P+DA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:29.571082Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.02167","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1600d563ec1a09cd2de93d368dab246eb0aef0cacc53937fd56ec5b65ae36072","sha256:7092c4f8d233599496fa5c95289ef8d8bcceff0a41ce4bb1d10cbb473dd8f1f6"],"state_sha256":"3d74b19045eb58c0e91242819aa18fd5c71a322e1926b11ffe2f0884e2fe9515"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oKtFd/aVK0NL4rmlerSgr75s78zbyBksWdCMBdNZVdOViTNRgtC8UFxzad8CI2PUcVN5T5GeXBfinAJQiUakCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T10:17:42.612407Z","bundle_sha256":"6d1c1b3d5608ca64bda713e359b0e3133ede005cf82d5df3277d9608a3d341ae"}}