{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:O2EKLGEBSRM7TIBNU6LADTIH67","short_pith_number":"pith:O2EKLGEB","canonical_record":{"source":{"id":"1107.0789","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-07-05T06:03:44Z","cross_cats_sorted":["cs.DS","cs.NA","math.NA","stat.ML"],"title_canon_sha256":"c60be36e55ea6944acade505ef5c8b3e3d4beec100e80aa8e13cc1e174f340d6","abstract_canon_sha256":"fb79e3b2f2728445697110fe2f3dfb591f994c591e1bd87be697da16fd7ee781"},"schema_version":"1.0"},"canonical_sha256":"7688a598819459f9a02da79601cd07f7f5d4b07f9deecd518c5bd71335418659","source":{"kind":"arxiv","id":"1107.0789","version":7},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.0789","created_at":"2026-05-18T03:08:47Z"},{"alias_kind":"arxiv_version","alias_value":"1107.0789v7","created_at":"2026-05-18T03:08:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.0789","created_at":"2026-05-18T03:08:47Z"},{"alias_kind":"pith_short_12","alias_value":"O2EKLGEBSRM7","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"O2EKLGEBSRM7TIBN","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"O2EKLGEB","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:O2EKLGEBSRM7TIBNU6LADTIH67","target":"record","payload":{"canonical_record":{"source":{"id":"1107.0789","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-07-05T06:03:44Z","cross_cats_sorted":["cs.DS","cs.NA","math.NA","stat.ML"],"title_canon_sha256":"c60be36e55ea6944acade505ef5c8b3e3d4beec100e80aa8e13cc1e174f340d6","abstract_canon_sha256":"fb79e3b2f2728445697110fe2f3dfb591f994c591e1bd87be697da16fd7ee781"},"schema_version":"1.0"},"canonical_sha256":"7688a598819459f9a02da79601cd07f7f5d4b07f9deecd518c5bd71335418659","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:08:47.931726Z","signature_b64":"ms9frttSkoBbs0aFaPHrx+60QfJbMSWd8CMTCF0BJOOQpuKXV9D+78u7Kgx3RqPf3W5arWRfS4RAWkan4rIMCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7688a598819459f9a02da79601cd07f7f5d4b07f9deecd518c5bd71335418659","last_reissued_at":"2026-05-18T03:08:47.931019Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:08:47.931019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.0789","source_version":7,"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-18T03:08:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"783DD2I8pqvRDUu7nLa6GZnjn3CYhEiwgP287N4L9MOtCkEV/Ep9FZwnICgGl9uMecH+DeGomT/N86mYwB2oDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:34:55.117062Z"},"content_sha256":"e241fbc83ac1af8c1884619e81b9de06b6b460c11b4504ebf010b544e063885e","schema_version":"1.0","event_id":"sha256:e241fbc83ac1af8c1884619e81b9de06b6b460c11b4504ebf010b544e063885e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:O2EKLGEBSRM7TIBNU6LADTIH67","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Matrix Completion and Robust Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.NA","math.NA","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ameet Talwalkar, Lester Mackey, Michael I. Jordan","submitted_at":"2011-07-05T06:03:44Z","abstract_excerpt":"If learning methods are to scale to the massive sizes of modern datasets, it is essential for the field of machine learning to embrace parallel and distributed computing. Inspired by the recent development of matrix factorization methods with rich theory but poor computational complexity and by the relative ease of mapping matrices onto distributed architectures, we introduce a scalable divide-and-conquer framework for noisy matrix factorization. We present a thorough theoretical analysis of this framework in which we characterize the statistical errors introduced by the \"divide\" step and cont"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.0789","kind":"arxiv","version":7},"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-18T03:08:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bKbBuUT+0oz9KZrLW/WOqoEff5XoqjyhJ+GHDP8xzfzxqq/1q2Nuwon8gRxo+otfTVWD5cGbZK5MmL1TRx7MCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:34:55.117431Z"},"content_sha256":"293507ea32dde9776067fea60eff4b6de28279afa696a2f011355ba905ae1f02","schema_version":"1.0","event_id":"sha256:293507ea32dde9776067fea60eff4b6de28279afa696a2f011355ba905ae1f02"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O2EKLGEBSRM7TIBNU6LADTIH67/bundle.json","state_url":"https://pith.science/pith/O2EKLGEBSRM7TIBNU6LADTIH67/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O2EKLGEBSRM7TIBNU6LADTIH67/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-02T22:34:55Z","links":{"resolver":"https://pith.science/pith/O2EKLGEBSRM7TIBNU6LADTIH67","bundle":"https://pith.science/pith/O2EKLGEBSRM7TIBNU6LADTIH67/bundle.json","state":"https://pith.science/pith/O2EKLGEBSRM7TIBNU6LADTIH67/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O2EKLGEBSRM7TIBNU6LADTIH67/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:O2EKLGEBSRM7TIBNU6LADTIH67","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":"fb79e3b2f2728445697110fe2f3dfb591f994c591e1bd87be697da16fd7ee781","cross_cats_sorted":["cs.DS","cs.NA","math.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-07-05T06:03:44Z","title_canon_sha256":"c60be36e55ea6944acade505ef5c8b3e3d4beec100e80aa8e13cc1e174f340d6"},"schema_version":"1.0","source":{"id":"1107.0789","kind":"arxiv","version":7}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.0789","created_at":"2026-05-18T03:08:47Z"},{"alias_kind":"arxiv_version","alias_value":"1107.0789v7","created_at":"2026-05-18T03:08:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.0789","created_at":"2026-05-18T03:08:47Z"},{"alias_kind":"pith_short_12","alias_value":"O2EKLGEBSRM7","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"O2EKLGEBSRM7TIBN","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"O2EKLGEB","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:293507ea32dde9776067fea60eff4b6de28279afa696a2f011355ba905ae1f02","target":"graph","created_at":"2026-05-18T03:08:47Z","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":"If learning methods are to scale to the massive sizes of modern datasets, it is essential for the field of machine learning to embrace parallel and distributed computing. Inspired by the recent development of matrix factorization methods with rich theory but poor computational complexity and by the relative ease of mapping matrices onto distributed architectures, we introduce a scalable divide-and-conquer framework for noisy matrix factorization. We present a thorough theoretical analysis of this framework in which we characterize the statistical errors introduced by the \"divide\" step and cont","authors_text":"Ameet Talwalkar, Lester Mackey, Michael I. Jordan","cross_cats":["cs.DS","cs.NA","math.NA","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-07-05T06:03:44Z","title":"Distributed Matrix Completion and Robust Factorization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.0789","kind":"arxiv","version":7},"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:e241fbc83ac1af8c1884619e81b9de06b6b460c11b4504ebf010b544e063885e","target":"record","created_at":"2026-05-18T03:08:47Z","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":"fb79e3b2f2728445697110fe2f3dfb591f994c591e1bd87be697da16fd7ee781","cross_cats_sorted":["cs.DS","cs.NA","math.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-07-05T06:03:44Z","title_canon_sha256":"c60be36e55ea6944acade505ef5c8b3e3d4beec100e80aa8e13cc1e174f340d6"},"schema_version":"1.0","source":{"id":"1107.0789","kind":"arxiv","version":7}},"canonical_sha256":"7688a598819459f9a02da79601cd07f7f5d4b07f9deecd518c5bd71335418659","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7688a598819459f9a02da79601cd07f7f5d4b07f9deecd518c5bd71335418659","first_computed_at":"2026-05-18T03:08:47.931019Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:08:47.931019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ms9frttSkoBbs0aFaPHrx+60QfJbMSWd8CMTCF0BJOOQpuKXV9D+78u7Kgx3RqPf3W5arWRfS4RAWkan4rIMCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:08:47.931726Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.0789","source_kind":"arxiv","source_version":7}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e241fbc83ac1af8c1884619e81b9de06b6b460c11b4504ebf010b544e063885e","sha256:293507ea32dde9776067fea60eff4b6de28279afa696a2f011355ba905ae1f02"],"state_sha256":"eaf10796496a94ff27701530bc0373193592899f03d358e285b3d86fdce63c8b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"013rQaQeFjWJASuwmiAQxAhGWUa7mDBV6XbEAiDN4olehGTkexA+qU2z2ubG/amUSbG++digJySLQ9vAolB0BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T22:34:55.119438Z","bundle_sha256":"c89191224decf5d90620eb95c9443b801113c19aebdb4135c4d0c650a2366a7a"}}