{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:6SQHYKXMPHIX4XCXVN2VANFL3E","short_pith_number":"pith:6SQHYKXM","canonical_record":{"source":{"id":"1402.5497","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-02-22T09:39:52Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"79557526e4438930a8c21143673fb63f820a9d704ca75dd7b3fda9983e31a02d","abstract_canon_sha256":"617dbbde7e5c97e654d7315706bdfc52e1f81c38b22fccaf4c758a2d67454223"},"schema_version":"1.0"},"canonical_sha256":"f4a07c2aec79d17e5c57ab755034abd93b4f1c032aa6bb168cf485617fce45ae","source":{"kind":"arxiv","id":"1402.5497","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.5497","created_at":"2026-05-18T02:58:20Z"},{"alias_kind":"arxiv_version","alias_value":"1402.5497v1","created_at":"2026-05-18T02:58:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.5497","created_at":"2026-05-18T02:58:20Z"},{"alias_kind":"pith_short_12","alias_value":"6SQHYKXMPHIX","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6SQHYKXMPHIX4XCX","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6SQHYKXM","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:6SQHYKXMPHIX4XCXVN2VANFL3E","target":"record","payload":{"canonical_record":{"source":{"id":"1402.5497","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-02-22T09:39:52Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"79557526e4438930a8c21143673fb63f820a9d704ca75dd7b3fda9983e31a02d","abstract_canon_sha256":"617dbbde7e5c97e654d7315706bdfc52e1f81c38b22fccaf4c758a2d67454223"},"schema_version":"1.0"},"canonical_sha256":"f4a07c2aec79d17e5c57ab755034abd93b4f1c032aa6bb168cf485617fce45ae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:20.951835Z","signature_b64":"D81fzmfOb66OoZo1vYRSX5wZcMZpJ8hmEBBgvqfB9+CUI8/JzYZ7mdQfPJkqZLEaZ5jjKsuXftqjrR88vcHECA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4a07c2aec79d17e5c57ab755034abd93b4f1c032aa6bb168cf485617fce45ae","last_reissued_at":"2026-05-18T02:58:20.951249Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:20.951249Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.5497","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:58:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JIQ3hlGV4Nmr1+e0Uu3BUj5S45pvIlzubFasD3mZCtBf0PJZ5sfcXNTBKe6605Z75uEEJ3Wf2CgMTGs3XKE6CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:06:26.163830Z"},"content_sha256":"9cd2098b896675614daaa7d5e5119889baaf5bfa3e6eec8fb04768d97c382b09","schema_version":"1.0","event_id":"sha256:9cd2098b896675614daaa7d5e5119889baaf5bfa3e6eec8fb04768d97c382b09"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:6SQHYKXMPHIX4XCXVN2VANFL3E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Semidefinite Spectral Clustering via Lagrange Duality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Chunhua Shen, Hanzi Wang, Yan Yan","submitted_at":"2014-02-22T09:39:52Z","abstract_excerpt":"We propose an efficient approach to semidefinite spectral clustering (SSC), which addresses the Frobenius normalization with the positive semidefinite (p.s.d.) constraint for spectral clustering. Compared with the original Frobenius norm approximation based algorithm, the proposed algorithm can more accurately find the closest doubly stochastic approximation to the affinity matrix by considering the p.s.d. constraint. In this paper, SSC is formulated as a semidefinite programming (SDP) problem. In order to solve the high computational complexity of SDP, we present a dual algorithm based on the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.5497","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:58:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KyEukI89+8EMToz8Nh+nv4YAI4MjTJ+bwvOWwkTDCXxHlvTJjzgejmSFUM4UhbMJVXARB1n7vMIxpY4B7C2pCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:06:26.164545Z"},"content_sha256":"53c7b9de5e349a1b660c97886d64e22d2db827e17910ba4102a24fcbb52046c7","schema_version":"1.0","event_id":"sha256:53c7b9de5e349a1b660c97886d64e22d2db827e17910ba4102a24fcbb52046c7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6SQHYKXMPHIX4XCXVN2VANFL3E/bundle.json","state_url":"https://pith.science/pith/6SQHYKXMPHIX4XCXVN2VANFL3E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6SQHYKXMPHIX4XCXVN2VANFL3E/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-26T07:06:26Z","links":{"resolver":"https://pith.science/pith/6SQHYKXMPHIX4XCXVN2VANFL3E","bundle":"https://pith.science/pith/6SQHYKXMPHIX4XCXVN2VANFL3E/bundle.json","state":"https://pith.science/pith/6SQHYKXMPHIX4XCXVN2VANFL3E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6SQHYKXMPHIX4XCXVN2VANFL3E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:6SQHYKXMPHIX4XCXVN2VANFL3E","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":"617dbbde7e5c97e654d7315706bdfc52e1f81c38b22fccaf4c758a2d67454223","cross_cats_sorted":["cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-02-22T09:39:52Z","title_canon_sha256":"79557526e4438930a8c21143673fb63f820a9d704ca75dd7b3fda9983e31a02d"},"schema_version":"1.0","source":{"id":"1402.5497","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.5497","created_at":"2026-05-18T02:58:20Z"},{"alias_kind":"arxiv_version","alias_value":"1402.5497v1","created_at":"2026-05-18T02:58:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.5497","created_at":"2026-05-18T02:58:20Z"},{"alias_kind":"pith_short_12","alias_value":"6SQHYKXMPHIX","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6SQHYKXMPHIX4XCX","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6SQHYKXM","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:53c7b9de5e349a1b660c97886d64e22d2db827e17910ba4102a24fcbb52046c7","target":"graph","created_at":"2026-05-18T02:58:20Z","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":"We propose an efficient approach to semidefinite spectral clustering (SSC), which addresses the Frobenius normalization with the positive semidefinite (p.s.d.) constraint for spectral clustering. Compared with the original Frobenius norm approximation based algorithm, the proposed algorithm can more accurately find the closest doubly stochastic approximation to the affinity matrix by considering the p.s.d. constraint. In this paper, SSC is formulated as a semidefinite programming (SDP) problem. In order to solve the high computational complexity of SDP, we present a dual algorithm based on the","authors_text":"Chunhua Shen, Hanzi Wang, Yan Yan","cross_cats":["cs.CV"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-02-22T09:39:52Z","title":"Efficient Semidefinite Spectral Clustering via Lagrange Duality"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.5497","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:9cd2098b896675614daaa7d5e5119889baaf5bfa3e6eec8fb04768d97c382b09","target":"record","created_at":"2026-05-18T02:58:20Z","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":"617dbbde7e5c97e654d7315706bdfc52e1f81c38b22fccaf4c758a2d67454223","cross_cats_sorted":["cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-02-22T09:39:52Z","title_canon_sha256":"79557526e4438930a8c21143673fb63f820a9d704ca75dd7b3fda9983e31a02d"},"schema_version":"1.0","source":{"id":"1402.5497","kind":"arxiv","version":1}},"canonical_sha256":"f4a07c2aec79d17e5c57ab755034abd93b4f1c032aa6bb168cf485617fce45ae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f4a07c2aec79d17e5c57ab755034abd93b4f1c032aa6bb168cf485617fce45ae","first_computed_at":"2026-05-18T02:58:20.951249Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:58:20.951249Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"D81fzmfOb66OoZo1vYRSX5wZcMZpJ8hmEBBgvqfB9+CUI8/JzYZ7mdQfPJkqZLEaZ5jjKsuXftqjrR88vcHECA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:58:20.951835Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.5497","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9cd2098b896675614daaa7d5e5119889baaf5bfa3e6eec8fb04768d97c382b09","sha256:53c7b9de5e349a1b660c97886d64e22d2db827e17910ba4102a24fcbb52046c7"],"state_sha256":"7bca9d27647ec457a95002e258c3fdafc90f9cd892da377c509cac1f3c85736f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sG2uyM4c+ovvnNr4RHBrhf7ENWaygadU6DbsZ1jnydaaCSTlInDQhrcIyGWE4p+F3+9NUy8ECRQeLQj1k84aAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T07:06:26.168098Z","bundle_sha256":"6847d31591f91cadb9a1e594021037a9f664961d4357fb29c6c4450901e8eedf"}}