{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:NFDDB3EDV4G7ADEZIZLLJE65GO","short_pith_number":"pith:NFDDB3ED","schema_version":"1.0","canonical_sha256":"694630ec83af0df00c994656b493dd33b7222ead3d4b841ddc1f6d7d58b86a5d","source":{"kind":"arxiv","id":"1909.05831","version":2},"attestation_state":"computed","paper":{"title":"Tight Lower Bound on the Tensor Rank based on the Maximally Square Unfolding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Bruno Scalzo Dees, Danilo P. Mandic, Giuseppe G. Calvi","submitted_at":"2019-09-12T17:38:02Z","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"},"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":"1909.05831","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-09-12T17:38:02Z","cross_cats_sorted":[],"title_canon_sha256":"050d9ec3b8865a6010e0887ba4ffaf931665e18aa611f310be69f8105c8fbb45","abstract_canon_sha256":"4a18dc6e88dba7c665ef3cec02e87b9c81d10b1f13493e5a14ce2a9fc66fa730"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:19:10.433736Z","signature_b64":"PhOaxbhze3WMqnhaSrFt2gtUUrTDxXk/naAblCgZM+34swEvYDdRBTxY755RsznnJ1IceE0cUAdQ7drg6/2DDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"694630ec83af0df00c994656b493dd33b7222ead3d4b841ddc1f6d7d58b86a5d","last_reissued_at":"2026-07-05T00:19:10.433254Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:19:10.433254Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tight Lower Bound on the Tensor Rank based on the Maximally Square Unfolding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Bruno Scalzo Dees, Danilo P. Mandic, Giuseppe G. Calvi","submitted_at":"2019-09-12T17:38:02Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.05831","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1909.05831/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1909.05831","created_at":"2026-07-05T00:19:10.433311+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.05831v2","created_at":"2026-07-05T00:19:10.433311+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.05831","created_at":"2026-07-05T00:19:10.433311+00:00"},{"alias_kind":"pith_short_12","alias_value":"NFDDB3EDV4G7","created_at":"2026-07-05T00:19:10.433311+00:00"},{"alias_kind":"pith_short_16","alias_value":"NFDDB3EDV4G7ADEZ","created_at":"2026-07-05T00:19:10.433311+00:00"},{"alias_kind":"pith_short_8","alias_value":"NFDDB3ED","created_at":"2026-07-05T00:19:10.433311+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/NFDDB3EDV4G7ADEZIZLLJE65GO","json":"https://pith.science/pith/NFDDB3EDV4G7ADEZIZLLJE65GO.json","graph_json":"https://pith.science/api/pith-number/NFDDB3EDV4G7ADEZIZLLJE65GO/graph.json","events_json":"https://pith.science/api/pith-number/NFDDB3EDV4G7ADEZIZLLJE65GO/events.json","paper":"https://pith.science/paper/NFDDB3ED"},"agent_actions":{"view_html":"https://pith.science/pith/NFDDB3EDV4G7ADEZIZLLJE65GO","download_json":"https://pith.science/pith/NFDDB3EDV4G7ADEZIZLLJE65GO.json","view_paper":"https://pith.science/paper/NFDDB3ED","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.05831&json=true","fetch_graph":"https://pith.science/api/pith-number/NFDDB3EDV4G7ADEZIZLLJE65GO/graph.json","fetch_events":"https://pith.science/api/pith-number/NFDDB3EDV4G7ADEZIZLLJE65GO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NFDDB3EDV4G7ADEZIZLLJE65GO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NFDDB3EDV4G7ADEZIZLLJE65GO/action/storage_attestation","attest_author":"https://pith.science/pith/NFDDB3EDV4G7ADEZIZLLJE65GO/action/author_attestation","sign_citation":"https://pith.science/pith/NFDDB3EDV4G7ADEZIZLLJE65GO/action/citation_signature","submit_replication":"https://pith.science/pith/NFDDB3EDV4G7ADEZIZLLJE65GO/action/replication_record"}},"created_at":"2026-07-05T00:19:10.433311+00:00","updated_at":"2026-07-05T00:19:10.433311+00:00"}