{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:VSASXWB3Q7L4EU6JFQUDHXUBXA","short_pith_number":"pith:VSASXWB3","schema_version":"1.0","canonical_sha256":"ac812bd83b87d7c253c92c2833de81b8369623d21af153fc1125e0defbfe6e38","source":{"kind":"arxiv","id":"2008.06741","version":1},"attestation_state":"computed","paper":{"title":"Breaking Barriers: Maximizing Array Utilization for Compute In-Memory Fabrics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"cs.AR","authors_text":"Arijit Raychowdhury, Brian Crafton, Gauthaman Murali, Samuel Spetalnick, Sung-Kyu Lim, Tushar Krishna","submitted_at":"2020-08-15T15:49:50Z","abstract_excerpt":"Compute in-memory (CIM) is a promising technique that minimizes data transport, the primary performance bottleneck and energy cost of most data intensive applications. This has found wide-spread adoption in accelerating neural networks for machine learning applications. Utilizing a crossbar architecture with emerging non-volatile memories (eNVM) such as dense resistive random access memory (RRAM) or phase change random access memory (PCRAM), various forms of neural networks can be implemented to greatly reduce power and increase on chip memory capacity. However, compute in-memory faces its own"},"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":"2008.06741","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2020-08-15T15:49:50Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"08b6195e5b93ce45c40c67ed373c474373037055a5e0e44f901a3a9f3edd853a","abstract_canon_sha256":"0cdf79be9c8112447a2781003d8510a23e86a6d9fceb2313536cbafeaeb8fb10"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:27:31.758197Z","signature_b64":"owx87aRrKB9kryEqZkZPu5bk9I41yZp+A206aGj05qII679PDgdUGLqvWtpNHTjCJs1w4GxBfai25AylYQrOCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac812bd83b87d7c253c92c2833de81b8369623d21af153fc1125e0defbfe6e38","last_reissued_at":"2026-07-05T01:27:31.757828Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:27:31.757828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Breaking Barriers: Maximizing Array Utilization for Compute In-Memory Fabrics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"cs.AR","authors_text":"Arijit Raychowdhury, Brian Crafton, Gauthaman Murali, Samuel Spetalnick, Sung-Kyu Lim, Tushar Krishna","submitted_at":"2020-08-15T15:49:50Z","abstract_excerpt":"Compute in-memory (CIM) is a promising technique that minimizes data transport, the primary performance bottleneck and energy cost of most data intensive applications. This has found wide-spread adoption in accelerating neural networks for machine learning applications. Utilizing a crossbar architecture with emerging non-volatile memories (eNVM) such as dense resistive random access memory (RRAM) or phase change random access memory (PCRAM), various forms of neural networks can be implemented to greatly reduce power and increase on chip memory capacity. However, compute in-memory faces its own"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.06741","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2008.06741/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":"2008.06741","created_at":"2026-07-05T01:27:31.757878+00:00"},{"alias_kind":"arxiv_version","alias_value":"2008.06741v1","created_at":"2026-07-05T01:27:31.757878+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.06741","created_at":"2026-07-05T01:27:31.757878+00:00"},{"alias_kind":"pith_short_12","alias_value":"VSASXWB3Q7L4","created_at":"2026-07-05T01:27:31.757878+00:00"},{"alias_kind":"pith_short_16","alias_value":"VSASXWB3Q7L4EU6J","created_at":"2026-07-05T01:27:31.757878+00:00"},{"alias_kind":"pith_short_8","alias_value":"VSASXWB3","created_at":"2026-07-05T01:27:31.757878+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VSASXWB3Q7L4EU6JFQUDHXUBXA","json":"https://pith.science/pith/VSASXWB3Q7L4EU6JFQUDHXUBXA.json","graph_json":"https://pith.science/api/pith-number/VSASXWB3Q7L4EU6JFQUDHXUBXA/graph.json","events_json":"https://pith.science/api/pith-number/VSASXWB3Q7L4EU6JFQUDHXUBXA/events.json","paper":"https://pith.science/paper/VSASXWB3"},"agent_actions":{"view_html":"https://pith.science/pith/VSASXWB3Q7L4EU6JFQUDHXUBXA","download_json":"https://pith.science/pith/VSASXWB3Q7L4EU6JFQUDHXUBXA.json","view_paper":"https://pith.science/paper/VSASXWB3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2008.06741&json=true","fetch_graph":"https://pith.science/api/pith-number/VSASXWB3Q7L4EU6JFQUDHXUBXA/graph.json","fetch_events":"https://pith.science/api/pith-number/VSASXWB3Q7L4EU6JFQUDHXUBXA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VSASXWB3Q7L4EU6JFQUDHXUBXA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VSASXWB3Q7L4EU6JFQUDHXUBXA/action/storage_attestation","attest_author":"https://pith.science/pith/VSASXWB3Q7L4EU6JFQUDHXUBXA/action/author_attestation","sign_citation":"https://pith.science/pith/VSASXWB3Q7L4EU6JFQUDHXUBXA/action/citation_signature","submit_replication":"https://pith.science/pith/VSASXWB3Q7L4EU6JFQUDHXUBXA/action/replication_record"}},"created_at":"2026-07-05T01:27:31.757878+00:00","updated_at":"2026-07-05T01:27:31.757878+00:00"}