{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:S7FXSGN76OW2LXBCNBMPD6FEZX","short_pith_number":"pith:S7FXSGN7","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"},"canonical_sha256":"97cb7919bff3ada5dc226858f1f8a4cdd1e15ac7f1826023b230c98a672ef6c2","source":{"kind":"arxiv","id":"1812.06580","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.06580","created_at":"2026-05-17T23:58:09Z"},{"alias_kind":"arxiv_version","alias_value":"1812.06580v1","created_at":"2026-05-17T23:58:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.06580","created_at":"2026-05-17T23:58:09Z"},{"alias_kind":"pith_short_12","alias_value":"S7FXSGN76OW2","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"S7FXSGN76OW2LXBC","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"S7FXSGN7","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:S7FXSGN76OW2LXBCNBMPD6FEZX","target":"record","payload":{"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"},"canonical_sha256":"97cb7919bff3ada5dc226858f1f8a4cdd1e15ac7f1826023b230c98a672ef6c2","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"},"source_kind":"arxiv","source_id":"1812.06580","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-17T23:58:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EVIEirM7q9oHYEOI5beflTjiMqv1P3gv8fLEWfJrjvPXL+Xjg7kpBh7E0wOL3kFOXCra9XVOgvxxnZ7Gg3VGDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T15:28:47.730142Z"},"content_sha256":"824525b8f2b0421a6197957d1d47dcb2bab6ab27b22b56058be28f03607d66af","schema_version":"1.0","event_id":"sha256:824525b8f2b0421a6197957d1d47dcb2bab6ab27b22b56058be28f03607d66af"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:S7FXSGN76OW2LXBCNBMPD6FEZX","target":"graph","payload":{"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"},"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-17T23:58:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i9b2b3NXzL/HE/j3UZHMmdA79tZzjK6CWcx5YpxaTwiQ28bQpYXux+M4GzHFzYvjWtpvWJNktYFeM1Vw/etsDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T15:28:47.730534Z"},"content_sha256":"de94e90074c26d7d1b185f49b990393ed370a403336e28181b1c48ef71b234a4","schema_version":"1.0","event_id":"sha256:de94e90074c26d7d1b185f49b990393ed370a403336e28181b1c48ef71b234a4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S7FXSGN76OW2LXBCNBMPD6FEZX/bundle.json","state_url":"https://pith.science/pith/S7FXSGN76OW2LXBCNBMPD6FEZX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S7FXSGN76OW2LXBCNBMPD6FEZX/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-21T15:28:47Z","links":{"resolver":"https://pith.science/pith/S7FXSGN76OW2LXBCNBMPD6FEZX","bundle":"https://pith.science/pith/S7FXSGN76OW2LXBCNBMPD6FEZX/bundle.json","state":"https://pith.science/pith/S7FXSGN76OW2LXBCNBMPD6FEZX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S7FXSGN76OW2LXBCNBMPD6FEZX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:S7FXSGN76OW2LXBCNBMPD6FEZX","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":"12178b6cdcad5e8c83783a634ce88279a3ac48d775af4e9d91fcb5bcb3046b6f","cross_cats_sorted":["cs.CV","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-17T02:06:16Z","title_canon_sha256":"63973544e689ff938e83ef046cc270a503f4fa10d89781838606b3ce498ff62d"},"schema_version":"1.0","source":{"id":"1812.06580","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.06580","created_at":"2026-05-17T23:58:09Z"},{"alias_kind":"arxiv_version","alias_value":"1812.06580v1","created_at":"2026-05-17T23:58:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.06580","created_at":"2026-05-17T23:58:09Z"},{"alias_kind":"pith_short_12","alias_value":"S7FXSGN76OW2","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"S7FXSGN76OW2LXBC","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"S7FXSGN7","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:de94e90074c26d7d1b185f49b990393ed370a403336e28181b1c48ef71b234a4","target":"graph","created_at":"2026-05-17T23:58:09Z","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":"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","authors_text":"Ivica Kopriva, Maria Brbi\\'c","cross_cats":["cs.CV","math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-17T02:06:16Z","title":"$\\ell_0$-Motivated Low-Rank Sparse Subspace Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.06580","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:824525b8f2b0421a6197957d1d47dcb2bab6ab27b22b56058be28f03607d66af","target":"record","created_at":"2026-05-17T23:58:09Z","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":"12178b6cdcad5e8c83783a634ce88279a3ac48d775af4e9d91fcb5bcb3046b6f","cross_cats_sorted":["cs.CV","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-17T02:06:16Z","title_canon_sha256":"63973544e689ff938e83ef046cc270a503f4fa10d89781838606b3ce498ff62d"},"schema_version":"1.0","source":{"id":"1812.06580","kind":"arxiv","version":1}},"canonical_sha256":"97cb7919bff3ada5dc226858f1f8a4cdd1e15ac7f1826023b230c98a672ef6c2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"97cb7919bff3ada5dc226858f1f8a4cdd1e15ac7f1826023b230c98a672ef6c2","first_computed_at":"2026-05-17T23:58:09.833379Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:09.833379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C1NTCmpaDyRjC8WgmZM+HISwvcW7N+3BZ7BGBe8CBUADcumb3Trbp1/rE13ZHtmGjsKPEyXGXOlc/JvtiUhGAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:09.833885Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.06580","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:824525b8f2b0421a6197957d1d47dcb2bab6ab27b22b56058be28f03607d66af","sha256:de94e90074c26d7d1b185f49b990393ed370a403336e28181b1c48ef71b234a4"],"state_sha256":"699f7b6d9a39e81883088880954529edc3e03d9fe6449db078af07ca9e8fe68f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xdDIz3pg6sJyEAsVu+Bq3bIGTLtwZF71u0ZPMGnhzoH82pBwst8RophkwQQu0NQavxjQ4nNFZZQbAVblMGURBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T15:28:47.733681Z","bundle_sha256":"9dc92d4d810dde88699e99915bfb55bd026fe1d8790d2b680ed6ce87fcab9c45"}}