{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:5ZBZVZ2EUTTDH5ZUCU2VFHARXS","short_pith_number":"pith:5ZBZVZ2E","canonical_record":{"source":{"id":"1708.07401","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-08-24T13:33:46Z","cross_cats_sorted":[],"title_canon_sha256":"cf17dfcdd7e1044e7c63b9bdf04b9bd97eb389fa6b69a84bea5e5fe5c79fbf2a","abstract_canon_sha256":"b3359267f9d1b253004ff77cd44c73d9ba56dc713f0f65586dfa0d478ef53690"},"schema_version":"1.0"},"canonical_sha256":"ee439ae744a4e633f7341535529c11bc9731d27960d0696d92a6a796fa16930d","source":{"kind":"arxiv","id":"1708.07401","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.07401","created_at":"2026-05-18T00:32:20Z"},{"alias_kind":"arxiv_version","alias_value":"1708.07401v2","created_at":"2026-05-18T00:32:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07401","created_at":"2026-05-18T00:32:20Z"},{"alias_kind":"pith_short_12","alias_value":"5ZBZVZ2EUTTD","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"5ZBZVZ2EUTTDH5ZU","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"5ZBZVZ2E","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:5ZBZVZ2EUTTDH5ZUCU2VFHARXS","target":"record","payload":{"canonical_record":{"source":{"id":"1708.07401","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-08-24T13:33:46Z","cross_cats_sorted":[],"title_canon_sha256":"cf17dfcdd7e1044e7c63b9bdf04b9bd97eb389fa6b69a84bea5e5fe5c79fbf2a","abstract_canon_sha256":"b3359267f9d1b253004ff77cd44c73d9ba56dc713f0f65586dfa0d478ef53690"},"schema_version":"1.0"},"canonical_sha256":"ee439ae744a4e633f7341535529c11bc9731d27960d0696d92a6a796fa16930d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:20.173561Z","signature_b64":"vn4holqAo1dkcZZhQZahS2lbOcXhqh8BFGIQN3EqdQF7gfwEHxQK1aX65Ml7VmnUkwin5ySBqifpJAht+UjxDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee439ae744a4e633f7341535529c11bc9731d27960d0696d92a6a796fa16930d","last_reissued_at":"2026-05-18T00:32:20.173009Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:20.173009Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.07401","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-18T00:32:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DmTeepTfLJWTKMWymrK+xxzDqi2ZToh+JUPEhwQTXrPp9Bw4S7Eb189g1MTaUSjB+AXkHdnKLPRQJ6LcIrwrDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:44:56.891680Z"},"content_sha256":"b58cc617b6354e87e5efc81bde5598a2b0d66244672da36c4a44da20960e440d","schema_version":"1.0","event_id":"sha256:b58cc617b6354e87e5efc81bde5598a2b0d66244672da36c4a44da20960e440d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:5ZBZVZ2EUTTDH5ZUCU2VFHARXS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Communication Lower Bounds for Matricized Tensor Times Khatri-Rao Product","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Grey Ballard, Kathryn Rouse, Nicholas Knight","submitted_at":"2017-08-24T13:33:46Z","abstract_excerpt":"The matricized-tensor times Khatri-Rao product computation is the typical bottleneck in algorithms for computing a CP decomposition of a tensor. In order to develop high performance sequential and parallel algorithms, we establish communication lower bounds that identify how much data movement is required for this computation in the case of dense tensors. We also present sequential and parallel algorithms that attain the lower bounds and are therefore communication optimal. In particular, we show that the structure of the computation allows for less communication than the straightforward appro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.07401","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-18T00:32:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GMg3d8Xd7NVTW2wKHzdiwTd8WhhWzKP5sY9qBMbWI6nBUcMytXfE0Hl7OZKg0oiMVBe6lN1a67fRAfnZfV4JAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:44:56.892020Z"},"content_sha256":"b15d3ac87cd34bf4182bb6b83a70043c3c4006b8541cae4a02776be5d0d92035","schema_version":"1.0","event_id":"sha256:b15d3ac87cd34bf4182bb6b83a70043c3c4006b8541cae4a02776be5d0d92035"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5ZBZVZ2EUTTDH5ZUCU2VFHARXS/bundle.json","state_url":"https://pith.science/pith/5ZBZVZ2EUTTDH5ZUCU2VFHARXS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5ZBZVZ2EUTTDH5ZUCU2VFHARXS/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-03T02:44:56Z","links":{"resolver":"https://pith.science/pith/5ZBZVZ2EUTTDH5ZUCU2VFHARXS","bundle":"https://pith.science/pith/5ZBZVZ2EUTTDH5ZUCU2VFHARXS/bundle.json","state":"https://pith.science/pith/5ZBZVZ2EUTTDH5ZUCU2VFHARXS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5ZBZVZ2EUTTDH5ZUCU2VFHARXS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:5ZBZVZ2EUTTDH5ZUCU2VFHARXS","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":"b3359267f9d1b253004ff77cd44c73d9ba56dc713f0f65586dfa0d478ef53690","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-08-24T13:33:46Z","title_canon_sha256":"cf17dfcdd7e1044e7c63b9bdf04b9bd97eb389fa6b69a84bea5e5fe5c79fbf2a"},"schema_version":"1.0","source":{"id":"1708.07401","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.07401","created_at":"2026-05-18T00:32:20Z"},{"alias_kind":"arxiv_version","alias_value":"1708.07401v2","created_at":"2026-05-18T00:32:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07401","created_at":"2026-05-18T00:32:20Z"},{"alias_kind":"pith_short_12","alias_value":"5ZBZVZ2EUTTD","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"5ZBZVZ2EUTTDH5ZU","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"5ZBZVZ2E","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:b15d3ac87cd34bf4182bb6b83a70043c3c4006b8541cae4a02776be5d0d92035","target":"graph","created_at":"2026-05-18T00:32:20Z","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 matricized-tensor times Khatri-Rao product computation is the typical bottleneck in algorithms for computing a CP decomposition of a tensor. In order to develop high performance sequential and parallel algorithms, we establish communication lower bounds that identify how much data movement is required for this computation in the case of dense tensors. We also present sequential and parallel algorithms that attain the lower bounds and are therefore communication optimal. In particular, we show that the structure of the computation allows for less communication than the straightforward appro","authors_text":"Grey Ballard, Kathryn Rouse, Nicholas Knight","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-08-24T13:33:46Z","title":"Communication Lower Bounds for Matricized Tensor Times Khatri-Rao Product"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.07401","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:b58cc617b6354e87e5efc81bde5598a2b0d66244672da36c4a44da20960e440d","target":"record","created_at":"2026-05-18T00:32:20Z","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":"b3359267f9d1b253004ff77cd44c73d9ba56dc713f0f65586dfa0d478ef53690","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-08-24T13:33:46Z","title_canon_sha256":"cf17dfcdd7e1044e7c63b9bdf04b9bd97eb389fa6b69a84bea5e5fe5c79fbf2a"},"schema_version":"1.0","source":{"id":"1708.07401","kind":"arxiv","version":2}},"canonical_sha256":"ee439ae744a4e633f7341535529c11bc9731d27960d0696d92a6a796fa16930d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee439ae744a4e633f7341535529c11bc9731d27960d0696d92a6a796fa16930d","first_computed_at":"2026-05-18T00:32:20.173009Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:20.173009Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vn4holqAo1dkcZZhQZahS2lbOcXhqh8BFGIQN3EqdQF7gfwEHxQK1aX65Ml7VmnUkwin5ySBqifpJAht+UjxDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:20.173561Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.07401","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b58cc617b6354e87e5efc81bde5598a2b0d66244672da36c4a44da20960e440d","sha256:b15d3ac87cd34bf4182bb6b83a70043c3c4006b8541cae4a02776be5d0d92035"],"state_sha256":"56c7af3180fa500d749a43b3a7482ae12f7dd751e5eef0d7b0afec2c7cdcaeee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FO3C1KojmMES7MP3emy1ywJeEsPQAXo4wupgY84LCSFki5Xv05dP8thAztt3SBUMOkrI92SxjVMHlfciAVbVCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T02:44:56.893991Z","bundle_sha256":"69b3b2dac8ca51bb72bda1b8b35fb91b902ee73153707ba6f1e3e881beaaa1eb"}}