{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:JINSWEBMCKDZZ7B2TEYBNMPWU6","short_pith_number":"pith:JINSWEBM","schema_version":"1.0","canonical_sha256":"4a1b2b102c12879cfc3a993016b1f6a786a199e30912a78ea4ddc18b5d580254","source":{"kind":"arxiv","id":"1806.07985","version":1},"attestation_state":"computed","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,"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1806.07985","created_at":"2026-05-18T00:12:42.410918+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.07985v1","created_at":"2026-05-18T00:12:42.410918+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.07985","created_at":"2026-05-18T00:12:42.410918+00:00"},{"alias_kind":"pith_short_12","alias_value":"JINSWEBMCKDZ","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"JINSWEBMCKDZZ7B2","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"JINSWEBM","created_at":"2026-05-18T12:32:31.084164+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/JINSWEBMCKDZZ7B2TEYBNMPWU6","json":"https://pith.science/pith/JINSWEBMCKDZZ7B2TEYBNMPWU6.json","graph_json":"https://pith.science/api/pith-number/JINSWEBMCKDZZ7B2TEYBNMPWU6/graph.json","events_json":"https://pith.science/api/pith-number/JINSWEBMCKDZZ7B2TEYBNMPWU6/events.json","paper":"https://pith.science/paper/JINSWEBM"},"agent_actions":{"view_html":"https://pith.science/pith/JINSWEBMCKDZZ7B2TEYBNMPWU6","download_json":"https://pith.science/pith/JINSWEBMCKDZZ7B2TEYBNMPWU6.json","view_paper":"https://pith.science/paper/JINSWEBM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.07985&json=true","fetch_graph":"https://pith.science/api/pith-number/JINSWEBMCKDZZ7B2TEYBNMPWU6/graph.json","fetch_events":"https://pith.science/api/pith-number/JINSWEBMCKDZZ7B2TEYBNMPWU6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JINSWEBMCKDZZ7B2TEYBNMPWU6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JINSWEBMCKDZZ7B2TEYBNMPWU6/action/storage_attestation","attest_author":"https://pith.science/pith/JINSWEBMCKDZZ7B2TEYBNMPWU6/action/author_attestation","sign_citation":"https://pith.science/pith/JINSWEBMCKDZZ7B2TEYBNMPWU6/action/citation_signature","submit_replication":"https://pith.science/pith/JINSWEBMCKDZZ7B2TEYBNMPWU6/action/replication_record"}},"created_at":"2026-05-18T00:12:42.410918+00:00","updated_at":"2026-05-18T00:12:42.410918+00:00"}