{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:AUEJZWLWJ57CWAOLDEZ4MVHX2F","short_pith_number":"pith:AUEJZWLW","schema_version":"1.0","canonical_sha256":"05089cd9764f7e2b01cb1933c654f7d15ae4bb494f49702af91cdc151c863d81","source":{"kind":"arxiv","id":"2505.12713","version":1},"attestation_state":"computed","paper":{"title":"Identifiability of Nonnegative Tucker Decompositions -- Part I: Theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA","eess.SP","stat.ML"],"primary_cat":"math.NA","authors_text":"Giovanni Barbarino, Nicolas Gillis, Subhayan Saha","submitted_at":"2025-05-19T05:08:37Z","abstract_excerpt":"Tensor decompositions have become a central tool in data science, with applications in areas such as data analysis, signal processing, and machine learning. A key property of many tensor decompositions, such as the canonical polyadic decomposition, is identifiability: the factors are unique, up to trivial scaling and permutation ambiguities. This allows one to recover the groundtruth sources that generated the data. The Tucker decomposition (TD) is a central and widely used tensor decomposition model. However, it is in general not identifiable. In this paper, we study the identifiability of th"},"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":"2505.12713","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2025-05-19T05:08:37Z","cross_cats_sorted":["cs.LG","cs.NA","eess.SP","stat.ML"],"title_canon_sha256":"596969d76c98f555a32147c96d5efe820fedbb0bc94f694f80c6b606cdcceeef","abstract_canon_sha256":"f9e15fb54e1d08fc0590d48336eb3d5cd519432daba11a16d8b4fa37a4a141a7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:05:08.635814Z","signature_b64":"+0XJKoz30L6nzRKy+0j/63xQ12aKPQVEvdz409zEemU6ToyjLRWpXEpVrra8WhLsp9lhjCzEI9RiGdEs7wzlAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05089cd9764f7e2b01cb1933c654f7d15ae4bb494f49702af91cdc151c863d81","last_reissued_at":"2026-07-05T11:05:08.635397Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:05:08.635397Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Identifiability of Nonnegative Tucker Decompositions -- Part I: Theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA","eess.SP","stat.ML"],"primary_cat":"math.NA","authors_text":"Giovanni Barbarino, Nicolas Gillis, Subhayan Saha","submitted_at":"2025-05-19T05:08:37Z","abstract_excerpt":"Tensor decompositions have become a central tool in data science, with applications in areas such as data analysis, signal processing, and machine learning. A key property of many tensor decompositions, such as the canonical polyadic decomposition, is identifiability: the factors are unique, up to trivial scaling and permutation ambiguities. This allows one to recover the groundtruth sources that generated the data. The Tucker decomposition (TD) is a central and widely used tensor decomposition model. However, it is in general not identifiable. In this paper, we study the identifiability of th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.12713","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.12713/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":"2505.12713","created_at":"2026-07-05T11:05:08.635457+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.12713v1","created_at":"2026-07-05T11:05:08.635457+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.12713","created_at":"2026-07-05T11:05:08.635457+00:00"},{"alias_kind":"pith_short_12","alias_value":"AUEJZWLWJ57C","created_at":"2026-07-05T11:05:08.635457+00:00"},{"alias_kind":"pith_short_16","alias_value":"AUEJZWLWJ57CWAOL","created_at":"2026-07-05T11:05:08.635457+00:00"},{"alias_kind":"pith_short_8","alias_value":"AUEJZWLW","created_at":"2026-07-05T11:05:08.635457+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/AUEJZWLWJ57CWAOLDEZ4MVHX2F","json":"https://pith.science/pith/AUEJZWLWJ57CWAOLDEZ4MVHX2F.json","graph_json":"https://pith.science/api/pith-number/AUEJZWLWJ57CWAOLDEZ4MVHX2F/graph.json","events_json":"https://pith.science/api/pith-number/AUEJZWLWJ57CWAOLDEZ4MVHX2F/events.json","paper":"https://pith.science/paper/AUEJZWLW"},"agent_actions":{"view_html":"https://pith.science/pith/AUEJZWLWJ57CWAOLDEZ4MVHX2F","download_json":"https://pith.science/pith/AUEJZWLWJ57CWAOLDEZ4MVHX2F.json","view_paper":"https://pith.science/paper/AUEJZWLW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.12713&json=true","fetch_graph":"https://pith.science/api/pith-number/AUEJZWLWJ57CWAOLDEZ4MVHX2F/graph.json","fetch_events":"https://pith.science/api/pith-number/AUEJZWLWJ57CWAOLDEZ4MVHX2F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AUEJZWLWJ57CWAOLDEZ4MVHX2F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AUEJZWLWJ57CWAOLDEZ4MVHX2F/action/storage_attestation","attest_author":"https://pith.science/pith/AUEJZWLWJ57CWAOLDEZ4MVHX2F/action/author_attestation","sign_citation":"https://pith.science/pith/AUEJZWLWJ57CWAOLDEZ4MVHX2F/action/citation_signature","submit_replication":"https://pith.science/pith/AUEJZWLWJ57CWAOLDEZ4MVHX2F/action/replication_record"}},"created_at":"2026-07-05T11:05:08.635457+00:00","updated_at":"2026-07-05T11:05:08.635457+00:00"}