{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:7EA22MSBABXKNPBYS4QFZVTCBL","short_pith_number":"pith:7EA22MSB","schema_version":"1.0","canonical_sha256":"f901ad3241006ea6bc3897205cd6620af83da91417168d4f3873924a42d4f9b5","source":{"kind":"arxiv","id":"1809.09175","version":2},"attestation_state":"computed","paper":{"title":"Software for Sparse Tensor Decomposition on Emerging Computing Architectures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MS","authors_text":"Eric Phipps, Tamara G. Kolda","submitted_at":"2018-09-24T19:19:05Z","abstract_excerpt":"In this paper, we develop software for decomposing sparse tensors that is portable to and performant on a variety of multicore, manycore, and GPU computing architectures. The result is a single code whose performance matches optimized architecture-specific implementations. The key to a portable approach is to determine multiple levels of parallelism that can be mapped in different ways to different architectures, and we explain how to do this for the matricized tensor times Khatri-Rao product (MTTKRP) which is the key kernel in canonical polyadic tensor decomposition. Our implementation levera"},"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":"1809.09175","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2018-09-24T19:19:05Z","cross_cats_sorted":[],"title_canon_sha256":"f0c837ba6416f05bedcddeb44d1862b687a1b993cead50431c5674e3444ba55b","abstract_canon_sha256":"9df20eaba9bb5aa776d6bd3a122ab91191a2ef144213913d471eab17c6cf36c4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:27.067782Z","signature_b64":"isYvJGmq44bA/lrxnQA1QUzd0YIwz6cwOUjnKKkufDS0CDfZUav5/KGur2y/qIhAZZ/x0TjqgpfuWH52gBmrDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f901ad3241006ea6bc3897205cd6620af83da91417168d4f3873924a42d4f9b5","last_reissued_at":"2026-05-17T23:39:27.067069Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:27.067069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Software for Sparse Tensor Decomposition on Emerging Computing Architectures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MS","authors_text":"Eric Phipps, Tamara G. Kolda","submitted_at":"2018-09-24T19:19:05Z","abstract_excerpt":"In this paper, we develop software for decomposing sparse tensors that is portable to and performant on a variety of multicore, manycore, and GPU computing architectures. The result is a single code whose performance matches optimized architecture-specific implementations. The key to a portable approach is to determine multiple levels of parallelism that can be mapped in different ways to different architectures, and we explain how to do this for the matricized tensor times Khatri-Rao product (MTTKRP) which is the key kernel in canonical polyadic tensor decomposition. Our implementation levera"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.09175","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1809.09175","created_at":"2026-05-17T23:39:27.067173+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.09175v2","created_at":"2026-05-17T23:39:27.067173+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.09175","created_at":"2026-05-17T23:39:27.067173+00:00"},{"alias_kind":"pith_short_12","alias_value":"7EA22MSBABXK","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"7EA22MSBABXKNPBY","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"7EA22MSB","created_at":"2026-05-18T12:32:11.075285+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/7EA22MSBABXKNPBYS4QFZVTCBL","json":"https://pith.science/pith/7EA22MSBABXKNPBYS4QFZVTCBL.json","graph_json":"https://pith.science/api/pith-number/7EA22MSBABXKNPBYS4QFZVTCBL/graph.json","events_json":"https://pith.science/api/pith-number/7EA22MSBABXKNPBYS4QFZVTCBL/events.json","paper":"https://pith.science/paper/7EA22MSB"},"agent_actions":{"view_html":"https://pith.science/pith/7EA22MSBABXKNPBYS4QFZVTCBL","download_json":"https://pith.science/pith/7EA22MSBABXKNPBYS4QFZVTCBL.json","view_paper":"https://pith.science/paper/7EA22MSB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.09175&json=true","fetch_graph":"https://pith.science/api/pith-number/7EA22MSBABXKNPBYS4QFZVTCBL/graph.json","fetch_events":"https://pith.science/api/pith-number/7EA22MSBABXKNPBYS4QFZVTCBL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7EA22MSBABXKNPBYS4QFZVTCBL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7EA22MSBABXKNPBYS4QFZVTCBL/action/storage_attestation","attest_author":"https://pith.science/pith/7EA22MSBABXKNPBYS4QFZVTCBL/action/author_attestation","sign_citation":"https://pith.science/pith/7EA22MSBABXKNPBYS4QFZVTCBL/action/citation_signature","submit_replication":"https://pith.science/pith/7EA22MSBABXKNPBYS4QFZVTCBL/action/replication_record"}},"created_at":"2026-05-17T23:39:27.067173+00:00","updated_at":"2026-05-17T23:39:27.067173+00:00"}