{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ZLIOPO66KTWBKMEYHOQARF6V75","short_pith_number":"pith:ZLIOPO66","schema_version":"1.0","canonical_sha256":"cad0e7bbde54ec1530983ba00897d5ff4d582ad591e831af8c3571098148c499","source":{"kind":"arxiv","id":"1511.06860","version":3},"attestation_state":"computed","paper":{"title":"Convex Sparse Spectral Clustering: Single-view to Multi-view","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Canyi Lu, Shuicheng Yan, Zhouchen Lin","submitted_at":"2015-11-21T09:38:31Z","abstract_excerpt":"Spectral Clustering (SC) is one of the most widely used methods for data clustering. It first finds a low-dimensonal embedding $U$ of data by computing the eigenvectors of the normalized Laplacian matrix, and then performs k-means on $U^\\top$ to get the final clustering result. In this work, we observe that, in the ideal case, $UU^\\top$ should be block diagonal and thus sparse. Therefore we propose the Sparse Spectral Clustering (SSC) method which extends SC with sparse regularization on $UU^\\top$. To address the computational issue of the nonconvex SSC model, we propose a novel convex relaxat"},"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":"1511.06860","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-11-21T09:38:31Z","cross_cats_sorted":[],"title_canon_sha256":"aa1207aef23fb5d5099ce660f8599b20e7adf233525c9337140545c027d688c6","abstract_canon_sha256":"19bc007ef43950e64007c493dc5ee528c027c78661e86e3519efe2b3521ac919"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:57.523564Z","signature_b64":"l1a5FKpL93XWeu/lprj2BAeBB5f0pb3aF0kTjo6bJmy6moN0gt7n0evIX5SY2IZmEcAAnBNexXRh5QkZCgNiBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cad0e7bbde54ec1530983ba00897d5ff4d582ad591e831af8c3571098148c499","last_reissued_at":"2026-05-18T00:14:57.523014Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:57.523014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convex Sparse Spectral Clustering: Single-view to Multi-view","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Canyi Lu, Shuicheng Yan, Zhouchen Lin","submitted_at":"2015-11-21T09:38:31Z","abstract_excerpt":"Spectral Clustering (SC) is one of the most widely used methods for data clustering. It first finds a low-dimensonal embedding $U$ of data by computing the eigenvectors of the normalized Laplacian matrix, and then performs k-means on $U^\\top$ to get the final clustering result. In this work, we observe that, in the ideal case, $UU^\\top$ should be block diagonal and thus sparse. Therefore we propose the Sparse Spectral Clustering (SSC) method which extends SC with sparse regularization on $UU^\\top$. To address the computational issue of the nonconvex SSC model, we propose a novel convex relaxat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.06860","kind":"arxiv","version":3},"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":"1511.06860","created_at":"2026-05-18T00:14:57.523109+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.06860v3","created_at":"2026-05-18T00:14:57.523109+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.06860","created_at":"2026-05-18T00:14:57.523109+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZLIOPO66KTWB","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZLIOPO66KTWBKMEY","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZLIOPO66","created_at":"2026-05-18T12:29:52.810259+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/ZLIOPO66KTWBKMEYHOQARF6V75","json":"https://pith.science/pith/ZLIOPO66KTWBKMEYHOQARF6V75.json","graph_json":"https://pith.science/api/pith-number/ZLIOPO66KTWBKMEYHOQARF6V75/graph.json","events_json":"https://pith.science/api/pith-number/ZLIOPO66KTWBKMEYHOQARF6V75/events.json","paper":"https://pith.science/paper/ZLIOPO66"},"agent_actions":{"view_html":"https://pith.science/pith/ZLIOPO66KTWBKMEYHOQARF6V75","download_json":"https://pith.science/pith/ZLIOPO66KTWBKMEYHOQARF6V75.json","view_paper":"https://pith.science/paper/ZLIOPO66","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.06860&json=true","fetch_graph":"https://pith.science/api/pith-number/ZLIOPO66KTWBKMEYHOQARF6V75/graph.json","fetch_events":"https://pith.science/api/pith-number/ZLIOPO66KTWBKMEYHOQARF6V75/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZLIOPO66KTWBKMEYHOQARF6V75/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZLIOPO66KTWBKMEYHOQARF6V75/action/storage_attestation","attest_author":"https://pith.science/pith/ZLIOPO66KTWBKMEYHOQARF6V75/action/author_attestation","sign_citation":"https://pith.science/pith/ZLIOPO66KTWBKMEYHOQARF6V75/action/citation_signature","submit_replication":"https://pith.science/pith/ZLIOPO66KTWBKMEYHOQARF6V75/action/replication_record"}},"created_at":"2026-05-18T00:14:57.523109+00:00","updated_at":"2026-05-18T00:14:57.523109+00:00"}