{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:YL4LUJKPYQW7PTZYBZY3KTOHGW","short_pith_number":"pith:YL4LUJKP","canonical_record":{"source":{"id":"1712.07495","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-12-20T14:28:21Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"3c1f7ec64c29b8094673f40dfdcd2c24f47b29227d70a680fef7b9f19ef56cb5","abstract_canon_sha256":"7513f10861918623fdd69ca5309a0d0b6d378a8e0788194cdc39e98db8379f60"},"schema_version":"1.0"},"canonical_sha256":"c2f8ba254fc42df7cf380e71b54dc7359e84f8f12ebb15b272a2f0cf89471ce6","source":{"kind":"arxiv","id":"1712.07495","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.07495","created_at":"2026-05-18T00:16:08Z"},{"alias_kind":"arxiv_version","alias_value":"1712.07495v2","created_at":"2026-05-18T00:16:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.07495","created_at":"2026-05-18T00:16:08Z"},{"alias_kind":"pith_short_12","alias_value":"YL4LUJKPYQW7","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YL4LUJKPYQW7PTZY","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YL4LUJKP","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:YL4LUJKPYQW7PTZYBZY3KTOHGW","target":"record","payload":{"canonical_record":{"source":{"id":"1712.07495","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-12-20T14:28:21Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"3c1f7ec64c29b8094673f40dfdcd2c24f47b29227d70a680fef7b9f19ef56cb5","abstract_canon_sha256":"7513f10861918623fdd69ca5309a0d0b6d378a8e0788194cdc39e98db8379f60"},"schema_version":"1.0"},"canonical_sha256":"c2f8ba254fc42df7cf380e71b54dc7359e84f8f12ebb15b272a2f0cf89471ce6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:08.151386Z","signature_b64":"jS0s2elKulI5jr2fecB2GFIzfoLPcRgImAA+26SB0Rh1H3XnmP9h7X9SB6q05cQQf8U7anFHS6YyOMZ49GLmCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2f8ba254fc42df7cf380e71b54dc7359e84f8f12ebb15b272a2f0cf89471ce6","last_reissued_at":"2026-05-18T00:16:08.150665Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:08.150665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.07495","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-05-18T00:16:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H0YSViuYtCEygfkvoxkPecECKM6V06jTP/HhpAu1xBfieG63RU8lS/35XH7a67MSoCruhUQiBA1Lj0izavDYBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T08:20:47.056710Z"},"content_sha256":"e35ba1ba8e4358993e809d7b7e5b4e55724f9be76de45f0b9699516de955b5b6","schema_version":"1.0","event_id":"sha256:e35ba1ba8e4358993e809d7b7e5b4e55724f9be76de45f0b9699516de955b5b6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:YL4LUJKPYQW7PTZYBZY3KTOHGW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Distributed Frank-Wolfe Framework for Learning Low-Rank Matrices with the Trace Norm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.DC","authors_text":"Aur\\'elien Bellet, Patrick Gallinari, Wenjie Zheng","submitted_at":"2017-12-20T14:28:21Z","abstract_excerpt":"We consider the problem of learning a high-dimensional but low-rank matrix from a large-scale dataset distributed over several machines, where low-rankness is enforced by a convex trace norm constraint. We propose DFW-Trace, a distributed Frank-Wolfe algorithm which leverages the low-rank structure of its updates to achieve efficiency in time, memory and communication usage. The step at the heart of DFW-Trace is solved approximately using a distributed version of the power method. We provide a theoretical analysis of the convergence of DFW-Trace, showing that we can ensure sublinear convergenc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.07495","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":""},"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-05-18T00:16:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cRbpPAw6jSj+x0ApmXeJwg9wP7aLDmLYqJCOQ8HmK+wOZ2uo+8c/E43Rt+Qo2haOBxFLyOezu6wf+5IvnEheAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T08:20:47.057093Z"},"content_sha256":"67b0dc4541f06a605666dbf3c373614b5297d3a96fc4aa2c4a4a9373f62d8375","schema_version":"1.0","event_id":"sha256:67b0dc4541f06a605666dbf3c373614b5297d3a96fc4aa2c4a4a9373f62d8375"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YL4LUJKPYQW7PTZYBZY3KTOHGW/bundle.json","state_url":"https://pith.science/pith/YL4LUJKPYQW7PTZYBZY3KTOHGW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YL4LUJKPYQW7PTZYBZY3KTOHGW/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-07-01T08:20:47Z","links":{"resolver":"https://pith.science/pith/YL4LUJKPYQW7PTZYBZY3KTOHGW","bundle":"https://pith.science/pith/YL4LUJKPYQW7PTZYBZY3KTOHGW/bundle.json","state":"https://pith.science/pith/YL4LUJKPYQW7PTZYBZY3KTOHGW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YL4LUJKPYQW7PTZYBZY3KTOHGW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:YL4LUJKPYQW7PTZYBZY3KTOHGW","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":"7513f10861918623fdd69ca5309a0d0b6d378a8e0788194cdc39e98db8379f60","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-12-20T14:28:21Z","title_canon_sha256":"3c1f7ec64c29b8094673f40dfdcd2c24f47b29227d70a680fef7b9f19ef56cb5"},"schema_version":"1.0","source":{"id":"1712.07495","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.07495","created_at":"2026-05-18T00:16:08Z"},{"alias_kind":"arxiv_version","alias_value":"1712.07495v2","created_at":"2026-05-18T00:16:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.07495","created_at":"2026-05-18T00:16:08Z"},{"alias_kind":"pith_short_12","alias_value":"YL4LUJKPYQW7","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YL4LUJKPYQW7PTZY","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YL4LUJKP","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:67b0dc4541f06a605666dbf3c373614b5297d3a96fc4aa2c4a4a9373f62d8375","target":"graph","created_at":"2026-05-18T00:16:08Z","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"},"paper":{"abstract_excerpt":"We consider the problem of learning a high-dimensional but low-rank matrix from a large-scale dataset distributed over several machines, where low-rankness is enforced by a convex trace norm constraint. We propose DFW-Trace, a distributed Frank-Wolfe algorithm which leverages the low-rank structure of its updates to achieve efficiency in time, memory and communication usage. The step at the heart of DFW-Trace is solved approximately using a distributed version of the power method. We provide a theoretical analysis of the convergence of DFW-Trace, showing that we can ensure sublinear convergenc","authors_text":"Aur\\'elien Bellet, Patrick Gallinari, Wenjie Zheng","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-12-20T14:28:21Z","title":"A Distributed Frank-Wolfe Framework for Learning Low-Rank Matrices with the Trace Norm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.07495","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:e35ba1ba8e4358993e809d7b7e5b4e55724f9be76de45f0b9699516de955b5b6","target":"record","created_at":"2026-05-18T00:16:08Z","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":"7513f10861918623fdd69ca5309a0d0b6d378a8e0788194cdc39e98db8379f60","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-12-20T14:28:21Z","title_canon_sha256":"3c1f7ec64c29b8094673f40dfdcd2c24f47b29227d70a680fef7b9f19ef56cb5"},"schema_version":"1.0","source":{"id":"1712.07495","kind":"arxiv","version":2}},"canonical_sha256":"c2f8ba254fc42df7cf380e71b54dc7359e84f8f12ebb15b272a2f0cf89471ce6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c2f8ba254fc42df7cf380e71b54dc7359e84f8f12ebb15b272a2f0cf89471ce6","first_computed_at":"2026-05-18T00:16:08.150665Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:08.150665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jS0s2elKulI5jr2fecB2GFIzfoLPcRgImAA+26SB0Rh1H3XnmP9h7X9SB6q05cQQf8U7anFHS6YyOMZ49GLmCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:08.151386Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.07495","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e35ba1ba8e4358993e809d7b7e5b4e55724f9be76de45f0b9699516de955b5b6","sha256:67b0dc4541f06a605666dbf3c373614b5297d3a96fc4aa2c4a4a9373f62d8375"],"state_sha256":"f44a8296813bbb1fa809f07db66e48ddc978a2fa80e875001ec93c54bae4ea47"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E9uv1wUAEAd1D9HOIFi0NuvY14fRy79jISKGcfDHhzezLTyP0d9ZTIOKVN9K3AllGzrBYrUy46gJYrHrodDBAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T08:20:47.059571Z","bundle_sha256":"351288191f497c5b24e6233140ef8b307a1c2e0bbe114063e0d2a7e8d5140902"}}