{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:4LGYN7DYIBOBO4MJTUTPIXEGNP","short_pith_number":"pith:4LGYN7DY","schema_version":"1.0","canonical_sha256":"e2cd86fc78405c1771899d26f45c866bc192bbadeb1cbf3955c25a3a66b5e334","source":{"kind":"arxiv","id":"1312.7167","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1312.7167","created_at":"2026-05-18T03:03:45.608730+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.7167v1","created_at":"2026-05-18T03:03:45.608730+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.7167","created_at":"2026-05-18T03:03:45.608730+00:00"},{"alias_kind":"pith_short_12","alias_value":"4LGYN7DYIBOB","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"4LGYN7DYIBOBO4MJ","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"4LGYN7DY","created_at":"2026-05-18T12:27:34.582898+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4LGYN7DYIBOBO4MJTUTPIXEGNP","json":"https://pith.science/pith/4LGYN7DYIBOBO4MJTUTPIXEGNP.json","graph_json":"https://pith.science/api/pith-number/4LGYN7DYIBOBO4MJTUTPIXEGNP/graph.json","events_json":"https://pith.science/api/pith-number/4LGYN7DYIBOBO4MJTUTPIXEGNP/events.json","paper":"https://pith.science/paper/4LGYN7DY"},"agent_actions":{"view_html":"https://pith.science/pith/4LGYN7DYIBOBO4MJTUTPIXEGNP","download_json":"https://pith.science/pith/4LGYN7DYIBOBO4MJTUTPIXEGNP.json","view_paper":"https://pith.science/paper/4LGYN7DY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.7167&json=true","fetch_graph":"https://pith.science/api/pith-number/4LGYN7DYIBOBO4MJTUTPIXEGNP/graph.json","fetch_events":"https://pith.science/api/pith-number/4LGYN7DYIBOBO4MJTUTPIXEGNP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4LGYN7DYIBOBO4MJTUTPIXEGNP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4LGYN7DYIBOBO4MJTUTPIXEGNP/action/storage_attestation","attest_author":"https://pith.science/pith/4LGYN7DYIBOBO4MJTUTPIXEGNP/action/author_attestation","sign_citation":"https://pith.science/pith/4LGYN7DYIBOBO4MJTUTPIXEGNP/action/citation_signature","submit_replication":"https://pith.science/pith/4LGYN7DYIBOBO4MJTUTPIXEGNP/action/replication_record"}},"created_at":"2026-05-18T03:03:45.608730+00:00","updated_at":"2026-05-18T03:03:45.608730+00:00"}