{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:PBC4JHWWW6MULDZ7PXN5ZQQXAM","short_pith_number":"pith:PBC4JHWW","schema_version":"1.0","canonical_sha256":"7845c49ed6b799458f3f7ddbdcc2170336cac6644dc7115bfbd6e257780fbc2c","source":{"kind":"arxiv","id":"1605.00507","version":1},"attestation_state":"computed","paper":{"title":"Methods for Sparse and Low-Rank Recovery under Simplex Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ME","authors_text":"Martin Slawski, Ping Li, Syama Sundar Rangapuram","submitted_at":"2016-05-02T14:37:59Z","abstract_excerpt":"The de-facto standard approach of promoting sparsity by means of $\\ell_1$-regularization becomes ineffective in the presence of simplex constraints, i.e.,~the target is known to have non-negative entries summing up to a given constant. The situation is analogous for the use of nuclear norm regularization for low-rank recovery of Hermitian positive semidefinite matrices with given trace. In the present paper, we discuss several strategies to deal with this situation, from simple to more complex. As a starting point, we consider empirical risk minimization (ERM). It follows from existing theory "},"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":"1605.00507","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-05-02T14:37:59Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"fc4bf3149bba8a68848fcbe213f799c7b1e25dedc655e72e0cbb29945c47c218","abstract_canon_sha256":"e9b68fb47db05d896cc953a59f096c5617dffc10758b5dcb1dc59276152121b5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:48.449661Z","signature_b64":"k0ikUru/ubyFaaJG+H/cK0sLZ9hRS7ZvbyISLSX0VN2dhfVk5kj/ErmDK7R5s8HJaEcqGRA+QTgWfY7+Mi4VBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7845c49ed6b799458f3f7ddbdcc2170336cac6644dc7115bfbd6e257780fbc2c","last_reissued_at":"2026-05-18T01:15:48.449248Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:48.449248Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Methods for Sparse and Low-Rank Recovery under Simplex Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ME","authors_text":"Martin Slawski, Ping Li, Syama Sundar Rangapuram","submitted_at":"2016-05-02T14:37:59Z","abstract_excerpt":"The de-facto standard approach of promoting sparsity by means of $\\ell_1$-regularization becomes ineffective in the presence of simplex constraints, i.e.,~the target is known to have non-negative entries summing up to a given constant. The situation is analogous for the use of nuclear norm regularization for low-rank recovery of Hermitian positive semidefinite matrices with given trace. In the present paper, we discuss several strategies to deal with this situation, from simple to more complex. As a starting point, we consider empirical risk minimization (ERM). It follows from existing theory "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.00507","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":"1605.00507","created_at":"2026-05-18T01:15:48.449319+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.00507v1","created_at":"2026-05-18T01:15:48.449319+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.00507","created_at":"2026-05-18T01:15:48.449319+00:00"},{"alias_kind":"pith_short_12","alias_value":"PBC4JHWWW6MU","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"PBC4JHWWW6MULDZ7","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"PBC4JHWW","created_at":"2026-05-18T12:30:39.010887+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/PBC4JHWWW6MULDZ7PXN5ZQQXAM","json":"https://pith.science/pith/PBC4JHWWW6MULDZ7PXN5ZQQXAM.json","graph_json":"https://pith.science/api/pith-number/PBC4JHWWW6MULDZ7PXN5ZQQXAM/graph.json","events_json":"https://pith.science/api/pith-number/PBC4JHWWW6MULDZ7PXN5ZQQXAM/events.json","paper":"https://pith.science/paper/PBC4JHWW"},"agent_actions":{"view_html":"https://pith.science/pith/PBC4JHWWW6MULDZ7PXN5ZQQXAM","download_json":"https://pith.science/pith/PBC4JHWWW6MULDZ7PXN5ZQQXAM.json","view_paper":"https://pith.science/paper/PBC4JHWW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.00507&json=true","fetch_graph":"https://pith.science/api/pith-number/PBC4JHWWW6MULDZ7PXN5ZQQXAM/graph.json","fetch_events":"https://pith.science/api/pith-number/PBC4JHWWW6MULDZ7PXN5ZQQXAM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PBC4JHWWW6MULDZ7PXN5ZQQXAM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PBC4JHWWW6MULDZ7PXN5ZQQXAM/action/storage_attestation","attest_author":"https://pith.science/pith/PBC4JHWWW6MULDZ7PXN5ZQQXAM/action/author_attestation","sign_citation":"https://pith.science/pith/PBC4JHWWW6MULDZ7PXN5ZQQXAM/action/citation_signature","submit_replication":"https://pith.science/pith/PBC4JHWWW6MULDZ7PXN5ZQQXAM/action/replication_record"}},"created_at":"2026-05-18T01:15:48.449319+00:00","updated_at":"2026-05-18T01:15:48.449319+00:00"}