{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:E467337RHNKK66RB4MPWDHGHLI","short_pith_number":"pith:E467337R","schema_version":"1.0","canonical_sha256":"273dfdeff13b54af7a21e31f619cc75a01dc1715b25bf9d6cccd0fad15d1392c","source":{"kind":"arxiv","id":"1605.06968","version":1},"attestation_state":"computed","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1605.06968","created_at":"2026-05-18T01:14:10.721253+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.06968v1","created_at":"2026-05-18T01:14:10.721253+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.06968","created_at":"2026-05-18T01:14:10.721253+00:00"},{"alias_kind":"pith_short_12","alias_value":"E467337RHNKK","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"E467337RHNKK66RB","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"E467337R","created_at":"2026-05-18T12:30:12.583610+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/E467337RHNKK66RB4MPWDHGHLI","json":"https://pith.science/pith/E467337RHNKK66RB4MPWDHGHLI.json","graph_json":"https://pith.science/api/pith-number/E467337RHNKK66RB4MPWDHGHLI/graph.json","events_json":"https://pith.science/api/pith-number/E467337RHNKK66RB4MPWDHGHLI/events.json","paper":"https://pith.science/paper/E467337R"},"agent_actions":{"view_html":"https://pith.science/pith/E467337RHNKK66RB4MPWDHGHLI","download_json":"https://pith.science/pith/E467337RHNKK66RB4MPWDHGHLI.json","view_paper":"https://pith.science/paper/E467337R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.06968&json=true","fetch_graph":"https://pith.science/api/pith-number/E467337RHNKK66RB4MPWDHGHLI/graph.json","fetch_events":"https://pith.science/api/pith-number/E467337RHNKK66RB4MPWDHGHLI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E467337RHNKK66RB4MPWDHGHLI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E467337RHNKK66RB4MPWDHGHLI/action/storage_attestation","attest_author":"https://pith.science/pith/E467337RHNKK66RB4MPWDHGHLI/action/author_attestation","sign_citation":"https://pith.science/pith/E467337RHNKK66RB4MPWDHGHLI/action/citation_signature","submit_replication":"https://pith.science/pith/E467337RHNKK66RB4MPWDHGHLI/action/replication_record"}},"created_at":"2026-05-18T01:14:10.721253+00:00","updated_at":"2026-05-18T01:14:10.721253+00:00"}