{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:PWGEH33UU2O7HASJ4N2TBCFQBR","short_pith_number":"pith:PWGEH33U","canonical_record":{"source":{"id":"1608.07485","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2016-08-26T15:04:20Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"c7f4655539980d30a55586935a8d82714e1950c39bd2140c069808e15ff466ce","abstract_canon_sha256":"417714a452977b7e2835ed965cf1afbd8d4479d08c49d7778947feac53182d98"},"schema_version":"1.0"},"canonical_sha256":"7d8c43ef74a69df38249e3753088b00c4bee41e55a9441c1f57039ba00a0f30f","source":{"kind":"arxiv","id":"1608.07485","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.07485","created_at":"2026-05-18T01:07:52Z"},{"alias_kind":"arxiv_version","alias_value":"1608.07485v1","created_at":"2026-05-18T01:07:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.07485","created_at":"2026-05-18T01:07:52Z"},{"alias_kind":"pith_short_12","alias_value":"PWGEH33UU2O7","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PWGEH33UU2O7HASJ","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PWGEH33U","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:PWGEH33UU2O7HASJ4N2TBCFQBR","target":"record","payload":{"canonical_record":{"source":{"id":"1608.07485","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2016-08-26T15:04:20Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"c7f4655539980d30a55586935a8d82714e1950c39bd2140c069808e15ff466ce","abstract_canon_sha256":"417714a452977b7e2835ed965cf1afbd8d4479d08c49d7778947feac53182d98"},"schema_version":"1.0"},"canonical_sha256":"7d8c43ef74a69df38249e3753088b00c4bee41e55a9441c1f57039ba00a0f30f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:07:52.918229Z","signature_b64":"RA9dwQjoJL27Rz7ARGxWoIGge/Ct24kecslKaTAw1pFYXmiJ9tF/RIyi9VK4flMpfoXp5ocl/Cu45UkVdYFKDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d8c43ef74a69df38249e3753088b00c4bee41e55a9441c1f57039ba00a0f30f","last_reissued_at":"2026-05-18T01:07:52.917703Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:07:52.917703Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.07485","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-18T01:07:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nwxaOTfFDSg7GaO/hvnWfVKd7PteWJOPBV6GBk79EtRRSnkJFk/JgEzbM/SiPwRsJCDIMRxCLlYk+2/UmPK/Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T16:01:18.511573Z"},"content_sha256":"8e853714169b3e1453d2077e130ffb9f2613f2a4406bca9776711914947680c0","schema_version":"1.0","event_id":"sha256:8e853714169b3e1453d2077e130ffb9f2613f2a4406bca9776711914947680c0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:PWGEH33UU2O7HASJ4N2TBCFQBR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"When to use 3D Die-Stacked Memory for Bandwidth-Constrained Big Data Workloads","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.AR","authors_text":"David A. Wood, Jason Lowe-Power, Mark D. Hill","submitted_at":"2016-08-26T15:04:20Z","abstract_excerpt":"Response time requirements for big data processing systems are shrinking. To meet this strict response time requirement, many big data systems store all or most of their data in main memory to reduce the access latency. Main memory capacities have grown, and systems with 2 TB of main memory capacity available today. However, the rate at which processors can access this data--the memory bandwidth--has not grown at the same rate. In fact, some of these big-memory systems can access less than 10% of their main memory capacity in one second (billions of processor cycles).\n  3D die-stacking is one "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.07485","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-18T01:07:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2/P+omvH+5fQsI02rHt3KcvRhSG0Wd4F4O5LwC3a9Cm92sO1OiH2yBMeDJ0P1pAQA7ANxMevu7b2PHJRn2KLCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T16:01:18.511930Z"},"content_sha256":"17c80be8303305307a2421104207910bc8ac270aecf794601945fc741d11ce5a","schema_version":"1.0","event_id":"sha256:17c80be8303305307a2421104207910bc8ac270aecf794601945fc741d11ce5a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PWGEH33UU2O7HASJ4N2TBCFQBR/bundle.json","state_url":"https://pith.science/pith/PWGEH33UU2O7HASJ4N2TBCFQBR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PWGEH33UU2O7HASJ4N2TBCFQBR/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-06-09T16:01:18Z","links":{"resolver":"https://pith.science/pith/PWGEH33UU2O7HASJ4N2TBCFQBR","bundle":"https://pith.science/pith/PWGEH33UU2O7HASJ4N2TBCFQBR/bundle.json","state":"https://pith.science/pith/PWGEH33UU2O7HASJ4N2TBCFQBR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PWGEH33UU2O7HASJ4N2TBCFQBR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:PWGEH33UU2O7HASJ4N2TBCFQBR","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":"417714a452977b7e2835ed965cf1afbd8d4479d08c49d7778947feac53182d98","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2016-08-26T15:04:20Z","title_canon_sha256":"c7f4655539980d30a55586935a8d82714e1950c39bd2140c069808e15ff466ce"},"schema_version":"1.0","source":{"id":"1608.07485","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.07485","created_at":"2026-05-18T01:07:52Z"},{"alias_kind":"arxiv_version","alias_value":"1608.07485v1","created_at":"2026-05-18T01:07:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.07485","created_at":"2026-05-18T01:07:52Z"},{"alias_kind":"pith_short_12","alias_value":"PWGEH33UU2O7","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PWGEH33UU2O7HASJ","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PWGEH33U","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:17c80be8303305307a2421104207910bc8ac270aecf794601945fc741d11ce5a","target":"graph","created_at":"2026-05-18T01:07:52Z","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":"Response time requirements for big data processing systems are shrinking. To meet this strict response time requirement, many big data systems store all or most of their data in main memory to reduce the access latency. Main memory capacities have grown, and systems with 2 TB of main memory capacity available today. However, the rate at which processors can access this data--the memory bandwidth--has not grown at the same rate. In fact, some of these big-memory systems can access less than 10% of their main memory capacity in one second (billions of processor cycles).\n  3D die-stacking is one ","authors_text":"David A. Wood, Jason Lowe-Power, Mark D. Hill","cross_cats":["cs.DB"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2016-08-26T15:04:20Z","title":"When to use 3D Die-Stacked Memory for Bandwidth-Constrained Big Data Workloads"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.07485","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:8e853714169b3e1453d2077e130ffb9f2613f2a4406bca9776711914947680c0","target":"record","created_at":"2026-05-18T01:07:52Z","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":"417714a452977b7e2835ed965cf1afbd8d4479d08c49d7778947feac53182d98","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2016-08-26T15:04:20Z","title_canon_sha256":"c7f4655539980d30a55586935a8d82714e1950c39bd2140c069808e15ff466ce"},"schema_version":"1.0","source":{"id":"1608.07485","kind":"arxiv","version":1}},"canonical_sha256":"7d8c43ef74a69df38249e3753088b00c4bee41e55a9441c1f57039ba00a0f30f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7d8c43ef74a69df38249e3753088b00c4bee41e55a9441c1f57039ba00a0f30f","first_computed_at":"2026-05-18T01:07:52.917703Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:07:52.917703Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RA9dwQjoJL27Rz7ARGxWoIGge/Ct24kecslKaTAw1pFYXmiJ9tF/RIyi9VK4flMpfoXp5ocl/Cu45UkVdYFKDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:07:52.918229Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.07485","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8e853714169b3e1453d2077e130ffb9f2613f2a4406bca9776711914947680c0","sha256:17c80be8303305307a2421104207910bc8ac270aecf794601945fc741d11ce5a"],"state_sha256":"ed23bc4809e838a9031b5b710263a50f1e1a4db94863bc56134bbb8dc043fe90"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ob+rSAB6vvog7u/JaqehmWgqfoGZb5SGKpWAN7NcSIKKOTZ0i5nOdV3PMwfkb5GPqH4/qLwEgYvwSTOzouC4DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T16:01:18.513876Z","bundle_sha256":"df184af2fdbc783aa62f4a6161d97af8d4ce9eaa9aa8651d92bbc311d94d24dd"}}