{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:5EGG3TQUKGGPHTSLXXFQ5QT2L5","short_pith_number":"pith:5EGG3TQU","canonical_record":{"source":{"id":"1712.02979","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-08T08:34:18Z","cross_cats_sorted":[],"title_canon_sha256":"fbac0c67f1ff3e4f063eb9ad0ee1cf1e18922859ebe44fb9797783074e6b47e0","abstract_canon_sha256":"5a8abe10d298c82ef4a78ecd1b30ea7ae511df48304a1caf4790d673baeafce4"},"schema_version":"1.0"},"canonical_sha256":"e90c6dce14518cf3ce4bbdcb0ec27a5f6ea07b9b705ab326a594c6623a37c739","source":{"kind":"arxiv","id":"1712.02979","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.02979","created_at":"2026-05-18T00:28:28Z"},{"alias_kind":"arxiv_version","alias_value":"1712.02979v1","created_at":"2026-05-18T00:28:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.02979","created_at":"2026-05-18T00:28:28Z"},{"alias_kind":"pith_short_12","alias_value":"5EGG3TQUKGGP","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5EGG3TQUKGGPHTSL","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5EGG3TQU","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:5EGG3TQUKGGPHTSLXXFQ5QT2L5","target":"record","payload":{"canonical_record":{"source":{"id":"1712.02979","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-08T08:34:18Z","cross_cats_sorted":[],"title_canon_sha256":"fbac0c67f1ff3e4f063eb9ad0ee1cf1e18922859ebe44fb9797783074e6b47e0","abstract_canon_sha256":"5a8abe10d298c82ef4a78ecd1b30ea7ae511df48304a1caf4790d673baeafce4"},"schema_version":"1.0"},"canonical_sha256":"e90c6dce14518cf3ce4bbdcb0ec27a5f6ea07b9b705ab326a594c6623a37c739","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:28.710257Z","signature_b64":"Z4PrrPz5NZYEk1NmCVpWjTGW7QX7Z41ofbMRirf+UuW3OOiXyK85ePCNoDLkOOIGoxHLFdJzaxAm8u30RVvPAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e90c6dce14518cf3ce4bbdcb0ec27a5f6ea07b9b705ab326a594c6623a37c739","last_reissued_at":"2026-05-18T00:28:28.709683Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:28.709683Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.02979","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-18T00:28:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BHnbJGkm/SmeECZT+Nb3/Hx2A/R4ofJ1Uc4WOnoooGszxTnWFgm1QJqaEDkyvD8YxY3oGrRIHfrBJI+EE/JFCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T21:00:42.683457Z"},"content_sha256":"890ae326f4c8a01f56efdf2082e2b8774be3aec40409a04aaffc47b658b655b8","schema_version":"1.0","event_id":"sha256:890ae326f4c8a01f56efdf2082e2b8774be3aec40409a04aaffc47b658b655b8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:5EGG3TQUKGGPHTSLXXFQ5QT2L5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Nonconvex Sparse Spectral Clustering by Alternating Direction Method of Multipliers and Its Convergence Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Canyi Lu, Jiashi Feng, Shuicheng Yan, Zhouchen Lin","submitted_at":"2017-12-08T08:34:18Z","abstract_excerpt":"Spectral Clustering (SC) is a widely used data clustering method which first learns a low-dimensional 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. The Sparse Spectral Clustering (SSC) method extends SC with a sparse regularization on $UU^\\top$ by using the block diagonal structure prior of $UU^\\top$ in the ideal case. However, encouraging $UU^\\top$ to be sparse leads to a heavily nonconvex problem which is challenging to solve and the work (Lu, Yan, and Lin 2016) proposes a conv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.02979","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-18T00:28:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HOwzCd1Nkzasr9go8lxDj6MR2mENBe4JoNkfg4eZGkA194nvkcdudC+QMB9uWfvTvi3sWj6JR3coYRi2n4ZjDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T21:00:42.684120Z"},"content_sha256":"27a9bb9a6d666fe91c8fcb7d5e22942ad3427525b0a395f2c41ce691a2e82106","schema_version":"1.0","event_id":"sha256:27a9bb9a6d666fe91c8fcb7d5e22942ad3427525b0a395f2c41ce691a2e82106"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5EGG3TQUKGGPHTSLXXFQ5QT2L5/bundle.json","state_url":"https://pith.science/pith/5EGG3TQUKGGPHTSLXXFQ5QT2L5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5EGG3TQUKGGPHTSLXXFQ5QT2L5/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-06-08T21:00:42Z","links":{"resolver":"https://pith.science/pith/5EGG3TQUKGGPHTSLXXFQ5QT2L5","bundle":"https://pith.science/pith/5EGG3TQUKGGPHTSLXXFQ5QT2L5/bundle.json","state":"https://pith.science/pith/5EGG3TQUKGGPHTSLXXFQ5QT2L5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5EGG3TQUKGGPHTSLXXFQ5QT2L5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:5EGG3TQUKGGPHTSLXXFQ5QT2L5","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":"5a8abe10d298c82ef4a78ecd1b30ea7ae511df48304a1caf4790d673baeafce4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-08T08:34:18Z","title_canon_sha256":"fbac0c67f1ff3e4f063eb9ad0ee1cf1e18922859ebe44fb9797783074e6b47e0"},"schema_version":"1.0","source":{"id":"1712.02979","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.02979","created_at":"2026-05-18T00:28:28Z"},{"alias_kind":"arxiv_version","alias_value":"1712.02979v1","created_at":"2026-05-18T00:28:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.02979","created_at":"2026-05-18T00:28:28Z"},{"alias_kind":"pith_short_12","alias_value":"5EGG3TQUKGGP","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5EGG3TQUKGGPHTSL","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5EGG3TQU","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:27a9bb9a6d666fe91c8fcb7d5e22942ad3427525b0a395f2c41ce691a2e82106","target":"graph","created_at":"2026-05-18T00:28:28Z","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":"Spectral Clustering (SC) is a widely used data clustering method which first learns a low-dimensional 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. The Sparse Spectral Clustering (SSC) method extends SC with a sparse regularization on $UU^\\top$ by using the block diagonal structure prior of $UU^\\top$ in the ideal case. However, encouraging $UU^\\top$ to be sparse leads to a heavily nonconvex problem which is challenging to solve and the work (Lu, Yan, and Lin 2016) proposes a conv","authors_text":"Canyi Lu, Jiashi Feng, Shuicheng Yan, Zhouchen Lin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-08T08:34:18Z","title":"Nonconvex Sparse Spectral Clustering by Alternating Direction Method of Multipliers and Its Convergence Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.02979","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:890ae326f4c8a01f56efdf2082e2b8774be3aec40409a04aaffc47b658b655b8","target":"record","created_at":"2026-05-18T00:28:28Z","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":"5a8abe10d298c82ef4a78ecd1b30ea7ae511df48304a1caf4790d673baeafce4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-08T08:34:18Z","title_canon_sha256":"fbac0c67f1ff3e4f063eb9ad0ee1cf1e18922859ebe44fb9797783074e6b47e0"},"schema_version":"1.0","source":{"id":"1712.02979","kind":"arxiv","version":1}},"canonical_sha256":"e90c6dce14518cf3ce4bbdcb0ec27a5f6ea07b9b705ab326a594c6623a37c739","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e90c6dce14518cf3ce4bbdcb0ec27a5f6ea07b9b705ab326a594c6623a37c739","first_computed_at":"2026-05-18T00:28:28.709683Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:28.709683Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z4PrrPz5NZYEk1NmCVpWjTGW7QX7Z41ofbMRirf+UuW3OOiXyK85ePCNoDLkOOIGoxHLFdJzaxAm8u30RVvPAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:28.710257Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.02979","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:890ae326f4c8a01f56efdf2082e2b8774be3aec40409a04aaffc47b658b655b8","sha256:27a9bb9a6d666fe91c8fcb7d5e22942ad3427525b0a395f2c41ce691a2e82106"],"state_sha256":"29f54715ee321008bd0fb55375d16a3153ee412bbfb0b13ca22e6ce811d9a58a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AqrydM+kXPlgN1U7KIj8uWymVWcWSNPQ28EheVnnGtgZDg07G/lS1UAM+AppltWiXiqmjqNVmbYy8h3bkNSaAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T21:00:42.687360Z","bundle_sha256":"bc615e1f73ff61d69fddfee9fa748ea9970045ef579e128516f821d577f51c8c"}}