{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:7EA22MSBABXKNPBYS4QFZVTCBL","short_pith_number":"pith:7EA22MSB","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"},"canonical_sha256":"f901ad3241006ea6bc3897205cd6620af83da91417168d4f3873924a42d4f9b5","source":{"kind":"arxiv","id":"1809.09175","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.09175","created_at":"2026-05-17T23:39:27Z"},{"alias_kind":"arxiv_version","alias_value":"1809.09175v2","created_at":"2026-05-17T23:39:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.09175","created_at":"2026-05-17T23:39:27Z"},{"alias_kind":"pith_short_12","alias_value":"7EA22MSBABXK","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7EA22MSBABXKNPBY","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7EA22MSB","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:7EA22MSBABXKNPBYS4QFZVTCBL","target":"record","payload":{"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"},"canonical_sha256":"f901ad3241006ea6bc3897205cd6620af83da91417168d4f3873924a42d4f9b5","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"},"source_kind":"arxiv","source_id":"1809.09175","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xieUkOfPPjsqqVeR0LUvvDGrppkcF51HCkkxQM+Tw1OqmVYfS3kA2mKwDyY2oAvi8NjYEz7uF/N6NCODE1DOAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T08:55:25.074136Z"},"content_sha256":"5952e24cc17c60b8ba8421a3be124b0f6f7cfab604bd3d4f3ae17d314408addf","schema_version":"1.0","event_id":"sha256:5952e24cc17c60b8ba8421a3be124b0f6f7cfab604bd3d4f3ae17d314408addf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:7EA22MSBABXKNPBYS4QFZVTCBL","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hlNbkOeiuPRmIplL1TKdzm2Z4+oL1JVfz9BLyy82Y3fQ2QBgsupYSzWGK0g6Gb5Un5H/rDLNobu5npVNZxY0AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T08:55:25.074495Z"},"content_sha256":"6c7b31b55562f56fbafff4403f592e8832fb8abf325262d7b4926b9ad3585055","schema_version":"1.0","event_id":"sha256:6c7b31b55562f56fbafff4403f592e8832fb8abf325262d7b4926b9ad3585055"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7EA22MSBABXKNPBYS4QFZVTCBL/bundle.json","state_url":"https://pith.science/pith/7EA22MSBABXKNPBYS4QFZVTCBL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7EA22MSBABXKNPBYS4QFZVTCBL/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-27T08:55:25Z","links":{"resolver":"https://pith.science/pith/7EA22MSBABXKNPBYS4QFZVTCBL","bundle":"https://pith.science/pith/7EA22MSBABXKNPBYS4QFZVTCBL/bundle.json","state":"https://pith.science/pith/7EA22MSBABXKNPBYS4QFZVTCBL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7EA22MSBABXKNPBYS4QFZVTCBL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:7EA22MSBABXKNPBYS4QFZVTCBL","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"9df20eaba9bb5aa776d6bd3a122ab91191a2ef144213913d471eab17c6cf36c4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2018-09-24T19:19:05Z","title_canon_sha256":"f0c837ba6416f05bedcddeb44d1862b687a1b993cead50431c5674e3444ba55b"},"schema_version":"1.0","source":{"id":"1809.09175","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.09175","created_at":"2026-05-17T23:39:27Z"},{"alias_kind":"arxiv_version","alias_value":"1809.09175v2","created_at":"2026-05-17T23:39:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.09175","created_at":"2026-05-17T23:39:27Z"},{"alias_kind":"pith_short_12","alias_value":"7EA22MSBABXK","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7EA22MSBABXKNPBY","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7EA22MSB","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:6c7b31b55562f56fbafff4403f592e8832fb8abf325262d7b4926b9ad3585055","target":"graph","created_at":"2026-05-17T23:39:27Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Eric Phipps, Tamara G. Kolda","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2018-09-24T19:19:05Z","title":"Software for Sparse Tensor Decomposition on Emerging Computing Architectures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.09175","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5952e24cc17c60b8ba8421a3be124b0f6f7cfab604bd3d4f3ae17d314408addf","target":"record","created_at":"2026-05-17T23:39:27Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"9df20eaba9bb5aa776d6bd3a122ab91191a2ef144213913d471eab17c6cf36c4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2018-09-24T19:19:05Z","title_canon_sha256":"f0c837ba6416f05bedcddeb44d1862b687a1b993cead50431c5674e3444ba55b"},"schema_version":"1.0","source":{"id":"1809.09175","kind":"arxiv","version":2}},"canonical_sha256":"f901ad3241006ea6bc3897205cd6620af83da91417168d4f3873924a42d4f9b5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f901ad3241006ea6bc3897205cd6620af83da91417168d4f3873924a42d4f9b5","first_computed_at":"2026-05-17T23:39:27.067069Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:27.067069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"isYvJGmq44bA/lrxnQA1QUzd0YIwz6cwOUjnKKkufDS0CDfZUav5/KGur2y/qIhAZZ/x0TjqgpfuWH52gBmrDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:27.067782Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.09175","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5952e24cc17c60b8ba8421a3be124b0f6f7cfab604bd3d4f3ae17d314408addf","sha256:6c7b31b55562f56fbafff4403f592e8832fb8abf325262d7b4926b9ad3585055"],"state_sha256":"6e91248204a574ce4112834f3d08e86855ea436747b2bec75272657398bbb057"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IZXHUCuKclZRwSsiYoBxAi+bqHeuL+Oi9nAuwv+1+6bRi0qciVKIYXdGppPT144+mCqYGiHC7LjGtBQqz0y3CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T08:55:25.076362Z","bundle_sha256":"e923830babe4330913f6a310c3d9d39b4c89b8dc76936008ee36a2e18c0f7111"}}