{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:XEY7LEKC7AEQ2OWVP6WX4RSE6C","short_pith_number":"pith:XEY7LEKC","canonical_record":{"source":{"id":"2409.08771","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-09-13T12:28:42Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"eddf9a3635cc24ce5404cd6cfd05b2666867f4ed7fdc1a8846ac72aadd01e376","abstract_canon_sha256":"a10070d0eca6be1601b69d976d66824e15163a9f668442a325cd3b92bced2604"},"schema_version":"1.0"},"canonical_sha256":"b931f59142f8090d3ad57fad7e4644f08ca962c32771acfc14be51f24c3130bf","source":{"kind":"arxiv","id":"2409.08771","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.08771","created_at":"2026-07-05T11:40:31Z"},{"alias_kind":"arxiv_version","alias_value":"2409.08771v2","created_at":"2026-07-05T11:40:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.08771","created_at":"2026-07-05T11:40:31Z"},{"alias_kind":"pith_short_12","alias_value":"XEY7LEKC7AEQ","created_at":"2026-07-05T11:40:31Z"},{"alias_kind":"pith_short_16","alias_value":"XEY7LEKC7AEQ2OWV","created_at":"2026-07-05T11:40:31Z"},{"alias_kind":"pith_short_8","alias_value":"XEY7LEKC","created_at":"2026-07-05T11:40:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:XEY7LEKC7AEQ2OWVP6WX4RSE6C","target":"record","payload":{"canonical_record":{"source":{"id":"2409.08771","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-09-13T12:28:42Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"eddf9a3635cc24ce5404cd6cfd05b2666867f4ed7fdc1a8846ac72aadd01e376","abstract_canon_sha256":"a10070d0eca6be1601b69d976d66824e15163a9f668442a325cd3b92bced2604"},"schema_version":"1.0"},"canonical_sha256":"b931f59142f8090d3ad57fad7e4644f08ca962c32771acfc14be51f24c3130bf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:40:31.426025Z","signature_b64":"9aq1XYhFYWWaJm+DJwcc1WuvW/XFXYe5koJxc6yMyTTjLf5VDrJ6gc8oUzj3V3m/OXR5I+JHIOhTB2oIGoyXCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b931f59142f8090d3ad57fad7e4644f08ca962c32771acfc14be51f24c3130bf","last_reissued_at":"2026-07-05T11:40:31.425535Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:40:31.425535Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2409.08771","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:40:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dogV4CRpXjz9EXnsdCsVZ2CQ8qIBxeZ6i9iu6Lcjc9IfUyaAE0BNSbrYmM5KfA2N9NVzOLxmkUpGFf3dNRrbCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-24T00:22:15.764066Z"},"content_sha256":"245a29e48a24e3fb53ac0f26d1234bdf8ec75ece0bc30897db97f52af7b59379","schema_version":"1.0","event_id":"sha256:245a29e48a24e3fb53ac0f26d1234bdf8ec75ece0bc30897db97f52af7b59379"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:XEY7LEKC7AEQ2OWVP6WX4RSE6C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"In-depth Analysis of Low-rank Matrix Factorisation in a Federated Setting","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Constantin Philippenko, Kevin Scaman, Laurent Massouli\\'e","submitted_at":"2024-09-13T12:28:42Z","abstract_excerpt":"We analyze a distributed algorithm to compute a low-rank matrix factorization on $N$ clients, each holding a local dataset $\\mathbf{S}^i \\in \\mathbb{R}^{n_i \\times d}$, mathematically, we seek to solve $min_{\\mathbf{U}^i \\in \\mathbb{R}^{n_i\\times r}, \\mathbf{V}\\in \\mathbb{R}^{d \\times r} } \\frac{1}{2} \\sum_{i=1}^N \\|\\mathbf{S}^i - \\mathbf{U}^i \\mathbf{V}^\\top\\|^2_{\\text{F}}$. Considering a power initialization of $\\mathbf{V}$, we rewrite the previous smooth non-convex problem into a smooth strongly-convex problem that we solve using a parallel Nesterov gradient descent potentially requiring a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.08771","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/2409.08771/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:40:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GCN8OQ/WGIX5zykM23tgdv/ndKY7rA2kgKCdtQWVFb4ZDNPf2yoT31dSXVwqvGTW5zTwnJPs8WfscW+z+TwfAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-24T00:22:15.764561Z"},"content_sha256":"377ebc81fa34c5283636d1f4a5c37d37b93417dfddb3df11b982cf3ec5dd307e","schema_version":"1.0","event_id":"sha256:377ebc81fa34c5283636d1f4a5c37d37b93417dfddb3df11b982cf3ec5dd307e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XEY7LEKC7AEQ2OWVP6WX4RSE6C/bundle.json","state_url":"https://pith.science/pith/XEY7LEKC7AEQ2OWVP6WX4RSE6C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XEY7LEKC7AEQ2OWVP6WX4RSE6C/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-24T00:22:15Z","links":{"resolver":"https://pith.science/pith/XEY7LEKC7AEQ2OWVP6WX4RSE6C","bundle":"https://pith.science/pith/XEY7LEKC7AEQ2OWVP6WX4RSE6C/bundle.json","state":"https://pith.science/pith/XEY7LEKC7AEQ2OWVP6WX4RSE6C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XEY7LEKC7AEQ2OWVP6WX4RSE6C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:XEY7LEKC7AEQ2OWVP6WX4RSE6C","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":"a10070d0eca6be1601b69d976d66824e15163a9f668442a325cd3b92bced2604","cross_cats_sorted":["math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-09-13T12:28:42Z","title_canon_sha256":"eddf9a3635cc24ce5404cd6cfd05b2666867f4ed7fdc1a8846ac72aadd01e376"},"schema_version":"1.0","source":{"id":"2409.08771","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.08771","created_at":"2026-07-05T11:40:31Z"},{"alias_kind":"arxiv_version","alias_value":"2409.08771v2","created_at":"2026-07-05T11:40:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.08771","created_at":"2026-07-05T11:40:31Z"},{"alias_kind":"pith_short_12","alias_value":"XEY7LEKC7AEQ","created_at":"2026-07-05T11:40:31Z"},{"alias_kind":"pith_short_16","alias_value":"XEY7LEKC7AEQ2OWV","created_at":"2026-07-05T11:40:31Z"},{"alias_kind":"pith_short_8","alias_value":"XEY7LEKC","created_at":"2026-07-05T11:40:31Z"}],"graph_snapshots":[{"event_id":"sha256:377ebc81fa34c5283636d1f4a5c37d37b93417dfddb3df11b982cf3ec5dd307e","target":"graph","created_at":"2026-07-05T11:40:31Z","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/2409.08771/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We analyze a distributed algorithm to compute a low-rank matrix factorization on $N$ clients, each holding a local dataset $\\mathbf{S}^i \\in \\mathbb{R}^{n_i \\times d}$, mathematically, we seek to solve $min_{\\mathbf{U}^i \\in \\mathbb{R}^{n_i\\times r}, \\mathbf{V}\\in \\mathbb{R}^{d \\times r} } \\frac{1}{2} \\sum_{i=1}^N \\|\\mathbf{S}^i - \\mathbf{U}^i \\mathbf{V}^\\top\\|^2_{\\text{F}}$. Considering a power initialization of $\\mathbf{V}$, we rewrite the previous smooth non-convex problem into a smooth strongly-convex problem that we solve using a parallel Nesterov gradient descent potentially requiring a ","authors_text":"Constantin Philippenko, Kevin Scaman, Laurent Massouli\\'e","cross_cats":["math.OC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-09-13T12:28:42Z","title":"In-depth Analysis of Low-rank Matrix Factorisation in a Federated Setting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.08771","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:245a29e48a24e3fb53ac0f26d1234bdf8ec75ece0bc30897db97f52af7b59379","target":"record","created_at":"2026-07-05T11:40:31Z","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":"a10070d0eca6be1601b69d976d66824e15163a9f668442a325cd3b92bced2604","cross_cats_sorted":["math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-09-13T12:28:42Z","title_canon_sha256":"eddf9a3635cc24ce5404cd6cfd05b2666867f4ed7fdc1a8846ac72aadd01e376"},"schema_version":"1.0","source":{"id":"2409.08771","kind":"arxiv","version":2}},"canonical_sha256":"b931f59142f8090d3ad57fad7e4644f08ca962c32771acfc14be51f24c3130bf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b931f59142f8090d3ad57fad7e4644f08ca962c32771acfc14be51f24c3130bf","first_computed_at":"2026-07-05T11:40:31.425535Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:40:31.425535Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9aq1XYhFYWWaJm+DJwcc1WuvW/XFXYe5koJxc6yMyTTjLf5VDrJ6gc8oUzj3V3m/OXR5I+JHIOhTB2oIGoyXCA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:40:31.426025Z","signed_message":"canonical_sha256_bytes"},"source_id":"2409.08771","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:245a29e48a24e3fb53ac0f26d1234bdf8ec75ece0bc30897db97f52af7b59379","sha256:377ebc81fa34c5283636d1f4a5c37d37b93417dfddb3df11b982cf3ec5dd307e"],"state_sha256":"98929fb812dd503730e1b3c68e5c6bcc766dcb02eabc1c54af63a36ebdeb7e6b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pratYHNiPNH0U3FHc7xvHq4u8DDnwCZp1wvzemFUJ+xfAeipXXT1/y1VPuJbImffseSfRUsJ+Nb8uWBx4KEXDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-24T00:22:15.768726Z","bundle_sha256":"00ff8ca76ee20c312a280e990738e13f8791030ed09f007813fdac24421c6b76"}}