{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:MTOKSMJSCTFLTT67VPUBT725LQ","short_pith_number":"pith:MTOKSMJS","canonical_record":{"source":{"id":"1803.06068","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2018-03-16T03:39:45Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"04fa1221db8f620f5361a84882a926f596305438d6b7ff88e9b464a297979d3e","abstract_canon_sha256":"adeaa9c807d911553caa181970c8e3a0e11e23e7bd50d62e1c469bbd6f928982"},"schema_version":"1.0"},"canonical_sha256":"64dca9313214cab9cfdfabe819ff5d5c17d431b42a83e65852cf1ca53a0b6ac4","source":{"kind":"arxiv","id":"1803.06068","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.06068","created_at":"2026-05-18T00:20:50Z"},{"alias_kind":"arxiv_version","alias_value":"1803.06068v1","created_at":"2026-05-18T00:20:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06068","created_at":"2026-05-18T00:20:50Z"},{"alias_kind":"pith_short_12","alias_value":"MTOKSMJSCTFL","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"MTOKSMJSCTFLTT67","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"MTOKSMJS","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:MTOKSMJSCTFLTT67VPUBT725LQ","target":"record","payload":{"canonical_record":{"source":{"id":"1803.06068","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2018-03-16T03:39:45Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"04fa1221db8f620f5361a84882a926f596305438d6b7ff88e9b464a297979d3e","abstract_canon_sha256":"adeaa9c807d911553caa181970c8e3a0e11e23e7bd50d62e1c469bbd6f928982"},"schema_version":"1.0"},"canonical_sha256":"64dca9313214cab9cfdfabe819ff5d5c17d431b42a83e65852cf1ca53a0b6ac4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:50.788191Z","signature_b64":"STxj+sXjH3MZXKFeycHvg8B4pOCKi0qEWER27Yr964QUSy4H2/XI3yLVtSXQqlwnZzYhL1jFdPLl+nnucULkCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64dca9313214cab9cfdfabe819ff5d5c17d431b42a83e65852cf1ca53a0b6ac4","last_reissued_at":"2026-05-18T00:20:50.786191Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:50.786191Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.06068","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:20:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+wXsRSUxg4VX0FGOrODvEDRusnKdVmQnlfs4QlIQwqy5dDZD28GBtZnuC65r3+SrY7DCn2aShrbaKVot1eeABA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T19:58:35.147834Z"},"content_sha256":"8485817e4a93ca009478c8f7eab943a5a445d149e110467605caf805e6c42f5f","schema_version":"1.0","event_id":"sha256:8485817e4a93ca009478c8f7eab943a5a445d149e110467605caf805e6c42f5f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:MTOKSMJSCTFLTT67VPUBT725LQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Memory Slices: A Modular Building Block for Scalable, Intelligent Memory Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"cs.AR","authors_text":"Bahar Asgari, Saibal Mukhopadhyay, Sudhakar Yalamanchili","submitted_at":"2018-03-16T03:39:45Z","abstract_excerpt":"While reduction in feature size makes computation cheaper in terms of latency, area, and power consumption, performance of emerging data-intensive applications is determined by data movement. These trends have introduced the concept of scalability as reaching a desirable performance per unit cost by using as few number of units as possible. Many proposals have moved compute closer to the memory. However, these efforts ignored maintaining a balance between bandwidth and compute rate of an architecture, with those of applications, which is a key principle in designing scalable large systems. Thi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.06068","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:20:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"feONeV+jV1IQYndM8z6Tq5fhFw4WlSFeWTiIkPhDTgd1E5tf/3LVCAxu6gywc5EIX6DnnqU40DWzRPPDuPLkBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T19:58:35.148180Z"},"content_sha256":"e0dd334df9ab01ffe6b7915641dbc54c0386b5de45f3203625c5d6751d650ee4","schema_version":"1.0","event_id":"sha256:e0dd334df9ab01ffe6b7915641dbc54c0386b5de45f3203625c5d6751d650ee4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MTOKSMJSCTFLTT67VPUBT725LQ/bundle.json","state_url":"https://pith.science/pith/MTOKSMJSCTFLTT67VPUBT725LQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MTOKSMJSCTFLTT67VPUBT725LQ/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-23T19:58:35Z","links":{"resolver":"https://pith.science/pith/MTOKSMJSCTFLTT67VPUBT725LQ","bundle":"https://pith.science/pith/MTOKSMJSCTFLTT67VPUBT725LQ/bundle.json","state":"https://pith.science/pith/MTOKSMJSCTFLTT67VPUBT725LQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MTOKSMJSCTFLTT67VPUBT725LQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:MTOKSMJSCTFLTT67VPUBT725LQ","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":"adeaa9c807d911553caa181970c8e3a0e11e23e7bd50d62e1c469bbd6f928982","cross_cats_sorted":["cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2018-03-16T03:39:45Z","title_canon_sha256":"04fa1221db8f620f5361a84882a926f596305438d6b7ff88e9b464a297979d3e"},"schema_version":"1.0","source":{"id":"1803.06068","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.06068","created_at":"2026-05-18T00:20:50Z"},{"alias_kind":"arxiv_version","alias_value":"1803.06068v1","created_at":"2026-05-18T00:20:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06068","created_at":"2026-05-18T00:20:50Z"},{"alias_kind":"pith_short_12","alias_value":"MTOKSMJSCTFL","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"MTOKSMJSCTFLTT67","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"MTOKSMJS","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:e0dd334df9ab01ffe6b7915641dbc54c0386b5de45f3203625c5d6751d650ee4","target":"graph","created_at":"2026-05-18T00:20:50Z","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":"While reduction in feature size makes computation cheaper in terms of latency, area, and power consumption, performance of emerging data-intensive applications is determined by data movement. These trends have introduced the concept of scalability as reaching a desirable performance per unit cost by using as few number of units as possible. Many proposals have moved compute closer to the memory. However, these efforts ignored maintaining a balance between bandwidth and compute rate of an architecture, with those of applications, which is a key principle in designing scalable large systems. Thi","authors_text":"Bahar Asgari, Saibal Mukhopadhyay, Sudhakar Yalamanchili","cross_cats":["cs.PF"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2018-03-16T03:39:45Z","title":"Memory Slices: A Modular Building Block for Scalable, Intelligent Memory Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.06068","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:8485817e4a93ca009478c8f7eab943a5a445d149e110467605caf805e6c42f5f","target":"record","created_at":"2026-05-18T00:20:50Z","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":"adeaa9c807d911553caa181970c8e3a0e11e23e7bd50d62e1c469bbd6f928982","cross_cats_sorted":["cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2018-03-16T03:39:45Z","title_canon_sha256":"04fa1221db8f620f5361a84882a926f596305438d6b7ff88e9b464a297979d3e"},"schema_version":"1.0","source":{"id":"1803.06068","kind":"arxiv","version":1}},"canonical_sha256":"64dca9313214cab9cfdfabe819ff5d5c17d431b42a83e65852cf1ca53a0b6ac4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"64dca9313214cab9cfdfabe819ff5d5c17d431b42a83e65852cf1ca53a0b6ac4","first_computed_at":"2026-05-18T00:20:50.786191Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:50.786191Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"STxj+sXjH3MZXKFeycHvg8B4pOCKi0qEWER27Yr964QUSy4H2/XI3yLVtSXQqlwnZzYhL1jFdPLl+nnucULkCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:50.788191Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.06068","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8485817e4a93ca009478c8f7eab943a5a445d149e110467605caf805e6c42f5f","sha256:e0dd334df9ab01ffe6b7915641dbc54c0386b5de45f3203625c5d6751d650ee4"],"state_sha256":"00a4f516da384b536331f39c43f59e8f108ac778e06f6f23aad73ba7b1ace4a0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oD8pwfLYr4NTnngKoo9M7Nx1hzkapXyKnXoirYt6r4+x9cH6ZxUk2rOQeq3dY3VIPaS4q+0kOYoyliCC/7evDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T19:58:35.150169Z","bundle_sha256":"78d1fc6feba6bb84769bbb31c55ee863294dbcbca7aab861e23bb709b1151c20"}}