{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:67ZIER36LME4KEDKVWFTZAYN4J","short_pith_number":"pith:67ZIER36","canonical_record":{"source":{"id":"1401.1842","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-01-08T21:39:03Z","cross_cats_sorted":["cs.IT","cs.LG","cs.NA","math.IT"],"title_canon_sha256":"5a3d38edf6d53ddf74571ecd7a8e6bbb5d8c9fdb5fb4ef620dcd71704e1fbff6","abstract_canon_sha256":"53ab39b95a1a5aff182948b8221f67d08917a784759c209e06186dc7353b4383"},"schema_version":"1.0"},"canonical_sha256":"f7f282477e5b09c5106aad8b3c830de25f1cf1bbb5a325669e5b81dc034558a7","source":{"kind":"arxiv","id":"1401.1842","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.1842","created_at":"2026-05-18T03:02:56Z"},{"alias_kind":"arxiv_version","alias_value":"1401.1842v1","created_at":"2026-05-18T03:02:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.1842","created_at":"2026-05-18T03:02:56Z"},{"alias_kind":"pith_short_12","alias_value":"67ZIER36LME4","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"67ZIER36LME4KEDK","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"67ZIER36","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:67ZIER36LME4KEDKVWFTZAYN4J","target":"record","payload":{"canonical_record":{"source":{"id":"1401.1842","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-01-08T21:39:03Z","cross_cats_sorted":["cs.IT","cs.LG","cs.NA","math.IT"],"title_canon_sha256":"5a3d38edf6d53ddf74571ecd7a8e6bbb5d8c9fdb5fb4ef620dcd71704e1fbff6","abstract_canon_sha256":"53ab39b95a1a5aff182948b8221f67d08917a784759c209e06186dc7353b4383"},"schema_version":"1.0"},"canonical_sha256":"f7f282477e5b09c5106aad8b3c830de25f1cf1bbb5a325669e5b81dc034558a7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:56.576149Z","signature_b64":"P3VpdNMQj1isH5p0tiH6akeNabIBJN+VdCmlPk/HipbdHmZ6vAZPFVnCD2t2lAX5YnLKU014bk9n8K/FK4JmDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7f282477e5b09c5106aad8b3c830de25f1cf1bbb5a325669e5b81dc034558a7","last_reissued_at":"2026-05-18T03:02:56.575483Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:56.575483Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.1842","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-18T03:02:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PVpkzEjv3USRzYNdqG9XXUO7H6lonqb2UQDJ3pbk+HjFoZxyOhVld7FKfehWFRp8BEWFoLc55iycm7S6qXXCAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T17:21:51.181093Z"},"content_sha256":"3770b5495c09fa6d6cbf39185921ea07f3862092ff87b37d38e53fd37853b5ee","schema_version":"1.0","event_id":"sha256:3770b5495c09fa6d6cbf39185921ea07f3862092ff87b37d38e53fd37853b5ee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:67ZIER36LME4KEDKVWFTZAYN4J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Large Scale Non-negative Matrix Factorization using Proximal Point Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","cs.NA","math.IT"],"primary_cat":"stat.ML","authors_text":"Jason Gejie Liu, Shuchin Aeron","submitted_at":"2014-01-08T21:39:03Z","abstract_excerpt":"A robust algorithm for non-negative matrix factorization (NMF) is presented in this paper with the purpose of dealing with large-scale data, where the separability assumption is satisfied. In particular, we modify the Linear Programming (LP) algorithm of [9] by introducing a reduced set of constraints for exact NMF. In contrast to the previous approaches, the proposed algorithm does not require the knowledge of factorization rank (extreme rays [3] or topics [7]). Furthermore, motivated by a similar problem arising in the context of metabolic network analysis [13], we consider an entirely diffe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.1842","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-18T03:02:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i2VauX7o6k3RkzP/lAxj1JiABdJsR8ayghhz5olHktPoh3Bs9PoIPaL2YocFKBdzN/MTwo5cBk0haTrhybEkCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T17:21:51.181845Z"},"content_sha256":"f78d5220f05cc3b655451744a451119ab87f1429bef163d3463e2ea355ea9988","schema_version":"1.0","event_id":"sha256:f78d5220f05cc3b655451744a451119ab87f1429bef163d3463e2ea355ea9988"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/67ZIER36LME4KEDKVWFTZAYN4J/bundle.json","state_url":"https://pith.science/pith/67ZIER36LME4KEDKVWFTZAYN4J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/67ZIER36LME4KEDKVWFTZAYN4J/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-07T17:21:51Z","links":{"resolver":"https://pith.science/pith/67ZIER36LME4KEDKVWFTZAYN4J","bundle":"https://pith.science/pith/67ZIER36LME4KEDKVWFTZAYN4J/bundle.json","state":"https://pith.science/pith/67ZIER36LME4KEDKVWFTZAYN4J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/67ZIER36LME4KEDKVWFTZAYN4J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:67ZIER36LME4KEDKVWFTZAYN4J","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":"53ab39b95a1a5aff182948b8221f67d08917a784759c209e06186dc7353b4383","cross_cats_sorted":["cs.IT","cs.LG","cs.NA","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-01-08T21:39:03Z","title_canon_sha256":"5a3d38edf6d53ddf74571ecd7a8e6bbb5d8c9fdb5fb4ef620dcd71704e1fbff6"},"schema_version":"1.0","source":{"id":"1401.1842","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.1842","created_at":"2026-05-18T03:02:56Z"},{"alias_kind":"arxiv_version","alias_value":"1401.1842v1","created_at":"2026-05-18T03:02:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.1842","created_at":"2026-05-18T03:02:56Z"},{"alias_kind":"pith_short_12","alias_value":"67ZIER36LME4","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"67ZIER36LME4KEDK","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"67ZIER36","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:f78d5220f05cc3b655451744a451119ab87f1429bef163d3463e2ea355ea9988","target":"graph","created_at":"2026-05-18T03:02:56Z","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":"A robust algorithm for non-negative matrix factorization (NMF) is presented in this paper with the purpose of dealing with large-scale data, where the separability assumption is satisfied. In particular, we modify the Linear Programming (LP) algorithm of [9] by introducing a reduced set of constraints for exact NMF. In contrast to the previous approaches, the proposed algorithm does not require the knowledge of factorization rank (extreme rays [3] or topics [7]). Furthermore, motivated by a similar problem arising in the context of metabolic network analysis [13], we consider an entirely diffe","authors_text":"Jason Gejie Liu, Shuchin Aeron","cross_cats":["cs.IT","cs.LG","cs.NA","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-01-08T21:39:03Z","title":"Robust Large Scale Non-negative Matrix Factorization using Proximal Point Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.1842","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:3770b5495c09fa6d6cbf39185921ea07f3862092ff87b37d38e53fd37853b5ee","target":"record","created_at":"2026-05-18T03:02:56Z","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":"53ab39b95a1a5aff182948b8221f67d08917a784759c209e06186dc7353b4383","cross_cats_sorted":["cs.IT","cs.LG","cs.NA","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-01-08T21:39:03Z","title_canon_sha256":"5a3d38edf6d53ddf74571ecd7a8e6bbb5d8c9fdb5fb4ef620dcd71704e1fbff6"},"schema_version":"1.0","source":{"id":"1401.1842","kind":"arxiv","version":1}},"canonical_sha256":"f7f282477e5b09c5106aad8b3c830de25f1cf1bbb5a325669e5b81dc034558a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f7f282477e5b09c5106aad8b3c830de25f1cf1bbb5a325669e5b81dc034558a7","first_computed_at":"2026-05-18T03:02:56.575483Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:02:56.575483Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P3VpdNMQj1isH5p0tiH6akeNabIBJN+VdCmlPk/HipbdHmZ6vAZPFVnCD2t2lAX5YnLKU014bk9n8K/FK4JmDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:02:56.576149Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.1842","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3770b5495c09fa6d6cbf39185921ea07f3862092ff87b37d38e53fd37853b5ee","sha256:f78d5220f05cc3b655451744a451119ab87f1429bef163d3463e2ea355ea9988"],"state_sha256":"c2b685d7e6e9c8463d7e0444d275c4e54e84a7667b5c919545a37338d7d1188f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XOmHwgn+UcHfs9OjLuzCR20UQAxvEimH28lxVVdoDXkzjwATR0cMBS1lvFoT6V+gPGxuEKW2LaScMQT+Z/7CBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T17:21:51.185235Z","bundle_sha256":"cb48854bb4fc24eb70167891f7da08b58d151ccf7be5130c30920d3c9e70d4fd"}}