{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:5SRAQONQZMRMKGX25KEVHHUABL","short_pith_number":"pith:5SRAQONQ","canonical_record":{"source":{"id":"1210.1190","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-10-03T18:37:47Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"d6c4437ad31b5c39c81e9b9486513c5887ba1e245b67aabc4c4d4241297b458b","abstract_canon_sha256":"fa95104bcb7a52975678fbb23a69883043531d07d2f71d23882dc19493e5b977"},"schema_version":"1.0"},"canonical_sha256":"eca20839b0cb22c51afaea89539e800ac346c0df8350ac35020c266ba0c2d2de","source":{"kind":"arxiv","id":"1210.1190","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.1190","created_at":"2026-05-18T03:44:05Z"},{"alias_kind":"arxiv_version","alias_value":"1210.1190v1","created_at":"2026-05-18T03:44:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.1190","created_at":"2026-05-18T03:44:05Z"},{"alias_kind":"pith_short_12","alias_value":"5SRAQONQZMRM","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"5SRAQONQZMRMKGX2","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"5SRAQONQ","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:5SRAQONQZMRMKGX25KEVHHUABL","target":"record","payload":{"canonical_record":{"source":{"id":"1210.1190","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-10-03T18:37:47Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"d6c4437ad31b5c39c81e9b9486513c5887ba1e245b67aabc4c4d4241297b458b","abstract_canon_sha256":"fa95104bcb7a52975678fbb23a69883043531d07d2f71d23882dc19493e5b977"},"schema_version":"1.0"},"canonical_sha256":"eca20839b0cb22c51afaea89539e800ac346c0df8350ac35020c266ba0c2d2de","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:44:05.304419Z","signature_b64":"CsvMGZ+IkYftOdfgaN+KVDfDyNA1HuvgijE10Yf6vNhef5RLHZEBtWpAGNAmyMeexTGjpKjYQvlcVyTMGhc9DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eca20839b0cb22c51afaea89539e800ac346c0df8350ac35020c266ba0c2d2de","last_reissued_at":"2026-05-18T03:44:05.303615Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:44:05.303615Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.1190","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:44:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y6BimYiVBCY/YTlpRwKC/E5+T/iZui61dhOASVMSr+hpbnBmPPN+qKHkP2RNirFDu/0e52VWI5VaAvMCM33vBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:57:07.851290Z"},"content_sha256":"f1339775bf2053207d911175473c75c67386ac2aad71d36aa979fec75648e4cf","schema_version":"1.0","event_id":"sha256:f1339775bf2053207d911175473c75c67386ac2aad71d36aa979fec75648e4cf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:5SRAQONQZMRMKGX25KEVHHUABL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Conical Hull Algorithms for Near-separable Non-negative Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Abhishek Kumar, Prabhanjan Kambadur, Vikas Sindhwani","submitted_at":"2012-10-03T18:37:47Z","abstract_excerpt":"The separability assumption (Donoho & Stodden, 2003; Arora et al., 2012) turns non-negative matrix factorization (NMF) into a tractable problem. Recently, a new class of provably-correct NMF algorithms have emerged under this assumption. In this paper, we reformulate the separable NMF problem as that of finding the extreme rays of the conical hull of a finite set of vectors. From this geometric perspective, we derive new separable NMF algorithms that are highly scalable and empirically noise robust, and have several other favorable properties in relation to existing methods. A parallel impleme"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.1190","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:44:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OG7mRu2GQzzdQUfgzn9QrWgJz2U7w0AA/xfrIi/9ZRFHbynEkjfcciutAaoQ0hmKgry4Xe5LfGIcI7PF2QSbBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:57:07.851706Z"},"content_sha256":"be4d2aba08a6a7e4b153b882cf3134bf18fc385519f120489807deddb6d400da","schema_version":"1.0","event_id":"sha256:be4d2aba08a6a7e4b153b882cf3134bf18fc385519f120489807deddb6d400da"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5SRAQONQZMRMKGX25KEVHHUABL/bundle.json","state_url":"https://pith.science/pith/5SRAQONQZMRMKGX25KEVHHUABL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5SRAQONQZMRMKGX25KEVHHUABL/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-05-30T11:57:07Z","links":{"resolver":"https://pith.science/pith/5SRAQONQZMRMKGX25KEVHHUABL","bundle":"https://pith.science/pith/5SRAQONQZMRMKGX25KEVHHUABL/bundle.json","state":"https://pith.science/pith/5SRAQONQZMRMKGX25KEVHHUABL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5SRAQONQZMRMKGX25KEVHHUABL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:5SRAQONQZMRMKGX25KEVHHUABL","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":"fa95104bcb7a52975678fbb23a69883043531d07d2f71d23882dc19493e5b977","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-10-03T18:37:47Z","title_canon_sha256":"d6c4437ad31b5c39c81e9b9486513c5887ba1e245b67aabc4c4d4241297b458b"},"schema_version":"1.0","source":{"id":"1210.1190","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.1190","created_at":"2026-05-18T03:44:05Z"},{"alias_kind":"arxiv_version","alias_value":"1210.1190v1","created_at":"2026-05-18T03:44:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.1190","created_at":"2026-05-18T03:44:05Z"},{"alias_kind":"pith_short_12","alias_value":"5SRAQONQZMRM","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"5SRAQONQZMRMKGX2","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"5SRAQONQ","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:be4d2aba08a6a7e4b153b882cf3134bf18fc385519f120489807deddb6d400da","target":"graph","created_at":"2026-05-18T03:44:05Z","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":"The separability assumption (Donoho & Stodden, 2003; Arora et al., 2012) turns non-negative matrix factorization (NMF) into a tractable problem. Recently, a new class of provably-correct NMF algorithms have emerged under this assumption. In this paper, we reformulate the separable NMF problem as that of finding the extreme rays of the conical hull of a finite set of vectors. From this geometric perspective, we derive new separable NMF algorithms that are highly scalable and empirically noise robust, and have several other favorable properties in relation to existing methods. A parallel impleme","authors_text":"Abhishek Kumar, Prabhanjan Kambadur, Vikas Sindhwani","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-10-03T18:37:47Z","title":"Fast Conical Hull Algorithms for Near-separable Non-negative Matrix Factorization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.1190","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:f1339775bf2053207d911175473c75c67386ac2aad71d36aa979fec75648e4cf","target":"record","created_at":"2026-05-18T03:44:05Z","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":"fa95104bcb7a52975678fbb23a69883043531d07d2f71d23882dc19493e5b977","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-10-03T18:37:47Z","title_canon_sha256":"d6c4437ad31b5c39c81e9b9486513c5887ba1e245b67aabc4c4d4241297b458b"},"schema_version":"1.0","source":{"id":"1210.1190","kind":"arxiv","version":1}},"canonical_sha256":"eca20839b0cb22c51afaea89539e800ac346c0df8350ac35020c266ba0c2d2de","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eca20839b0cb22c51afaea89539e800ac346c0df8350ac35020c266ba0c2d2de","first_computed_at":"2026-05-18T03:44:05.303615Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:44:05.303615Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CsvMGZ+IkYftOdfgaN+KVDfDyNA1HuvgijE10Yf6vNhef5RLHZEBtWpAGNAmyMeexTGjpKjYQvlcVyTMGhc9DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:44:05.304419Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.1190","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f1339775bf2053207d911175473c75c67386ac2aad71d36aa979fec75648e4cf","sha256:be4d2aba08a6a7e4b153b882cf3134bf18fc385519f120489807deddb6d400da"],"state_sha256":"2dd53f59f63d860dbc9753f99c8d4df41c744569cfe12806a92b6803a4674e80"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rox6t+tqYqNoNcayf4qvIry+hytikS66AFUv1qWbm1+XW0L4qDNuaomG3LhhD5INAsey2nUUgU7m3kTYZP1LDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T11:57:07.854143Z","bundle_sha256":"3970182049ef205316781a0f430afd13e1e70bbc1cea021adffeb07305d008af"}}