{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:HCQ2GQDRQI7ROQUPJ37QPHCRPL","short_pith_number":"pith:HCQ2GQDR","schema_version":"1.0","canonical_sha256":"38a1a34071823f17428f4eff079c517ade99b22b30d651adf7df9af04ed9fa25","source":{"kind":"arxiv","id":"2605.29728","version":1},"attestation_state":"computed","paper":{"title":"PRISM: Processing-In-Memory Sparse MTTKRP for Tensor Decomposition Acceleration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Aleksandar Ilic, Daniel Pacheco, Leonel Sousa","submitted_at":"2026-05-28T10:21:45Z","abstract_excerpt":"Sparse tensors are the most used representation of sparse multidimensional data. Operations that decompose them, selecting their most important features while reducing their dimension, have become prevalent procedures in machine learning. One of the most used tensor decomposition algorithms is the Alternating Least Squares Canonical Polyadic Decomposition (CP-ALS), where the most time-consuming operation is the Sparse Matricized Tensor Times Khatri-Rao Product (spMTTKRP). This operation is strongly memory-bound, making it hard to implement efficiently on general-purpose processors. This work p"},"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":"2605.29728","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2026-05-28T10:21:45Z","cross_cats_sorted":[],"title_canon_sha256":"4c618b783afdaf7fac228d5e37702340dfefae121ea476b5dbc658feb7038b38","abstract_canon_sha256":"fa07eaf71def91e3a62332fdf6e70db0b23578cd468980622899b0225d0b23ec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-29T01:05:57.119185Z","signature_b64":"9+38xGkxBUnlprjPp0gosUkeuHS2PhNGKoviNYb26OtHB0GS6jPVpNfWsgJlnZygDbT1tTElkfS3d4zX4/WKAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38a1a34071823f17428f4eff079c517ade99b22b30d651adf7df9af04ed9fa25","last_reissued_at":"2026-05-29T01:05:57.118718Z","signature_status":"signed_v1","first_computed_at":"2026-05-29T01:05:57.118718Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PRISM: Processing-In-Memory Sparse MTTKRP for Tensor Decomposition Acceleration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Aleksandar Ilic, Daniel Pacheco, Leonel Sousa","submitted_at":"2026-05-28T10:21:45Z","abstract_excerpt":"Sparse tensors are the most used representation of sparse multidimensional data. Operations that decompose them, selecting their most important features while reducing their dimension, have become prevalent procedures in machine learning. One of the most used tensor decomposition algorithms is the Alternating Least Squares Canonical Polyadic Decomposition (CP-ALS), where the most time-consuming operation is the Sparse Matricized Tensor Times Khatri-Rao Product (spMTTKRP). This operation is strongly memory-bound, making it hard to implement efficiently on general-purpose processors. This work p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.29728","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/2605.29728/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":"2605.29728","created_at":"2026-05-29T01:05:57.118798+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.29728v1","created_at":"2026-05-29T01:05:57.118798+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.29728","created_at":"2026-05-29T01:05:57.118798+00:00"},{"alias_kind":"pith_short_12","alias_value":"HCQ2GQDRQI7R","created_at":"2026-05-29T01:05:57.118798+00:00"},{"alias_kind":"pith_short_16","alias_value":"HCQ2GQDRQI7ROQUP","created_at":"2026-05-29T01:05:57.118798+00:00"},{"alias_kind":"pith_short_8","alias_value":"HCQ2GQDR","created_at":"2026-05-29T01:05:57.118798+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/HCQ2GQDRQI7ROQUPJ37QPHCRPL","json":"https://pith.science/pith/HCQ2GQDRQI7ROQUPJ37QPHCRPL.json","graph_json":"https://pith.science/api/pith-number/HCQ2GQDRQI7ROQUPJ37QPHCRPL/graph.json","events_json":"https://pith.science/api/pith-number/HCQ2GQDRQI7ROQUPJ37QPHCRPL/events.json","paper":"https://pith.science/paper/HCQ2GQDR"},"agent_actions":{"view_html":"https://pith.science/pith/HCQ2GQDRQI7ROQUPJ37QPHCRPL","download_json":"https://pith.science/pith/HCQ2GQDRQI7ROQUPJ37QPHCRPL.json","view_paper":"https://pith.science/paper/HCQ2GQDR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.29728&json=true","fetch_graph":"https://pith.science/api/pith-number/HCQ2GQDRQI7ROQUPJ37QPHCRPL/graph.json","fetch_events":"https://pith.science/api/pith-number/HCQ2GQDRQI7ROQUPJ37QPHCRPL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HCQ2GQDRQI7ROQUPJ37QPHCRPL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HCQ2GQDRQI7ROQUPJ37QPHCRPL/action/storage_attestation","attest_author":"https://pith.science/pith/HCQ2GQDRQI7ROQUPJ37QPHCRPL/action/author_attestation","sign_citation":"https://pith.science/pith/HCQ2GQDRQI7ROQUPJ37QPHCRPL/action/citation_signature","submit_replication":"https://pith.science/pith/HCQ2GQDRQI7ROQUPJ37QPHCRPL/action/replication_record"}},"created_at":"2026-05-29T01:05:57.118798+00:00","updated_at":"2026-05-29T01:05:57.118798+00:00"}