{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:Y7RJR7XOQPDQ25B5CFJUD72HEG","short_pith_number":"pith:Y7RJR7XO","schema_version":"1.0","canonical_sha256":"c7e298feee83c70d743d115341ff47218bd8bec1cbc3e4f4084871d06102306c","source":{"kind":"arxiv","id":"2506.08143","version":1},"attestation_state":"computed","paper":{"title":"Accelerating Spectral Clustering under Fairness Constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Alex Lambert, Francesco Tonin, Johan A. K. Suykens, Volkan Cevher","submitted_at":"2025-06-09T18:46:27Z","abstract_excerpt":"Fairness of decision-making algorithms is an increasingly important issue. In this paper, we focus on spectral clustering with group fairness constraints, where every demographic group is represented in each cluster proportionally as in the general population. We present a new efficient method for fair spectral clustering (Fair SC) by casting the Fair SC problem within the difference of convex functions (DC) framework. To this end, we introduce a novel variable augmentation strategy and employ an alternating direction method of multipliers type of algorithm adapted to DC problems. We show that"},"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":"2506.08143","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-09T18:46:27Z","cross_cats_sorted":[],"title_canon_sha256":"2236b74b19bce0c5a63c6c6393bbab5be743071bdc502186d4b27c74a9c45bec","abstract_canon_sha256":"28eb20c33be6b64aa8088ed11d84d0d5a6a466f9e0578802ed7698ebcfe64c37"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:18:45.328656Z","signature_b64":"fQBf/F0n3h324wQ14A5uHmmBMPkMbEEPxf6JnG2xFlb9WBqyixxhm/Hs8ZmCSCvIhdSE3ggiKaWd/xJxR8LSBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c7e298feee83c70d743d115341ff47218bd8bec1cbc3e4f4084871d06102306c","last_reissued_at":"2026-07-05T11:18:45.328208Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:18:45.328208Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accelerating Spectral Clustering under Fairness Constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Alex Lambert, Francesco Tonin, Johan A. K. Suykens, Volkan Cevher","submitted_at":"2025-06-09T18:46:27Z","abstract_excerpt":"Fairness of decision-making algorithms is an increasingly important issue. In this paper, we focus on spectral clustering with group fairness constraints, where every demographic group is represented in each cluster proportionally as in the general population. We present a new efficient method for fair spectral clustering (Fair SC) by casting the Fair SC problem within the difference of convex functions (DC) framework. To this end, we introduce a novel variable augmentation strategy and employ an alternating direction method of multipliers type of algorithm adapted to DC problems. We show that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.08143","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.08143/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2506.08143","created_at":"2026-07-05T11:18:45.328261+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.08143v1","created_at":"2026-07-05T11:18:45.328261+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.08143","created_at":"2026-07-05T11:18:45.328261+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y7RJR7XOQPDQ","created_at":"2026-07-05T11:18:45.328261+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y7RJR7XOQPDQ25B5","created_at":"2026-07-05T11:18:45.328261+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y7RJR7XO","created_at":"2026-07-05T11:18:45.328261+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/Y7RJR7XOQPDQ25B5CFJUD72HEG","json":"https://pith.science/pith/Y7RJR7XOQPDQ25B5CFJUD72HEG.json","graph_json":"https://pith.science/api/pith-number/Y7RJR7XOQPDQ25B5CFJUD72HEG/graph.json","events_json":"https://pith.science/api/pith-number/Y7RJR7XOQPDQ25B5CFJUD72HEG/events.json","paper":"https://pith.science/paper/Y7RJR7XO"},"agent_actions":{"view_html":"https://pith.science/pith/Y7RJR7XOQPDQ25B5CFJUD72HEG","download_json":"https://pith.science/pith/Y7RJR7XOQPDQ25B5CFJUD72HEG.json","view_paper":"https://pith.science/paper/Y7RJR7XO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.08143&json=true","fetch_graph":"https://pith.science/api/pith-number/Y7RJR7XOQPDQ25B5CFJUD72HEG/graph.json","fetch_events":"https://pith.science/api/pith-number/Y7RJR7XOQPDQ25B5CFJUD72HEG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y7RJR7XOQPDQ25B5CFJUD72HEG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y7RJR7XOQPDQ25B5CFJUD72HEG/action/storage_attestation","attest_author":"https://pith.science/pith/Y7RJR7XOQPDQ25B5CFJUD72HEG/action/author_attestation","sign_citation":"https://pith.science/pith/Y7RJR7XOQPDQ25B5CFJUD72HEG/action/citation_signature","submit_replication":"https://pith.science/pith/Y7RJR7XOQPDQ25B5CFJUD72HEG/action/replication_record"}},"created_at":"2026-07-05T11:18:45.328261+00:00","updated_at":"2026-07-05T11:18:45.328261+00:00"}