{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:4YQNCDCRRLANJZ2NAZUYZMZHRB","short_pith_number":"pith:4YQNCDCR","schema_version":"1.0","canonical_sha256":"e620d10c518ac0d4e74d06698cb327887c62babedcd16a61a1426819a80de5f7","source":{"kind":"arxiv","id":"1805.08183","version":2},"attestation_state":"computed","paper":{"title":"Constrained Sparse Subspace Clustering with Side-Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Chun-Guang Li, Jun Guo, Junjian Zhang","submitted_at":"2018-05-21T17:06:17Z","abstract_excerpt":"Subspace clustering refers to the problem of segmenting high dimensional data drawn from a union of subspaces into the respective subspaces. In some applications, partial side-information to indicate \"must-link\" or \"cannot-link\" in clustering is available. This leads to the task of subspace clustering with side-information. However, in prior work the supervision value of the side-information for subspace clustering has not been fully exploited. To this end, in this paper, we present an enhanced approach for constrained subspace clustering with side-information, termed Constrained Sparse Subspa"},"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":"1805.08183","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-05-21T17:06:17Z","cross_cats_sorted":[],"title_canon_sha256":"8d414b5efa4719446264c7cb4f831bdabcaa107eeb8e1f68195d70b798254060","abstract_canon_sha256":"b875d9c8e6c042c7c4d7d04a71c89e91f194e99575a17d3d6d141e0072e92f64"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:27.267524Z","signature_b64":"3xT+Wr7DG80+rxUO3wtKds533accab8Wx4rQwGH0S2C8HfK8NbeupWspQ7iMlcB3VmUoBabSWEpoLx60DSbQAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e620d10c518ac0d4e74d06698cb327887c62babedcd16a61a1426819a80de5f7","last_reissued_at":"2026-05-18T00:15:27.266649Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:27.266649Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constrained Sparse Subspace Clustering with Side-Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Chun-Guang Li, Jun Guo, Junjian Zhang","submitted_at":"2018-05-21T17:06:17Z","abstract_excerpt":"Subspace clustering refers to the problem of segmenting high dimensional data drawn from a union of subspaces into the respective subspaces. In some applications, partial side-information to indicate \"must-link\" or \"cannot-link\" in clustering is available. This leads to the task of subspace clustering with side-information. However, in prior work the supervision value of the side-information for subspace clustering has not been fully exploited. To this end, in this paper, we present an enhanced approach for constrained subspace clustering with side-information, termed Constrained Sparse Subspa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.08183","kind":"arxiv","version":2},"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":"1805.08183","created_at":"2026-05-18T00:15:27.266795+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.08183v2","created_at":"2026-05-18T00:15:27.266795+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08183","created_at":"2026-05-18T00:15:27.266795+00:00"},{"alias_kind":"pith_short_12","alias_value":"4YQNCDCRRLAN","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"4YQNCDCRRLANJZ2N","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"4YQNCDCR","created_at":"2026-05-18T12:32:05.422762+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/4YQNCDCRRLANJZ2NAZUYZMZHRB","json":"https://pith.science/pith/4YQNCDCRRLANJZ2NAZUYZMZHRB.json","graph_json":"https://pith.science/api/pith-number/4YQNCDCRRLANJZ2NAZUYZMZHRB/graph.json","events_json":"https://pith.science/api/pith-number/4YQNCDCRRLANJZ2NAZUYZMZHRB/events.json","paper":"https://pith.science/paper/4YQNCDCR"},"agent_actions":{"view_html":"https://pith.science/pith/4YQNCDCRRLANJZ2NAZUYZMZHRB","download_json":"https://pith.science/pith/4YQNCDCRRLANJZ2NAZUYZMZHRB.json","view_paper":"https://pith.science/paper/4YQNCDCR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.08183&json=true","fetch_graph":"https://pith.science/api/pith-number/4YQNCDCRRLANJZ2NAZUYZMZHRB/graph.json","fetch_events":"https://pith.science/api/pith-number/4YQNCDCRRLANJZ2NAZUYZMZHRB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4YQNCDCRRLANJZ2NAZUYZMZHRB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4YQNCDCRRLANJZ2NAZUYZMZHRB/action/storage_attestation","attest_author":"https://pith.science/pith/4YQNCDCRRLANJZ2NAZUYZMZHRB/action/author_attestation","sign_citation":"https://pith.science/pith/4YQNCDCRRLANJZ2NAZUYZMZHRB/action/citation_signature","submit_replication":"https://pith.science/pith/4YQNCDCRRLANJZ2NAZUYZMZHRB/action/replication_record"}},"created_at":"2026-05-18T00:15:27.266795+00:00","updated_at":"2026-05-18T00:15:27.266795+00:00"}