{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:KTPEYQNW33IY6B7D26UMATCXIU","short_pith_number":"pith:KTPEYQNW","schema_version":"1.0","canonical_sha256":"54de4c41b6ded18f07e3d7a8c04c574510c1b1f4cd80ef92e4770e4938f5806d","source":{"kind":"arxiv","id":"2110.01235","version":2},"attestation_state":"computed","paper":{"title":"Identifiability in Two-Layer Sparse Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Elisa Riccietti (DANTE), L\\'eon Zheng (DANTE), R\\'emi Gribonval (DANTE)","submitted_at":"2021-10-04T07:56:37Z","abstract_excerpt":"Sparse matrix factorization is the problem of approximating a matrix $\\mathbf{Z}$ by a product of $J$ sparse factors $\\mathbf{X}^{(J)} \\mathbf{X}^{(J-1)}  \\ldots \\mathbf{X}^{(1)}$. This paper focuses on identifiability issues that appear in this problem, in view of better understanding under which sparsity constraints the problem is well-posed. We give conditions under which the problem of factorizing a matrix into \\emph{two} sparse factors admits a unique solution, up to unavoidable permutation and scaling equivalences. Our general framework considers an arbitrary family of prescribed sparsit"},"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":"2110.01235","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-10-04T07:56:37Z","cross_cats_sorted":[],"title_canon_sha256":"aacb2d9e3dfae3e017777392538c3ebf5de188a6b1a26f9bc81c91d8392bc2e1","abstract_canon_sha256":"65f4853cd2ac4273e90d7ec33990a4e231ea52c437884e6d37d2b6e14c69c0d7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:32:54.815724Z","signature_b64":"sD8NXUi9+qNzevat7hE9Oi+Yms4Agne3ez2A492uviUJY+M2I5ZSRWlZqGJZJEmxWZaTX7nWIHLm2ykCZ+NrAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"54de4c41b6ded18f07e3d7a8c04c574510c1b1f4cd80ef92e4770e4938f5806d","last_reissued_at":"2026-07-05T03:32:54.815073Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:32:54.815073Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Identifiability in Two-Layer Sparse Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Elisa Riccietti (DANTE), L\\'eon Zheng (DANTE), R\\'emi Gribonval (DANTE)","submitted_at":"2021-10-04T07:56:37Z","abstract_excerpt":"Sparse matrix factorization is the problem of approximating a matrix $\\mathbf{Z}$ by a product of $J$ sparse factors $\\mathbf{X}^{(J)} \\mathbf{X}^{(J-1)}  \\ldots \\mathbf{X}^{(1)}$. This paper focuses on identifiability issues that appear in this problem, in view of better understanding under which sparsity constraints the problem is well-posed. We give conditions under which the problem of factorizing a matrix into \\emph{two} sparse factors admits a unique solution, up to unavoidable permutation and scaling equivalences. Our general framework considers an arbitrary family of prescribed sparsit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.01235","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/2110.01235/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":"2110.01235","created_at":"2026-07-05T03:32:54.815130+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.01235v2","created_at":"2026-07-05T03:32:54.815130+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.01235","created_at":"2026-07-05T03:32:54.815130+00:00"},{"alias_kind":"pith_short_12","alias_value":"KTPEYQNW33IY","created_at":"2026-07-05T03:32:54.815130+00:00"},{"alias_kind":"pith_short_16","alias_value":"KTPEYQNW33IY6B7D","created_at":"2026-07-05T03:32:54.815130+00:00"},{"alias_kind":"pith_short_8","alias_value":"KTPEYQNW","created_at":"2026-07-05T03:32:54.815130+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.03913","citing_title":"Sparse Weight Decomposition for Efficient Circuit Extraction","ref_index":25,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KTPEYQNW33IY6B7D26UMATCXIU","json":"https://pith.science/pith/KTPEYQNW33IY6B7D26UMATCXIU.json","graph_json":"https://pith.science/api/pith-number/KTPEYQNW33IY6B7D26UMATCXIU/graph.json","events_json":"https://pith.science/api/pith-number/KTPEYQNW33IY6B7D26UMATCXIU/events.json","paper":"https://pith.science/paper/KTPEYQNW"},"agent_actions":{"view_html":"https://pith.science/pith/KTPEYQNW33IY6B7D26UMATCXIU","download_json":"https://pith.science/pith/KTPEYQNW33IY6B7D26UMATCXIU.json","view_paper":"https://pith.science/paper/KTPEYQNW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.01235&json=true","fetch_graph":"https://pith.science/api/pith-number/KTPEYQNW33IY6B7D26UMATCXIU/graph.json","fetch_events":"https://pith.science/api/pith-number/KTPEYQNW33IY6B7D26UMATCXIU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KTPEYQNW33IY6B7D26UMATCXIU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KTPEYQNW33IY6B7D26UMATCXIU/action/storage_attestation","attest_author":"https://pith.science/pith/KTPEYQNW33IY6B7D26UMATCXIU/action/author_attestation","sign_citation":"https://pith.science/pith/KTPEYQNW33IY6B7D26UMATCXIU/action/citation_signature","submit_replication":"https://pith.science/pith/KTPEYQNW33IY6B7D26UMATCXIU/action/replication_record"}},"created_at":"2026-07-05T03:32:54.815130+00:00","updated_at":"2026-07-05T03:32:54.815130+00:00"}