{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:MGRKS5AWKIP3E53FLLICYYNY2D","short_pith_number":"pith:MGRKS5AW","canonical_record":{"source":{"id":"1903.05239","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-12T22:20:10Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"e94a6e4f9c4716e7a0a805ece739b2441822ebeca11d18d656e36d111a2521ac","abstract_canon_sha256":"71954c2107ad427fa8e97ba07e406f1dd9e02b986b6a5bb059e24b6206fe3e53"},"schema_version":"1.0"},"canonical_sha256":"61a2a97416521fb277655ad02c61b8d0d1c784872e7d3c7dc211184beb0c3ede","source":{"kind":"arxiv","id":"1903.05239","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.05239","created_at":"2026-05-17T23:51:24Z"},{"alias_kind":"arxiv_version","alias_value":"1903.05239v1","created_at":"2026-05-17T23:51:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.05239","created_at":"2026-05-17T23:51:24Z"},{"alias_kind":"pith_short_12","alias_value":"MGRKS5AWKIP3","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"MGRKS5AWKIP3E53F","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"MGRKS5AW","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:MGRKS5AWKIP3E53FLLICYYNY2D","target":"record","payload":{"canonical_record":{"source":{"id":"1903.05239","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-12T22:20:10Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"e94a6e4f9c4716e7a0a805ece739b2441822ebeca11d18d656e36d111a2521ac","abstract_canon_sha256":"71954c2107ad427fa8e97ba07e406f1dd9e02b986b6a5bb059e24b6206fe3e53"},"schema_version":"1.0"},"canonical_sha256":"61a2a97416521fb277655ad02c61b8d0d1c784872e7d3c7dc211184beb0c3ede","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:24.998769Z","signature_b64":"GJlHrbTSRsOpphwN2y6XSznBr57PM4qk2DE9bOz32ozqiYt9zE/n05Q4MoPW8h+tsFyM30URBmk78bkgDihfAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61a2a97416521fb277655ad02c61b8d0d1c784872e7d3c7dc211184beb0c3ede","last_reissued_at":"2026-05-17T23:51:24.998232Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:24.998232Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.05239","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:51:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gvXLNoCOal+FA7OFuOTLZT3zDwDPt3XnFDrBrAnW3pcw5O5GuLU1330ROyEUeT4efcvEwp8qQ+YO86epUT/RDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T16:01:18.663018Z"},"content_sha256":"cd67143f11f548343d219449534470948adbb9ca6f6a13e0be351dc4d721edfd","schema_version":"1.0","event_id":"sha256:cd67143f11f548343d219449534470948adbb9ca6f6a13e0be351dc4d721edfd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:MGRKS5AWKIP3E53FLLICYYNY2D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Non-Negative Local Sparse Coding for Subspace Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Babak Hosseini, Barbara Hammer","submitted_at":"2019-03-12T22:20:10Z","abstract_excerpt":"Subspace sparse coding (SSC) algorithms have proven to be beneficial to clustering problems. They provide an alternative data representation in which the underlying structure of the clusters can be better captured. However, most of the research in this area is mainly focused on enhancing the sparse coding part of the problem. In contrast, we introduce a novel objective term in our proposed SSC framework which focuses on the separability of data points in the coding space. We also provide mathematical insights into how this local-separability term improves the clustering result of the SSC frame"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.05239","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:51:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nm/zcLtO0O+maVrhrp/SlWyd1Iu7b7GP9k7/H866+69L4gQhiTf5ugima4VhE/+8W4KpGvQ6PrRDQhHJhaCRAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T16:01:18.663720Z"},"content_sha256":"db5fc56356f02b1db278ced35c75d7774e89bbcf8a8019c7d8395b8698a6c1de","schema_version":"1.0","event_id":"sha256:db5fc56356f02b1db278ced35c75d7774e89bbcf8a8019c7d8395b8698a6c1de"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MGRKS5AWKIP3E53FLLICYYNY2D/bundle.json","state_url":"https://pith.science/pith/MGRKS5AWKIP3E53FLLICYYNY2D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MGRKS5AWKIP3E53FLLICYYNY2D/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-29T16:01:18Z","links":{"resolver":"https://pith.science/pith/MGRKS5AWKIP3E53FLLICYYNY2D","bundle":"https://pith.science/pith/MGRKS5AWKIP3E53FLLICYYNY2D/bundle.json","state":"https://pith.science/pith/MGRKS5AWKIP3E53FLLICYYNY2D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MGRKS5AWKIP3E53FLLICYYNY2D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:MGRKS5AWKIP3E53FLLICYYNY2D","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":"71954c2107ad427fa8e97ba07e406f1dd9e02b986b6a5bb059e24b6206fe3e53","cross_cats_sorted":["cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-12T22:20:10Z","title_canon_sha256":"e94a6e4f9c4716e7a0a805ece739b2441822ebeca11d18d656e36d111a2521ac"},"schema_version":"1.0","source":{"id":"1903.05239","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.05239","created_at":"2026-05-17T23:51:24Z"},{"alias_kind":"arxiv_version","alias_value":"1903.05239v1","created_at":"2026-05-17T23:51:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.05239","created_at":"2026-05-17T23:51:24Z"},{"alias_kind":"pith_short_12","alias_value":"MGRKS5AWKIP3","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"MGRKS5AWKIP3E53F","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"MGRKS5AW","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:db5fc56356f02b1db278ced35c75d7774e89bbcf8a8019c7d8395b8698a6c1de","target":"graph","created_at":"2026-05-17T23:51:24Z","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":"Subspace sparse coding (SSC) algorithms have proven to be beneficial to clustering problems. They provide an alternative data representation in which the underlying structure of the clusters can be better captured. However, most of the research in this area is mainly focused on enhancing the sparse coding part of the problem. In contrast, we introduce a novel objective term in our proposed SSC framework which focuses on the separability of data points in the coding space. We also provide mathematical insights into how this local-separability term improves the clustering result of the SSC frame","authors_text":"Babak Hosseini, Barbara Hammer","cross_cats":["cs.DS","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-12T22:20:10Z","title":"Non-Negative Local Sparse Coding for Subspace Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.05239","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:cd67143f11f548343d219449534470948adbb9ca6f6a13e0be351dc4d721edfd","target":"record","created_at":"2026-05-17T23:51:24Z","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":"71954c2107ad427fa8e97ba07e406f1dd9e02b986b6a5bb059e24b6206fe3e53","cross_cats_sorted":["cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-12T22:20:10Z","title_canon_sha256":"e94a6e4f9c4716e7a0a805ece739b2441822ebeca11d18d656e36d111a2521ac"},"schema_version":"1.0","source":{"id":"1903.05239","kind":"arxiv","version":1}},"canonical_sha256":"61a2a97416521fb277655ad02c61b8d0d1c784872e7d3c7dc211184beb0c3ede","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"61a2a97416521fb277655ad02c61b8d0d1c784872e7d3c7dc211184beb0c3ede","first_computed_at":"2026-05-17T23:51:24.998232Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:24.998232Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GJlHrbTSRsOpphwN2y6XSznBr57PM4qk2DE9bOz32ozqiYt9zE/n05Q4MoPW8h+tsFyM30URBmk78bkgDihfAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:24.998769Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.05239","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd67143f11f548343d219449534470948adbb9ca6f6a13e0be351dc4d721edfd","sha256:db5fc56356f02b1db278ced35c75d7774e89bbcf8a8019c7d8395b8698a6c1de"],"state_sha256":"5ea3ce7de5f40364c5253454dcbd6ae7366c1769a5d9ecfd62fd15f0e981b692"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Oyclb28v0a90OSpCX9s5/Q4lzPS6o3ycnGPhedUwe6rHn5SniHqFZQzwoqkyBp4K+ca2vtEQHSMpxHQXYcr6Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T16:01:18.667299Z","bundle_sha256":"91d36d673ac13caa285812be0a3bfcf175bfbf50cce7c97775ce5d51774a427a"}}