{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:S7FXSGN76OW2LXBCNBMPD6FEZX","short_pith_number":"pith:S7FXSGN7","schema_version":"1.0","canonical_sha256":"97cb7919bff3ada5dc226858f1f8a4cdd1e15ac7f1826023b230c98a672ef6c2","source":{"kind":"arxiv","id":"1812.06580","version":1},"attestation_state":"computed","paper":{"title":"$\\ell_0$-Motivated Low-Rank Sparse Subspace Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ivica Kopriva, Maria Brbi\\'c","submitted_at":"2018-12-17T02:06:16Z","abstract_excerpt":"In many applications, high-dimensional data points can be well represented by low-dimensional subspaces. To identify the subspaces, it is important to capture a global and local structure of the data which is achieved by imposing low-rank and sparseness constraints on the data representation matrix. In low-rank sparse subspace clustering (LRSSC), nuclear and $\\ell_1$ norms are used to measure rank and sparsity. However, the use of nuclear and $\\ell_1$ norms leads to an overpenalized problem and only approximates the original problem. In this paper, we propose two $\\ell_0$ quasi-norm based regu"},"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":"1812.06580","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-17T02:06:16Z","cross_cats_sorted":["cs.CV","math.OC","stat.ML"],"title_canon_sha256":"63973544e689ff938e83ef046cc270a503f4fa10d89781838606b3ce498ff62d","abstract_canon_sha256":"12178b6cdcad5e8c83783a634ce88279a3ac48d775af4e9d91fcb5bcb3046b6f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:09.833885Z","signature_b64":"C1NTCmpaDyRjC8WgmZM+HISwvcW7N+3BZ7BGBe8CBUADcumb3Trbp1/rE13ZHtmGjsKPEyXGXOlc/JvtiUhGAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"97cb7919bff3ada5dc226858f1f8a4cdd1e15ac7f1826023b230c98a672ef6c2","last_reissued_at":"2026-05-17T23:58:09.833379Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:09.833379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"$\\ell_0$-Motivated Low-Rank Sparse Subspace Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ivica Kopriva, Maria Brbi\\'c","submitted_at":"2018-12-17T02:06:16Z","abstract_excerpt":"In many applications, high-dimensional data points can be well represented by low-dimensional subspaces. To identify the subspaces, it is important to capture a global and local structure of the data which is achieved by imposing low-rank and sparseness constraints on the data representation matrix. In low-rank sparse subspace clustering (LRSSC), nuclear and $\\ell_1$ norms are used to measure rank and sparsity. However, the use of nuclear and $\\ell_1$ norms leads to an overpenalized problem and only approximates the original problem. In this paper, we propose two $\\ell_0$ quasi-norm based regu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.06580","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":"1812.06580","created_at":"2026-05-17T23:58:09.833467+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.06580v1","created_at":"2026-05-17T23:58:09.833467+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.06580","created_at":"2026-05-17T23:58:09.833467+00:00"},{"alias_kind":"pith_short_12","alias_value":"S7FXSGN76OW2","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"S7FXSGN76OW2LXBC","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"S7FXSGN7","created_at":"2026-05-18T12:32:50.500415+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/S7FXSGN76OW2LXBCNBMPD6FEZX","json":"https://pith.science/pith/S7FXSGN76OW2LXBCNBMPD6FEZX.json","graph_json":"https://pith.science/api/pith-number/S7FXSGN76OW2LXBCNBMPD6FEZX/graph.json","events_json":"https://pith.science/api/pith-number/S7FXSGN76OW2LXBCNBMPD6FEZX/events.json","paper":"https://pith.science/paper/S7FXSGN7"},"agent_actions":{"view_html":"https://pith.science/pith/S7FXSGN76OW2LXBCNBMPD6FEZX","download_json":"https://pith.science/pith/S7FXSGN76OW2LXBCNBMPD6FEZX.json","view_paper":"https://pith.science/paper/S7FXSGN7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.06580&json=true","fetch_graph":"https://pith.science/api/pith-number/S7FXSGN76OW2LXBCNBMPD6FEZX/graph.json","fetch_events":"https://pith.science/api/pith-number/S7FXSGN76OW2LXBCNBMPD6FEZX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S7FXSGN76OW2LXBCNBMPD6FEZX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S7FXSGN76OW2LXBCNBMPD6FEZX/action/storage_attestation","attest_author":"https://pith.science/pith/S7FXSGN76OW2LXBCNBMPD6FEZX/action/author_attestation","sign_citation":"https://pith.science/pith/S7FXSGN76OW2LXBCNBMPD6FEZX/action/citation_signature","submit_replication":"https://pith.science/pith/S7FXSGN76OW2LXBCNBMPD6FEZX/action/replication_record"}},"created_at":"2026-05-17T23:58:09.833467+00:00","updated_at":"2026-05-17T23:58:09.833467+00:00"}