{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:NNT4ETQXXB3X7C3GI7ZGDS4NSY","short_pith_number":"pith:NNT4ETQX","canonical_record":{"source":{"id":"1609.09154","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-09-28T23:31:45Z","cross_cats_sorted":["cs.NA","stat.ML"],"title_canon_sha256":"9473a25dd92c86459c3129394415ad64e9c7017fc6f5bcf3f5ccab8d484f05b1","abstract_canon_sha256":"b9dc5a5324fb968dba4777aae33b3c1a4b8e0384b1242a0e1464ee93a0691f7c"},"schema_version":"1.0"},"canonical_sha256":"6b67c24e17b8777f8b6647f261cb8d962d03960bb8cb17d0ef7bb9cbdc21c4d6","source":{"kind":"arxiv","id":"1609.09154","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.09154","created_at":"2026-05-18T01:03:38Z"},{"alias_kind":"arxiv_version","alias_value":"1609.09154v1","created_at":"2026-05-18T01:03:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.09154","created_at":"2026-05-18T01:03:38Z"},{"alias_kind":"pith_short_12","alias_value":"NNT4ETQXXB3X","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"NNT4ETQXXB3X7C3G","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"NNT4ETQX","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:NNT4ETQXXB3X7C3GI7ZGDS4NSY","target":"record","payload":{"canonical_record":{"source":{"id":"1609.09154","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-09-28T23:31:45Z","cross_cats_sorted":["cs.NA","stat.ML"],"title_canon_sha256":"9473a25dd92c86459c3129394415ad64e9c7017fc6f5bcf3f5ccab8d484f05b1","abstract_canon_sha256":"b9dc5a5324fb968dba4777aae33b3c1a4b8e0384b1242a0e1464ee93a0691f7c"},"schema_version":"1.0"},"canonical_sha256":"6b67c24e17b8777f8b6647f261cb8d962d03960bb8cb17d0ef7bb9cbdc21c4d6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:38.665840Z","signature_b64":"1tfSayZAsrggCBbUgapFaqDtYboMhCmxDDvwWfl5KtRQTSjHRfWEMfNSdusEEQwudx4ejTZK6W+sjLJZ0qk8Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b67c24e17b8777f8b6647f261cb8d962d03960bb8cb17d0ef7bb9cbdc21c4d6","last_reissued_at":"2026-05-18T01:03:38.665235Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:38.665235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.09154","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:03:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2+Xf7ZRLjbxAxjkaI+GFPCXd8oQMw2KNE8bcsoMv3wnv0QXilkD8S2EPLT0KpivW5alza85FzYrYs9TjimTlAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T15:40:16.679235Z"},"content_sha256":"505ab4e51a3dacaef1c7b9c09ddeef04f4944a5a98701b370efc1c822aa1d905","schema_version":"1.0","event_id":"sha256:505ab4e51a3dacaef1c7b9c09ddeef04f4944a5a98701b370efc1c822aa1d905"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:NNT4ETQXXB3X7C3GI7ZGDS4NSY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"MPI-FAUN: An MPI-Based Framework for Alternating-Updating Nonnegative Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","stat.ML"],"primary_cat":"cs.DC","authors_text":"Grey Ballard, Haesun Park, Ramakrishnan Kannan","submitted_at":"2016-09-28T23:31:45Z","abstract_excerpt":"Non-negative matrix factorization (NMF) is the problem of determining two non-negative low rank factors $W$ and $H$, for the given input matrix $A$, such that $A \\approx W H$. NMF is a useful tool for many applications in different domains such as topic modeling in text mining, background separation in video analysis, and community detection in social networks. Despite its popularity in the data mining community, there is a lack of efficient parallel algorithms to solve the problem for big data sets.\n  The main contribution of this work is a new, high-performance parallel computational framewo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.09154","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:03:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wGAahFK72/0t0KPSVuydXjR7SS5pflqTWNOg+D6MBDljQCK58bnIWN1ZE6/UQk3nU9C4PIZ8xsRCk8m65NtNDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T15:40:16.679795Z"},"content_sha256":"1c4b69b797bc9b4beb7e83b5bac794819793b3324200b9e2c4a04092246261a4","schema_version":"1.0","event_id":"sha256:1c4b69b797bc9b4beb7e83b5bac794819793b3324200b9e2c4a04092246261a4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NNT4ETQXXB3X7C3GI7ZGDS4NSY/bundle.json","state_url":"https://pith.science/pith/NNT4ETQXXB3X7C3GI7ZGDS4NSY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NNT4ETQXXB3X7C3GI7ZGDS4NSY/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-03T15:40:16Z","links":{"resolver":"https://pith.science/pith/NNT4ETQXXB3X7C3GI7ZGDS4NSY","bundle":"https://pith.science/pith/NNT4ETQXXB3X7C3GI7ZGDS4NSY/bundle.json","state":"https://pith.science/pith/NNT4ETQXXB3X7C3GI7ZGDS4NSY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NNT4ETQXXB3X7C3GI7ZGDS4NSY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:NNT4ETQXXB3X7C3GI7ZGDS4NSY","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":"b9dc5a5324fb968dba4777aae33b3c1a4b8e0384b1242a0e1464ee93a0691f7c","cross_cats_sorted":["cs.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-09-28T23:31:45Z","title_canon_sha256":"9473a25dd92c86459c3129394415ad64e9c7017fc6f5bcf3f5ccab8d484f05b1"},"schema_version":"1.0","source":{"id":"1609.09154","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.09154","created_at":"2026-05-18T01:03:38Z"},{"alias_kind":"arxiv_version","alias_value":"1609.09154v1","created_at":"2026-05-18T01:03:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.09154","created_at":"2026-05-18T01:03:38Z"},{"alias_kind":"pith_short_12","alias_value":"NNT4ETQXXB3X","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"NNT4ETQXXB3X7C3G","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"NNT4ETQX","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:1c4b69b797bc9b4beb7e83b5bac794819793b3324200b9e2c4a04092246261a4","target":"graph","created_at":"2026-05-18T01:03:38Z","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":"Non-negative matrix factorization (NMF) is the problem of determining two non-negative low rank factors $W$ and $H$, for the given input matrix $A$, such that $A \\approx W H$. NMF is a useful tool for many applications in different domains such as topic modeling in text mining, background separation in video analysis, and community detection in social networks. Despite its popularity in the data mining community, there is a lack of efficient parallel algorithms to solve the problem for big data sets.\n  The main contribution of this work is a new, high-performance parallel computational framewo","authors_text":"Grey Ballard, Haesun Park, Ramakrishnan Kannan","cross_cats":["cs.NA","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-09-28T23:31:45Z","title":"MPI-FAUN: An MPI-Based Framework for Alternating-Updating Nonnegative Matrix Factorization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.09154","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:505ab4e51a3dacaef1c7b9c09ddeef04f4944a5a98701b370efc1c822aa1d905","target":"record","created_at":"2026-05-18T01:03:38Z","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":"b9dc5a5324fb968dba4777aae33b3c1a4b8e0384b1242a0e1464ee93a0691f7c","cross_cats_sorted":["cs.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-09-28T23:31:45Z","title_canon_sha256":"9473a25dd92c86459c3129394415ad64e9c7017fc6f5bcf3f5ccab8d484f05b1"},"schema_version":"1.0","source":{"id":"1609.09154","kind":"arxiv","version":1}},"canonical_sha256":"6b67c24e17b8777f8b6647f261cb8d962d03960bb8cb17d0ef7bb9cbdc21c4d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6b67c24e17b8777f8b6647f261cb8d962d03960bb8cb17d0ef7bb9cbdc21c4d6","first_computed_at":"2026-05-18T01:03:38.665235Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:03:38.665235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1tfSayZAsrggCBbUgapFaqDtYboMhCmxDDvwWfl5KtRQTSjHRfWEMfNSdusEEQwudx4ejTZK6W+sjLJZ0qk8Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T01:03:38.665840Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.09154","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:505ab4e51a3dacaef1c7b9c09ddeef04f4944a5a98701b370efc1c822aa1d905","sha256:1c4b69b797bc9b4beb7e83b5bac794819793b3324200b9e2c4a04092246261a4"],"state_sha256":"6bc940aa2a02447bb3a8a7191684cc04a956806ec374a7add38c6326b4463528"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O8Gfgr+SWMQ0ftXU+NPMpOpt53S6TsKVCjryDLZypDHdGJ03R32kr0/nADwMWGwbti0GXZOV73bdngXHiLAkCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T15:40:16.683059Z","bundle_sha256":"96412e8ae7270e807e23788fa20c13eeae0fc2274a07232d6c453f5e3e5cf7bd"}}