{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:6XJE3EQM46A6MIQWHGT6CYGIRB","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":"e947671a03a407455c6b968a58c882c90fadc29c4e8ef908a277b5065b8fd272","cross_cats_sorted":["eess.SP","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-04-18T11:14:25Z","title_canon_sha256":"b3c2c0107ee84b5e9cd877c532414ccd7d625cc763eb62571f9dd853e765f96f"},"schema_version":"1.0","source":{"id":"2504.13633","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.13633","created_at":"2026-07-05T10:52:23Z"},{"alias_kind":"arxiv_version","alias_value":"2504.13633v2","created_at":"2026-07-05T10:52:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.13633","created_at":"2026-07-05T10:52:23Z"},{"alias_kind":"pith_short_12","alias_value":"6XJE3EQM46A6","created_at":"2026-07-05T10:52:23Z"},{"alias_kind":"pith_short_16","alias_value":"6XJE3EQM46A6MIQW","created_at":"2026-07-05T10:52:23Z"},{"alias_kind":"pith_short_8","alias_value":"6XJE3EQM","created_at":"2026-07-05T10:52:23Z"}],"graph_snapshots":[{"event_id":"sha256:6f726e7b202dfbeb0f7508a9568a5fde81ee68ba458f558683a4c5c7c6ca4f37","target":"graph","created_at":"2026-07-05T10:52:23Z","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/2504.13633/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Hadamard decomposition is a powerful technique for data analysis and matrix compression, which decomposes a given matrix into the element-wise product of two or more low-rank matrices. In this paper, we develop an efficient algorithm to solve this problem, leveraging an alternating optimization approach that decomposes the global non-convex problem into a series of convex sub-problems. To improve performance, we explore advanced initialization strategies inspired by the singular value decomposition (SVD) and incorporate acceleration techniques by introducing momentum-based updates. Beyond ","authors_text":"Arnaud Vandaele, Nicolas Gillis, Samuel Wertz","cross_cats":["eess.SP","math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-04-18T11:14:25Z","title":"Efficient algorithms for the Hadamard decomposition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.13633","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:c9d1ab41e21c1c93b21010f954ccd5dc51742a738769d1725218b85f7fec3612","target":"record","created_at":"2026-07-05T10:52:23Z","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":"e947671a03a407455c6b968a58c882c90fadc29c4e8ef908a277b5065b8fd272","cross_cats_sorted":["eess.SP","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-04-18T11:14:25Z","title_canon_sha256":"b3c2c0107ee84b5e9cd877c532414ccd7d625cc763eb62571f9dd853e765f96f"},"schema_version":"1.0","source":{"id":"2504.13633","kind":"arxiv","version":2}},"canonical_sha256":"f5d24d920ce781e6221639a7e160c8887727e7ea069578b417ac362c1ddb340d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f5d24d920ce781e6221639a7e160c8887727e7ea069578b417ac362c1ddb340d","first_computed_at":"2026-07-05T10:52:23.043073Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:52:23.043073Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Opa7+A/+cV373QwhBndWJr4wd/iuYQSh9Ny2RdMOnTbUDn2m3/RQPQYN/wAfzBaEFLEsJ4teKSXcZ2FLxQkzDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:52:23.043549Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.13633","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c9d1ab41e21c1c93b21010f954ccd5dc51742a738769d1725218b85f7fec3612","sha256:6f726e7b202dfbeb0f7508a9568a5fde81ee68ba458f558683a4c5c7c6ca4f37"],"state_sha256":"d1a0a3a3151b8ecd3a284eec8e8acd7faf6430e6309933cf3ae53cf1a43ecd1b"}