{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:H4GRES5DRSXSQOYLKIBPL2YKQ3","short_pith_number":"pith:H4GRES5D","canonical_record":{"source":{"id":"1712.02248","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-12-06T15:56:21Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"a86cce0c4ce0c2885832864d6924cbc4385548dc573d07dc698c6412065244c7","abstract_canon_sha256":"51c62772ba1ee10f5d21feed2fd6fd593e1f9cba0496f2201dc66ac329b0b6dd"},"schema_version":"1.0"},"canonical_sha256":"3f0d124ba38caf283b0b5202f5eb0a86fa180ee5bde910501db133ea00ab6712","source":{"kind":"arxiv","id":"1712.02248","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.02248","created_at":"2026-05-18T00:28:38Z"},{"alias_kind":"arxiv_version","alias_value":"1712.02248v1","created_at":"2026-05-18T00:28:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.02248","created_at":"2026-05-18T00:28:38Z"},{"alias_kind":"pith_short_12","alias_value":"H4GRES5DRSXS","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"H4GRES5DRSXSQOYL","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"H4GRES5D","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:H4GRES5DRSXSQOYLKIBPL2YKQ3","target":"record","payload":{"canonical_record":{"source":{"id":"1712.02248","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-12-06T15:56:21Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"a86cce0c4ce0c2885832864d6924cbc4385548dc573d07dc698c6412065244c7","abstract_canon_sha256":"51c62772ba1ee10f5d21feed2fd6fd593e1f9cba0496f2201dc66ac329b0b6dd"},"schema_version":"1.0"},"canonical_sha256":"3f0d124ba38caf283b0b5202f5eb0a86fa180ee5bde910501db133ea00ab6712","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:38.710134Z","signature_b64":"TcEOx9lzaAnUodSaBRCSaqGVlz9wXsZPlDpX1lxmKA2x0DhqIV0qbqEf16wVnaLMw7gIQ9XOAfyCdEQYxCR4Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f0d124ba38caf283b0b5202f5eb0a86fa180ee5bde910501db133ea00ab6712","last_reissued_at":"2026-05-18T00:28:38.709452Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:38.709452Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.02248","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:28:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eV6v9CcKQM6C5BJ+gFCxoiWpEpB5FCyp374GM7jNcO03rsjDv1+4X52ApFx9N+bvlLl/n81FjRm37TGrgHOcCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T08:39:36.054883Z"},"content_sha256":"2aad33f4f1b5b0d7fec795640d22408b678afca63f57f395ce12fe869da79854","schema_version":"1.0","event_id":"sha256:2aad33f4f1b5b0d7fec795640d22408b678afca63f57f395ce12fe869da79854"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:H4GRES5DRSXSQOYLKIBPL2YKQ3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Efficient Algorithm for Non-Negative Matrix Factorization with Random Projections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.NA","authors_text":"Gabriele Torre, Michael Graber","submitted_at":"2017-12-06T15:56:21Z","abstract_excerpt":"Non-negative matrix factorization (NMF) is one of the most popular decomposition techniques for multivariate data. NMF is a core method for many machine-learning related computational problems, such as data compression, feature extraction, word embedding, recommender systems etc. In practice, however, its application is challenging for large datasets. The efficiency of NMF is constrained by long data loading times, by large memory requirements and by limited parallelization capabilities. Here we present a novel and efficient compressed NMF algorithm. Our algorithm applies a random compression "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.02248","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:28:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/OqjggW+weMLyr9UB26rjdoaaXVf1n32Bid8Fj8B36I7zC6C4RjPlNLoiO7pilPXjUWD2En8rAv1A+/utJLdAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T08:39:36.055224Z"},"content_sha256":"410f08332a8d53c3623afff088a57040d6dadb808557fba6d0f79866ba81fff6","schema_version":"1.0","event_id":"sha256:410f08332a8d53c3623afff088a57040d6dadb808557fba6d0f79866ba81fff6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H4GRES5DRSXSQOYLKIBPL2YKQ3/bundle.json","state_url":"https://pith.science/pith/H4GRES5DRSXSQOYLKIBPL2YKQ3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H4GRES5DRSXSQOYLKIBPL2YKQ3/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-07-02T08:39:36Z","links":{"resolver":"https://pith.science/pith/H4GRES5DRSXSQOYLKIBPL2YKQ3","bundle":"https://pith.science/pith/H4GRES5DRSXSQOYLKIBPL2YKQ3/bundle.json","state":"https://pith.science/pith/H4GRES5DRSXSQOYLKIBPL2YKQ3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H4GRES5DRSXSQOYLKIBPL2YKQ3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:H4GRES5DRSXSQOYLKIBPL2YKQ3","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":"51c62772ba1ee10f5d21feed2fd6fd593e1f9cba0496f2201dc66ac329b0b6dd","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-12-06T15:56:21Z","title_canon_sha256":"a86cce0c4ce0c2885832864d6924cbc4385548dc573d07dc698c6412065244c7"},"schema_version":"1.0","source":{"id":"1712.02248","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.02248","created_at":"2026-05-18T00:28:38Z"},{"alias_kind":"arxiv_version","alias_value":"1712.02248v1","created_at":"2026-05-18T00:28:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.02248","created_at":"2026-05-18T00:28:38Z"},{"alias_kind":"pith_short_12","alias_value":"H4GRES5DRSXS","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"H4GRES5DRSXSQOYL","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"H4GRES5D","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:410f08332a8d53c3623afff088a57040d6dadb808557fba6d0f79866ba81fff6","target":"graph","created_at":"2026-05-18T00:28: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 one of the most popular decomposition techniques for multivariate data. NMF is a core method for many machine-learning related computational problems, such as data compression, feature extraction, word embedding, recommender systems etc. In practice, however, its application is challenging for large datasets. The efficiency of NMF is constrained by long data loading times, by large memory requirements and by limited parallelization capabilities. Here we present a novel and efficient compressed NMF algorithm. Our algorithm applies a random compression ","authors_text":"Gabriele Torre, Michael Graber","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-12-06T15:56:21Z","title":"An Efficient Algorithm for Non-Negative Matrix Factorization with Random Projections"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.02248","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:2aad33f4f1b5b0d7fec795640d22408b678afca63f57f395ce12fe869da79854","target":"record","created_at":"2026-05-18T00:28: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":"51c62772ba1ee10f5d21feed2fd6fd593e1f9cba0496f2201dc66ac329b0b6dd","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-12-06T15:56:21Z","title_canon_sha256":"a86cce0c4ce0c2885832864d6924cbc4385548dc573d07dc698c6412065244c7"},"schema_version":"1.0","source":{"id":"1712.02248","kind":"arxiv","version":1}},"canonical_sha256":"3f0d124ba38caf283b0b5202f5eb0a86fa180ee5bde910501db133ea00ab6712","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3f0d124ba38caf283b0b5202f5eb0a86fa180ee5bde910501db133ea00ab6712","first_computed_at":"2026-05-18T00:28:38.709452Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:38.709452Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TcEOx9lzaAnUodSaBRCSaqGVlz9wXsZPlDpX1lxmKA2x0DhqIV0qbqEf16wVnaLMw7gIQ9XOAfyCdEQYxCR4Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:38.710134Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.02248","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2aad33f4f1b5b0d7fec795640d22408b678afca63f57f395ce12fe869da79854","sha256:410f08332a8d53c3623afff088a57040d6dadb808557fba6d0f79866ba81fff6"],"state_sha256":"492a67abfc99faea9b3c85d2a1805d0be35f5a027887eeb0212b881b2327fa68"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rhHypFABpgGP394dwE8qzDVrdAMqgMNzR+x+D6j6TghSJoxN2UqrXuzCjQux+AY1+yTGhdV2tFOby/i9irlnCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T08:39:36.057337Z","bundle_sha256":"ea81698d67b833cc258ca0fd777a265f4f4895fa4e87d11b35c5c687f74f35f6"}}