{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:RMKV7MC5DSCG5M5CTSDVMBWBPG","short_pith_number":"pith:RMKV7MC5","schema_version":"1.0","canonical_sha256":"8b155fb05d1c846eb3a29c875606c179a58bc3a0048d57e825cd8b1af63c861c","source":{"kind":"arxiv","id":"1802.08938","version":1},"attestation_state":"computed","paper":{"title":"DID: Distributed Incremental Block Coordinate Descent for Nonnegative Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Chris Chu, Tianxiang Gao","submitted_at":"2018-02-25T01:23:23Z","abstract_excerpt":"Nonnegative matrix factorization (NMF) has attracted much attention in the last decade as a dimension reduction method in many applications. Due to the explosion in the size of data, naturally the samples are collected and stored distributively in local computational nodes. Thus, there is a growing need to develop algorithms in a distributed memory architecture. We propose a novel distributed algorithm, called \\textit{distributed incremental block coordinate descent} (DID), to solve the problem. By adapting the block coordinate descent framework, closed-form update rules are obtained in DID. M"},"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":"1802.08938","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-25T01:23:23Z","cross_cats_sorted":["cs.AI","math.OC","stat.ML"],"title_canon_sha256":"fff3de71e872f64edb8244c81d601bd3c2504ac7a435eaa8ea996eef7b67982e","abstract_canon_sha256":"28463472505795f3eaa9906e7f391284fd304414d85186d212d4e158487ce666"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:36.010278Z","signature_b64":"OpJBlWizsQ7o08NmUNF/xI6H3eRs4tFiGN4FwXUQjHGDHX5BAHprT/TE+hoMF2Uf1QoqfhHBjg9/NtTt3KFoAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b155fb05d1c846eb3a29c875606c179a58bc3a0048d57e825cd8b1af63c861c","last_reissued_at":"2026-05-18T00:22:36.009662Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:36.009662Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DID: Distributed Incremental Block Coordinate Descent for Nonnegative Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Chris Chu, Tianxiang Gao","submitted_at":"2018-02-25T01:23:23Z","abstract_excerpt":"Nonnegative matrix factorization (NMF) has attracted much attention in the last decade as a dimension reduction method in many applications. Due to the explosion in the size of data, naturally the samples are collected and stored distributively in local computational nodes. Thus, there is a growing need to develop algorithms in a distributed memory architecture. We propose a novel distributed algorithm, called \\textit{distributed incremental block coordinate descent} (DID), to solve the problem. By adapting the block coordinate descent framework, closed-form update rules are obtained in DID. M"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.08938","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":"1802.08938","created_at":"2026-05-18T00:22:36.009755+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.08938v1","created_at":"2026-05-18T00:22:36.009755+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.08938","created_at":"2026-05-18T00:22:36.009755+00:00"},{"alias_kind":"pith_short_12","alias_value":"RMKV7MC5DSCG","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"RMKV7MC5DSCG5M5C","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"RMKV7MC5","created_at":"2026-05-18T12:32:50.500415+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/RMKV7MC5DSCG5M5CTSDVMBWBPG","json":"https://pith.science/pith/RMKV7MC5DSCG5M5CTSDVMBWBPG.json","graph_json":"https://pith.science/api/pith-number/RMKV7MC5DSCG5M5CTSDVMBWBPG/graph.json","events_json":"https://pith.science/api/pith-number/RMKV7MC5DSCG5M5CTSDVMBWBPG/events.json","paper":"https://pith.science/paper/RMKV7MC5"},"agent_actions":{"view_html":"https://pith.science/pith/RMKV7MC5DSCG5M5CTSDVMBWBPG","download_json":"https://pith.science/pith/RMKV7MC5DSCG5M5CTSDVMBWBPG.json","view_paper":"https://pith.science/paper/RMKV7MC5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.08938&json=true","fetch_graph":"https://pith.science/api/pith-number/RMKV7MC5DSCG5M5CTSDVMBWBPG/graph.json","fetch_events":"https://pith.science/api/pith-number/RMKV7MC5DSCG5M5CTSDVMBWBPG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RMKV7MC5DSCG5M5CTSDVMBWBPG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RMKV7MC5DSCG5M5CTSDVMBWBPG/action/storage_attestation","attest_author":"https://pith.science/pith/RMKV7MC5DSCG5M5CTSDVMBWBPG/action/author_attestation","sign_citation":"https://pith.science/pith/RMKV7MC5DSCG5M5CTSDVMBWBPG/action/citation_signature","submit_replication":"https://pith.science/pith/RMKV7MC5DSCG5M5CTSDVMBWBPG/action/replication_record"}},"created_at":"2026-05-18T00:22:36.009755+00:00","updated_at":"2026-05-18T00:22:36.009755+00:00"}