{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:NFDDB3EDV4G7ADEZIZLLJE65GO","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":"4a18dc6e88dba7c665ef3cec02e87b9c81d10b1f13493e5a14ce2a9fc66fa730","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-09-12T17:38:02Z","title_canon_sha256":"050d9ec3b8865a6010e0887ba4ffaf931665e18aa611f310be69f8105c8fbb45"},"schema_version":"1.0","source":{"id":"1909.05831","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.05831","created_at":"2026-07-05T00:19:10Z"},{"alias_kind":"arxiv_version","alias_value":"1909.05831v2","created_at":"2026-07-05T00:19:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.05831","created_at":"2026-07-05T00:19:10Z"},{"alias_kind":"pith_short_12","alias_value":"NFDDB3EDV4G7","created_at":"2026-07-05T00:19:10Z"},{"alias_kind":"pith_short_16","alias_value":"NFDDB3EDV4G7ADEZ","created_at":"2026-07-05T00:19:10Z"},{"alias_kind":"pith_short_8","alias_value":"NFDDB3ED","created_at":"2026-07-05T00:19:10Z"}],"graph_snapshots":[{"event_id":"sha256:058bf78aaec58e768273c6c230f0e6aa730600b0d393aa9cdcb8bf369bc3eae4","target":"graph","created_at":"2026-07-05T00:19:10Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1909.05831/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Tensors decompositions are a class of tools for analysing datasets of high dimensionality and variety in a natural manner, with the Canonical Polyadic Decomposition (CPD) being a main pillar. While the notion of CPD is closely intertwined with that of the tensor rank, $R$, unlike the matrix rank, the computation of the tensor rank is an NP-hard problem, owing to the associated computational burden of evaluating the CPD. To address this issue, we investigate tight lower bounds on $R$ with the aim to provide a reduced search space, and hence to lessen the computational costs of the CPD evaluatio","authors_text":"Bruno Scalzo Dees, Danilo P. Mandic, Giuseppe G. Calvi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-09-12T17:38:02Z","title":"Tight Lower Bound on the Tensor Rank based on the Maximally Square Unfolding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.05831","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:b5271ec114ace69b0760b93c59a5f442c70f5690590cc8eb3139dad3ce9c972f","target":"record","created_at":"2026-07-05T00:19:10Z","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":"4a18dc6e88dba7c665ef3cec02e87b9c81d10b1f13493e5a14ce2a9fc66fa730","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-09-12T17:38:02Z","title_canon_sha256":"050d9ec3b8865a6010e0887ba4ffaf931665e18aa611f310be69f8105c8fbb45"},"schema_version":"1.0","source":{"id":"1909.05831","kind":"arxiv","version":2}},"canonical_sha256":"694630ec83af0df00c994656b493dd33b7222ead3d4b841ddc1f6d7d58b86a5d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"694630ec83af0df00c994656b493dd33b7222ead3d4b841ddc1f6d7d58b86a5d","first_computed_at":"2026-07-05T00:19:10.433254Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:19:10.433254Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PhOaxbhze3WMqnhaSrFt2gtUUrTDxXk/naAblCgZM+34swEvYDdRBTxY755RsznnJ1IceE0cUAdQ7drg6/2DDg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:19:10.433736Z","signed_message":"canonical_sha256_bytes"},"source_id":"1909.05831","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b5271ec114ace69b0760b93c59a5f442c70f5690590cc8eb3139dad3ce9c972f","sha256:058bf78aaec58e768273c6c230f0e6aa730600b0d393aa9cdcb8bf369bc3eae4"],"state_sha256":"2a0e0088074ca7eec55d43aad9be4ffb551abaaedd607f654f1368226cc49b8e"}