{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:RMKV7MC5DSCG5M5CTSDVMBWBPG","short_pith_number":"pith:RMKV7MC5","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"},"canonical_sha256":"8b155fb05d1c846eb3a29c875606c179a58bc3a0048d57e825cd8b1af63c861c","source":{"kind":"arxiv","id":"1802.08938","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.08938","created_at":"2026-05-18T00:22:36Z"},{"alias_kind":"arxiv_version","alias_value":"1802.08938v1","created_at":"2026-05-18T00:22:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.08938","created_at":"2026-05-18T00:22:36Z"},{"alias_kind":"pith_short_12","alias_value":"RMKV7MC5DSCG","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RMKV7MC5DSCG5M5C","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RMKV7MC5","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:RMKV7MC5DSCG5M5CTSDVMBWBPG","target":"record","payload":{"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"},"canonical_sha256":"8b155fb05d1c846eb3a29c875606c179a58bc3a0048d57e825cd8b1af63c861c","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"},"source_kind":"arxiv","source_id":"1802.08938","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-18T00:22:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CBxCpnN+s5Wus1Di8TfRY6GvMwVZLYT5gUCmqjMjgyGa6t1n15/3Z3O6AV15Slk+sRT6f1m6OpaZZ3pBoiN9Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:52:55.083494Z"},"content_sha256":"c7ee79f4e731c1fa6939c7974c187dd1871ffedeccf828dd71333d3143900f0e","schema_version":"1.0","event_id":"sha256:c7ee79f4e731c1fa6939c7974c187dd1871ffedeccf828dd71333d3143900f0e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:RMKV7MC5DSCG5M5CTSDVMBWBPG","target":"graph","payload":{"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"},"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-18T00:22:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sCb02coxKEb+kqymBd9jF1/2RyxAE9/HL1fAKSjOU6ADtp+/63eMIY6ujEBxgYp89H5tc4h1/1kco/lQuGNsAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:52:55.084147Z"},"content_sha256":"f72ed9e7bc4574b8fc5857499ba99590b08e229641cc25ac05a5115f20b7662f","schema_version":"1.0","event_id":"sha256:f72ed9e7bc4574b8fc5857499ba99590b08e229641cc25ac05a5115f20b7662f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RMKV7MC5DSCG5M5CTSDVMBWBPG/bundle.json","state_url":"https://pith.science/pith/RMKV7MC5DSCG5M5CTSDVMBWBPG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RMKV7MC5DSCG5M5CTSDVMBWBPG/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-09T08:52:55Z","links":{"resolver":"https://pith.science/pith/RMKV7MC5DSCG5M5CTSDVMBWBPG","bundle":"https://pith.science/pith/RMKV7MC5DSCG5M5CTSDVMBWBPG/bundle.json","state":"https://pith.science/pith/RMKV7MC5DSCG5M5CTSDVMBWBPG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RMKV7MC5DSCG5M5CTSDVMBWBPG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:RMKV7MC5DSCG5M5CTSDVMBWBPG","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":"28463472505795f3eaa9906e7f391284fd304414d85186d212d4e158487ce666","cross_cats_sorted":["cs.AI","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-25T01:23:23Z","title_canon_sha256":"fff3de71e872f64edb8244c81d601bd3c2504ac7a435eaa8ea996eef7b67982e"},"schema_version":"1.0","source":{"id":"1802.08938","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.08938","created_at":"2026-05-18T00:22:36Z"},{"alias_kind":"arxiv_version","alias_value":"1802.08938v1","created_at":"2026-05-18T00:22:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.08938","created_at":"2026-05-18T00:22:36Z"},{"alias_kind":"pith_short_12","alias_value":"RMKV7MC5DSCG","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RMKV7MC5DSCG5M5C","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RMKV7MC5","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:f72ed9e7bc4574b8fc5857499ba99590b08e229641cc25ac05a5115f20b7662f","target":"graph","created_at":"2026-05-18T00:22:36Z","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":"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","authors_text":"Chris Chu, Tianxiang Gao","cross_cats":["cs.AI","math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-25T01:23:23Z","title":"DID: Distributed Incremental Block Coordinate Descent for Nonnegative Matrix Factorization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.08938","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:c7ee79f4e731c1fa6939c7974c187dd1871ffedeccf828dd71333d3143900f0e","target":"record","created_at":"2026-05-18T00:22:36Z","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":"28463472505795f3eaa9906e7f391284fd304414d85186d212d4e158487ce666","cross_cats_sorted":["cs.AI","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-25T01:23:23Z","title_canon_sha256":"fff3de71e872f64edb8244c81d601bd3c2504ac7a435eaa8ea996eef7b67982e"},"schema_version":"1.0","source":{"id":"1802.08938","kind":"arxiv","version":1}},"canonical_sha256":"8b155fb05d1c846eb3a29c875606c179a58bc3a0048d57e825cd8b1af63c861c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8b155fb05d1c846eb3a29c875606c179a58bc3a0048d57e825cd8b1af63c861c","first_computed_at":"2026-05-18T00:22:36.009662Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:36.009662Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OpJBlWizsQ7o08NmUNF/xI6H3eRs4tFiGN4FwXUQjHGDHX5BAHprT/TE+hoMF2Uf1QoqfhHBjg9/NtTt3KFoAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:36.010278Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.08938","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c7ee79f4e731c1fa6939c7974c187dd1871ffedeccf828dd71333d3143900f0e","sha256:f72ed9e7bc4574b8fc5857499ba99590b08e229641cc25ac05a5115f20b7662f"],"state_sha256":"b93d2691e12a9edbc8c56c2b5339a80fa4a359caa7baf093080568c8f2cc8a69"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"00wx0FLAoMouyfPoNa53mc6+yiOL+WC5ZtOG5BTkolBL8o46ESivknw8hRgzclMkv65/Nwhim7AUZwfnlbE4AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T08:52:55.091733Z","bundle_sha256":"326d8db7a42a29db9b1b98e16487f380a32e26421c0ebbcf1be99145784af78c"}}