{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:G36MJVL46JAUVA2ZHRAF2EB3YV","short_pith_number":"pith:G36MJVL4","canonical_record":{"source":{"id":"1904.07935","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-16T19:18:37Z","cross_cats_sorted":["cs.DC","stat.ML"],"title_canon_sha256":"35a598289e362554ceaaca319e8eec020871f4281d7183fb3c3d26735f55a081","abstract_canon_sha256":"bc464cd0685b0a9b0c68fd3dc9d408617d5aebc143a89ba97ba2773c31e12b78"},"schema_version":"1.0"},"canonical_sha256":"36fcc4d57cf2414a83593c405d103bc575939eef30c0a57a8fde53c210085f00","source":{"kind":"arxiv","id":"1904.07935","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.07935","created_at":"2026-05-17T23:48:19Z"},{"alias_kind":"arxiv_version","alias_value":"1904.07935v1","created_at":"2026-05-17T23:48:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.07935","created_at":"2026-05-17T23:48:19Z"},{"alias_kind":"pith_short_12","alias_value":"G36MJVL46JAU","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"G36MJVL46JAUVA2Z","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"G36MJVL4","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:G36MJVL46JAUVA2ZHRAF2EB3YV","target":"record","payload":{"canonical_record":{"source":{"id":"1904.07935","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-16T19:18:37Z","cross_cats_sorted":["cs.DC","stat.ML"],"title_canon_sha256":"35a598289e362554ceaaca319e8eec020871f4281d7183fb3c3d26735f55a081","abstract_canon_sha256":"bc464cd0685b0a9b0c68fd3dc9d408617d5aebc143a89ba97ba2773c31e12b78"},"schema_version":"1.0"},"canonical_sha256":"36fcc4d57cf2414a83593c405d103bc575939eef30c0a57a8fde53c210085f00","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:19.358990Z","signature_b64":"SiSiSQ/XUhE/YB6hQ2olkEIMYfo9TmL/nHkEqH42j2n/1cbPyJ9Ct4D3BpX+8uGORrY0JEeytlpFsMEXDrNACg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36fcc4d57cf2414a83593c405d103bc575939eef30c0a57a8fde53c210085f00","last_reissued_at":"2026-05-17T23:48:19.358404Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:19.358404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.07935","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-17T23:48:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hiN5U5urI8GBSm5Ydu5370mqEZRhMLNe60hZKDaLAzBBIBL2zr8Ho6SoNiefFswSV+rIhbvrVnuNTjvSb7C0Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T00:43:46.983467Z"},"content_sha256":"8ca44561877da874881323fc39e6f403ea95d18bbd571d36609dcbec5d2082b9","schema_version":"1.0","event_id":"sha256:8ca44561877da874881323fc39e6f403ea95d18bbd571d36609dcbec5d2082b9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:G36MJVL46JAUVA2ZHRAF2EB3YV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"PL-NMF: Parallel Locality-Optimized Non-negative Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Aravind Sukumaran-Rajam, Gordon E. Moon, P. Sadayappan, Srinivasan Parthasarathy","submitted_at":"2019-04-16T19:18:37Z","abstract_excerpt":"Non-negative Matrix Factorization (NMF) is a key kernel for unsupervised dimension reduction used in a wide range of applications, including topic modeling, recommender systems and bioinformatics. Due to the compute-intensive nature of applications that must perform repeated NMF, several parallel implementations have been developed in the past. However, existing parallel NMF algorithms have not addressed data locality optimizations, which are critical for high performance since data movement costs greatly exceed the cost of arithmetic/logic operations on current computer systems. In this paper"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.07935","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-17T23:48:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1Qtn2wJUPHD6B28NpwEszwUk9avSbxkJN8y8RqMPg48ginNpgF44oYwOYEBoSsZ6d8DqoycDrm0wRiga4XmDAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T00:43:46.983831Z"},"content_sha256":"44ab6435a7946d9ee19a875ef9100272c9ea40d8835bb95d08f14244ca399efd","schema_version":"1.0","event_id":"sha256:44ab6435a7946d9ee19a875ef9100272c9ea40d8835bb95d08f14244ca399efd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G36MJVL46JAUVA2ZHRAF2EB3YV/bundle.json","state_url":"https://pith.science/pith/G36MJVL46JAUVA2ZHRAF2EB3YV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G36MJVL46JAUVA2ZHRAF2EB3YV/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-05T00:43:46Z","links":{"resolver":"https://pith.science/pith/G36MJVL46JAUVA2ZHRAF2EB3YV","bundle":"https://pith.science/pith/G36MJVL46JAUVA2ZHRAF2EB3YV/bundle.json","state":"https://pith.science/pith/G36MJVL46JAUVA2ZHRAF2EB3YV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G36MJVL46JAUVA2ZHRAF2EB3YV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:G36MJVL46JAUVA2ZHRAF2EB3YV","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":"bc464cd0685b0a9b0c68fd3dc9d408617d5aebc143a89ba97ba2773c31e12b78","cross_cats_sorted":["cs.DC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-16T19:18:37Z","title_canon_sha256":"35a598289e362554ceaaca319e8eec020871f4281d7183fb3c3d26735f55a081"},"schema_version":"1.0","source":{"id":"1904.07935","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.07935","created_at":"2026-05-17T23:48:19Z"},{"alias_kind":"arxiv_version","alias_value":"1904.07935v1","created_at":"2026-05-17T23:48:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.07935","created_at":"2026-05-17T23:48:19Z"},{"alias_kind":"pith_short_12","alias_value":"G36MJVL46JAU","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"G36MJVL46JAUVA2Z","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"G36MJVL4","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:44ab6435a7946d9ee19a875ef9100272c9ea40d8835bb95d08f14244ca399efd","target":"graph","created_at":"2026-05-17T23:48:19Z","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 a key kernel for unsupervised dimension reduction used in a wide range of applications, including topic modeling, recommender systems and bioinformatics. Due to the compute-intensive nature of applications that must perform repeated NMF, several parallel implementations have been developed in the past. However, existing parallel NMF algorithms have not addressed data locality optimizations, which are critical for high performance since data movement costs greatly exceed the cost of arithmetic/logic operations on current computer systems. In this paper","authors_text":"Aravind Sukumaran-Rajam, Gordon E. Moon, P. Sadayappan, Srinivasan Parthasarathy","cross_cats":["cs.DC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-16T19:18:37Z","title":"PL-NMF: Parallel Locality-Optimized Non-negative Matrix Factorization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.07935","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:8ca44561877da874881323fc39e6f403ea95d18bbd571d36609dcbec5d2082b9","target":"record","created_at":"2026-05-17T23:48:19Z","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":"bc464cd0685b0a9b0c68fd3dc9d408617d5aebc143a89ba97ba2773c31e12b78","cross_cats_sorted":["cs.DC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-16T19:18:37Z","title_canon_sha256":"35a598289e362554ceaaca319e8eec020871f4281d7183fb3c3d26735f55a081"},"schema_version":"1.0","source":{"id":"1904.07935","kind":"arxiv","version":1}},"canonical_sha256":"36fcc4d57cf2414a83593c405d103bc575939eef30c0a57a8fde53c210085f00","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"36fcc4d57cf2414a83593c405d103bc575939eef30c0a57a8fde53c210085f00","first_computed_at":"2026-05-17T23:48:19.358404Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:19.358404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SiSiSQ/XUhE/YB6hQ2olkEIMYfo9TmL/nHkEqH42j2n/1cbPyJ9Ct4D3BpX+8uGORrY0JEeytlpFsMEXDrNACg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:19.358990Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.07935","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8ca44561877da874881323fc39e6f403ea95d18bbd571d36609dcbec5d2082b9","sha256:44ab6435a7946d9ee19a875ef9100272c9ea40d8835bb95d08f14244ca399efd"],"state_sha256":"b0dfca6ce149d3c852f9157b4f1be022b7b8a4ef26be81770dbf223586a6e843"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E/xT9ux+vKUOm/LCgO4+JDn+McwIUZj/1fRwZqSGroFarv0kLh/WDc7rawkPb999trS1yxUgPF0njHM4fA2xCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T00:43:46.985909Z","bundle_sha256":"347d2364844912beaa6197abd1b6b9198a654398900cb7590ab3a53430b4d8df"}}