{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:EARB2HFDZNA3YRHQLF2V25FOC7","short_pith_number":"pith:EARB2HFD","schema_version":"1.0","canonical_sha256":"20221d1ca3cb41bc44f059755d74ae17f89dc2402f06031a193747a894f2b3db","source":{"kind":"arxiv","id":"2301.07486","version":4},"attestation_state":"computed","paper":{"title":"CINM (Cinnamon): A Compilation Infrastructure for Heterogeneous Compute In-Memory and Compute Near-Memory Paradigms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Asif Ali Khan, Cl\\'ement Fournier, Hamid Farzaneh, Jeronimo Castrillon, Karl F. A. Friebel, Lorenzo Chelini","submitted_at":"2022-12-25T18:36:47Z","abstract_excerpt":"The rise of data-intensive applications exposed the limitations of conventional processor-centric von-Neumann architectures that struggle to meet the off-chip memory bandwidth demand. Therefore, recent innovations in computer architecture advocate compute-in-memory (CIM) and compute-near-memory (CNM), non-von- Neumann paradigms achieving orders-of-magnitude improvements in performance and energy consumption. Despite significant technological breakthroughs in the last few years, the programmability of these systems is still a serious challenge. Their programming models are too low-level and spe"},"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":"2301.07486","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AR","submitted_at":"2022-12-25T18:36:47Z","cross_cats_sorted":[],"title_canon_sha256":"d2da70fc8de140e96647b1850841afc2f4f64408848e641d9784bab557f10771","abstract_canon_sha256":"88d6c8e4c91cc7b4df562752a45387fc560da55c7ef8b0a39a73488ab60d1aa6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:22:54.654081Z","signature_b64":"FkcWGxyHk8qMPc8i7hp7/Ex/HTdmzukLIbe0Yo5w7qdtbfUwne6xok4p6iQ1PvgAL2e2QYA1mW8YUVP6/AmcDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20221d1ca3cb41bc44f059755d74ae17f89dc2402f06031a193747a894f2b3db","last_reissued_at":"2026-07-05T08:22:54.653613Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:22:54.653613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CINM (Cinnamon): A Compilation Infrastructure for Heterogeneous Compute In-Memory and Compute Near-Memory Paradigms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Asif Ali Khan, Cl\\'ement Fournier, Hamid Farzaneh, Jeronimo Castrillon, Karl F. A. Friebel, Lorenzo Chelini","submitted_at":"2022-12-25T18:36:47Z","abstract_excerpt":"The rise of data-intensive applications exposed the limitations of conventional processor-centric von-Neumann architectures that struggle to meet the off-chip memory bandwidth demand. Therefore, recent innovations in computer architecture advocate compute-in-memory (CIM) and compute-near-memory (CNM), non-von- Neumann paradigms achieving orders-of-magnitude improvements in performance and energy consumption. Despite significant technological breakthroughs in the last few years, the programmability of these systems is still a serious challenge. Their programming models are too low-level and spe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.07486","kind":"arxiv","version":4},"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/2301.07486/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":"2301.07486","created_at":"2026-07-05T08:22:54.653669+00:00"},{"alias_kind":"arxiv_version","alias_value":"2301.07486v4","created_at":"2026-07-05T08:22:54.653669+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.07486","created_at":"2026-07-05T08:22:54.653669+00:00"},{"alias_kind":"pith_short_12","alias_value":"EARB2HFDZNA3","created_at":"2026-07-05T08:22:54.653669+00:00"},{"alias_kind":"pith_short_16","alias_value":"EARB2HFDZNA3YRHQ","created_at":"2026-07-05T08:22:54.653669+00:00"},{"alias_kind":"pith_short_8","alias_value":"EARB2HFD","created_at":"2026-07-05T08:22:54.653669+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.20047","citing_title":"Taking Cryptography Out of the Data Path via Near-Memory Processing in DRAM","ref_index":38,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EARB2HFDZNA3YRHQLF2V25FOC7","json":"https://pith.science/pith/EARB2HFDZNA3YRHQLF2V25FOC7.json","graph_json":"https://pith.science/api/pith-number/EARB2HFDZNA3YRHQLF2V25FOC7/graph.json","events_json":"https://pith.science/api/pith-number/EARB2HFDZNA3YRHQLF2V25FOC7/events.json","paper":"https://pith.science/paper/EARB2HFD"},"agent_actions":{"view_html":"https://pith.science/pith/EARB2HFDZNA3YRHQLF2V25FOC7","download_json":"https://pith.science/pith/EARB2HFDZNA3YRHQLF2V25FOC7.json","view_paper":"https://pith.science/paper/EARB2HFD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2301.07486&json=true","fetch_graph":"https://pith.science/api/pith-number/EARB2HFDZNA3YRHQLF2V25FOC7/graph.json","fetch_events":"https://pith.science/api/pith-number/EARB2HFDZNA3YRHQLF2V25FOC7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EARB2HFDZNA3YRHQLF2V25FOC7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EARB2HFDZNA3YRHQLF2V25FOC7/action/storage_attestation","attest_author":"https://pith.science/pith/EARB2HFDZNA3YRHQLF2V25FOC7/action/author_attestation","sign_citation":"https://pith.science/pith/EARB2HFDZNA3YRHQLF2V25FOC7/action/citation_signature","submit_replication":"https://pith.science/pith/EARB2HFDZNA3YRHQLF2V25FOC7/action/replication_record"}},"created_at":"2026-07-05T08:22:54.653669+00:00","updated_at":"2026-07-05T08:22:54.653669+00:00"}