{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:AUTTZMDLT6MQG3Y2EAT2JMFXCV","short_pith_number":"pith:AUTTZMDL","schema_version":"1.0","canonical_sha256":"05273cb06b9f99036f1a2027a4b0b7156d7ea80f94b389b22c4faecbd1d59942","source":{"kind":"arxiv","id":"1711.07684","version":2},"attestation_state":"computed","paper":{"title":"A two-dimensional decomposition approach for matrix completion through gossip","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bamdev Mishra, Mukul Bhutani","submitted_at":"2017-11-21T09:21:13Z","abstract_excerpt":"Factoring a matrix into two low rank matrices is at the heart of many problems. The problem of matrix completion especially uses it to decompose a sparse matrix into two non sparse, low rank matrices which can then be used to predict unknown entries of the original matrix. We present a scalable and decentralized approach in which instead of learning two factors for the original input matrix, we decompose the original matrix into a grid blocks, each of whose factors can be individually learned just by communicating (gossiping) with neighboring blocks. This eliminates any need for a central serv"},"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":"1711.07684","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-21T09:21:13Z","cross_cats_sorted":[],"title_canon_sha256":"56e18e84306fadad9f5eaa544ff616d6d12a324bcc8a40520992e4d530626d7b","abstract_canon_sha256":"cc6748c1fbbe91e1d764d3b287d2280568a4d73e6d2c031c410b8c26f8a9610e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:14.282172Z","signature_b64":"xuAM8jQQJxeOGnDw7BgLjI7m3IrixoELoLTrK9jz/WRVBtFQBzzVqu2B6nqsoCcQJWTvTftA6vzbcOyQ1RuXBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05273cb06b9f99036f1a2027a4b0b7156d7ea80f94b389b22c4faecbd1d59942","last_reissued_at":"2026-05-18T00:26:14.281591Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:14.281591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A two-dimensional decomposition approach for matrix completion through gossip","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bamdev Mishra, Mukul Bhutani","submitted_at":"2017-11-21T09:21:13Z","abstract_excerpt":"Factoring a matrix into two low rank matrices is at the heart of many problems. The problem of matrix completion especially uses it to decompose a sparse matrix into two non sparse, low rank matrices which can then be used to predict unknown entries of the original matrix. We present a scalable and decentralized approach in which instead of learning two factors for the original input matrix, we decompose the original matrix into a grid blocks, each of whose factors can be individually learned just by communicating (gossiping) with neighboring blocks. This eliminates any need for a central serv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.07684","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1711.07684","created_at":"2026-05-18T00:26:14.281692+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.07684v2","created_at":"2026-05-18T00:26:14.281692+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.07684","created_at":"2026-05-18T00:26:14.281692+00:00"},{"alias_kind":"pith_short_12","alias_value":"AUTTZMDLT6MQ","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"AUTTZMDLT6MQG3Y2","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"AUTTZMDL","created_at":"2026-05-18T12:31:08.081275+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/AUTTZMDLT6MQG3Y2EAT2JMFXCV","json":"https://pith.science/pith/AUTTZMDLT6MQG3Y2EAT2JMFXCV.json","graph_json":"https://pith.science/api/pith-number/AUTTZMDLT6MQG3Y2EAT2JMFXCV/graph.json","events_json":"https://pith.science/api/pith-number/AUTTZMDLT6MQG3Y2EAT2JMFXCV/events.json","paper":"https://pith.science/paper/AUTTZMDL"},"agent_actions":{"view_html":"https://pith.science/pith/AUTTZMDLT6MQG3Y2EAT2JMFXCV","download_json":"https://pith.science/pith/AUTTZMDLT6MQG3Y2EAT2JMFXCV.json","view_paper":"https://pith.science/paper/AUTTZMDL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.07684&json=true","fetch_graph":"https://pith.science/api/pith-number/AUTTZMDLT6MQG3Y2EAT2JMFXCV/graph.json","fetch_events":"https://pith.science/api/pith-number/AUTTZMDLT6MQG3Y2EAT2JMFXCV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AUTTZMDLT6MQG3Y2EAT2JMFXCV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AUTTZMDLT6MQG3Y2EAT2JMFXCV/action/storage_attestation","attest_author":"https://pith.science/pith/AUTTZMDLT6MQG3Y2EAT2JMFXCV/action/author_attestation","sign_citation":"https://pith.science/pith/AUTTZMDLT6MQG3Y2EAT2JMFXCV/action/citation_signature","submit_replication":"https://pith.science/pith/AUTTZMDLT6MQG3Y2EAT2JMFXCV/action/replication_record"}},"created_at":"2026-05-18T00:26:14.281692+00:00","updated_at":"2026-05-18T00:26:14.281692+00:00"}