{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ZWZ2VT2UFOIGGRMRABEJU3WOXO","short_pith_number":"pith:ZWZ2VT2U","canonical_record":{"source":{"id":"1505.06485","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-05-24T21:25:44Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"03023807e3db2f12f54fe0b3016935bf2e421362154ee5a2e4629e8c537282dc","abstract_canon_sha256":"aa9d2db06eca07fafc92972a302d68a8e00fe8241a790633818c4d5bbd202aa3"},"schema_version":"1.0"},"canonical_sha256":"cdb3aacf542b9063459100489a6ecebb90fb8aa1dca58423ba03254c66319dee","source":{"kind":"arxiv","id":"1505.06485","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.06485","created_at":"2026-05-18T02:03:44Z"},{"alias_kind":"arxiv_version","alias_value":"1505.06485v1","created_at":"2026-05-18T02:03:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.06485","created_at":"2026-05-18T02:03:44Z"},{"alias_kind":"pith_short_12","alias_value":"ZWZ2VT2UFOIG","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZWZ2VT2UFOIGGRMR","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZWZ2VT2U","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ZWZ2VT2UFOIGGRMRABEJU3WOXO","target":"record","payload":{"canonical_record":{"source":{"id":"1505.06485","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-05-24T21:25:44Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"03023807e3db2f12f54fe0b3016935bf2e421362154ee5a2e4629e8c537282dc","abstract_canon_sha256":"aa9d2db06eca07fafc92972a302d68a8e00fe8241a790633818c4d5bbd202aa3"},"schema_version":"1.0"},"canonical_sha256":"cdb3aacf542b9063459100489a6ecebb90fb8aa1dca58423ba03254c66319dee","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:03:44.859178Z","signature_b64":"EKscfhC4ZZlVpPAF1hhqkd6CKwyQHewzmdMCkwprKL0fnVTA5DKri550vxMGlYOY0SQpO6D4iBmEUKo90sGIBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cdb3aacf542b9063459100489a6ecebb90fb8aa1dca58423ba03254c66319dee","last_reissued_at":"2026-05-18T02:03:44.858659Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:03:44.858659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.06485","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:03:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EavrYD3GwsnhROI0CNoz5DmECNHCU1JNAVyTg/fL+JT/A0FqZYwmnh1K0l/+c5swxdeEu9hgV20+JNrz9t9KAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T05:25:08.395486Z"},"content_sha256":"bd8868b3136227a57009bff87c65692c87fef9ccce0c09cbf5c2eae1719c0988","schema_version":"1.0","event_id":"sha256:bd8868b3136227a57009bff87c65692c87fef9ccce0c09cbf5c2eae1719c0988"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ZWZ2VT2UFOIGGRMRABEJU3WOXO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constrained 1-Spectral Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Matthias Hein, Syama Sundar Rangapuram","submitted_at":"2015-05-24T21:25:44Z","abstract_excerpt":"An important form of prior information in clustering comes in form of cannot-link and must-link constraints. We present a generalization of the popular spectral clustering technique which integrates such constraints. Motivated by the recently proposed $1$-spectral clustering for the unconstrained problem, our method is based on a tight relaxation of the constrained normalized cut into a continuous optimization problem. Opposite to all other methods which have been suggested for constrained spectral clustering, we can always guarantee to satisfy all constraints. Moreover, our soft formulation a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.06485","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:03:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vlywfP4JNCA6eASw7b7Y6OaOyv6ai1+KtQu4D9joC/bWoWqv0q7dDioQAGX7UyJOHwRwvN6ijmiupbTPKr70AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T05:25:08.396135Z"},"content_sha256":"4f75d3d944a484489d3a265f83b1972101c80fca99d2e5b0e249a6bdcb08798b","schema_version":"1.0","event_id":"sha256:4f75d3d944a484489d3a265f83b1972101c80fca99d2e5b0e249a6bdcb08798b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZWZ2VT2UFOIGGRMRABEJU3WOXO/bundle.json","state_url":"https://pith.science/pith/ZWZ2VT2UFOIGGRMRABEJU3WOXO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZWZ2VT2UFOIGGRMRABEJU3WOXO/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-02T05:25:08Z","links":{"resolver":"https://pith.science/pith/ZWZ2VT2UFOIGGRMRABEJU3WOXO","bundle":"https://pith.science/pith/ZWZ2VT2UFOIGGRMRABEJU3WOXO/bundle.json","state":"https://pith.science/pith/ZWZ2VT2UFOIGGRMRABEJU3WOXO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZWZ2VT2UFOIGGRMRABEJU3WOXO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ZWZ2VT2UFOIGGRMRABEJU3WOXO","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":"aa9d2db06eca07fafc92972a302d68a8e00fe8241a790633818c4d5bbd202aa3","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-05-24T21:25:44Z","title_canon_sha256":"03023807e3db2f12f54fe0b3016935bf2e421362154ee5a2e4629e8c537282dc"},"schema_version":"1.0","source":{"id":"1505.06485","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.06485","created_at":"2026-05-18T02:03:44Z"},{"alias_kind":"arxiv_version","alias_value":"1505.06485v1","created_at":"2026-05-18T02:03:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.06485","created_at":"2026-05-18T02:03:44Z"},{"alias_kind":"pith_short_12","alias_value":"ZWZ2VT2UFOIG","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZWZ2VT2UFOIGGRMR","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZWZ2VT2U","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:4f75d3d944a484489d3a265f83b1972101c80fca99d2e5b0e249a6bdcb08798b","target":"graph","created_at":"2026-05-18T02:03:44Z","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":"An important form of prior information in clustering comes in form of cannot-link and must-link constraints. We present a generalization of the popular spectral clustering technique which integrates such constraints. Motivated by the recently proposed $1$-spectral clustering for the unconstrained problem, our method is based on a tight relaxation of the constrained normalized cut into a continuous optimization problem. Opposite to all other methods which have been suggested for constrained spectral clustering, we can always guarantee to satisfy all constraints. Moreover, our soft formulation a","authors_text":"Matthias Hein, Syama Sundar Rangapuram","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-05-24T21:25:44Z","title":"Constrained 1-Spectral Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.06485","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:bd8868b3136227a57009bff87c65692c87fef9ccce0c09cbf5c2eae1719c0988","target":"record","created_at":"2026-05-18T02:03:44Z","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":"aa9d2db06eca07fafc92972a302d68a8e00fe8241a790633818c4d5bbd202aa3","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-05-24T21:25:44Z","title_canon_sha256":"03023807e3db2f12f54fe0b3016935bf2e421362154ee5a2e4629e8c537282dc"},"schema_version":"1.0","source":{"id":"1505.06485","kind":"arxiv","version":1}},"canonical_sha256":"cdb3aacf542b9063459100489a6ecebb90fb8aa1dca58423ba03254c66319dee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cdb3aacf542b9063459100489a6ecebb90fb8aa1dca58423ba03254c66319dee","first_computed_at":"2026-05-18T02:03:44.858659Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:03:44.858659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EKscfhC4ZZlVpPAF1hhqkd6CKwyQHewzmdMCkwprKL0fnVTA5DKri550vxMGlYOY0SQpO6D4iBmEUKo90sGIBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:03:44.859178Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.06485","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bd8868b3136227a57009bff87c65692c87fef9ccce0c09cbf5c2eae1719c0988","sha256:4f75d3d944a484489d3a265f83b1972101c80fca99d2e5b0e249a6bdcb08798b"],"state_sha256":"1af54385d45744cd730045cde76ce4a51e3068f158064825129140b370140532"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RSSDteoSMt07jyZ5Tr7Hm9N6B0Nd1m/CA6FeN3E7OhHRBz1aDHkqCycLR2ihG3r9Ep5wzdsEfd388Om+MuNNBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T05:25:08.399050Z","bundle_sha256":"8c51699b60898f8ae4c2f6fac571fb1757c78d4fa2187070c19be3c8f093c1e0"}}