{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:UAD3MYAXBIMCQGLOC5EZ2J4I6F","short_pith_number":"pith:UAD3MYAX","schema_version":"1.0","canonical_sha256":"a007b660170a1828196e17499d2788f143eb582e90cc76f286ba86fd2e2097d7","source":{"kind":"arxiv","id":"1710.05895","version":1},"attestation_state":"computed","paper":{"title":"Spectral Algorithms for Computing Fair Support Vector Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Anil Aswani, Matt Olfat","submitted_at":"2017-10-16T17:48:23Z","abstract_excerpt":"Classifiers and rating scores are prone to implicitly codifying biases, which may be present in the training data, against protected classes (i.e., age, gender, or race). So it is important to understand how to design classifiers and scores that prevent discrimination in predictions. This paper develops computationally tractable algorithms for designing accurate but fair support vector machines (SVM's). Our approach imposes a constraint on the covariance matrices conditioned on each protected class, which leads to a nonconvex quadratic constraint in the SVM formulation. We develop iterative al"},"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":"1710.05895","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-10-16T17:48:23Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"ce6430091294b6c46cd44852e21b5299ff9e367c36b404c19b8c2f8b42a14560","abstract_canon_sha256":"ff9e675c6b77a807c67f491ea8918f4ce2c32eced4b9417acddc3019e7416683"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:47.873593Z","signature_b64":"2Q7/A16XvvwxNwl2TCS8HvuE1ysfS4QC2henibOg75eCnOl25a16wd8S1gSOFBSJQYUHxQu156N5c8QjjqSuAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a007b660170a1828196e17499d2788f143eb582e90cc76f286ba86fd2e2097d7","last_reissued_at":"2026-05-18T00:32:47.872879Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:47.872879Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spectral Algorithms for Computing Fair Support Vector Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Anil Aswani, Matt Olfat","submitted_at":"2017-10-16T17:48:23Z","abstract_excerpt":"Classifiers and rating scores are prone to implicitly codifying biases, which may be present in the training data, against protected classes (i.e., age, gender, or race). So it is important to understand how to design classifiers and scores that prevent discrimination in predictions. This paper develops computationally tractable algorithms for designing accurate but fair support vector machines (SVM's). Our approach imposes a constraint on the covariance matrices conditioned on each protected class, which leads to a nonconvex quadratic constraint in the SVM formulation. We develop iterative al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.05895","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1710.05895","created_at":"2026-05-18T00:32:47.872998+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.05895v1","created_at":"2026-05-18T00:32:47.872998+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.05895","created_at":"2026-05-18T00:32:47.872998+00:00"},{"alias_kind":"pith_short_12","alias_value":"UAD3MYAXBIMC","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"UAD3MYAXBIMCQGLO","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"UAD3MYAX","created_at":"2026-05-18T12:31:46.661854+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/UAD3MYAXBIMCQGLOC5EZ2J4I6F","json":"https://pith.science/pith/UAD3MYAXBIMCQGLOC5EZ2J4I6F.json","graph_json":"https://pith.science/api/pith-number/UAD3MYAXBIMCQGLOC5EZ2J4I6F/graph.json","events_json":"https://pith.science/api/pith-number/UAD3MYAXBIMCQGLOC5EZ2J4I6F/events.json","paper":"https://pith.science/paper/UAD3MYAX"},"agent_actions":{"view_html":"https://pith.science/pith/UAD3MYAXBIMCQGLOC5EZ2J4I6F","download_json":"https://pith.science/pith/UAD3MYAXBIMCQGLOC5EZ2J4I6F.json","view_paper":"https://pith.science/paper/UAD3MYAX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.05895&json=true","fetch_graph":"https://pith.science/api/pith-number/UAD3MYAXBIMCQGLOC5EZ2J4I6F/graph.json","fetch_events":"https://pith.science/api/pith-number/UAD3MYAXBIMCQGLOC5EZ2J4I6F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UAD3MYAXBIMCQGLOC5EZ2J4I6F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UAD3MYAXBIMCQGLOC5EZ2J4I6F/action/storage_attestation","attest_author":"https://pith.science/pith/UAD3MYAXBIMCQGLOC5EZ2J4I6F/action/author_attestation","sign_citation":"https://pith.science/pith/UAD3MYAXBIMCQGLOC5EZ2J4I6F/action/citation_signature","submit_replication":"https://pith.science/pith/UAD3MYAXBIMCQGLOC5EZ2J4I6F/action/replication_record"}},"created_at":"2026-05-18T00:32:47.872998+00:00","updated_at":"2026-05-18T00:32:47.872998+00:00"}