{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:TMN4RSYEGRH5L2WKNYP2IC3HPF","short_pith_number":"pith:TMN4RSYE","canonical_record":{"source":{"id":"1501.04277","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-01-18T10:06:55Z","cross_cats_sorted":[],"title_canon_sha256":"23f8eeed1e87b5d9d9ddf91c517d37ade8359e0fc2cce04078befd4088f35c6e","abstract_canon_sha256":"5320fbb801c39df19d7a0ccf6d489d746a51e0093b4b852b886aa53909bbfaee"},"schema_version":"1.0"},"canonical_sha256":"9b1bc8cb04344fd5eaca6e1fa40b67796bcc576d81ca06e38020866927b8cdff","source":{"kind":"arxiv","id":"1501.04277","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.04277","created_at":"2026-05-18T02:29:09Z"},{"alias_kind":"arxiv_version","alias_value":"1501.04277v1","created_at":"2026-05-18T02:29:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.04277","created_at":"2026-05-18T02:29:09Z"},{"alias_kind":"pith_short_12","alias_value":"TMN4RSYEGRH5","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TMN4RSYEGRH5L2WK","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TMN4RSYE","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:TMN4RSYEGRH5L2WKNYP2IC3HPF","target":"record","payload":{"canonical_record":{"source":{"id":"1501.04277","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-01-18T10:06:55Z","cross_cats_sorted":[],"title_canon_sha256":"23f8eeed1e87b5d9d9ddf91c517d37ade8359e0fc2cce04078befd4088f35c6e","abstract_canon_sha256":"5320fbb801c39df19d7a0ccf6d489d746a51e0093b4b852b886aa53909bbfaee"},"schema_version":"1.0"},"canonical_sha256":"9b1bc8cb04344fd5eaca6e1fa40b67796bcc576d81ca06e38020866927b8cdff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:09.518134Z","signature_b64":"Hgbah021xb8R6HNP8LgHgK0kkoqWe80oCS0EYMg4dRM858p8A3muZkAU77CsebJ2eyCLbqeUw6GMPpxnlKKCBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b1bc8cb04344fd5eaca6e1fa40b67796bcc576d81ca06e38020866927b8cdff","last_reissued_at":"2026-05-18T02:29:09.517489Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:09.517489Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.04277","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-18T02:29:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dCibQmxB5HoCD9zzUkLidR0pIIRwPQgbUoBNJdMeP4ruX+wdFyFCZ9IrMf372mMNaGskqA3RQwtQpf9lcTmNDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T18:15:26.748456Z"},"content_sha256":"a7a80d968a5b867092b04bf4df463ae12560220b9344222336a35790536baa61","schema_version":"1.0","event_id":"sha256:a7a80d968a5b867092b04bf4df463ae12560220b9344222336a35790536baa61"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:TMN4RSYEGRH5L2WKNYP2IC3HPF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Correntropy Induced L2 Graph for Robust Subspace Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Canyi Lu, Jinhui Tang, Liang Lin, Min Lin, Shuicheng Yan, Zhouchen Lin","submitted_at":"2015-01-18T10:06:55Z","abstract_excerpt":"In this paper, we study the robust subspace clustering problem, which aims to cluster the given possibly noisy data points into their underlying subspaces. A large pool of previous subspace clustering methods focus on the graph construction by different regularization of the representation coefficient. We instead focus on the robustness of the model to non-Gaussian noises. We propose a new robust clustering method by using the correntropy induced metric, which is robust for handling the non-Gaussian and impulsive noises. Also we further extend the method for handling the data with outlier rows"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.04277","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-18T02:29:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CZcUi9caejSUZcsNPUroH8+s85mBhxUeknT9pweuq0pG/v9UDQKG3f6ddJDwMILbrZcDwhh0+wrI3cXUVWF0CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T18:15:26.748825Z"},"content_sha256":"0144d211bb8b4418cb7b5d5fc515782de20a2433ac43ad509e52a5ebc2a0e0de","schema_version":"1.0","event_id":"sha256:0144d211bb8b4418cb7b5d5fc515782de20a2433ac43ad509e52a5ebc2a0e0de"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TMN4RSYEGRH5L2WKNYP2IC3HPF/bundle.json","state_url":"https://pith.science/pith/TMN4RSYEGRH5L2WKNYP2IC3HPF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TMN4RSYEGRH5L2WKNYP2IC3HPF/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-21T18:15:26Z","links":{"resolver":"https://pith.science/pith/TMN4RSYEGRH5L2WKNYP2IC3HPF","bundle":"https://pith.science/pith/TMN4RSYEGRH5L2WKNYP2IC3HPF/bundle.json","state":"https://pith.science/pith/TMN4RSYEGRH5L2WKNYP2IC3HPF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TMN4RSYEGRH5L2WKNYP2IC3HPF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:TMN4RSYEGRH5L2WKNYP2IC3HPF","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":"5320fbb801c39df19d7a0ccf6d489d746a51e0093b4b852b886aa53909bbfaee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-01-18T10:06:55Z","title_canon_sha256":"23f8eeed1e87b5d9d9ddf91c517d37ade8359e0fc2cce04078befd4088f35c6e"},"schema_version":"1.0","source":{"id":"1501.04277","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.04277","created_at":"2026-05-18T02:29:09Z"},{"alias_kind":"arxiv_version","alias_value":"1501.04277v1","created_at":"2026-05-18T02:29:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.04277","created_at":"2026-05-18T02:29:09Z"},{"alias_kind":"pith_short_12","alias_value":"TMN4RSYEGRH5","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TMN4RSYEGRH5L2WK","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TMN4RSYE","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:0144d211bb8b4418cb7b5d5fc515782de20a2433ac43ad509e52a5ebc2a0e0de","target":"graph","created_at":"2026-05-18T02:29: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 this paper, we study the robust subspace clustering problem, which aims to cluster the given possibly noisy data points into their underlying subspaces. A large pool of previous subspace clustering methods focus on the graph construction by different regularization of the representation coefficient. We instead focus on the robustness of the model to non-Gaussian noises. We propose a new robust clustering method by using the correntropy induced metric, which is robust for handling the non-Gaussian and impulsive noises. Also we further extend the method for handling the data with outlier rows","authors_text":"Canyi Lu, Jinhui Tang, Liang Lin, Min Lin, Shuicheng Yan, Zhouchen Lin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-01-18T10:06:55Z","title":"Correntropy Induced L2 Graph for Robust Subspace Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.04277","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:a7a80d968a5b867092b04bf4df463ae12560220b9344222336a35790536baa61","target":"record","created_at":"2026-05-18T02:29: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":"5320fbb801c39df19d7a0ccf6d489d746a51e0093b4b852b886aa53909bbfaee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-01-18T10:06:55Z","title_canon_sha256":"23f8eeed1e87b5d9d9ddf91c517d37ade8359e0fc2cce04078befd4088f35c6e"},"schema_version":"1.0","source":{"id":"1501.04277","kind":"arxiv","version":1}},"canonical_sha256":"9b1bc8cb04344fd5eaca6e1fa40b67796bcc576d81ca06e38020866927b8cdff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9b1bc8cb04344fd5eaca6e1fa40b67796bcc576d81ca06e38020866927b8cdff","first_computed_at":"2026-05-18T02:29:09.517489Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:29:09.517489Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Hgbah021xb8R6HNP8LgHgK0kkoqWe80oCS0EYMg4dRM858p8A3muZkAU77CsebJ2eyCLbqeUw6GMPpxnlKKCBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:29:09.518134Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.04277","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a7a80d968a5b867092b04bf4df463ae12560220b9344222336a35790536baa61","sha256:0144d211bb8b4418cb7b5d5fc515782de20a2433ac43ad509e52a5ebc2a0e0de"],"state_sha256":"f1872ca8004c13dc87ce345ef1e5762de93b1f7d351f95e53b735083a673a63d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"26XOKNoo7hWmTE3+VCMnSFImz9oRRaz4bTZwtbh73+a89BJ9PlSsgSsWjXri/bbXiZCrM9GhQr+/NTc8LA8UAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T18:15:26.754526Z","bundle_sha256":"2d2a0e909773aec2b37443bcd52e9f48fba9546d6cb4285a706a74f6f111c382"}}