{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:E467337RHNKK66RB4MPWDHGHLI","short_pith_number":"pith:E467337R","canonical_record":{"source":{"id":"1605.06968","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2016-05-23T10:46:08Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"dd968df2fdb55662480a9db5e150498586daabd52331c06c461430b94e3c8bf6","abstract_canon_sha256":"3759c64c75e3dd83ac36f0d92f7bf0a46d710bc740477f11d2b27f010c01a46a"},"schema_version":"1.0"},"canonical_sha256":"273dfdeff13b54af7a21e31f619cc75a01dc1715b25bf9d6cccd0fad15d1392c","source":{"kind":"arxiv","id":"1605.06968","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.06968","created_at":"2026-05-18T01:14:10Z"},{"alias_kind":"arxiv_version","alias_value":"1605.06968v1","created_at":"2026-05-18T01:14:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.06968","created_at":"2026-05-18T01:14:10Z"},{"alias_kind":"pith_short_12","alias_value":"E467337RHNKK","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"E467337RHNKK66RB","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"E467337R","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:E467337RHNKK66RB4MPWDHGHLI","target":"record","payload":{"canonical_record":{"source":{"id":"1605.06968","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2016-05-23T10:46:08Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"dd968df2fdb55662480a9db5e150498586daabd52331c06c461430b94e3c8bf6","abstract_canon_sha256":"3759c64c75e3dd83ac36f0d92f7bf0a46d710bc740477f11d2b27f010c01a46a"},"schema_version":"1.0"},"canonical_sha256":"273dfdeff13b54af7a21e31f619cc75a01dc1715b25bf9d6cccd0fad15d1392c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:10.721869Z","signature_b64":"Ycv8tzmpc6zyrpBVfBRlek64AlzDIn2KG8xdFCBpEv8WXvcTv3OYSTf4D/DtoOOA2hMttJ9xn5V7w5dI9zqbCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"273dfdeff13b54af7a21e31f619cc75a01dc1715b25bf9d6cccd0fad15d1392c","last_reissued_at":"2026-05-18T01:14:10.721163Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:10.721163Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.06968","source_version":1,"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:14:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5cOA7/CGQjh1fMGMiqj8cM8HsjY8bpC7rMRhfa7YGeTR9RYDpigywknW65mCWVpf/cIVYx0gU5SaE95MQTgJAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T00:29:02.432602Z"},"content_sha256":"81ce7c76bcde29d5462ce0a3c590b8cb4fabfb4d600e38097884292e1d96926e","schema_version":"1.0","event_id":"sha256:81ce7c76bcde29d5462ce0a3c590b8cb4fabfb4d600e38097884292e1d96926e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:E467337RHNKK66RB4MPWDHGHLI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Riemannian gossip approach to decentralized matrix completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"cs.NA","authors_text":"Atul Saroop, Bamdev Mishra, Hiroyuki Kasai","submitted_at":"2016-05-23T10:46:08Z","abstract_excerpt":"In this paper, we propose novel gossip algorithms for the low-rank decentralized matrix completion problem. The proposed approach is on the Riemannian Grassmann manifold that allows local matrix completion by different agents while achieving asymptotic consensus on the global low-rank factors. The resulting approach is scalable and parallelizable. Our numerical experiments show the good performance of the proposed algorithms on various benchmarks."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.06968","kind":"arxiv","version":1},"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:14:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UNo6urd4H1wJdezky1KNVK4ZXVyl8Ozq5tY0OPfJgDoO9RbSUEi5BeKycD4iz8OB8O6teQ3MO7bOdncPab5tAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T00:29:02.432956Z"},"content_sha256":"c4e57b51660d5965fc63b76399503084ed2432736762bcdd10b8f4e344592a92","schema_version":"1.0","event_id":"sha256:c4e57b51660d5965fc63b76399503084ed2432736762bcdd10b8f4e344592a92"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E467337RHNKK66RB4MPWDHGHLI/bundle.json","state_url":"https://pith.science/pith/E467337RHNKK66RB4MPWDHGHLI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E467337RHNKK66RB4MPWDHGHLI/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-02T00:29:02Z","links":{"resolver":"https://pith.science/pith/E467337RHNKK66RB4MPWDHGHLI","bundle":"https://pith.science/pith/E467337RHNKK66RB4MPWDHGHLI/bundle.json","state":"https://pith.science/pith/E467337RHNKK66RB4MPWDHGHLI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E467337RHNKK66RB4MPWDHGHLI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:E467337RHNKK66RB4MPWDHGHLI","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":"3759c64c75e3dd83ac36f0d92f7bf0a46d710bc740477f11d2b27f010c01a46a","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2016-05-23T10:46:08Z","title_canon_sha256":"dd968df2fdb55662480a9db5e150498586daabd52331c06c461430b94e3c8bf6"},"schema_version":"1.0","source":{"id":"1605.06968","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.06968","created_at":"2026-05-18T01:14:10Z"},{"alias_kind":"arxiv_version","alias_value":"1605.06968v1","created_at":"2026-05-18T01:14:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.06968","created_at":"2026-05-18T01:14:10Z"},{"alias_kind":"pith_short_12","alias_value":"E467337RHNKK","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"E467337RHNKK66RB","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"E467337R","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:c4e57b51660d5965fc63b76399503084ed2432736762bcdd10b8f4e344592a92","target":"graph","created_at":"2026-05-18T01:14:10Z","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":"In this paper, we propose novel gossip algorithms for the low-rank decentralized matrix completion problem. The proposed approach is on the Riemannian Grassmann manifold that allows local matrix completion by different agents while achieving asymptotic consensus on the global low-rank factors. The resulting approach is scalable and parallelizable. Our numerical experiments show the good performance of the proposed algorithms on various benchmarks.","authors_text":"Atul Saroop, Bamdev Mishra, Hiroyuki Kasai","cross_cats":["cs.LG","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2016-05-23T10:46:08Z","title":"A Riemannian gossip approach to decentralized matrix completion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.06968","kind":"arxiv","version":1},"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:81ce7c76bcde29d5462ce0a3c590b8cb4fabfb4d600e38097884292e1d96926e","target":"record","created_at":"2026-05-18T01:14:10Z","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":"3759c64c75e3dd83ac36f0d92f7bf0a46d710bc740477f11d2b27f010c01a46a","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2016-05-23T10:46:08Z","title_canon_sha256":"dd968df2fdb55662480a9db5e150498586daabd52331c06c461430b94e3c8bf6"},"schema_version":"1.0","source":{"id":"1605.06968","kind":"arxiv","version":1}},"canonical_sha256":"273dfdeff13b54af7a21e31f619cc75a01dc1715b25bf9d6cccd0fad15d1392c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"273dfdeff13b54af7a21e31f619cc75a01dc1715b25bf9d6cccd0fad15d1392c","first_computed_at":"2026-05-18T01:14:10.721163Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:10.721163Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ycv8tzmpc6zyrpBVfBRlek64AlzDIn2KG8xdFCBpEv8WXvcTv3OYSTf4D/DtoOOA2hMttJ9xn5V7w5dI9zqbCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:10.721869Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.06968","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:81ce7c76bcde29d5462ce0a3c590b8cb4fabfb4d600e38097884292e1d96926e","sha256:c4e57b51660d5965fc63b76399503084ed2432736762bcdd10b8f4e344592a92"],"state_sha256":"89696f27deda8c16b94d85d56348b8ca84e77eb1ccb2cccedcaacd3e19698b28"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+2kxIiF8jQ+qOQzHIQvbs+IDEHEnRQnr0FY2wc6Fgh8rbGBNK8UnUCPHLN2YUs2+n3+G86ROO7muyKLEQ4ZVAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T00:29:02.434995Z","bundle_sha256":"2da3c4bcc0a57678ab4c5c76c22f43f65a75bcaff247922025f1683634860508"}}