{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:46NVFMVTP5IF5USTA762TZ3QCZ","short_pith_number":"pith:46NVFMVT","canonical_record":{"source":{"id":"1812.11473","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-30T05:59:07Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"43c244c908bdb897a668ec81fe239d3fb5003bdf9cd1ada279706aa7286cbe0f","abstract_canon_sha256":"249dd1d70dc6b49043d8438ac9139dba7ba2518670673242edd9f042ab98e911"},"schema_version":"1.0"},"canonical_sha256":"e79b52b2b37f505ed25307fda9e7701666cd63d7c04542912c0afe4329ce6cb1","source":{"kind":"arxiv","id":"1812.11473","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.11473","created_at":"2026-05-17T23:56:40Z"},{"alias_kind":"arxiv_version","alias_value":"1812.11473v2","created_at":"2026-05-17T23:56:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.11473","created_at":"2026-05-17T23:56:40Z"},{"alias_kind":"pith_short_12","alias_value":"46NVFMVTP5IF","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"46NVFMVTP5IF5UST","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"46NVFMVT","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:46NVFMVTP5IF5USTA762TZ3QCZ","target":"record","payload":{"canonical_record":{"source":{"id":"1812.11473","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-30T05:59:07Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"43c244c908bdb897a668ec81fe239d3fb5003bdf9cd1ada279706aa7286cbe0f","abstract_canon_sha256":"249dd1d70dc6b49043d8438ac9139dba7ba2518670673242edd9f042ab98e911"},"schema_version":"1.0"},"canonical_sha256":"e79b52b2b37f505ed25307fda9e7701666cd63d7c04542912c0afe4329ce6cb1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:40.585738Z","signature_b64":"qqXoeZAlEJbqCL6T/9RfFtp2C664SRTYVIiVjUcdBNDo0Bb2dxZdajU/7EgU/apOOczR8gpm2XMxioQmBz9hDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e79b52b2b37f505ed25307fda9e7701666cd63d7c04542912c0afe4329ce6cb1","last_reissued_at":"2026-05-17T23:56:40.585059Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:40.585059Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.11473","source_version":2,"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:56:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SXB5RCLdlz9nYgkfrmtt7oDQ8uCm1sESszdS2IyoZW9EHsrFgebQzdPJmKsjNfxMYkKZSXN+dEboOxENbp3qBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T11:07:45.877771Z"},"content_sha256":"bf2a62ad76230b3773e335773dfe938202f86e3300e89bc9baaa3622959a05ca","schema_version":"1.0","event_id":"sha256:bf2a62ad76230b3773e335773dfe938202f86e3300e89bc9baaa3622959a05ca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:46NVFMVTP5IF5USTA762TZ3QCZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"ORIGAMI: A Heterogeneous Split Architecture for In-Memory Acceleration of Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Hajar Falahati, Hamid Sarbazi-Azad, Mohammad Sadrosadati, Pejman Lotfi-Kamran","submitted_at":"2018-12-30T05:59:07Z","abstract_excerpt":"Memory bandwidth bottleneck is a major challenges in processing machine learning (ML) algorithms. In-memory acceleration has potential to address this problem; however, it needs to address two challenges. First, in-memory accelerator should be general enough to support a large set of different ML algorithms. Second, it should be efficient enough to utilize bandwidth while meeting limited power and area budgets of logic layer of a 3D-stacked memory. We observe that previous work fails to simultaneously address both challenges. We propose ORIGAMI, a heterogeneous set of in-memory accelerators, t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.11473","kind":"arxiv","version":2},"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:56:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ciO4LuwPvfUjrEapEGL3/JfsXn0B34daJOWbsjUP2+ecniGzJOxvkyc2bUdMn78e51dbisPTSARWnD6Ov7oODQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T11:07:45.878130Z"},"content_sha256":"6704e228c0bc75305cebc776ddfec2742090fe6bc8ade9ea6e4198e6d012bf20","schema_version":"1.0","event_id":"sha256:6704e228c0bc75305cebc776ddfec2742090fe6bc8ade9ea6e4198e6d012bf20"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/46NVFMVTP5IF5USTA762TZ3QCZ/bundle.json","state_url":"https://pith.science/pith/46NVFMVTP5IF5USTA762TZ3QCZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/46NVFMVTP5IF5USTA762TZ3QCZ/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-21T11:07:45Z","links":{"resolver":"https://pith.science/pith/46NVFMVTP5IF5USTA762TZ3QCZ","bundle":"https://pith.science/pith/46NVFMVTP5IF5USTA762TZ3QCZ/bundle.json","state":"https://pith.science/pith/46NVFMVTP5IF5USTA762TZ3QCZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/46NVFMVTP5IF5USTA762TZ3QCZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:46NVFMVTP5IF5USTA762TZ3QCZ","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":"249dd1d70dc6b49043d8438ac9139dba7ba2518670673242edd9f042ab98e911","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-30T05:59:07Z","title_canon_sha256":"43c244c908bdb897a668ec81fe239d3fb5003bdf9cd1ada279706aa7286cbe0f"},"schema_version":"1.0","source":{"id":"1812.11473","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.11473","created_at":"2026-05-17T23:56:40Z"},{"alias_kind":"arxiv_version","alias_value":"1812.11473v2","created_at":"2026-05-17T23:56:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.11473","created_at":"2026-05-17T23:56:40Z"},{"alias_kind":"pith_short_12","alias_value":"46NVFMVTP5IF","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"46NVFMVTP5IF5UST","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"46NVFMVT","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:6704e228c0bc75305cebc776ddfec2742090fe6bc8ade9ea6e4198e6d012bf20","target":"graph","created_at":"2026-05-17T23:56:40Z","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":"Memory bandwidth bottleneck is a major challenges in processing machine learning (ML) algorithms. In-memory acceleration has potential to address this problem; however, it needs to address two challenges. First, in-memory accelerator should be general enough to support a large set of different ML algorithms. Second, it should be efficient enough to utilize bandwidth while meeting limited power and area budgets of logic layer of a 3D-stacked memory. We observe that previous work fails to simultaneously address both challenges. We propose ORIGAMI, a heterogeneous set of in-memory accelerators, t","authors_text":"Hajar Falahati, Hamid Sarbazi-Azad, Mohammad Sadrosadati, Pejman Lotfi-Kamran","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-30T05:59:07Z","title":"ORIGAMI: A Heterogeneous Split Architecture for In-Memory Acceleration of Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.11473","kind":"arxiv","version":2},"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:bf2a62ad76230b3773e335773dfe938202f86e3300e89bc9baaa3622959a05ca","target":"record","created_at":"2026-05-17T23:56:40Z","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":"249dd1d70dc6b49043d8438ac9139dba7ba2518670673242edd9f042ab98e911","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-30T05:59:07Z","title_canon_sha256":"43c244c908bdb897a668ec81fe239d3fb5003bdf9cd1ada279706aa7286cbe0f"},"schema_version":"1.0","source":{"id":"1812.11473","kind":"arxiv","version":2}},"canonical_sha256":"e79b52b2b37f505ed25307fda9e7701666cd63d7c04542912c0afe4329ce6cb1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e79b52b2b37f505ed25307fda9e7701666cd63d7c04542912c0afe4329ce6cb1","first_computed_at":"2026-05-17T23:56:40.585059Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:40.585059Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qqXoeZAlEJbqCL6T/9RfFtp2C664SRTYVIiVjUcdBNDo0Bb2dxZdajU/7EgU/apOOczR8gpm2XMxioQmBz9hDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:40.585738Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.11473","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bf2a62ad76230b3773e335773dfe938202f86e3300e89bc9baaa3622959a05ca","sha256:6704e228c0bc75305cebc776ddfec2742090fe6bc8ade9ea6e4198e6d012bf20"],"state_sha256":"c00d1ff50734d54881192230d93c4192a27c16be0ff66921edbe27d784ff291e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"As9jZe8/MUTSzglvSwcEUak3YTekL13CIg+Gr326U1+Upaq9CkrH8x/ImQtYBEIOIlSs/fI6yqHDyOWfUuOFBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T11:07:45.880299Z","bundle_sha256":"66e64bb17ee397b847a510022b75cb486156eb45ba0d8b3811d77e5d33017f68"}}