{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:4LGYN7DYIBOBO4MJTUTPIXEGNP","short_pith_number":"pith:4LGYN7DY","canonical_record":{"source":{"id":"1312.7167","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-12-27T01:10:00Z","cross_cats_sorted":["cs.CV","cs.LG"],"title_canon_sha256":"072c761bfe7ca90339c9ac1da128519cc48fd9c442f503097fce1721adbf9dc3","abstract_canon_sha256":"03dd113bacdc0f955109a199e6353a5ea7b70f160cdaae505a277714021fa1bd"},"schema_version":"1.0"},"canonical_sha256":"e2cd86fc78405c1771899d26f45c866bc192bbadeb1cbf3955c25a3a66b5e334","source":{"kind":"arxiv","id":"1312.7167","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.7167","created_at":"2026-05-18T03:03:45Z"},{"alias_kind":"arxiv_version","alias_value":"1312.7167v1","created_at":"2026-05-18T03:03:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.7167","created_at":"2026-05-18T03:03:45Z"},{"alias_kind":"pith_short_12","alias_value":"4LGYN7DYIBOB","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"4LGYN7DYIBOBO4MJ","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"4LGYN7DY","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:4LGYN7DYIBOBO4MJTUTPIXEGNP","target":"record","payload":{"canonical_record":{"source":{"id":"1312.7167","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-12-27T01:10:00Z","cross_cats_sorted":["cs.CV","cs.LG"],"title_canon_sha256":"072c761bfe7ca90339c9ac1da128519cc48fd9c442f503097fce1721adbf9dc3","abstract_canon_sha256":"03dd113bacdc0f955109a199e6353a5ea7b70f160cdaae505a277714021fa1bd"},"schema_version":"1.0"},"canonical_sha256":"e2cd86fc78405c1771899d26f45c866bc192bbadeb1cbf3955c25a3a66b5e334","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:45.609237Z","signature_b64":"n2L+IbtWRNfL2mIjLRGNUPnaFVmSsR+Ov9LreqsOYqshlVcn9vjxjRLrCQzIkZjWDi40fSTij+camcGw98QFAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2cd86fc78405c1771899d26f45c866bc192bbadeb1cbf3955c25a3a66b5e334","last_reissued_at":"2026-05-18T03:03:45.608616Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:45.608616Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.7167","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:03:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MCOuAATlRsAlMsLQNRkZf9bLDxbJf7oP0/I0uaFYeMnLX8yyOYdBZvYs+RTgSH6uyYmtsZKsyvxLthr/1w6mCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:43:35.333826Z"},"content_sha256":"9588bd2e483aca13661f12fee167a8d9c9d4e5618dee700caad9ce09ccf8d878","schema_version":"1.0","event_id":"sha256:9588bd2e483aca13661f12fee167a8d9c9d4e5618dee700caad9ce09ccf8d878"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:4LGYN7DYIBOBO4MJTUTPIXEGNP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Near-separable Non-negative Matrix Factorization with $\\ell_1$- and Bregman Loss Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.LG"],"primary_cat":"stat.ML","authors_text":"Abhishek Kumar, Vikas Sindhwani","submitted_at":"2013-12-27T01:10:00Z","abstract_excerpt":"Recently, a family of tractable NMF algorithms have been proposed under the assumption that the data matrix satisfies a separability condition Donoho & Stodden (2003); Arora et al. (2012). Geometrically, this condition reformulates the NMF problem as that of finding the extreme rays of the conical hull of a finite set of vectors. In this paper, we develop several extensions of the conical hull procedures of Kumar et al. (2013) for robust ($\\ell_1$) approximations and Bregman divergences. Our methods inherit all the advantages of Kumar et al. (2013) including scalability and noise-tolerance. We"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.7167","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:03:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KOCMc0qgrV3JcDSv5xQlxnV2geWf0TQADpccQ7m4HYZlCNw2o6c7EDu+T3KnEFgKBAEQ7hDI68iRtaoYIrkRBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:43:35.334531Z"},"content_sha256":"3bf24eb3aa13745e5cb972d61f0b87056acb2a0ed32f47c96db2b31f60a9a3be","schema_version":"1.0","event_id":"sha256:3bf24eb3aa13745e5cb972d61f0b87056acb2a0ed32f47c96db2b31f60a9a3be"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4LGYN7DYIBOBO4MJTUTPIXEGNP/bundle.json","state_url":"https://pith.science/pith/4LGYN7DYIBOBO4MJTUTPIXEGNP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4LGYN7DYIBOBO4MJTUTPIXEGNP/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-31T19:43:35Z","links":{"resolver":"https://pith.science/pith/4LGYN7DYIBOBO4MJTUTPIXEGNP","bundle":"https://pith.science/pith/4LGYN7DYIBOBO4MJTUTPIXEGNP/bundle.json","state":"https://pith.science/pith/4LGYN7DYIBOBO4MJTUTPIXEGNP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4LGYN7DYIBOBO4MJTUTPIXEGNP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:4LGYN7DYIBOBO4MJTUTPIXEGNP","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":"03dd113bacdc0f955109a199e6353a5ea7b70f160cdaae505a277714021fa1bd","cross_cats_sorted":["cs.CV","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-12-27T01:10:00Z","title_canon_sha256":"072c761bfe7ca90339c9ac1da128519cc48fd9c442f503097fce1721adbf9dc3"},"schema_version":"1.0","source":{"id":"1312.7167","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.7167","created_at":"2026-05-18T03:03:45Z"},{"alias_kind":"arxiv_version","alias_value":"1312.7167v1","created_at":"2026-05-18T03:03:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.7167","created_at":"2026-05-18T03:03:45Z"},{"alias_kind":"pith_short_12","alias_value":"4LGYN7DYIBOB","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"4LGYN7DYIBOBO4MJ","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"4LGYN7DY","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:3bf24eb3aa13745e5cb972d61f0b87056acb2a0ed32f47c96db2b31f60a9a3be","target":"graph","created_at":"2026-05-18T03:03:45Z","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":"Recently, a family of tractable NMF algorithms have been proposed under the assumption that the data matrix satisfies a separability condition Donoho & Stodden (2003); Arora et al. (2012). Geometrically, this condition reformulates the NMF problem as that of finding the extreme rays of the conical hull of a finite set of vectors. In this paper, we develop several extensions of the conical hull procedures of Kumar et al. (2013) for robust ($\\ell_1$) approximations and Bregman divergences. Our methods inherit all the advantages of Kumar et al. (2013) including scalability and noise-tolerance. We","authors_text":"Abhishek Kumar, Vikas Sindhwani","cross_cats":["cs.CV","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-12-27T01:10:00Z","title":"Near-separable Non-negative Matrix Factorization with $\\ell_1$- and Bregman Loss Functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.7167","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:9588bd2e483aca13661f12fee167a8d9c9d4e5618dee700caad9ce09ccf8d878","target":"record","created_at":"2026-05-18T03:03:45Z","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":"03dd113bacdc0f955109a199e6353a5ea7b70f160cdaae505a277714021fa1bd","cross_cats_sorted":["cs.CV","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-12-27T01:10:00Z","title_canon_sha256":"072c761bfe7ca90339c9ac1da128519cc48fd9c442f503097fce1721adbf9dc3"},"schema_version":"1.0","source":{"id":"1312.7167","kind":"arxiv","version":1}},"canonical_sha256":"e2cd86fc78405c1771899d26f45c866bc192bbadeb1cbf3955c25a3a66b5e334","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e2cd86fc78405c1771899d26f45c866bc192bbadeb1cbf3955c25a3a66b5e334","first_computed_at":"2026-05-18T03:03:45.608616Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:03:45.608616Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n2L+IbtWRNfL2mIjLRGNUPnaFVmSsR+Ov9LreqsOYqshlVcn9vjxjRLrCQzIkZjWDi40fSTij+camcGw98QFAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:03:45.609237Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.7167","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9588bd2e483aca13661f12fee167a8d9c9d4e5618dee700caad9ce09ccf8d878","sha256:3bf24eb3aa13745e5cb972d61f0b87056acb2a0ed32f47c96db2b31f60a9a3be"],"state_sha256":"0502b4576e60f790ec3d3becabfe716913980a6d06eed479e516c56ae67d93d4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JA7Nw39zX7UGTak+zRCGxWRDUQn8Qc0Z6MSpwHdDXingO18HYatBUNrQNs5iELxNNnmkznooOVt9ek5IABbGBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T19:43:35.338604Z","bundle_sha256":"b6d34a936e7efd0a6e3ccf757df2aed07cbf36879442dcb475aa211fe0756882"}}