{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:LEFP5IYVIY5JLFEO3VWJR5UMEE","short_pith_number":"pith:LEFP5IYV","schema_version":"1.0","canonical_sha256":"590afea315463a95948edd6c98f68c2128ab5314ff3767b560dacac2578accbd","source":{"kind":"arxiv","id":"1905.09822","version":3},"attestation_state":"computed","paper":{"title":"In-DRAM Bulk Bitwise Execution Engine","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"cs.AR","authors_text":"Onur Mutlu, Vivek Seshadri","submitted_at":"2019-05-23T06:17:39Z","abstract_excerpt":"Many applications heavily use bitwise operations on large bitvectors as part of their computation. In existing systems, performing such bulk bitwise operations requires the processor to transfer a large amount of data on the memory channel, thereby consuming high latency, memory bandwidth, and energy. In this paper, we describe Ambit, a recently-proposed mechanism to perform bulk bitwise operations completely inside main memory. Ambit exploits the internal organization and analog operation of DRAM-based memory to achieve low cost, high performance, and low energy. Ambit exposes a new bulk bitw"},"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":"1905.09822","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2019-05-23T06:17:39Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"6651dd9a222b64f0aa119e0a32f1f4af6ca350b6012f384e738b8dbb8f2a9505","abstract_canon_sha256":"6d9e31894c0e16c67cbe64aa87be32f0fae69bb5afc43608347501ffbdb15f17"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:52:46.216550Z","signature_b64":"d8s86OtQ6cBJENCZEUaQ0X4YMcOvNEUhzj+fhXHRToVtljBEPYGp4sidmfaw0B/LQ+dYG+XjHe/oYfxFBqXmAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"590afea315463a95948edd6c98f68c2128ab5314ff3767b560dacac2578accbd","last_reissued_at":"2026-07-05T00:52:46.216101Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:52:46.216101Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"In-DRAM Bulk Bitwise Execution Engine","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"cs.AR","authors_text":"Onur Mutlu, Vivek Seshadri","submitted_at":"2019-05-23T06:17:39Z","abstract_excerpt":"Many applications heavily use bitwise operations on large bitvectors as part of their computation. In existing systems, performing such bulk bitwise operations requires the processor to transfer a large amount of data on the memory channel, thereby consuming high latency, memory bandwidth, and energy. In this paper, we describe Ambit, a recently-proposed mechanism to perform bulk bitwise operations completely inside main memory. Ambit exploits the internal organization and analog operation of DRAM-based memory to achieve low cost, high performance, and low energy. Ambit exposes a new bulk bitw"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.09822","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1905.09822/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1905.09822","created_at":"2026-07-05T00:52:46.216168+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.09822v3","created_at":"2026-07-05T00:52:46.216168+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.09822","created_at":"2026-07-05T00:52:46.216168+00:00"},{"alias_kind":"pith_short_12","alias_value":"LEFP5IYVIY5J","created_at":"2026-07-05T00:52:46.216168+00:00"},{"alias_kind":"pith_short_16","alias_value":"LEFP5IYVIY5JLFEO","created_at":"2026-07-05T00:52:46.216168+00:00"},{"alias_kind":"pith_short_8","alias_value":"LEFP5IYV","created_at":"2026-07-05T00:52:46.216168+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.22812","citing_title":"Clutch: High Performance Vector-Scalar Comparison using DRAM via Chunked Temporal Coding","ref_index":173,"is_internal_anchor":false},{"citing_arxiv_id":"2606.19119","citing_title":"PuDGhost: Experimental Analysis of Computation Result Corruption in Processing-using-DRAM Operations on Real DRAM Chips and Implications for Future Systems","ref_index":30,"is_internal_anchor":false},{"citing_arxiv_id":"2606.13844","citing_title":"Ramulator 2.1: A Composable Memory System Simulator for Modern DRAM Systems","ref_index":35,"is_internal_anchor":false},{"citing_arxiv_id":"2605.20047","citing_title":"Taking Cryptography Out of the Data Path via Near-Memory Processing in DRAM","ref_index":66,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LEFP5IYVIY5JLFEO3VWJR5UMEE","json":"https://pith.science/pith/LEFP5IYVIY5JLFEO3VWJR5UMEE.json","graph_json":"https://pith.science/api/pith-number/LEFP5IYVIY5JLFEO3VWJR5UMEE/graph.json","events_json":"https://pith.science/api/pith-number/LEFP5IYVIY5JLFEO3VWJR5UMEE/events.json","paper":"https://pith.science/paper/LEFP5IYV"},"agent_actions":{"view_html":"https://pith.science/pith/LEFP5IYVIY5JLFEO3VWJR5UMEE","download_json":"https://pith.science/pith/LEFP5IYVIY5JLFEO3VWJR5UMEE.json","view_paper":"https://pith.science/paper/LEFP5IYV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.09822&json=true","fetch_graph":"https://pith.science/api/pith-number/LEFP5IYVIY5JLFEO3VWJR5UMEE/graph.json","fetch_events":"https://pith.science/api/pith-number/LEFP5IYVIY5JLFEO3VWJR5UMEE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LEFP5IYVIY5JLFEO3VWJR5UMEE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LEFP5IYVIY5JLFEO3VWJR5UMEE/action/storage_attestation","attest_author":"https://pith.science/pith/LEFP5IYVIY5JLFEO3VWJR5UMEE/action/author_attestation","sign_citation":"https://pith.science/pith/LEFP5IYVIY5JLFEO3VWJR5UMEE/action/citation_signature","submit_replication":"https://pith.science/pith/LEFP5IYVIY5JLFEO3VWJR5UMEE/action/replication_record"}},"created_at":"2026-07-05T00:52:46.216168+00:00","updated_at":"2026-07-05T00:52:46.216168+00:00"}