{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:TXDXYLREFZ7DJSUJULAVWKHOIM","short_pith_number":"pith:TXDXYLRE","canonical_record":{"source":{"id":"1809.00535","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2018-09-03T10:25:21Z","cross_cats_sorted":[],"title_canon_sha256":"76f35f79ff914f11018a1dc97d211a165927972425596e0a0ce4a617d685e389","abstract_canon_sha256":"1287bd14df5815ae15c7ec10e9596f5cd1aa418d046692db9b1ff42f68ae27f2"},"schema_version":"1.0"},"canonical_sha256":"9dc77c2e242e7e34ca89a2c15b28ee43208f6f4e24b1a0baa66b326074b30ae0","source":{"kind":"arxiv","id":"1809.00535","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.00535","created_at":"2026-05-18T00:06:33Z"},{"alias_kind":"arxiv_version","alias_value":"1809.00535v1","created_at":"2026-05-18T00:06:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.00535","created_at":"2026-05-18T00:06:33Z"},{"alias_kind":"pith_short_12","alias_value":"TXDXYLREFZ7D","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"TXDXYLREFZ7DJSUJ","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"TXDXYLRE","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:TXDXYLREFZ7DJSUJULAVWKHOIM","target":"record","payload":{"canonical_record":{"source":{"id":"1809.00535","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2018-09-03T10:25:21Z","cross_cats_sorted":[],"title_canon_sha256":"76f35f79ff914f11018a1dc97d211a165927972425596e0a0ce4a617d685e389","abstract_canon_sha256":"1287bd14df5815ae15c7ec10e9596f5cd1aa418d046692db9b1ff42f68ae27f2"},"schema_version":"1.0"},"canonical_sha256":"9dc77c2e242e7e34ca89a2c15b28ee43208f6f4e24b1a0baa66b326074b30ae0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:33.326538Z","signature_b64":"culWytPblKM4U5j2aN6FyextOk0yeSkEdN/AFWkfARS4vVTXQgZB6NJbiPrGA48J3Hj3g7UU0kQoIOCbIpV+DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9dc77c2e242e7e34ca89a2c15b28ee43208f6f4e24b1a0baa66b326074b30ae0","last_reissued_at":"2026-05-18T00:06:33.326016Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:33.326016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.00535","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:06:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tHwvdjIENUEYdHR2X1dDiSWUWUiAxDzwmAA3SwXyYr/KsLSZxINnHj1XBvWgsUTTguG7b9KKpMach1lwCycMCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T10:18:37.941109Z"},"content_sha256":"e07f7493772d34a0667292d1a8abe78c30d7437278cc5993854e27eb134159aa","schema_version":"1.0","event_id":"sha256:e07f7493772d34a0667292d1a8abe78c30d7437278cc5993854e27eb134159aa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:TXDXYLREFZ7DJSUJULAVWKHOIM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tensor Networks for Latent Variable Analysis: Higher Order Canonical Polyadic Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NA","authors_text":"Andrzej Cichocki, Anh-Huy Phan, Danilo Mandic, Giuseppe Calvi, Ivan Oseledets, Salman Ahmadi Asl","submitted_at":"2018-09-03T10:25:21Z","abstract_excerpt":"The Canonical Polyadic decomposition (CPD) is a convenient and intuitive tool for tensor factorization; however, for higher-order tensors, it often exhibits high computational cost and permutation of tensor entries, these undesirable effects grow exponentially with the tensor order. Prior compression of tensor in-hand can reduce the computational cost of CPD, but this is only applicable when the rank $R$ of the decomposition does not exceed the tensor dimensions. To resolve these issues, we present a novel method for CPD of higher-order tensors, which rests upon a simple tensor network of repr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.00535","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:06:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ggyphsbN9phnWHiu/M0ftKhXtQgAfvLGTAPLMMmbSZvQw0jwvUaq7x46WZNYlwFiBibEDVe31/8lxnsDrCHHCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T10:18:37.941513Z"},"content_sha256":"5f9305f2872dbe9a61d6389979dda804565978a0794e8a517ff3b23f5f8863a6","schema_version":"1.0","event_id":"sha256:5f9305f2872dbe9a61d6389979dda804565978a0794e8a517ff3b23f5f8863a6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TXDXYLREFZ7DJSUJULAVWKHOIM/bundle.json","state_url":"https://pith.science/pith/TXDXYLREFZ7DJSUJULAVWKHOIM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TXDXYLREFZ7DJSUJULAVWKHOIM/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-05-31T10:18:37Z","links":{"resolver":"https://pith.science/pith/TXDXYLREFZ7DJSUJULAVWKHOIM","bundle":"https://pith.science/pith/TXDXYLREFZ7DJSUJULAVWKHOIM/bundle.json","state":"https://pith.science/pith/TXDXYLREFZ7DJSUJULAVWKHOIM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TXDXYLREFZ7DJSUJULAVWKHOIM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:TXDXYLREFZ7DJSUJULAVWKHOIM","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":"1287bd14df5815ae15c7ec10e9596f5cd1aa418d046692db9b1ff42f68ae27f2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2018-09-03T10:25:21Z","title_canon_sha256":"76f35f79ff914f11018a1dc97d211a165927972425596e0a0ce4a617d685e389"},"schema_version":"1.0","source":{"id":"1809.00535","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.00535","created_at":"2026-05-18T00:06:33Z"},{"alias_kind":"arxiv_version","alias_value":"1809.00535v1","created_at":"2026-05-18T00:06:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.00535","created_at":"2026-05-18T00:06:33Z"},{"alias_kind":"pith_short_12","alias_value":"TXDXYLREFZ7D","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"TXDXYLREFZ7DJSUJ","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"TXDXYLRE","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:5f9305f2872dbe9a61d6389979dda804565978a0794e8a517ff3b23f5f8863a6","target":"graph","created_at":"2026-05-18T00:06:33Z","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 Canonical Polyadic decomposition (CPD) is a convenient and intuitive tool for tensor factorization; however, for higher-order tensors, it often exhibits high computational cost and permutation of tensor entries, these undesirable effects grow exponentially with the tensor order. Prior compression of tensor in-hand can reduce the computational cost of CPD, but this is only applicable when the rank $R$ of the decomposition does not exceed the tensor dimensions. To resolve these issues, we present a novel method for CPD of higher-order tensors, which rests upon a simple tensor network of repr","authors_text":"Andrzej Cichocki, Anh-Huy Phan, Danilo Mandic, Giuseppe Calvi, Ivan Oseledets, Salman Ahmadi Asl","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2018-09-03T10:25:21Z","title":"Tensor Networks for Latent Variable Analysis: Higher Order Canonical Polyadic Decomposition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.00535","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:e07f7493772d34a0667292d1a8abe78c30d7437278cc5993854e27eb134159aa","target":"record","created_at":"2026-05-18T00:06:33Z","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":"1287bd14df5815ae15c7ec10e9596f5cd1aa418d046692db9b1ff42f68ae27f2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2018-09-03T10:25:21Z","title_canon_sha256":"76f35f79ff914f11018a1dc97d211a165927972425596e0a0ce4a617d685e389"},"schema_version":"1.0","source":{"id":"1809.00535","kind":"arxiv","version":1}},"canonical_sha256":"9dc77c2e242e7e34ca89a2c15b28ee43208f6f4e24b1a0baa66b326074b30ae0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9dc77c2e242e7e34ca89a2c15b28ee43208f6f4e24b1a0baa66b326074b30ae0","first_computed_at":"2026-05-18T00:06:33.326016Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:33.326016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"culWytPblKM4U5j2aN6FyextOk0yeSkEdN/AFWkfARS4vVTXQgZB6NJbiPrGA48J3Hj3g7UU0kQoIOCbIpV+DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:33.326538Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.00535","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e07f7493772d34a0667292d1a8abe78c30d7437278cc5993854e27eb134159aa","sha256:5f9305f2872dbe9a61d6389979dda804565978a0794e8a517ff3b23f5f8863a6"],"state_sha256":"8b42e3d106bd67142c9ac4ef299a6692312eef224fc6dc00f235073b50074306"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T4pJSRZlr9XKrNG61UbbYe0+lyAnKGLgbM5pX8zaGI9JyJ5I6bDnVzQCIejUNFkA/3eRbYMzDoRC82Xk9pUtAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T10:18:37.944153Z","bundle_sha256":"9043fe58677d5c845f941fbfdcfa2229d3422f9a251a216cf37a9fe0f42a69a9"}}