{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:2RJF25DCMBPL7VHBD3277WGSBF","short_pith_number":"pith:2RJF25DC","canonical_record":{"source":{"id":"1409.5705","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-09-19T15:42:28Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"abd25c36d0c796bfa74d518d30ec1909738f054a617b95ca31802076156b142d","abstract_canon_sha256":"20a7e507d4aab4ed6d63d5be68cd870659f8b3949ea19a344cbf684abf83a030"},"schema_version":"1.0"},"canonical_sha256":"d4525d7462605ebfd4e11ef5ffd8d2097771a8c67424c32eecfb32b88a6445f1","source":{"kind":"arxiv","id":"1409.5705","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.5705","created_at":"2026-05-18T01:33:56Z"},{"alias_kind":"arxiv_version","alias_value":"1409.5705v2","created_at":"2026-05-18T01:33:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.5705","created_at":"2026-05-18T01:33:56Z"},{"alias_kind":"pith_short_12","alias_value":"2RJF25DCMBPL","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2RJF25DCMBPL7VHB","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2RJF25DC","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:2RJF25DCMBPL7VHBD3277WGSBF","target":"record","payload":{"canonical_record":{"source":{"id":"1409.5705","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-09-19T15:42:28Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"abd25c36d0c796bfa74d518d30ec1909738f054a617b95ca31802076156b142d","abstract_canon_sha256":"20a7e507d4aab4ed6d63d5be68cd870659f8b3949ea19a344cbf684abf83a030"},"schema_version":"1.0"},"canonical_sha256":"d4525d7462605ebfd4e11ef5ffd8d2097771a8c67424c32eecfb32b88a6445f1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:56.987562Z","signature_b64":"RYevs+uhO8si2mFx1IRcgCARO/gWWEbvlFK7WY8ZFCSPDV1GVS/yKsTMegzVkoj8mbTK4A4RFjvdHsBEnRI4CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4525d7462605ebfd4e11ef5ffd8d2097771a8c67424c32eecfb32b88a6445f1","last_reissued_at":"2026-05-18T01:33:56.987217Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:56.987217Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.5705","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-18T01:33:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1GgLRf5obPAqqsepQM+TDrllwrtkFGIz4+Gv/W/s1P5laPWaRHwq3UStfcinftJPj/3A75Q1u2ojOZmhAiIACQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T03:22:31.083671Z"},"content_sha256":"2d86139642dda83caf8c3867c7e3a8d70c58a6838206dae200b753fa2dd166e5","schema_version":"1.0","event_id":"sha256:2d86139642dda83caf8c3867c7e3a8d70c58a6838206dae200b753fa2dd166e5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:2RJF25DCMBPL7VHBD3277WGSBF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Machine Learning via Sufficient Factor Broadcasting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.LG","authors_text":"Abhimanu Kumar, Eric Xing, Jin Kyu Kim, Pengtao Xie, Qirong Ho, Yaoliang Yu, Yi Zhou","submitted_at":"2014-09-19T15:42:28Z","abstract_excerpt":"Matrix-parametrized models, including multiclass logistic regression and sparse coding, are used in machine learning (ML) applications ranging from computer vision to computational biology. When these models are applied to large-scale ML problems starting at millions of samples and tens of thousands of classes, their parameter matrix can grow at an unexpected rate, resulting in high parameter synchronization costs that greatly slow down distributed learning. To address this issue, we propose a Sufficient Factor Broadcasting (SFB) computation model for efficient distributed learning of a large "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.5705","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-18T01:33:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gcfo1sLMvSGica3l9ONQqaTBRAIr7ZfAyJm6vMWCvOdEE2aoJeTBHFEb2lie2xjfaA5ILM4rhj1RxJZcZL5hAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T03:22:31.084045Z"},"content_sha256":"43d6f855f8adbaf03ec7f85ea2c997dcb036509b608538a24c07e62df1b711dd","schema_version":"1.0","event_id":"sha256:43d6f855f8adbaf03ec7f85ea2c997dcb036509b608538a24c07e62df1b711dd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2RJF25DCMBPL7VHBD3277WGSBF/bundle.json","state_url":"https://pith.science/pith/2RJF25DCMBPL7VHBD3277WGSBF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2RJF25DCMBPL7VHBD3277WGSBF/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-06-03T03:22:31Z","links":{"resolver":"https://pith.science/pith/2RJF25DCMBPL7VHBD3277WGSBF","bundle":"https://pith.science/pith/2RJF25DCMBPL7VHBD3277WGSBF/bundle.json","state":"https://pith.science/pith/2RJF25DCMBPL7VHBD3277WGSBF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2RJF25DCMBPL7VHBD3277WGSBF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:2RJF25DCMBPL7VHBD3277WGSBF","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":"20a7e507d4aab4ed6d63d5be68cd870659f8b3949ea19a344cbf684abf83a030","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-09-19T15:42:28Z","title_canon_sha256":"abd25c36d0c796bfa74d518d30ec1909738f054a617b95ca31802076156b142d"},"schema_version":"1.0","source":{"id":"1409.5705","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.5705","created_at":"2026-05-18T01:33:56Z"},{"alias_kind":"arxiv_version","alias_value":"1409.5705v2","created_at":"2026-05-18T01:33:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.5705","created_at":"2026-05-18T01:33:56Z"},{"alias_kind":"pith_short_12","alias_value":"2RJF25DCMBPL","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2RJF25DCMBPL7VHB","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2RJF25DC","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:43d6f855f8adbaf03ec7f85ea2c997dcb036509b608538a24c07e62df1b711dd","target":"graph","created_at":"2026-05-18T01:33:56Z","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":"Matrix-parametrized models, including multiclass logistic regression and sparse coding, are used in machine learning (ML) applications ranging from computer vision to computational biology. When these models are applied to large-scale ML problems starting at millions of samples and tens of thousands of classes, their parameter matrix can grow at an unexpected rate, resulting in high parameter synchronization costs that greatly slow down distributed learning. To address this issue, we propose a Sufficient Factor Broadcasting (SFB) computation model for efficient distributed learning of a large ","authors_text":"Abhimanu Kumar, Eric Xing, Jin Kyu Kim, Pengtao Xie, Qirong Ho, Yaoliang Yu, Yi Zhou","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-09-19T15:42:28Z","title":"Distributed Machine Learning via Sufficient Factor Broadcasting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.5705","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:2d86139642dda83caf8c3867c7e3a8d70c58a6838206dae200b753fa2dd166e5","target":"record","created_at":"2026-05-18T01:33:56Z","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":"20a7e507d4aab4ed6d63d5be68cd870659f8b3949ea19a344cbf684abf83a030","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-09-19T15:42:28Z","title_canon_sha256":"abd25c36d0c796bfa74d518d30ec1909738f054a617b95ca31802076156b142d"},"schema_version":"1.0","source":{"id":"1409.5705","kind":"arxiv","version":2}},"canonical_sha256":"d4525d7462605ebfd4e11ef5ffd8d2097771a8c67424c32eecfb32b88a6445f1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d4525d7462605ebfd4e11ef5ffd8d2097771a8c67424c32eecfb32b88a6445f1","first_computed_at":"2026-05-18T01:33:56.987217Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:33:56.987217Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RYevs+uhO8si2mFx1IRcgCARO/gWWEbvlFK7WY8ZFCSPDV1GVS/yKsTMegzVkoj8mbTK4A4RFjvdHsBEnRI4CA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:33:56.987562Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.5705","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2d86139642dda83caf8c3867c7e3a8d70c58a6838206dae200b753fa2dd166e5","sha256:43d6f855f8adbaf03ec7f85ea2c997dcb036509b608538a24c07e62df1b711dd"],"state_sha256":"a76ebb3ffa82f5a0d29e628b76c66da8b7bca627d664610fdc73f48ad6988d68"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XlW8MTxiOwqpxki9S3skh3yeK9xXcl+rc/UI5PUPo3Z1s2Gg57znd5JToMrSW4ThWSrDhraHJMqiwCkyHTM1Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T03:22:31.086093Z","bundle_sha256":"c76735128d7add11bbfec13d8a658b46e78d41d9a36b81a741e695bd532eb51e"}}