{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:RTF6UQOJ343FVNUTLTYG5HM4AU","short_pith_number":"pith:RTF6UQOJ","canonical_record":{"source":{"id":"1201.5338","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-01-25T18:36:11Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"4e0743ebe261e86685401fcfd894451292facd2f2050afa9d68d501643d2a7fa","abstract_canon_sha256":"860149999bd9ac26bf51945e5d12f3494a1aaa104179992d56d0e97254b20ff5"},"schema_version":"1.0"},"canonical_sha256":"8ccbea41c9df365ab6935cf06e9d9c0505aa921e69842414afd0c5a2dc7396e0","source":{"kind":"arxiv","id":"1201.5338","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.5338","created_at":"2026-05-18T03:45:10Z"},{"alias_kind":"arxiv_version","alias_value":"1201.5338v2","created_at":"2026-05-18T03:45:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.5338","created_at":"2026-05-18T03:45:10Z"},{"alias_kind":"pith_short_12","alias_value":"RTF6UQOJ343F","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"RTF6UQOJ343FVNUT","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"RTF6UQOJ","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:RTF6UQOJ343FVNUTLTYG5HM4AU","target":"record","payload":{"canonical_record":{"source":{"id":"1201.5338","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-01-25T18:36:11Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"4e0743ebe261e86685401fcfd894451292facd2f2050afa9d68d501643d2a7fa","abstract_canon_sha256":"860149999bd9ac26bf51945e5d12f3494a1aaa104179992d56d0e97254b20ff5"},"schema_version":"1.0"},"canonical_sha256":"8ccbea41c9df365ab6935cf06e9d9c0505aa921e69842414afd0c5a2dc7396e0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:45:10.676109Z","signature_b64":"iPzFS8va/jsryEV8jrzDgNdBTGezHp1cZAGX7pet1u51KiRYYdIWuop6ewvj+qGOi0a/1E5q8Mqmq2r4CawxAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ccbea41c9df365ab6935cf06e9d9c0505aa921e69842414afd0c5a2dc7396e0","last_reissued_at":"2026-05-18T03:45:10.675471Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:45:10.675471Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.5338","source_version":2,"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-18T03:45:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"06ZuEhRPh0PSIGI5DVtgIbe2uCfAeN2YdGn0o52k0EdZJCwEYkE6bcEf3/i0LbU4unzbGyK9+7JcpIOu86BWBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:23:09.247613Z"},"content_sha256":"ed5558f2b0749b340b1a0a87d13d397403da3d32dfefc26338d0e773329263b3","schema_version":"1.0","event_id":"sha256:ed5558f2b0749b340b1a0a87d13d397403da3d32dfefc26338d0e773329263b3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:RTF6UQOJ343FVNUTLTYG5HM4AU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Constrained Spectral Clustering and Its Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Buyue Qian, Ian Davidson, Xiang Wang","submitted_at":"2012-01-25T18:36:11Z","abstract_excerpt":"Constrained clustering has been well-studied for algorithms such as $K$-means and hierarchical clustering. However, how to satisfy many constraints in these algorithmic settings has been shown to be intractable. One alternative to encode many constraints is to use spectral clustering, which remains a developing area. In this paper, we propose a flexible framework for constrained spectral clustering. In contrast to some previous efforts that implicitly encode Must-Link and Cannot-Link constraints by modifying the graph Laplacian or constraining the underlying eigenspace, we present a more natur"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.5338","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"},"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-18T03:45:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ysfRuCbk9yQZ6Highs6e/nezNPZj+0dDMZ+FZQjVXZhswhh+UJCUzCbNUavRI1InYDVfYBbRyk2siU98jArfCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:23:09.248235Z"},"content_sha256":"15780b7af67cdbd8e7355e611e976230d3dbf7e8f4882adf35c13e0258e58795","schema_version":"1.0","event_id":"sha256:15780b7af67cdbd8e7355e611e976230d3dbf7e8f4882adf35c13e0258e58795"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RTF6UQOJ343FVNUTLTYG5HM4AU/bundle.json","state_url":"https://pith.science/pith/RTF6UQOJ343FVNUTLTYG5HM4AU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RTF6UQOJ343FVNUTLTYG5HM4AU/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-27T23:23:09Z","links":{"resolver":"https://pith.science/pith/RTF6UQOJ343FVNUTLTYG5HM4AU","bundle":"https://pith.science/pith/RTF6UQOJ343FVNUTLTYG5HM4AU/bundle.json","state":"https://pith.science/pith/RTF6UQOJ343FVNUTLTYG5HM4AU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RTF6UQOJ343FVNUTLTYG5HM4AU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:RTF6UQOJ343FVNUTLTYG5HM4AU","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":"860149999bd9ac26bf51945e5d12f3494a1aaa104179992d56d0e97254b20ff5","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-01-25T18:36:11Z","title_canon_sha256":"4e0743ebe261e86685401fcfd894451292facd2f2050afa9d68d501643d2a7fa"},"schema_version":"1.0","source":{"id":"1201.5338","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.5338","created_at":"2026-05-18T03:45:10Z"},{"alias_kind":"arxiv_version","alias_value":"1201.5338v2","created_at":"2026-05-18T03:45:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.5338","created_at":"2026-05-18T03:45:10Z"},{"alias_kind":"pith_short_12","alias_value":"RTF6UQOJ343F","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"RTF6UQOJ343FVNUT","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"RTF6UQOJ","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:15780b7af67cdbd8e7355e611e976230d3dbf7e8f4882adf35c13e0258e58795","target":"graph","created_at":"2026-05-18T03:45:10Z","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":"Constrained clustering has been well-studied for algorithms such as $K$-means and hierarchical clustering. However, how to satisfy many constraints in these algorithmic settings has been shown to be intractable. One alternative to encode many constraints is to use spectral clustering, which remains a developing area. In this paper, we propose a flexible framework for constrained spectral clustering. In contrast to some previous efforts that implicitly encode Must-Link and Cannot-Link constraints by modifying the graph Laplacian or constraining the underlying eigenspace, we present a more natur","authors_text":"Buyue Qian, Ian Davidson, Xiang Wang","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-01-25T18:36:11Z","title":"On Constrained Spectral Clustering and Its Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.5338","kind":"arxiv","version":2},"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:ed5558f2b0749b340b1a0a87d13d397403da3d32dfefc26338d0e773329263b3","target":"record","created_at":"2026-05-18T03:45:10Z","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":"860149999bd9ac26bf51945e5d12f3494a1aaa104179992d56d0e97254b20ff5","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-01-25T18:36:11Z","title_canon_sha256":"4e0743ebe261e86685401fcfd894451292facd2f2050afa9d68d501643d2a7fa"},"schema_version":"1.0","source":{"id":"1201.5338","kind":"arxiv","version":2}},"canonical_sha256":"8ccbea41c9df365ab6935cf06e9d9c0505aa921e69842414afd0c5a2dc7396e0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8ccbea41c9df365ab6935cf06e9d9c0505aa921e69842414afd0c5a2dc7396e0","first_computed_at":"2026-05-18T03:45:10.675471Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:45:10.675471Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iPzFS8va/jsryEV8jrzDgNdBTGezHp1cZAGX7pet1u51KiRYYdIWuop6ewvj+qGOi0a/1E5q8Mqmq2r4CawxAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:45:10.676109Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.5338","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ed5558f2b0749b340b1a0a87d13d397403da3d32dfefc26338d0e773329263b3","sha256:15780b7af67cdbd8e7355e611e976230d3dbf7e8f4882adf35c13e0258e58795"],"state_sha256":"0adf525faaa551997f29ade589b40cf8596234d91c3389678a4e30e1aa7102cd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WVb5hRc+E1Np/CMYpucM12My7KIWuyqEi/AFkxMlNWSkf5ec88OrYFuAulZsDEmgnHH9HkhK06SvRCLOvX87Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T23:23:09.252046Z","bundle_sha256":"981eadde3e40f1544267a0a26cbbc1bedab2a5d524dc4fedcf45473edd87287f"}}