{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:JINSWEBMCKDZZ7B2TEYBNMPWU6","short_pith_number":"pith:JINSWEBM","canonical_record":{"source":{"id":"1806.07985","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2018-06-19T13:52:12Z","cross_cats_sorted":["cs.DC","cs.MS"],"title_canon_sha256":"5c6cccfc370b5f5958859b92f630314b16054efe50c738546cee4dfabfea8292","abstract_canon_sha256":"44b7b21791e34e322ff0d80a0d0c5ed70c33a414288dbd1729e265e933c7ae62"},"schema_version":"1.0"},"canonical_sha256":"4a1b2b102c12879cfc3a993016b1f6a786a199e30912a78ea4ddc18b5d580254","source":{"kind":"arxiv","id":"1806.07985","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.07985","created_at":"2026-05-18T00:12:42Z"},{"alias_kind":"arxiv_version","alias_value":"1806.07985v1","created_at":"2026-05-18T00:12:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.07985","created_at":"2026-05-18T00:12:42Z"},{"alias_kind":"pith_short_12","alias_value":"JINSWEBMCKDZ","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JINSWEBMCKDZZ7B2","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JINSWEBM","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:JINSWEBMCKDZZ7B2TEYBNMPWU6","target":"record","payload":{"canonical_record":{"source":{"id":"1806.07985","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2018-06-19T13:52:12Z","cross_cats_sorted":["cs.DC","cs.MS"],"title_canon_sha256":"5c6cccfc370b5f5958859b92f630314b16054efe50c738546cee4dfabfea8292","abstract_canon_sha256":"44b7b21791e34e322ff0d80a0d0c5ed70c33a414288dbd1729e265e933c7ae62"},"schema_version":"1.0"},"canonical_sha256":"4a1b2b102c12879cfc3a993016b1f6a786a199e30912a78ea4ddc18b5d580254","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:42.411346Z","signature_b64":"ms7x5J2RAChALHFmvO1lgImWYKNIIiEWj9FfWSL72wKkcsGA4BSAh6iODE6H+A6yH0ORMbB2EJw720d3UH7KDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a1b2b102c12879cfc3a993016b1f6a786a199e30912a78ea4ddc18b5d580254","last_reissued_at":"2026-05-18T00:12:42.410839Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:42.410839Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.07985","source_version":1,"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-18T00:12:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RYC0wFOdk8KiG3igOmo40Y3Ql2UXDm2/gh0IuItk1FR1R2gUH1pkSSfbYrb+4Sy5Cnc3Zq3BYWSmm+0ivDPdAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T23:08:37.384297Z"},"content_sha256":"85e9e2c1a3ba503dea7051354fe1f52c86222334397e216679cda766b8aee5c9","schema_version":"1.0","event_id":"sha256:85e9e2c1a3ba503dea7051354fe1f52c86222334397e216679cda766b8aee5c9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:JINSWEBMCKDZZ7B2TEYBNMPWU6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parallel Nonnegative CP Decomposition of Dense Tensors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.MS"],"primary_cat":"cs.NA","authors_text":"Grey Ballard, Koby Hayashi, Ramakrishnan Kannan","submitted_at":"2018-06-19T13:52:12Z","abstract_excerpt":"The CP tensor decomposition is a low-rank approximation of a tensor. We present a distributed-memory parallel algorithm and implementation of an alternating optimization method for computing a CP decomposition of dense tensor data that can enforce nonnegativity of the computed low-rank factors. The principal task is to parallelize the matricized-tensor times Khatri-Rao product (MTTKRP) bottleneck subcomputation. The algorithm is computation efficient, using dimension trees to avoid redundant computation across MTTKRPs within the alternating method. Our approach is also communication efficient,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.07985","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":""},"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-18T00:12:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"48ZseG8Ah42MGVxrV07R+JPmEzNWdEUTCtho+iXbCQAtywIQGIBu9U/GjBvQoKBIZAbQqf+u8sayVg1pKh0AAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T23:08:37.384654Z"},"content_sha256":"e3f3ce204d3408f7e78ad93883b04b70823fa8e26a42663c990971e65f527941","schema_version":"1.0","event_id":"sha256:e3f3ce204d3408f7e78ad93883b04b70823fa8e26a42663c990971e65f527941"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JINSWEBMCKDZZ7B2TEYBNMPWU6/bundle.json","state_url":"https://pith.science/pith/JINSWEBMCKDZZ7B2TEYBNMPWU6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JINSWEBMCKDZZ7B2TEYBNMPWU6/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-02T23:08:37Z","links":{"resolver":"https://pith.science/pith/JINSWEBMCKDZZ7B2TEYBNMPWU6","bundle":"https://pith.science/pith/JINSWEBMCKDZZ7B2TEYBNMPWU6/bundle.json","state":"https://pith.science/pith/JINSWEBMCKDZZ7B2TEYBNMPWU6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JINSWEBMCKDZZ7B2TEYBNMPWU6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:JINSWEBMCKDZZ7B2TEYBNMPWU6","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":"44b7b21791e34e322ff0d80a0d0c5ed70c33a414288dbd1729e265e933c7ae62","cross_cats_sorted":["cs.DC","cs.MS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2018-06-19T13:52:12Z","title_canon_sha256":"5c6cccfc370b5f5958859b92f630314b16054efe50c738546cee4dfabfea8292"},"schema_version":"1.0","source":{"id":"1806.07985","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.07985","created_at":"2026-05-18T00:12:42Z"},{"alias_kind":"arxiv_version","alias_value":"1806.07985v1","created_at":"2026-05-18T00:12:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.07985","created_at":"2026-05-18T00:12:42Z"},{"alias_kind":"pith_short_12","alias_value":"JINSWEBMCKDZ","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JINSWEBMCKDZZ7B2","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JINSWEBM","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:e3f3ce204d3408f7e78ad93883b04b70823fa8e26a42663c990971e65f527941","target":"graph","created_at":"2026-05-18T00:12:42Z","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":"The CP tensor decomposition is a low-rank approximation of a tensor. We present a distributed-memory parallel algorithm and implementation of an alternating optimization method for computing a CP decomposition of dense tensor data that can enforce nonnegativity of the computed low-rank factors. The principal task is to parallelize the matricized-tensor times Khatri-Rao product (MTTKRP) bottleneck subcomputation. The algorithm is computation efficient, using dimension trees to avoid redundant computation across MTTKRPs within the alternating method. Our approach is also communication efficient,","authors_text":"Grey Ballard, Koby Hayashi, Ramakrishnan Kannan","cross_cats":["cs.DC","cs.MS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2018-06-19T13:52:12Z","title":"Parallel Nonnegative CP Decomposition of Dense Tensors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.07985","kind":"arxiv","version":1},"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:85e9e2c1a3ba503dea7051354fe1f52c86222334397e216679cda766b8aee5c9","target":"record","created_at":"2026-05-18T00:12:42Z","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":"44b7b21791e34e322ff0d80a0d0c5ed70c33a414288dbd1729e265e933c7ae62","cross_cats_sorted":["cs.DC","cs.MS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2018-06-19T13:52:12Z","title_canon_sha256":"5c6cccfc370b5f5958859b92f630314b16054efe50c738546cee4dfabfea8292"},"schema_version":"1.0","source":{"id":"1806.07985","kind":"arxiv","version":1}},"canonical_sha256":"4a1b2b102c12879cfc3a993016b1f6a786a199e30912a78ea4ddc18b5d580254","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4a1b2b102c12879cfc3a993016b1f6a786a199e30912a78ea4ddc18b5d580254","first_computed_at":"2026-05-18T00:12:42.410839Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:42.410839Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ms7x5J2RAChALHFmvO1lgImWYKNIIiEWj9FfWSL72wKkcsGA4BSAh6iODE6H+A6yH0ORMbB2EJw720d3UH7KDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:42.411346Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.07985","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:85e9e2c1a3ba503dea7051354fe1f52c86222334397e216679cda766b8aee5c9","sha256:e3f3ce204d3408f7e78ad93883b04b70823fa8e26a42663c990971e65f527941"],"state_sha256":"0e029346f67dc507370c23e3e137e9b7bc15950af89c3074cba73353cac55fd5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/UVGza9Xindhb+wrdv3ZyujfwwWVEd1tJnuPQ3VaDPzcG3yPyF2bhoI6V9x2DFr1j8RLePyEawuKCRFJPFmzCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T23:08:37.386481Z","bundle_sha256":"7834b8b834dc53df821c86aadf32c3a123c93644209585039db822e2d020c59a"}}